scholarly journals DS Evidence Theory-Based Energy Balanced Routing Algorithm for Network Lifetime Enhancement in WSN-Assisted IOT

Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 152
Author(s):  
Liangrui Tang ◽  
Zhilin Lu
Keyword(s):  
Network Lifetime ◽  
Routing Algorithm ◽  
Evidence Theory ◽  
Routing Algorithms ◽  
Energy Efficient Routing ◽  
Balancing Energy ◽  
Energy Balanced Routing ◽  
The Ideal ◽  
Lifetime Enhancement

Wireless sensor networks (WSNs) can provide data acquisition for long-term environment monitoring, which are important parts of Internet of Things (IoT). In the WSN-assisted IoT, energy efficient routing algorithms are required to maintain a long network lifetime. In this paper, a DS evidence theory-based energy balanced routing algorithm for network lifetime enhancement (EBRA-NLE) in WSN-assisted IOT is proposed. From the perspective of energy balance and minimization of routing path energy consumption, three attribute indexes are established to evaluate the forward neighboring nodes. Then a route selection method based on DS evidence theory is developed to comprehensively evaluate the nodes and select the optimal next hop. In order to avoid missing the ideal solution because of the excessive difference between the index values, the sine function is used to adjust this difference. The simulation results show that the proposed EBRA-NLE has certain advantages in prolonging network lifetime and balancing energy between nodes.

scholarly journals Improved energy-balanced algorithm for underwater wireless sensor network based on depth threshold and energy level partition

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Pan Feng ◽  
Danyang Qin ◽  
Ping Ji ◽  
Min Zhao ◽  
Ruolin Guo ◽  
...  
Keyword(s):  
Wireless Sensor Network ◽  
Energy Level ◽  
Sensor Network ◽  
Network Lifetime ◽  
Data Transmission ◽  
Routing Algorithms ◽  
Superior Performance ◽  
Wireless Sensor ◽  
Energy Consumption Optimization ◽  
Energy Balanced Routing

Abstract Considering the insufficient global energy consumption optimization of the existing routing algorithms for Underwater Wireless Sensor Network (UWSN), a new algorithm, named improved energy-balanced routing (IEBR), is designed in this paper for UWSN. The algorithm includes two stages: routing establishment and data transmission. During the first stage, a mathematical model is constructed for transmission distance to find the neighbors at the optimal distances and the underwater network links are established. In addition, IEBR will select relays based on the depth of the neighbors, minimize the hops in a link based on the depth threshold, and solve the problem of data transmission loop. During the second stage, the links built in the first stage are dynamically changed based on the energy level (EL) differences between the neighboring nodes in the links, so as to achieve energy balance of the entire network and extend the network lifetime significantly. Simulation results show that compared with other typical energy-balanced routing algorithms, IEBR presents superior performance in network lifetime, transmission loss, and data throughput.

An Energy-Balanced Routing Algorithm in Wireless Seismic Sensor Network

2016 ◽  
Vol 13 (10) ◽  
pp. 6823-6833
Author(s):  
Xunqian Tong ◽  
Gengfa Fang ◽  
Diep Nguyen ◽  
Jun Lin ◽  
Emerson Cabrera
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Clustering Algorithm ◽  
Hamming Distance ◽  
Hot Spot ◽  
Routing Algorithm ◽  
Residual Energy ◽  
Data Collector ◽  
Energy Balanced Routing ◽  
Candidate Set

Due to unpredictable geological outdoor environments and imbalances in energy consumption of seismometer nodes in the wireless seismic sensor networks (WSSN), some seismometer nodes fail much earlier than others due to power loss. This would cause hot spot problems, network partitions, and significantly shorten network lifetime. In this paper, we designed an energy-balanced routing algorithm (EBRA) to ensure balanced energy consumption from all seismometer nodes in the WSSN and to enhance the connectivity and lifetime of the WSSN. By aiming at minimizing the imbalance in the residual energy, we divide the routing algorithm into two parts: clustering formation and inter-cluster routing. In clustering formation, we design an energy-balanced clustering algorithm, which selects the cluster head dynamically, based on residual energy, distance between the seismometer node and data collector. The clustering algorithm mitigates hot spot problems by balancing energy consumption among seismometer nodes. In regards to inter-cluster routing, we can relate it to the pareto-candidate set. To reduce the average multi-hop delay from cluster heads to the data collector, we optimize the pareto-candidate set by Hamming distance. In the design of EBRA, we consider minute details such as energy consumed by transmitting bits and impact of average multi-hop delay. This adds to the novelty of this work compared to the existing studies. Simulation results demonstrated a reduction in the average multi-hop delay by 87.5% with network size of 200 nodes in ten different data collector locations. Our algorithm also improves the network lifetime over the others three schemes by 7.8%, 23% and 45.4%, respectively.

scholarly journals Prolonging the Lifetime of Wireless Sensor Networks Interconnected to Fixed Network Using Hierarchical Energy Tree Based Routing Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-12
Author(s):  
M. Kalpana ◽  
R. Dhanalakshmi ◽  
P. Parthiban
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Research Work ◽  
Product Evaluation ◽  
Wireless Sensor ◽  
Energy Efficient Routing ◽  
Data Packets ◽  
Fixed Network

This research work proposes a mathematical model for the lifetime of wireless sensor networks (WSN). It also proposes an energy efficient routing algorithm for WSN called hierarchical energy tree based routing algorithm (HETRA) based on hierarchical energy tree constructed using the available energy in each node. The energy efficiency is further augmented by reducing the packet drops using exponential congestion control algorithm (TCP/EXP). The algorithms are evaluated in WSNs interconnected to fixed network with seven distribution patterns, simulated in ns2 and compared with the existing algorithms based on the parameters such as number of data packets, throughput, network lifetime, and data packets average network lifetime product. Evaluation and simulation results show that the combination of HETRA and TCP/EXP maximizes longer network lifetime in all the patterns. The lifetime of the network with HETRA algorithm has increased approximately 3.2 times that of the network implemented with AODV.

scholarly journals EARPC – Energy Aware Routing Protocol for Cooperative MIMO Scheme in WSNs

2020 ◽  
Vol 3 ◽  
pp. 22-27
Author(s):  
Kummathi Chenna Reddy ◽  
Geetha D. Devanagavi ◽  
Thippeswamy M. N.
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Levels ◽  
Routing Algorithm ◽  
Cluster Head ◽  
Sensor Nodes ◽  
Energy Aware ◽  
Energy Efficient Routing ◽  
Energy Aware Routing

Wireless sensor networks are typically operated on batteries. Therefore, in order to prolong network lifetime, an energy efficient routing algorithm is required. In this paper, an energy-aware routing protocol for the co-operative MIMO scheme in WSNs (EARPC) is presented. It is based on an improved cluster head selection method that considers the remaining energy level of a node and recent energy consumption of all nodes. This means that sensor nodes with lower energy levels are less likely to be chosen as cluster heads. Next, based on the cooperative node selection in each cluster, a virtual MIMO array is created, reducing uneven distribution of clusters. Simulation results show that the proposed routing protocol may reduce energy consumption and improve network lifetime compared with the LEACH protocol

scholarly journals A Genetic Algorithm Based Minimal Maximal Load Tree Routing Algorithm in Wireless Sensor Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-7 ◽  
Author(s):  
Zhi Huang
Keyword(s):  
Genetic Algorithm ◽  
Network Lifetime ◽  
Fitness Function ◽  
Routing Algorithm ◽  
Optimal Routing ◽  
Energy Efficient Routing ◽  
Maximal Load ◽  
The Individual ◽  
Routing Tree ◽  
Static Routing

The key issue of static routing algorithms is how to construct an energy efficient routing tree that is utilized during the whole network duration in order to extend network lifetime. In this paper, we have illuminated that, in applications that define network lifetime as the time when the first sensor dies, the optimal routing tree should be the routing tree with minimal maximal load of all sensors and named such trees the Minimal Maximal Load Tree (MMLT). Since the procedure of constructing a routing tree is complex and the number of possible routing trees in a network is very huge, we have proposed a genetic algorithm (GA) based algorithm to obtain approximate Minimal Maximal Load Tree (MMLT). Each individual corresponds to a routing tree, and the fitness function is defined as the maximal load of all sensors in accordance with the routing tree that the individual corresponds to. Thus, approximate MMLT is obtained and network lifetime is extended. Simulation results show that our proposed algorithm notably extends network lifetime.

scholarly journals Lifetime enhancement for clustering protocols in heterogeneous wireless sensor networks

2019 ◽  
Vol 14 (3) ◽  
pp. 1305 ◽  
Author(s):  
Basim Abood ◽  
Yasser Kareem Al-Rikabi
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Optimal Routing ◽  
Energy Efficient Routing ◽  
End To End Delay ◽  
Heterogeneous Wireless Sensor Networks ◽  
Balancing Energy ◽  
Clustering Approach ◽  
Routing Method ◽  
Stable Election Protocol

<span style="font-family: Arial, sans-serif; font-size: 9pt;">In this paper, we propose a new clustering method called fuzzy stable election protocol (FSEP), which is capable to overcome the bottleneck problem and addressing the uneven energy consumption problem in heterogeneous WSNs. We also propose an energy-efficient routing method called particle swarm optimization routing method (PSORM) to find the optimal routing path for the heterogeneous WSNs. PSORM seeks to investigate the problems of balancing energy consumption and maximization of network lifetime. To demonstrate the effectiveness of FSEP-PSORM in terms of lessening end-to-end delay, balancing energy consumption, and maximization of heterogeneous network lifetime, we compare our method with three approaches namely, chessboard clustering approach, PEGASIS, and LEACH. Simulation results show that the network lifetime achieved by FSEP-PSORM could be increased by nearly 38%, 45%, and 60% more than that obtained by PEGASIS, LEACH and stable election protocol clustering (SEP), respectively.</span>

Energy-Balanced Distance-Based Routing Algorithm in Wireless Sensor Networks

2014 ◽  
Vol 539 ◽  
pp. 229-233
Author(s):  
Qiang Xian ◽  
Wan Ting Zhang
Keyword(s):  
Energy Consumption ◽  
Network Lifetime ◽  
Routing Algorithm ◽  
Maintenance Phase ◽  
Routing Algorithms ◽  
System Model ◽  
Wireless Sensor ◽  
Primary Parameter ◽  
Route Maintenance ◽  
Individual Distance

In routing process, individual distance is regarded as the primary parameter in order to adjust the energy consumption. In this paper, we build a time and distance-based system model, and effectively design route setup and route maintenance phase. An Energy-balanced Distance-based Routing Algorithm (EDRA) is put forward to maximize network lifetime. Simulation results demonstrate that the EDRA effectively prolongs the network lifetime and reduces the energy consumption than other routing algorithms.

Sign in / Sign up

Export Citation Format

Share Document