A distributed, multi-hop, adaptive, tree-based energy-balanced routing approach

In order to avoid the network partitioning and nodes died too early in ZigBee audio guide system, we designed an energy-balanced routing algorithm in this paper, which can manage the rest energy of all network nodes effectively. The simulation results indicate that this algorithm can balance the entire network energy, extend the survival time of the whole network and increase the stability of the system relative to the original routing protocol.

Download Full-text

Maximization of Lifetime of Wireless Sensor Network with Sensitive Power Dynamic Protocol

International Journal of Engineering & Technology ◽

10.14419/ijet.v7i3.12.16111 ◽

2018 ◽

Vol 7 (3.12) ◽

pp. 380

Author(s):

Manish Bhardwaj ◽

Anil Ahlawat ◽

Nidhi Bansal

Keyword(s):

Routing Protocol ◽

Steering System ◽

Sensor Nodes ◽

Wireless Sensor ◽

Destination Node ◽

Power Efficient ◽

Data Packets ◽

And Performance ◽

Energy Balanced Routing ◽

Power Balancing

A vitality effective protocol configuration is a key testing issue in a network of Wireless Sensor. A portion of the few existing vitality effective protocols plots dependably forward the bundles through the base vitality based ideal course to the sink to limit vitality utilization. It causes a disturbed dispersion of remaining vitality between sensor nodes, which prompts partitioning of the network. The prime objective of this method is to pass the data packets to destination node through the vitality denser range within Sensor Networks Lifetime. The current procedure Energy Balanced Routing Protocol (EBRP) neglects to accomplish Throughput, Delay part, keeping in mind the end goal to enhance the Network Lifetime and Performance so the proficient steering convention is required with the abilities of both the Power Efficient and Power Balancing. To resolve this problem, this manuscript proposed Impediment Sensitive Power Unbiased Dynamic Routing Protocol (ISPUDRP). The proposed steering system accomplishes as far as End-to-End Delay, Throughput and Lifetime of network. This manuscript shows that proposed calculation accomplishes better execution performance than the current strategies.

Download Full-text

Autonomous Load Regulation Based Energy Balanced Routing in Rechargeable Wireless Sensor Networks

Applied Sciences ◽

10.3390/app9163251 ◽

2019 ◽

Vol 9 (16) ◽

pp. 3251 ◽

Cited By ~ 1

Author(s):

Runze Wu ◽

Haobo Guo ◽

Liangrui Tang ◽

Bing Fan

Keyword(s):

Wireless Sensor Networks ◽

Sensor Networks ◽

Network Lifetime ◽

Wireless Sensor ◽

Regulation Mechanism ◽

Wireless Charging ◽

Routing Strategy ◽

Load Regulation ◽

Energy Balanced Routing ◽

Balancing Efficiency

Recent progress in wireless charging technologies has greatly promoted the development of rechargeable wireless sensor networks (RWSN). The network lifetime of RWSN can be commonly extended through routing strategy and wireless charging technology. However, the node accepts the relay request of its neighbor unconditionally, and it cannot remove its overload on its own in a timely manner in traditional routing strategies. The energy balancing efficiency of the network may be limited by this passive mechanism, which poses a great challenge to obtaining optimal joint efficiency of routing and charging strategies. In this paper, we propose an autonomous load regulation mechanism-based energy balanced routing algorithm (ALRMR) for RWSN. In addition to an efficient framework of joint wireless energy transfer and multi-hop routing where the routing strategy is adapted to the charging scheme, an innovative load regulation mechanism is proposed. Under this mechanism, each node can actively adjust its own load by controlling its relay radius. The simulation demonstrates the advantages of our algorithm for energy balance efficiency and improving the network lifetime through the charging scheme and the innovative mechanism.

Download Full-text

Energy-balanced routing scheme in varying ZigBee networks

2012 IEEE Globecom Workshops ◽

10.1109/glocomw.2012.6477788 ◽

2012 ◽

Cited By ~ 1

Author(s):

Jiasong Mu ◽

Baoju Zhang ◽

Wei Wang

Keyword(s):

Routing Scheme ◽

Zigbee Networks ◽

Energy Balanced Routing

Download Full-text

A kind of novel VPF-based energy-balanced routing strategy for wireless mesh network

International Journal of Communication Systems ◽

10.1002/dac.2889 ◽

2014 ◽

Vol 30 (6) ◽

pp. e2889 ◽

Cited By ~ 3

Author(s):

De-gan Zhang ◽

Xiang Wang ◽

Xiao-dong Song ◽

Jun Li ◽

You-jia Chen

Keyword(s):

Wireless Mesh Network ◽

Mesh Network ◽

Wireless Mesh ◽

Routing Strategy ◽

Energy Balanced Routing

Download Full-text

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

EURASIP Journal on Wireless Communications and Networking ◽

10.1186/s13638-019-1533-y ◽

2019 ◽

Vol 2019 (1) ◽

Cited By ~ 5

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.

Download Full-text

An Energy-Balanced Routing Algorithm in Wireless Seismic Sensor Network

Journal of Computational and Theoretical Nanoscience ◽

10.1166/jctn.2016.5633 ◽

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.

Download Full-text