Braided Routing Technique to Balance Traffic Load in Wireless Sensor Networks

2020 ◽  
pp. 837-855
Author(s):  
Apostolos Demertzis ◽  
Konstantinos Oikonomou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Local Variation ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Energy Hole ◽  
Local Variance ◽  
Routing Mechanism ◽  
Simulation Results

Many-to-one wireless sensor networks suffer from an extreme variation of traffic load between nodes. Sensor nodes near the sink consume much more energy than distant ones, resulting in the energy hole problem (global variation of load). In addition, even nodes located at the same distance from the sink experience very different traffic load with each other (local variation). This uneven distribution of traffic load, both globally and locally, results in a severe shortening of the time until first node runs out of battery. This work focuses on balancing the load of equally-distant nodes from the sink by sharing each one's load among its next-hop neighbors. Eventually, packets are travelling from node to sink by following interlaced paths. The proposed routing mechanism, called braided routing, is a simple one and can be applied over any cost-based routing, incurring a negligible overhead. Simulation results show that the local variance of load is reduced nearly 20-60% on average while the time until first death can be prolonged more than twice in many cases and the lifetime about 15%.

Braided Routing Technique to Balance Traffic Load in Wireless Sensor Networks

2016 ◽  
Vol 4 (4) ◽  
pp. 1-19
Author(s):  
Apostolos Demertzis ◽  
Konstantinos Oikonomou
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Local Variation ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Energy Hole ◽  
Local Variance ◽  
Extreme Variation ◽  
Routing Mechanism

Many-to-one wireless sensor networks suffer from an extreme variation of traffic load between nodes. Sensor nodes near the sink consume much more energy than distant ones, resulting in the energy hole problem (global variation of load). In addition, even nodes located at the same distance from the sink experience very different traffic load with each other (local variation). This uneven distribution of traffic load, both globally and locally, results in a severe shortening of the time until first node runs out of battery. This work focuses on balancing the load of equally-distant nodes from the sink by sharing each one's load among its next-hop neighbors. Eventually, packets are travelling from node to sink by following interlaced paths. The proposed routing mechanism, called braided routing, is a simple one and can be applied over any cost-based routing, incurring a negligible overhead. Simulation results show that the local variance of load is reduced nearly 20-60% on average while the time until first death can be prolonged more than twice in many cases and the lifetime about 15%.

An Improved Sensor Positioning for Wireless Sensor Networks

2014 ◽  
Vol 716-717 ◽  
pp. 1322-1325
Author(s):  
Jin Tao Lin ◽  
Guang Yu Fan ◽  
Wen Hong Liu ◽  
Ying Da Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Signal Strength ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Positioning Accuracy ◽  
Positioning Method ◽  
Anchor Nodes ◽  
Simulation Results ◽  
Sensor Positioning

Sensor positioning is a fundamental block in various location-dependent applications of wireless sensor networks. In order to improve the positioning accuracy without increasing the complex and cost of sensor nodes, an improve sensor positioning method is proposed for wireless sensor networks. In the method, after receiving the broadcasting message of the neighboring anchor nodes, the sensor nodes calculate a modifying factor of the change of the signal strength. And they modify the distances between themselves and neighboring anchor nodes with the modifying factor. Simulation results show that the proposed method can obtain a high positioning accuracy.

scholarly journals LNDIR: A lightweight non-increasing delivery-latency interval-based routing for duty-cycled sensor networks

2018 ◽  
Vol 14 (4) ◽  
pp. 155014771876760 ◽  
Author(s):  
Muhammad K Shahzad ◽  
Dang Tu Nguyen ◽  
Vyacheslav Zalyubovskiy ◽  
Hyunseung Choo
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Neighbor Discovery ◽  
Performance Improvements ◽  
Novel Approach ◽  
Minimum Latency ◽  
Latency Interval

Wireless sensor networks are composed of low-energy, small-size, and low-range unattended sensor nodes. Recently, it has been observed that by periodically turning on and off the sensing and communication capabilities of sensor nodes, we can significantly reduce the active time and thus prolong network lifetime. However, this duty cycling may result in high network latency, routing overhead, and neighbor discovery delays due to asynchronous sleep and wake-up scheduling. These limitations call for a countermeasure for duty-cycled wireless sensor networks which should minimize routing information, routing traffic load, and energy consumption. In this article, we propose a lightweight non-increasing delivery-latency interval routing referred as LNDIR. This scheme can discover minimum latency routes at each non-increasing delivery-latency interval instead of each time slot. Simulation experiments demonstrated the validity of this novel approach in minimizing routing information stored at each sensor. Furthermore, this novel routing can also guarantee the minimum delivery latency from each source to the sink. Performance improvements of up to 12-fold and 11-fold are observed in terms of routing traffic load reduction and energy efficiency, respectively, as compared to existing schemes.

Localization in Wireless Sensor Networks in Beacon Drifting Scenarios

2012 ◽  
Vol 562-564 ◽  
pp. 1234-1239
Author(s):  
Ming Xia ◽  
Qing Zhang Chen ◽  
Yan Jin
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Probability Density ◽  
Sensor Nodes ◽  
Density Model ◽  
Wireless Sensor ◽  
Localization Algorithm ◽  
Localization Accuracy ◽  
Scenarios Simulation ◽  
Simulation Results

The beacon drifting problem occurs when the beacon nodes move accidentally after deployment. In this occasion, the localization results of sensor nodes in the network will be greatly affected and become inaccurate. In this paper, we present a localization algorithm in wireless sensor networks in beacon drifting scenarios. The algorithm first uses a probability density model to calculate the location reliability of each node, and in localization it will dynamically choose nodes with highest location reliabilities as beacon nodes to improve localization accuracy in beacon drifting scenarios. Simulation results show that the proposed algorithm achieves its design goals.

scholarly journals An Adaptive Approach to Discriminate the Persistence of Faults in Wireless Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Arunanshu Mahapatro ◽  
Pabitra Mohan Khilar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fault Detection ◽  
Detection Algorithm ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Transient Fault ◽  
Intermittent Faults ◽  
Parametric Fault ◽  
Simulation Results

This paper presents a parametric fault detection algorithm which can discriminate the persistence (permanent, intermittent, and transient) of faults in wireless sensor networks. The main characteristics of these faults are the amount the fault appears. We adopt this state-holding time to discriminate transient from intermittent faults. Neighbor-coordination-based approach is adopted, where faulty sensor nodes are detected based on comparisons between neighboring nodes and dissemination of the decision made at each node. Simulation results demonstrate the robustness of the work at varying transient fault rate.

scholarly journals THE PERFORMANCE OF DIRECTIONAL FLOODING ROUTING PROTOCOL FOR UNDERWATER SENSOR NETWORKS

2015 ◽  
Vol 74 (9) ◽  
Author(s):  
Nur Asfarina Idrus ◽  
Jiwa Abdullah
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Routing Protocol ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Underwater Sensor Networks ◽  
Underwater Communication ◽  
Routing Mechanism ◽  
Simulation Results ◽  
Networking Protocols

The specific characteristic of underwater environment introduces new challenges for the networking protocols. Underwater Wireless Sensor Networks (UWSN) and terrestrial Wireless Sensor Networks (WSN) share some common properties but their differences necessitate specialized new protocols for successful underwater communication. In this paper, a specialized protocol, known as Directional Flooding Routing Protocol is being chosen as the protocol to implement the routing mechanism for underwater sensor networks (UWSNs). The protocol is analyzed and evaluated. Simulation experiments have been carried out to find the suitability of various protocols for the sub aquatic transmission medium, whether in freshwater or seawater. The goal of this paper is to produce simulation results that would illustrate the performances of the protocol for a given metric such as end-to-end delay, packet delivery ratio and energy consumption. By analyzing the simulation results, DFR is considerably reliable for UWSN because this protocol is suitable for the sub aquatic transmission medium such as seawater.   

An Efficient Fitness Function for Clustering of Wireless Sensor Networks

2020 ◽  
Vol 10 (3) ◽  
pp. 318-324
Author(s):  
Atiieh Hoseinpour ◽  
Mojtaba Jafari Lahijani ◽  
Mohammad Hosseinpour ◽  
Javad Kazemitabar
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Fitness Function ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Evolutionary Clustering ◽  
Fitness Functions ◽  
Field Sensor ◽  
Simulation Results ◽  
And Control

Background & Objective: A sensor network is composed of a large number of sensor nodes that are deployed to perform measurement and/or command and control in a field. Sensor nodes are battery powered devices and replacement or recharging of their batteries may not be feasible. One of the major challenges with sensory wireless networks is excessive energy consumption in nodes. Clustering is one of the methods that has been offered for resolving this issue. In this paper, we pursue evolutionary clustering and propose a new fitness function that har-nesses multiple propagation indices. Methods: In this paper we develop an efficient fitness function by first selecting the best clusters, and then selecting the best attribution of cluster to clusters. The distance between the nodes and relevant cluster heads was used for the mathematical modelling necessary. In the end we develop the fitness function equation by using normalization of the raw data. Results: Simulation results show improvement compared to previous fitness functions in clustering of the wireless sensor networks.

Performance of Wireless Sensor Networks for Different Mobile Event Path Scenarios

2012 ◽  
pp. 55-68
Author(s):  
Tao Yang ◽  
Gjergji Mino ◽  
Leonard Barolli ◽  
Makoto Ikeda ◽  
Fatos Xhafa ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Network ◽  
Energy Characteristic ◽  
Large Scale ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Movement Path ◽  
Random Movement ◽  
Simulation Results

In this paper, the authors investigate how the sensor network performs when the event moves with special movement path. Simulation results are compared with four scenarios: when the event is stationary, moving randomly, moving with simple 4 path, and boids path. The simulation results show that for the case when the event is moving randomly, the performance is the worst in the four scenarios. The characteristic of goodput decreases with the increase of number of sensor nodes. In the case of the boids model, the goodput is unstable when the is lower than 10 pps. The consumed energy characteristic increases with the increase of Simulation results show that the consumed energy of random movement is the worst among the four scenarios. The consumed energy of boids model is the lowest in four cases. This shows that the event movement with boids model can decrease the consumed energy in large scale WSNs.

scholarly journals A Swarm Intelligent Algorithm Based Route Maintaining Protocol for Mobile Sink Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-10 ◽  
Author(s):  
Xiaoming Wu ◽  
Yinglong Wang ◽  
Yifan Hu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Mobile Sink ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Network Resources ◽  
Intelligent Algorithm ◽  
Bee Colony ◽  
Alternative Routing

Recent studies have shown that mobile sink can be a solution to solve the problem that energy consumption of sensor nodes is not balanced in wireless sensor networks (WSNs). Caused by the sink mobility, the paths between the sensor nodes and the sink change frequently and have profound influence on the lifetime of WSN. It is necessary to design a protocol that can find efficient routings between the mobile sink and nodes but does not consume too many network resources. In this paper, we propose a swarm intelligent algorithm based route maintaining protocol to resolve this issue. The protocol utilizes the concentric ring mechanism to guide the route researching direction and adopts the optimal routing selection to maintain the data delivery route in mobile sink WSN. Using the immune based artificial bee colony (IABC) algorithm to optimize the forwarding path, the routing maintaining protocol could find an alternative routing path quickly and efficiently when the coordinate of sink is changed in WSN. The results of our extensive experiments demonstrate that our proposed route maintaining protocol is able to balance the network traffic load and prolong the network lifetime.

scholarly journals Swarm Intelligence-based Partitioned Recovery in Wireless Sensor Networks

2018 ◽  
Vol 3 ◽  
pp. 70-81
Author(s):  
Gaurav Kumar ◽  
Virender Ranga
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Large Scale ◽  
Sensor Nodes ◽  
Traffic Load ◽  
Wireless Sensor ◽  
Grey Wolf ◽  
Relay Nodes ◽  
Network Partition ◽  
Heterogeneous Wireless Sensor Networks

The failure rate of sensor nodes in Heterogeneous Wireless Sensor Networks is high due to the use of low battery-powered sensor nodes in a hostile environment. Networks of this kind become non-operational and turn into disjoint segmented networks due to large-scale failures of sensor nodes. This may require the placement of additional highpower relay nodes. In this paper, we propose a network partition recovery solution called Grey Wolf, which is an optimizer algorithm for repairing segmented heterogeneous wireless sensor networks. The proposed solution provides not only strong bi-connectivity in the damaged area, but also distributes traffic load among the multiple deployed nodes to enhance the repaired network’s lifetime. The experiment results show that the Grey Wolf algorithm offers a considerable performance advantage over other state-of-the-art approaches.

Sign in / Sign up

Export Citation Format

Share Document