- freely available
An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks
AbstractSensor nodes usually have limited energy supply and they are impractical to recharge. How to balance traffic load in sensors in order to increase network lifetime is a very challenging research issue. Many clustering algorithms have been proposed recently for wireless sensor networks (WSNs). However, sensor networks with one fixed sink node often suffer from a hot spots problem since nodes near sinks have more traffic burden to forward during a multi-hop transmission process. The use of mobile sinks has been shown to be an effective technique to enhance network performance features such as latency, energy efficiency, network lifetime, etc. In this paper, a modified Stable Election Protocol (SEP), which employs a mobile sink, has been proposed for WSNs with non-uniform node distribution. The decision of selecting cluster heads by the sink is based on the minimization of the associated additional energy and residual energy at each node. Besides, the cluster head selects the shortest path to reach the sink between the direct approach and the indirect approach with the use of the nearest cluster head. Simulation results demonstrate that our algorithm has better performance than traditional routing algorithms, such as LEACH and SEP.
Share & Cite This Article
Wang, J.; Zhang, Z.; Xia, F.; Yuan, W.; Lee, S. An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks. Sensors 2013, 13, 14301-14320.View more citation formats
Wang J, Zhang Z, Xia F, Yuan W, Lee S. An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks. Sensors. 2013; 13(11):14301-14320.Chicago/Turabian Style
Wang, Jin; Zhang, Zhongqi; Xia, Feng; Yuan, Weiwei; Lee, Sungyoung. 2013. "An Energy Efficient Stable Election-Based Routing Algorithm for Wireless Sensor Networks." Sensors 13, no. 11: 14301-14320.
Notes: Multiple requests from the same IP address are counted as one view.