scholarly journals A Robust Self-Organizing Tree-Based Routing Protocol for Wireless Sensor Networks

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Qinbin He ◽  
Jinping Mou ◽  
Bin Lin

For a wireless sensor network (WSN), routing protocols not only affect the reliability and real-time data transmission but also affect the energy consumption of communication and the survival time of the entire network. In this paper, a routing protocol is proposed that combines virtual potential energy with local density of nodes and sleep-wake-up mechanism. The proposed routing protocol is self-organizing and robust. The routing protocol allows nodes to dynamically join or leave the network and enables nodes to automatically transmit information along the shortest path to reach a corresponding sink. The protocol can be applied in scenarios of single sink, multiple sinks, and three-dimensional WSNs. At the same time, the protocol takes a sleep-wake-up mechanism into account, makes a significant decrease in total network traffic, and achieves energy-saving as much as possible. Examples are given in detail to illustrate the effectiveness of the proposed routing protocol.

Author(s):  
Zhongdong Hu ◽  
Zhendong Wang ◽  
Junling Wang ◽  
Ting Zeng

<p>The existing routing protocols such as LEACH and its improvements are all balance the overall energy consumption of the network by electing cluster heads looping and randomly. However, it also causes defects such as different cluster sizes and uneven cluster head distribution, resulting in uneven energy loss. In response to these shortcomings, this paper proposes a new routing protocol called AOCRP based on automatic optimization of clustering. The AOCRP has an optimized and fixed number of clusters, and the cluster head distribution is relatively uniform. It can adjust the number of nodes in each cluster automatically during the operation and keep the number of nodes the same in each cluster during each round. The AOCRP balances node energy loss and extends the life cycle of wireless sensor networks. Simulation experiments show that the performance of this protocol is better than EH-LEACH and DEEC in extending the network lifecycle and data transmission.</p>


Author(s):  
Nabeena Ameen ◽  
Najumnissa Jamal ◽  
L. Arun Raj

<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>


2019 ◽  
Vol 9 (2) ◽  
Author(s):  
Nasarudin Ismail ◽  
Mohd Murtadha Mohamad

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.


Author(s):  
Yugashree Bhadane ◽  
Pooja Kadam

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.


Author(s):  
A. Radhika ◽  
D. Haritha

Wireless Sensor Networks, have witnessed significant amount of improvement in research across various areas like Routing, Security, Localization, Deployment and above all Energy Efficiency. Congestion is a problem of  importance in resource constrained Wireless Sensor Networks, especially for large networks, where the traffic loads exceed the available capacity of the resources . Sensor nodes are prone to failure and the misbehaviour of these faulty nodes creates further congestion. The resulting effect is a degradation in network performance, additional computation and increased energy consumption, which in turn decreases network lifetime. Hence, the data packet routing algorithm should consider congestion as one of the parameters, in addition to the role of the faulty nodes and not merely energy efficient protocols .Nowadays, the main central point of attraction is the concept of Swarm Intelligence based techniques integration in WSN.  Swarm Intelligence based Computational Swarm Intelligence Techniques have improvised WSN in terms of efficiency, Performance, robustness and scalability. The main objective of this research paper is to propose congestion aware , energy efficient, routing approach that utilizes Ant Colony Optimization, in which faulty nodes are isolated by means of the concept of trust further we compare the performance of various existing routing protocols like AODV, DSDV and DSR routing protocols, ACO Based Routing Protocol  with Trust Based Congestion aware ACO Based Routing in terms of End to End Delay, Packet Delivery Rate, Routing Overhead, Throughput and Energy Efficiency. Simulation based results and data analysis shows that overall TBC-ACO is 150% more efficient in terms of overall performance as compared to other existing routing protocols for Wireless Sensor Networks.


Author(s):  
Suzan Shukry

AbstractStable routing and energy conservation over a wireless sensor network (WSN) is a major issue in Internet of Things applications. The network lifetime can be increased when studying this issue with interest. Data transmission is a dominant factor in IoT networks for communication overhead and energy consumption. A proposed efficient node stable routing ($$ENSR$$ ENSR ) protocol is introduced to guarantee the stability of transmission data between the source and destination nodes, in a dynamic WSN conditions. $$ENSR$$ ENSR minimizes energy consumption and selects more stable nodes for packets forwarding. Stability becomes the most important factor that qualifies the node's centrality. A node’s stability is characterized by residual energy, link quality, and number of hops needed to reach the destination from the node. To calculate node's stability, an enhanced centrality concept, known as stable betweenness centrality ($$SBC$$ SBC ) is introduced. In $$ENSR$$ ENSR , at first, some nodes will be selected as the stable forwarding nodes, usually with maximum $$SBC$$ SBC between their neighbors within a limited communication radio range of a particular region. Furthermore, each stable forwarding node then broadcasts its identity, including $$SBC$$ SBC , to the source node separately. The source node can compute a stable path to forward packets to the corresponding stable forwarding node, based on a proper designed stable path routing metric ($$SPRM$$ SPRM ). Then, the stable forwarding node will behave as a new source node and start another stable path routing process until the packets are forwarded and reached to the destination node. In addition, the change of stable nodes over time balances and conserves node energy consumption, thereby mitigating “hot spots”. The proposed routing protocol is validated through simulation. The numerical results show that the proposed protocol outperforms the existing algorithms, global and local reliability-based routing ($$GLRR$$ GLRR ) and reliable energy-aware routing protocol $$(RER)$$ ( R E R ) , in terms of network efficiency and reliability.


2011 ◽  
Vol 474-476 ◽  
pp. 828-833
Author(s):  
Wen Jun Xu ◽  
Li Juan Sun ◽  
Jian Guo ◽  
Ru Chuan Wang

In order to reduce the average path length of the wireless sensor networks (WSNs) and save the energy, in this paper, the concept of the small world is introduced into the routing designs of WSNs. So a new small world routing protocol (SWRP) is proposed. By adding a few short cut links, which are confined to a fraction of the network diameter, we construct a small world network. Then the protocol finds paths through recurrent propagations of weak and strong links. The simulation results indicate that SWRP reduces the energy consumption effectively and the average delay of the data transmission, which leads to prolong the lifetime of both the nodes and the network.


Author(s):  
Edy Victor Haryanto ◽  

In an underwater wireless sensor network (UWSN), research challenges occur in the availability of new connectivity protocols, sensors, and utilization of energy. One of the issues is to enhance the lifespan of the network without increasing the supply, cost, and level of resources. This paper proposes a conceptual routing protocol for UWSN, known as Energy-Efficient Multipath Adaptive Routing (E2MAR) protocols, which is primarily intended for long-term control with greater energy efficiency and transmission rate. Key development conditions were set by the E2MR and forward nodes are chosen based on the performance index. Different tests are carried out by evaluating E2MR in terms of the number of live nodes, end-to-end latency, packet delivery rate, and maximum energy usage efficiently compared to some other Routing protocols. The lifespan of the network has also been greatly enhanced.


Author(s):  
Fuseini Jibreel ◽  
Emmanuel Tuyishimire ◽  
I M Daabo

Wireless Sensor Networks (WSNs) continue to provide essential services for various applications such as surveillance, data gathering, and data transmission from the hazardous environments to safer destinations. This has been enhanced by the energy-efficient routing protocols that are mostly designed for such purposes. Gateway-based Energy-Aware Multi-hop Routing protocol (MGEAR) is one of the homogenous routing schemes that was recently designed to more efficiently reduce the energy consumption of distant nodes. However, it has been found that the protocol has a high energy consumption rate, lower stability period, less data transmission to the Base station (BS). In this paper, an enhanced Heterogeneous Gateway-based Energy-Aware multi-hop routing protocol ( HMGEAR) is proposed. The proposed routing scheme is based on the introduction of heterogeneous nodes in the existing scheme, selection of the head based on the residual energy, introduction of multi-hop communication strategy in all the regions of the network, and implementation of energy hole elimination technique. Results show that the proposed routing scheme outperforms two existing ones.


2020 ◽  
Author(s):  
Ademola Abidoye ◽  
Boniface Kabaso

Abstract Wireless sensor networks (WSNs) have been recognized as one of the most essential technologies of the 21st century. The applications of WSNs are rapidly increasing in almost every sector because they can be deployed in areas where cable and power supply are difficult to use. In the literature, different methods have been proposed to minimize energy consumption of sensor nodes so as to prolong WSNs utilization. In this article, we propose an efficient routing protocol for data transmission in WSNs; it is called Energy-Efficient Hierarchical routing protocol for wireless sensor networks based on Fog Computing (EEHFC). Fog computing is integrated into the proposed scheme due to its capability to optimize the limited power source of WSNs and its ability to scale up to the requirements of the Internet of Things applications. In addition, we propose an improved ant colony optimization (ACO) algorithm that can be used to construct optimal path for efficient data transmission for sensor nodes. The performance of the proposed scheme is evaluated in comparison with P-SEP, EDCF, and RABACO schemes. The results of the simulations show that the proposed approach can minimize sensor nodes’ energy consumption, data packet losses and extends the network lifetime


Sign in / Sign up

Export Citation Format

Share Document