 Switching Algorithm with Prediction Strategy for Maximizing Lifetime in Wireless Sensor NetworkChuan-Jun Yi, Geng Yang, Hua Dai, Liang Liu and Ning Li International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 11, 592093 Abstract: In wireless sensor networks (WSNs), the sensed data of each node are usually gathered through a data collection tree rooted at the sink node. The data collection tree generated randomly usually does not have the longest network lifetime. How to prolong the network lifetime is one of the main challenges in WSNs. In this paper, we propose a switching algorithm with prediction strategy (SAPS) to enhance the lifetime of WSNs through reducing the load of the node with the highest load by switching its descendants. In SAPS, the shortest path to the sink is chosen for each switched node to ensure that the routing tree is shortest, thus reducing the delay and energy expenditure of data collection. Furthermore, a prediction strategy which ensures that the highest load in the network decreases in each switching is developed to guarantee high efficiency and fast convergence of the algorithm. A distributed version of our algorithm, called DSAPS, is also designed. Simulation results demonstrate that our algorithms outperform existing methods in terms of network lifetime, maximum level of the routing tree, energy expenditure of switching, energy expenditure of data collection in each round, and rate of convergence. Date: 2015 Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:11:y:2015:i:11:p:592093 DOI: 10.1155/2015/592093 Access Statistics for this article More articles in International Journal of Distributed Sensor Networks |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.