Reliability-Based Routing Algorithms for Energy-Aware Communication in Wireless Sensor Networks

Author(s):  
Janos Levendovszky ◽  
Andras Olah ◽  
Gergely Treplan ◽  
Long Tran-Thanh
2011 ◽  
Vol 8 (4) ◽  
pp. 991-1007 ◽  
Author(s):  
Jin Wang ◽  
Tinghuai Ma ◽  
Jinsung Cho ◽  
Sungoung Lee

Many energy aware routing algorithms and protocols have been proposed for wireless sensor networks recently to achieve aims like minimum energy consumption, maximized network lifetime, reduced communication latency and overhead etc. The problem of hotspot can not be well addressed under many routing algorithms since some nodes which are on the shortest path or close to the base station tend to deplete their energy quickly and consequently cause network partition. In this paper, we propose a Ring-based Energy Aware Routing (REAR) algorithm for wireless sensor networks which can achieve both energy balancing and energy efficiency for all sensor nodes. Our algorithm considers not only the hop number and distance but also the residual energy of the next hop node during routing process. Simulation results validate that our algorithm outperforms some other routing algorithms in the aspects of energy consumption and network lifetime etc.


2021 ◽  
Author(s):  
Khanh-Van Nguyen ◽  
Chi-Hieu Nguyen ◽  
Phi Le Nguyen ◽  
Tien Van Do ◽  
Imrich Chlamtac

AbstractA quest for geographic routing schemes of wireless sensor networks when sensor nodes are deployed in areas with obstacles has resulted in numerous ingenious proposals and techniques. However, there is a lack of solutions for complicated cases wherein the source or the sink nodes are located close to a specific hole, especially in cavern-like regions of large complex-shaped holes. In this paper, we propose a geographic routing scheme to deal with the existence of complicated-shape holes in an effective manner. Our proposed routing scheme achieves routes around holes with the (1+$$\epsilon$$ ϵ )-stretch. Experimental results show that our routing scheme yields the highest load balancing and the most extended network lifetime compared to other well-known routing algorithms as well.


Sign in / Sign up

Export Citation Format

Share Document