Routing Protocol For Wireless Sensor Networks Research Articles

Fast Simple Flooding Strategy in Wireless Sensor Networks

The wide deployment of wireless sensor networks is the primary reason behind the advancement of numerous routing protocols. In this context, sensors need to be remotely conveyed in unattended situations. Further, propels in wireless sensor network innovation have ensured accessibility and minimal effort in terms of sensor hubs with a capacity to sense various physical and natural environment conditions, in addition to wireless communication and data processing. Moreover, wireless sensor networks are rather different from regular and cellular networks, which comprise nodes with restricted bandwidth and energy. However, the most important limitation of wireless sensor networks is their characteristic limited energy resources. Furthermore, there is an imbalance of power consumption in their sensor nodes. Therefore, it is preferable to distribute the amount of energy throughout a wireless sensor network to minimize the maintenance and maximize the overall system performance. To this end, this paper suggests a new strategy in wireless sensor network dissemination and routing protocols referred to as the Fast Simple Flooding Strategy, which focuses on energy efficiency as a crucial design objective for routing protocols used in wireless sensor networks, without the overhead of other design factors, and reduces end-to-end latency. Additionally, this new strategy can be listed under flat approaches; it is simple and very fast in delivering the packet to the sink and does not require additional equipment or complex mathematical operations. It also resolves the major drawbacks of classic flooding and gossiping.

Energy-Aware Routing Hole Detection Algorithm in the Hierarchical Wireless Sensor Network

To minimize the communication overhead with the help of optimal path selection in Wireless Sensor Network (WSN) routing protocols is the challenging issue. Hierarchical routing optimizes energy utilization by distributing the workload among different clusters. But many-to-one multi-hop hierarchical routing will result in the excessive expenditure of energy near the sink and leads to early energy exhaustion of the nodes. Due to this the routing hole problem can be caused around the base station. Data routed along the hole boundary nodes will lead to premature exhaustion of energy. This will maximize the size of the hole in the network. Detection of holes saves the additional energy consumption around the hole and minimize the hole size. In this paper a novel energy efficient routing hole detection (EEHD) algorithm is presented, on the detection of routing hole, the periodic re-clustering is performed to avoid the long detour path. Extensive simulations are done in MATLAB, the results reveal that EEHD has better performance than other conventional routing hole detection techniques, such as BCP and BDCIS.

Adaptive Trust-Based Routing Protocol for Large Scale WSNs

Due to the dynamic and uncertain behaviors of nodes in Wireless Sensor Networks (WSNs), reliable data delivery becomes challenging task. With the absence of global information and centralised decision maker, the nodes in distributed WSNs need to rely on the surrounding nodes. This reliance requires the nodes to select the most reliable partner to work with in relaying the packets. Thus, the evaluation criteria and evaluation process has become a crucial agenda. Recent approaches adopt the concept of trust in selecting the next forwarder. However, most of them are restricted to certain criteria and the evaluation are conducted for single node. Inefficient consideration on the factors involved and inability to have wider view of the network could lead to inaccurate selection of forwarder, which eventually causes packet loss or re-transmission that consumes more resources. In this paper, we present an Adaptive Trust-based Routing Protocol (ATRP) that encompasses direct trust, indirect trust, and witness trust that considers multiple factors (resources and security) in its trustworthiness using pairwise comparison. The proposed mechanism allows further evaluations on more potential nodes, at several hops that helps to balance the energy consumption and prolong the network lifetime. Simulation results demonstrate longer lifetime, less delay, less packet loss and low energy consumption when compared to existing protocols.

QoS Aware Routing Protocol Through Cross-layer Approach in Asynchronous Duty-Cycled WSNs

The growing usage of wireless sensor networks (WSNs) in different scenarios makes the Quality-of-Service (QoS) a paramount issue in WSN-based applications. We are especially interested in the QoS aware of asynchronous duty-cycled WSNs in the light of designing routing protocol, whereby waiting for latency and malicious packet dropping are critical to the network performance. We first propose an optimized detection mechanism for malicious packet dropping attack. Then, based on sleep latency and queue length, a method for congestion degree measurement is proposed under asynchronous duty-cycled low power listening (LPL) modes. Last but not least, we introduce related QoS aware metrics for the design of QoS aware routing protocol, which can enhance the QoS performance in throughput, delay, and packet losses (TDL). Experimental results demonstrate that the QoS performance of our TDL-based routing protocol is better than those of the CTP-Watchdog protocol and the CTP-Optimized protocol, especially in terms of higher-throughput, lower-delay, and less-loss rate. By optimized threshold, the detection accuracy of our detection mechanism is improved much more than that of the traditional watchdog technology. Furthermore, we evaluate that the preferred optimization factor can help to make a tradeoff between the false negative rate and the false positive rate. Our TDL-based routing protocol is implemented under the component-based architecture by a cross-layer approach, which provides a practicable solution for the design of QoS-aware routing protocol in asynchronous duty-cycled WSNs.

A novel SMP-based survivability evaluation metric and approach in wireless sensor network

In Industrial Internet of Things (IIoT) device and network, wireless sensor network (WSN) is an important component. Routing protocol is the critical component of WSN. As the WSN may be attacked by all kinds of intruders, the survivability of WSN is important to IIoT security. To precisely evaluate the systematic survivability ability under external attack and internal security mechanism, a novel survivability entropy-based quantitative evaluation metric is proposed to calculate the systematic survivability ability of WSN routing protocol. Numerical analysis and simulation experiments are combined to precisely calculate the survivability entropy metric. To validate the evaluation approach, NS2 (Network simulator) is used to simulate the DoS attack and security mechanism in WSN. Experimental results show that the novel survivability evaluation metric and method can precisely evaluate the systematic survivability ability of WSN.

Energy efficient routing protocol for wireless sensor networks using dynamic hyper round policy and ACO

The clustering based routing protocols enhance the performance and scalability of wireless sensor networks (WSNs). State-of-art routing methods perform clustering and cluster head (CH) based on the scheme of fixed time intervals. Repetitive task of the cluster formation and CH selection at each time interval, regardless of its necessity, leads to routing overhead and consumption of network energy. Along with clustering, efficient route formation is a challenge to WSN routing protocols. In this paper, an attempt is made to overcome these challenges based on dynamic hyper round policy and route optimisation strategy. The selection of CH and cluster formation is mainly performed using three key parameters such as density, distance from base station and residual energy. After the cluster formation, route formation is performed using ant colony optimisation (ACO). The simulation results reveal that the proposed routing protocol shows improved performance in terms of energy efficiency and quality of service.

Video Traffic Analysis over LEACH-GA routing protocol in a WSN

Abstract One of the most advanced evolutions of Wireless communication is Wireless Sensor Network (WSN), which plays a vital role in many applications. The growth and attention towards the designing of many new QoS aware routing protocol for WSN has been increased for the past few decades. Energy awareness has a greater significance while developing a routing protocol in order to increase network lifetime. In this paper, a traditional LEACH-GA routing protocol has been used for analyzing the video traffic over the sensor network.

A Survey on Hierarchical Cluster Based Secure Routing Protocols and Key Management Schemes in Wireless Sensor Networks

Now days, wireless technology is one of the center of attention for users and researchers. Wireless network is a network having large number of sensor nodes and hence called as “Wireless Sensor Network (WSN)”. WSN monitors and senses the environment of targeted area. The sensor nodes in WSN transmit data to the base station depending on the application. These sensor nodes communicate with each other and routing is selected on the basis of routing protocols which are application specific. Based on network structure, routing protocols in WSN can be divided into two categories: flat routing, hierarchical or cluster based routing, location based routing. Out of these, hierarchical or cluster based routing is becoming an active branch of routing technology in WSN. To allow base station to receive unaltered or original data, routing protocol should be energy-efficient and secure. To fulfill this, Hierarchical or Cluster base routing protocol for WSN is the most energy-efficient among other routing protocols. Hence, in this paper, we present a survey on different hierarchical clustered routing techniques for WSN. We also present the key management schemes to provide security in WSN. Further we study and compare secure hierarchical routing protocols based on various criteria.

An Energy-Efficient Clustering Routing Protocol for Wireless Sensor Networks Based on AGNES with Balanced Energy Consumption Optimization.

To further prolong the lifetime of wireless sensor network (WSN), researchers from various countries have proposed many clustering routing protocols. However, the total network energy consumption of most protocols is not well minimized and balanced. To alleviate this problem, this paper proposes an energy-efficient clustering routing protocol in WSNs. To begin with, this paper introduces a new network structure model and combines the original energy consumption model to construct a new method to determine the optimal number of clusters for the total energy consumption minimization. Based on the balanced energy consumption, then we optimize the AGglomerative NESting (AGNES) algorithm, including: (1) introduction of distance variance, (2) the dual-cluster heads (D-CHs) division of the energy balance strategy, and (3) the node dormancy mechanism. In addition, the CHs priority function is constructed based on the residual energy and position of the node. Finally, we simulated this protocol in homogeneous networks (the initial energy = 0.4 J, 0.6 J and 0.8 J) and heterogeneous networks (the initial energy = 0.4–0.8 J). Simulation results show that our proposed protocol can reduce the network energy consumption decay rate, prolong the network lifetime, and improve the network throughput in the above two networks.

Classification of WSN Routing Protocol Based On Clustering

Wireless Sensor Networks (WSNs) within the zone time regulate to greater enticing and develop their manner into massive variance of exercise in distinctive domains. Elevation in wireless sensor network technology provide the affability of small and low cost sensor nodes with the adequacy of sensing, processing, computing the physical and surroundings circumstances. Due to inhibition in transmission range, processing and power resources it is considered necessary to design awesome and energy aware protocol to increase network lifetime. Routing strategies are developing to boom life cycle of sensor network and increase throughput performance. This paper gives, an analysis of various routing strategies used in wireless sensor networks in addition importance of cluster based routing, and varieties of cluster, type of cluster based routing are discussed. The observe concludes with the issues and the resent researchers on cluster based routing.

RELAY DEPLOYMENT ALGORITHMS IN WIRELESS SENSOR NETWORKS: A SURVEY

Wireless Sensor Networks (WSNs) are subject to failures. Even though reliable routing protocols for WSNs exist and are well-understood, the physical network topology must ensure that alternate routes with an acceptable length to the sinksare in fact available when failures occur. This requires a sensor network deployment to be planned with an objective of ensuring some measure of robustness in the topology, so that when failures do occur the protocols can continue to offer reliable delivery. To ensure that sensor nodes have sufficient paths, it may be necessary to add a number of additional relay nodes, which do not sense, but only forward data from other nodes. In this paper, we review a range of existing algorithms to deploy relay nodes for fault tolerance. We classify the state-of-the-art relay placement algorithms based on routing structures, connectivity requirements, deployment locations, and fault-tolerant requirements.

Securing the Sensor Networks Along With Secured Routing Protocols for Data Transfer in Wireless Sensor Networks

Recently, with the improvement of Wireless Sensor Networks (WSNs), numerous new routing protocols have been developed for WSNs. Routing protocols in WSNs, in any case, may vary depend on the application and network systems. Besides, WSNs are presented to various types of security threats. In this manner, it is headachy for us to pick secure routing protocol for application in WSNs. In regard that the decision of secure routing protocol for WSNs is personally related with the application prerequisites and routing protocol qualities and the assaults on routing protocol, there is no panacea secure routing protocol. In this paper we give a review of secure routing protocols that can be utilized as a part of remote sensor systems since it is imperative to give a characterization of the accessible conventions. Along these lines, a few conventions were audited in this paper. The directing conventions can be grouped into two principle classifications to be specific topology based and convention task based. The principle objective of the work proposed in this paper is to give analysts an unmistakable thought regarding the accessible security based directing conventions and their properties.

A Survey of Routing Protocols in Wireless Sensor Networks

Wireless Sensor Networks(WSNs) comprise sensor nodes which find applications in a wide variety of fields such as medical, wildlife, security, environment, industry. A network communication is initialized and accomplished with the aid of routing protocols. A routing protocol is a set of rules which govern the routing phenomenon. WSNs protocols for the purpose of routing have been the ubiquitous option of the researchers in the recent years due to their exorbitant scope of improvement. The objective of a routing protocol is to inquest for a relevant route amidst sender and receiver to accomplish successful transmission at the destination .Dissipation of energy and lengthening the duration of the network have always been one of the major points of research gaps. As the nodes in WSNs in are battery operated, so they can only use restricted energy to proceed with the communication and transmission operation. To cope up with this, a number of researchers have come up with developments in the field of energy efficacy and optimizations in WSNs routing protocols. A reify summarization of some protocols for routing purposes has been manifested in this paper.

An energy-aware buffer management (EABM) routing protocol for WSN

Wireless sensor network (WSN) seeks an unequal clustering approach to solve its energy hole and HOTSPOT issue. Increasing the cluster number and decreasing the size of the cluster near the sink equally distribute the load across the network. The approach is to made buffer aware to enhance the network lifetime and avoid data packet drop due to buffer overflow. The increase in buffer size is always not possible in preconfigured sensor nodes, making lifetime and data loss as a major problem. An energy-aware buffer management (EABM) routing protocol is designed to overcome the issue. The memory vacancy and energy level are considered before routing the next hop data to the cluster. The proposed EABM routing protocol is compared with LEACH, LEACH-C, ALEACH and EAR routing protocols to support our claim. The proposed routing protocol provides higher lifetime of 1.17 rounds, 1.1 times throughput and 0.73 times reduced packet drop considering LEACH as a benchmark protocol. The energy and buffer filling near the sink are equally distributed in case of the proposed EABM routing protocol.

Comparative Study of Optimized Wireless Sensor Network Routing Protocols

Comparative Study of Optimized Wireless Sensor Network Routing Protocols

EFFICIENT ROUTING PROTOCOL ALGORITHM FOR WIRELESS SENSOR NETWORKS

Recently, different applications of wireless sensor networks (WSNs) in the industry fields using different data transfer protocols has been developed. As the energy of sensor nodes is limited, prolonging network lifetime in WSNs considered a significant occurrence. To develop network permanence, researchers had considered energy consuming in routing protocols of WSNs by using modified Low Energy Adaptive Clustering Hierarchy. This article presents a developed effective transfer protocols for autonomic WSNs. An efficient routing scheme for wireless sensor network regarded as significant components of electronic devices is proposed. An optimal election probability of a node to be cluster head has being presented. In addition, this article uses a Voronoi diagram, which decomposes the nodes into zone around each node. This diagram used in management architecture for WSNs.

Energy-Aware Dual-Path Geographic Routing to Bypass Routing Holes in Wireless Sensor Networks

Geographic routing has been considered as an attractive approach for resource-constrained wireless sensor networks (WSNs) since it exploits local location information instead of global topology information to route data. However, this routing approach often suffers from the routing hole (i.e., an area free of nodes in the direction closer to destination) in various environments such as buildings and obstacles during data delivery, resulting in route failure. Currently, existing geographic routing protocols tend to walk along only one side of the routing holes to recover the route, thus achieving suboptimal network performance such as longer delivery delay and lower delivery ratio. Furthermore, these protocols cannot guarantee that all packets are delivered in an energy-efficient manner once encountering routing holes. In this paper, we focus on addressing these issues and propose an energy-aware dual-path geographic routing (EDGR) protocol for better route recovery from routing holes. EDGR adaptively utilizes the location information, residual energy, and the characteristics of energy consumption to make routing decisions, and dynamically exploits two node-disjoint anchor lists, passing through two sides of the routing holes, to shift routing path for load balance. Moreover, we extend EDGR into three-dimensional (3D) sensor networks to provide energy-aware routing for routing hole detour. Simulation results demonstrate that EDGR exhibits higher energy efficiency, and has moderate performance improvements on network lifetime, packet delivery ratio, and delivery delay, compared to other geographic routing protocols in WSNs over a variety of communication scenarios passing through routing holes. The proposed EDGR is much applicable to resource-constrained WSNs with routing holes.

Enhancing the Stability of the Improved-LEACH Routing Protocol for WSNs

Recently, increasing battery lifetime in wireless sensor networks has turned out to be one of the major challenges faced by researchers. The sensor nodes in wireless sensor networks use a battery as their power source, which is hard to replace during deployment. Low Energy Adaptive Clustering Hierarchy (LEACH) is one of the most prominent wireless sensor network routing protocols that have been proposed to improve network lifetime by utilizing energy-efficient clustering. However, LEACH has some issues related to cluster-head selection, where the selection is done randomly. This leads to rapid loss of energy in the network. Improved LEACH is a LEACH alternative that has the ability to increase network lifetime by using the nodes’ residual energy and their distance to the base station to select cluster-head nodes. However, Improved LEACH causes reduced stability, where the stability period is the duration before the death of the first node. The network stability period is important for applications that require reliable feedback from the network. Thus, we were motivated to investigate the Improved LEACH algorithm and to try to solve the stability problem. A new protocol is proposed in this paper: Stable Improved Low Energy Adaptive Clustering Hierarchy (SILEACH), which was developed to overcome the flaws of the Improved LEACH protocol. SILEACH balances the load between the nodes by utilizing an optimized method that considers the nodes’ distance to the base station and their residual energy to select the cluster-head nodes and considers the nodes’ distance to the cluster head and the base station to form clusters. The simulation results revealed that SILEACH is significantly more efficient than Improved LEACH in terms of stability period and network lifetime.

S-FEAR: Secure-Fuzzy Energy Aware Routing Protocol for Wireless Sensor Networks

Secure routing services in Wireless Sensor Networks (WSNs) are essential, especially in mission critical fields such as the military and in medical applications. Additionally, they play a vital role in the current and future Internet of Things (IoT) services. Lightness and efficiency of a routing protocol are not the only requirements that guarantee success; security assurance also needs to be enforced. This paper proposes a Secure-Fuzzy Energy Aware Routing Protocol (S-FEAR) for WSNs. S-FEAR applies a security model to an existing energy efficient FEAR protocol. As part of this research, the S-FEAR protocol has been analyzed in terms of the communication and processing costs associated with building and applying this model, regardless of the security techniques used. Moreover, the Qualnet network simulator was used to implement both FEAR and S-FEAR after carefully selecting the following security techniques to achieve both authentication and data integrity: the Cipher Block Chaining-Message Authentication Code (CBC-MAC) and the Elliptic Curve Digital Signature Algorithm (ECDSA). The performance of both protocols was assessed in terms of complexity and energy consumption. The results reveal that achieving authentication and data integrity successfully excluded all attackers from the network topology regardless of the percentage of attackers. Consequently, the constructed topology is secure and thus, safe data transmission over the network is ensured. Simulation results show that using CBC-MAC for example, costs 0.00064% of network energy while ECDSA costs about 0.0091%. On the other hand, attacks cost the network about 4.7 times the cost of applying these techniques.

Spiral Mobility Based on Optimized Clustering for Optimal Data Extraction in WSNs

Wireless Sensor Networks (WSNs) have led to tremendous growth in the development of sensor technology and offer numerous applications, such as wildlife monitoring, environment, healthcare, military surveillance and security systems. In terms of performance, the evolutions of WSN routing protocols play a vital role in extending the lifetime of networking operations. Due to the limited resources of power in sensor nodes, the design and implementation of an energy-efficient routing protocol comprise a key challenge for researchers. Before, in the case of a static sink, nodes at farther areas from the sink transmit their sensed data at a longer transmission range and die early, while nearby nodes face lesser transmission costs and stay alive for a longer period. This unbalanced energy distribution creates energy holes in ares far from the sink in WSNs. Mobility-based sink routing protocols are proposed to minimize the sub-optimal energy consumption in WSNs, as the sink mobility covers the sensor field, which alleviates the overall load-balancing among sensor nodes. In order to overcome the energy hole issue while prolonging the network lifetime, it is important to determine the optimal mobility pattern. In this regard, we propose the Spiral Mobility based on Optimized Clustering (SMOC) routing protocol and the Multiple sink-based SMOC (M-SMOC) routing protocol for large-scale WSNs. Performance evaluations of the proposed protocols are compared with various existing routing protocols based on static sink, random mobility and grid mobility. Different numbers of performance parameters are considered for evaluation, such as network lifetime, network stability, packet drop ratio, packet delivery ratio, end-to-end delay, average energy consumption, network connection time and the impact of different heterogeneity levels. Experimental results show the benefits of the spiral mobility pattern and how it improves the network lifetime and stability period over the existing state-of-the-art routing protocols.