Routing Protocol For Wireless Sensor Networks Research Articles

An Effective Relay Node Selection Technique for Energy Efficient WSN-Assisted IoT

The internet of things (IoT) is one of the emerging network paradigms that are reducing the distance between the physical and cyber world. In wireless sensor Network (WSN)-assisted IoT, hundreds to thousands of sensor nodes are deployed at a large scale, which in turn increases the complexity. Therefore, the issues and challenges of such network differ from WSN. The sensor nodes are an important component of WSN-Assisted IoT network running on limited and non-rechargeable energy resource. So, developing robust and energy-efficient routing protocol is a challenging task to prolong the network lifetime. In contrast to the state-of-the-art techniques this paper introduces: (1) a hierarchical cluster framework for network deployment; (2) an effective Relay Node (RN) selection scheme by considering the following parameters: node density in the cluster, shortest distance node selection as a RN, RN communication range as threshold distance for next RN selection; (3) an efficient routing algorithm to meet the requirement of proposed model. The proposed protocol has been compared with standard WSN routing protocols, viz., LEACH, MOD-LEACH, ME-CBCCP, EESAA, TDEEC, DEEC, and SEP. By extensive simulation for various network parameters, the proposed effective relay node selection for energy efficient consumption protocol found to be more effective in terms of network lifetime, energy consumption and supports scalability.

QCM2R: A QoS-aware cross-layered multichannel multisink routing protocol for stream based wireless sensor networks

Unlike the scalar data (such as temperature, pressure and humidity), the vector data (such as image, audio and video) necessitates more stringent Quality of Service (QoS) requirements in terms of bandwidth, delay, reliability and information security. These QoS requirements can be hardly achieved in a proper fashion by using a single channel for wireless communication. However, multichannel methodology may assist in accomplishing these QoS requirements by making possible parallel communication, enhancing throughput/delivery ratio, reducing transmission delay and countering jamming attacks. Furthermore, enabling data gathering at multiple points (i.e. multisink approach) may improve QoS by handling congestion, avoiding single point of failure issue and making possible load balancing between the available routes towards the corresponding destinations. To achieve reliable communication in stream based multichannel Wireless Sensor Networks (WSNs), this work proposes a novel QoS-aware Cross-layered Multichannel Multisink Routing protocol (QCM2R) for WSNs. For substantiating the performance of QCM2R protocol, the simulations are performed in NS-2 demonstrating the performance superiority of the proposed QCM2R protocol against the counterpart in terms of network lifetime, reliability, delay and throughput.

Energy efficient intra-cluster data aggregation technique for wireless sensor network

Cluster based routing strategies are popular categories of routing protocols among wireless sensor networks (WSNs). In a typical cluster based routing protocols, few nodes are elected as cluster Head (CH) nodes and they form clusters with other nodes of the networks known as cluster members. The data sensed by cluster members is sent to CH node for data aggregation and further processing. Data Aggregation is considered to be one of the important methods used to prolong the network lifetime of WSN. Data aggregation is quite popular among cluster based routing protocols for WSN, where the data packets are aggregated by intermediate nodes till it reaches to BS. Data aggregation ultimately helps in reducing the number of data messages thereby assisting in network life prolongation. In this paper, an intra-cluster data aggregation technique (ICA) for WSNs is proposed. ICA constructs the intra cluster data aggregation path from a source node to its CH node in an energy efficient way. The data packets are aggregated along the aggregation path by intermediate relay nodes till the message reaches to designated CH node. Comparative analysis of ICA, LEACH and LEACH-C protocols are carried by considering the parameters such as number of alive nodes, energy consumption, number of data packets received by BS. Results obtained show that ICA performs better compared to LEACH and LEACH-C protocols.

Intelligent Agent-Based Assessment of a Resilient Multi-hop Routing Protocol for Dynamic WSN

Wireless sensor networks (WSN) constitute a current field of interest in which the major concerns are related to mobility, spatial distribution, connectivity and dynamic creation of networks between autonomous nodes for cooperative detection and data transfer in diverse areas (e.g., healthcare, environmental or industrial monitoring). To this end, the present work describes the theoretical and practical development of a communication protocol for WSNs based on Bluetooth. The interaction between mobile nodes is performed with a multi-hop scheme in response to traffic needs without requiring a scatternet formation procedure. The interest of this algorithm—based on the concept of routing vector—is that it was designed to withstand changes in the node distribution for high-mobility scenarios, thus allowing the implementation of a robust data routing in low-resource microcontrolled devices with no operability loss. As the main contribution, we present the hardware and software implementation of the communication protocol in real devices along several case studies. With this aim, a long-term experimentation in a dense scenario has been carried out through an intelligent agent-based approach to formally validate the protocol considering three different performance metrics: packet delivery ratio, feedback overhead and round-trip time.

A multiagent-based hexagon shape approach for shortest path computation in wireless sensors network

The recent advances in sensor technology have resulted in increased utilization of sensors in real time applications such as battlefield surveillance, disaster management, health care and ecosystem management. Wireless Sensor Networks (WSNs) are constrained by limited sensor energy, latency, low network bandwidth size but the real time applications, such as above, demand delay sensitive, reliable, limited sensor node size and energy efficient routing protocols in WSNs. We have proposed a hexagon shape-based approach for shortest path computation in WSN to distribute the load efficiently using multi-agent-based scheme. This shortest path computation scheme to balance the load uses software agents to conserve the energy by reducing the transmission of data and control messages. In this method direct and alternate path are computed for reliable data transmission. The performance of the proposed scheme is evaluated in terms of performance parameters, such as packet delivery ratio, network lifetime and hexagon construction time.

A New wireless sensor networks Routing Algorithm Based on SPIN Protocols and Circumference Technique

In Wireless Sensor Networks (WSNs), the data transmission might be specified as a major challenge. Various protocols of routing were suggested for saving energy throughout the transmission of data in WSNs. The protocols of routing which are on the basis of data centric method were adequate in such regard which are performing data’s in-network aggregations for yielding energy- saving data dissemination, such sensor nodes have a few of limitations because of their limited, computing power, storage capacity, and limited energy. The data have been routed between nodes with the use of various routing protocols. In addition, there are a few routing protocols for WSNs, all such protocols attempted on eliminating a few of such limitations. A Circumference-based SPIN protocol, (C-SPIN), is going to implement for eliminating the limited energy as well as data overlap with the use of right-most data movement method.

Qualnet performances of grid-based clustering For WSN's routing protocols

<span>The wireless sensor networks (WSNs) believed to be as a hot research area due to their ranges in various fields of applications. Clustering is the more efficient techniques considered to resolve the problems of energy consumption in WSNs. The clustering has assured its effectiveness, specifically with high dynamic networks at which all nodes are represented in the clustering and all the data value can be collecting by sensor nodes with a cluster head (CH). The energy consumption as well as network traffic are balancing, the (CH) must be exchanged between all sensor nodes and the clustering size could be closely determined at various portions of the network. The key point at issue in WSN is to improve the energy-efficient algorithms with Grid based clustering for extending the lifetime of the networks, reducing cost, in addition to increasing the reliability of the network. The sensor nodes prepared with a power sources at limited period, so that the Grid Based Clustering algorithm (GBC) which efficiently employing sensor nodes energy have the ability to preserve an extended network lifetime. Sensor node Performances of the network mainly depend on the routing protocols, which are application based, four routing protocols LEACH, OLSR, AODV, and DSR in clustering WSN are estimated with Qualnet simulator. The results demonstrate that DSR outperforms in term of throughput, and end to end delay which compared to others while OLSR have highest value of half number of alive nodes per round.</span>

Increasing Efficiency of Sensor Nodes by Clustering in Section Based Hybrid Routing Protocol with Artificial Bee Colony

Abstract Sensor networks have been the area of interest for researcher community during the past few years due to its wide range of application and because of its limitations too. Sensor nodes, which are the key elements of these networks are small autonomous devices with limited processing power, limited battery capacity and also have limited memory. Short lifespan is one of the major challenges faced by these networks as the sensor nodes are deployed in the environments where the human intervention is difficult and hence replacing the batteries of the node is a tedious task. Many algorithms and protocols have come up from time to time with different ideas for improving the lifetime of the network by minimizing the consumption of battery which is mainly due to communication. This paper briefly discusses some of the algorithms for routing in a Wireless Sensor Network (WSN) with their challenges and the motivation behind proposing the Section Based Hybrid Routing Protocol (SBHRA) for WSN using Artificial Bee Colony. The design of the protocol is especially done for the network that has been divided into sections and uses hybrid routing for data transmission in Heterogeneous environment. The experimental results show that SBHRA gives stability periods that increased by 55.88% and life time of normal node is increased by 64.04% as compared with Enhanced Stable Election Protocol (E-SEP) protocol. The goal is to improve the throughput, stability and the lifetime of the network.

Secure and Energy-Aware Heuristic Routing Protocol for Wireless Sensor Network

Wireless Sensor Networks (WSNs) achieve much attention from various domains because of its easy maintenance, self-configuration, and scalability characteristics. It is comprised of small-sized sensors that interact with the Internet of Things (IoT) for observing and recording the physical conditions. The sensor nodes are autonomous and construct inter-communication topology with each other in an ad-hoc manner. However, the main restrictions of sensor nodes are their finite resources for energy management, data storage, transmission, and processing power. Different solutions have been addressed by researchers to overcome network performance due to bounded limitations of such battery-powered nodes, however, equalize the energy consumption and maintain the network throughput are the main research problems. Furthermore, due to the compromised nodes, the data is more prone to security vulnerabilities. Therefore, their security over the unpredictable network is other research concerns. Thus, the aim of this research article to propose a secure and energy-aware heuristic-based routing (SEHR) protocol for WSN to detect and prevent compromising data with efficient performance. Firstly, the proposed protocol makes use of an artificial intelligence-based heuristic analysis to accomplish a reliable, and intellectual learning scheme. Secondly, it protects the transmissions against adversary groups to attain security with the least complexity. Moreover, the route maintenance strategy is also achieved by using traffic exploration to reduce link failures and network dis-connectivity. The simulation results demonstrated the SEHR protocol improves the efficacy for network throughput by an average of 18%, packet drop ratio by 42%, end-to-end delay by 26%, energy consumption by 36%, faulty routes by 38%, network overhead by 44%, and computational overhead by 43% in dynamic scenarios as compared to existing work.

Information-Aware Secure Routing in Wireless Sensor Networks.

Secure routing is crucial for wireless sensor networks (WSNs) because they are vulnerable to various attacks. In this paper, we propose a new secure routing protocol for WSNs in the presence of malicious nodes. For each relay node in the route, associated information such as its trust value and status is considered in the protocol. The trust value is defined as the attack probability of the node according to previous packet-forwarding behaviors, and the status is a hybrid metric that combines the residual energy and distance to the sink node. Therefore, the route generated by the protocol is secure against malicious attacks and globally optimal according to the associated information. We used an improved variant of the Dijkstra algorithm to generate the secure route for WSNs in the presence of malicious nodes. Compared with the Reputation-Based Mechanism to Stimulate Cooperation (RBMSC) model in the same simulation environment, the proposed model can maintain a higher delivery ratio, which verifies the effectiveness of the proposed model on the basis of global optimization. Furthermore, compared with the traditional Dijkstra algorithm, the packet loss ratio in the improved Dijkstra algorithm is lower because it can more effectively avoid malicious nodes, thus verifying the effectiveness of the improved algorithm.

Data dependability based bimodal encryption scheme for distributed routing in wireless sensor networks

The development of smart cities and their fast-paced deployment leads to the creation of massive amount of data at exceptional rates. Due to the data gathering and tracking nature of wireless sensor networks (WSN), it finds applications in various domains. Presently, security is considered as an important design issue of developing multipath routing protocols in WSN. The existing routing techniques either concentrate on energy efficiency or security issues with maximum resource utilization. This paper focuses on the idea of incorporating encryption algorithms on multihop routing mechanism in WSN. Here, routing takes place by the Augmented Tree Based Routing (ATR) which is a tree-based multipath routing method. To attain higher level of security, two encryption algorithms namely lightweight encryption algorithm (LEA) and two phase hybrid cryptography algorithm (THCA) are employed based on the data dependability. The encryption algorithms are utilized based on data dependability where general data is encrypted by LEA and other confidential data are encrypted by THCA. i.e. the LEA is used to send proactive data and the important reactive data is encrypted by THCA. For routing purposes, Augmented Tree Based Routing (ATR) is used. From experimentation, it is evident that the presented method exhibits enhanced performance by means of throughput, control overhead and network lifetime even though there exist some misbehaving nodes in the network.

A Hybrid Swarm Intelligence Algorithm for Clustering-Based Routing in Wireless Sensor Networks

Wireless sensor networks (WSNs) comprise a large number of tiny sensing nodes, which are battery-powered with limited energy. An energy-efficient routing protocol is of utmost importance to prolong the network lifetime. Clustering is the most common technique to balance energy consumption among all nodes, while minimizing traffic and overhead during the data transmission phases. In this paper, a Multi-Objective nature-inspired algorithm based on Shuffled frog-leaping algorithm and Firefly Algorithm (named MOSFA) as an adaptive application-specific clustering-based multi-hop routing protocol for WSNs is proposed. MOSFA’s multi-objective function regards different criteria (e.g., inter- and intra-cluster distances, the residual energy of nodes, distances from the sink, overlap, and load of clusters) to select appropriate cluster heads at each round. Moreover, another multi-objective function is proposed to select the forwarder nodes in the routing phase. The controllable parameters of MOSFA in both clustering and multi-hop phases can be adaptively tuned to achieve the best performance based on the network requirements according to the specific application. Simulation results demonstrate average lifetime improvements of 182%, 68%, 30%, and 28% when compared with LEACH, ERA, SIF, and FSFLA, respectively, in different network scenarios.

A Review on Routing Protocols for Wireless Sensor Networks (WSNs)

Wireless Sensor Networks (WSNs) play a necessary position in todays actual world applications. WSNs are a team of autonomous sensor nodes that are geographically distributed to accumulate information and monitor events. WSNs are similarly sense that they rely on wireless connectivity and spontaneous formation of networks so that sensor information can be transported via wireless. Sometimes called dust network, minute sensors as small as dust referring to smart dust. WSNs are spatially distributed two to screen or bodily temperature, sound, pressure, etc. and to cooperatively ignore their data via the network to different locations. Each such sensor network node has typically various parts. Routing in WSNs in one of the important technique, because all node executes its battery power, if may be one node failure it collapse entire networks. Routing in WSNs is in reality difficult due to the intrinsic characteristics that differentiate these networks from different networks. The plan of routing protocols in WSN is affected via number of exigent factors. In this paper, a review on routing protocols for Wireless Sensor Networks (WSNs) and performance of its execution.

Evaluation of the Performance of Underwater Wireless Sensor Networks Routing Protocols under High-density Network

Nowadays, research and development of Underwater Wireless Sensor Networks (UWSNs) widely supporting various available application such as oil/gas monitoring system, tsunami monitoring, disaster prevention, and environmental monitoring has become increasingly popular among academicians and industries. However, to develop efficient communication in UWSNs is a difficult duty due to the irregular nature of the underwater environment. In our previous review [14], we did an elaborate theoretical survey on UWSNs routing protocols. In this work, we are going to evaluate the performance of some of the UWSNs routing protocols under high-density network condition. To simulate a high-density UWSNs, we are placing hundreds of underwater nodes in a small three-dimensional topographical area and study the behavior of the routing protocol and the network. We have chosen to evaluate some of the frequently addressed underwater routing protocols such as Underwater Flooding (UWFlooding), Vector-Based Forwarding (VBF), and Hop by Hop Vector-Based Forwarding (HH-VBF) under this high-density network scenarios. The result of our study shows that VBF and HH-VBF perform better in term of the number of packets received, dropped packets and PDR, while UWFlooding performs better in term of cumulative delay.

Secure and energy aware multi-hop routing protocol in WSN using Taylor-based hybrid optimization algorithm

The advancements of Wireless sensor network (WSN) in large number of applications made it common. However, the energy is a major challenge in the WSN environment as the battery-operated sensor nodes in the network consumes huge amount of energy during transmission. This work addresses the energy issue and provides an energy efficient multi-hop routing in WSN named Taylor based Cat Salp Swarm Algorithm (Taylor C-SSA) by modifying C-SSA with Taylor series. This method undergoes two stages for attaining multi-hop routing, which includes selection of cluster head (CH), and transmission of data. Initially, the energy-efficient cluster heads are selected using the Low Energy Adaptive Clustering Hierarchy (LEACH) protocol for effective data transmission, the sensor nodes sends data over the CH, which transmits the data to the base station through the selected optimal hop. The optimal hop selection is done using the proposed Taylor C-SSA. Moreover, the security aware multi-hop routing is performed by introducing trust model that involves indirect trust, integrity factor, direct trust, and data forwarding rate. The proposed Taylor C-SSA algorithm shows best performance in terms of energy, number of alive nodes, delay, and throughput values of 0.129, 42, 0.291, and 0.1, respectively.

ISFC-BLS (Intelligent and Secured Fuzzy Clustering Algorithm Using Balanced Load Sub-Cluster Formation) in WSN Environment

Wireless sensor networks (WSNs) have variety of applications and comprise of numerous tiny sensor nodes that are deployed to process and transmit the sensed data to the base station. Security and energy efficiency are the two major concerns for prolonging the lifetime of the WSN. Due to their broadcast nature, WSNs are prone to several threats that needs to be resolved. An effective clustering scheme can overcome these security threats and enhance the energy efficiency as well as lifetime of the network. A secured and energy efficient Intelligent and Secured Fuzzy Clustering Algorithm using Balanced Load Sub-cluster formation (ISFC-BLS) routing protocol for WSNs is proposed and corresponding maintenance methods and routing algorithms are established. On the basis of previous works, in order to select cluster heads in hierarchical topology, in this paper, a solution based on fuzzy based clustering technique is proposed which facilitates cooperative communication in the network and the balanced load sub cluster formation is proposed that helps to determine the nodes which joins the cluster. Ant colony optimization is used for determining the optimal path to the destination. Experimental results and performance analysis demonstrate that ISFC-BLS is more effective and secure than energy efficient heterogeneous ring clustering and other existing clustering techniques, for enhancing the networks lifetime and achieving better energy efficiency by decreasing the number of control messages and the node energy consumption.

Performance enhancement routing protocols for heterogeneous WSNs

SummaryOne of the main constraints in wireless sensor networks (WSNs) is the energy consumption. To mitigate this limitation and to prolong network life‐time, stability period and throughput, this paper proposes new cluster‐heads selection protocols, they based on Stable Election Protocol (SEP) and Distributed Energy‐Efficient Clustering (DEEC). We first propose Enhanced Zonal‐SEP (EZSEP) and Zonal Threshold‐DEEC (ZTDEEC) protocols, the proposed protocols are based on dividing the network field into certain zones, this will improve the connectivity of the far normal nodes with the base station (BS). Several evaluation metrics are used to compare between the proposed protocols and the conventional ZSEP and TDEEC protocols such as: network stability, instability period, life‐time and throughput. Considering the same total initial energy, the obtained results show that the proposed EZSEP slightly outperforms the conventional ZSEP in terms of network stability, instability period and life‐time, it achieves enormous improvements in terms of throughput as more nodes can transmit direct to BS. On the other hand, the proposed ZTDEEC provides huge improvements in terms of all the evaluation metrics mentioned above. To further improve the network life‐time and network throughput, we propose Threshold‐based EZSEP (TE‐ZSEP) and Enhanced‐ZTDEEC (EZ‐TDEEC) protocols, in these two new protocols we redefine the threshold formula used in EZSEP and ZTDEEC to consider both weighted energy and weighted distance parameters. By combining the idea of dividing the network field into certain zones and the new threshold formula, the proposed TE‐ZSEP and EZ‐TDEEC protocols can effectively improve the energy consumption in heterogeneous WSN and prolong its life‐time as proved by the obtained results.

MOMHR: A Dynamic Multi-hop Routing Protocol for WSN Using Heuristic Based Multi-objective Function

Wireless sensor networks (WSNs) are the networks which mainly focuses on the applications and are composed of considerable sensor nodes. The use of energy in a valuable way is considered as a feature for the design structure of WSNs. In the WSNs, the nodes power sources are limited. Moreover, because of this, there is a must for a different approach regarding the energy availability and this is mainly for long distance communication, for this multi-hop (MH) systems are chosen. Even though MH decreases the energy cost used by all node along the path, however, to obtain the best routing path among nodes is yet an interesting subject. In this article, we present a multi-objective multi-hop routing (MOMHR) protocol for optimal data routing to gain the network lifetime. In the first phase, the K-means algorithm is applied to split the nodes into k clusters. Next, the artificial bee colony optimisation algorithm is applied to obtain the best possible CH within each cluster then using a multi-objective functions finally the multi-hop routing protocol finds a multihop path with minimum communication cost from the node to the base station. Our proposed method is simulated in MATLAB platform and compared with two recent protocols such as low energy adaptive clustering hierarchy and energy efficient centroid-based routing protocol. The execution of the proposed MOMHR protocols using multi-objective function is evaluated using metrics such as energy efficiency and network lifetime.

Scalable Downward Routing for Wireless Sensor Networks Actuation

In this paper, we study the downward routing for network control/actuation in large-scale and heterogeneous wireless sensor networks (WSNs). We propose the opportunistic source routing (OSR), a scalable and reliable downward routing protocol for WSNs. OSR introduces opportunistic routing into traditional source routing based on the parent set of a node’s upward routing in data collection, significantly addressing the drastic link dynamics in low-power and lossy WSNs. We devise a novel adaptive Bloom filter mechanism to effectively and efficiently encode the downward source-route in OSR, which enables a significant reduction of the length of source-route field in the packet header. OSR is scalable to very large-size WSN deployments, since each resource-constrained node in the network stores only the set of its direct children. We present an analytical scalability model and evaluate the performance of OSR via both the simulations and real-world testbed experiments, in comparison with the standard RPL (both storing mode and non-storing mode), ORPL, and the representative dissemination protocol Drip. Our results show that the OSR significantly outperforms RPL and ORPL in scalability and reliability. OSR also achieves significantly better energy efficiency compared with TinyRPL and Drip which are based on the same TinyOS platform as OSR implementation.

Comparative analysis of energy based optimized dynamic source multipath routing protocol in WSNs

<p>Wireless Sensor Network (WSN) has been considered to be a formula for overcoming various requirements like surveillance, health care, traffic surveillance and defense systems. As an aid to the demands for Wireless sensor network, research has been going on the efficient consumption of energy and secure communication areas for WSN. Here introducing Ant colony optimization based Optimized dynamic Secure multipath routing protocol (ODMRP) have improvised WSN in terms of energy efficiency, performance, strength and scalability. This paper proposed mechanism of Ant Colony Optimization based on the optimized dynamic secure multipath routing protocol (ODMRP-ACO) for data transmission in the WSNs. This eases the data transmission via WSNs. The shortest path between the source node and the destination node is analyzed by the ant colony cooperation which is based on the ACO. There are several routing protocols like Energy-aware and Secure Routing with Trust (ESRT-ACO), Split multipath routing protocol-Ant colony Optimization (SMR-ACO), Light Weight Trust Based routing protocol (TLB-AODV) and AODV routing protocols that are built with the ACO based Routing Protocol. They are concerned over the End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. The data analytic results have proven to be effective compared to the other routing protocols designed for WSN. This is because; the overall ODMRP-ACO was calculated to be 96.98% better than the other existing. For the newly developed ODMRP-ACO protocol, the simulation platform used is NS2 simulation software.</p>