Title: Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks
Authors: Deying Li, Qinghua Zhu, Wenping Chen
Addresses: Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, Beijing 100872, China. ' School of Information, Renmin University of China, Beijing 100872, China. ' Key Laboratory of Data Engineering and Knowledge Engineering, MOE, School of Information, Renmin University of China, Beijing 100872, China
Abstract: Data aggregation problem with maximising network lifetime is one of important issues in wireless sensor networks. In this paper, we study the maximum lifetime many-to-one data gathering with aggregation (MLMTODA) problem: given locations of sensors and a base station together with available energy of each sensor, and a set of sources, find a schedule in which data should be gathered from all the sources and transmitted to the base station, such that the lifetime of the network is maximised. We propose efficient algorithms to solve the MLMTODA problem. Our simulations demonstrate that the proposed algorithm has a good performance for the MLMTODA problem.
Keywords: data aggregation; many-to-one; maximum lifetime; wireless sensor networks; WSNs; wireless networks; network lifetime; scheduling; simulation.
International Journal of Sensor Networks, 2011 Vol.9 No.2, pp.61 - 68
Available online: 01 Mar 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article