Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks
IEEE Transactions on Mobile Computing
Secure Data Aggregation in Wireless Sensor Networks: A Survey
PDCAT '06 Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies
Wireless sensor network survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
An Efficient Tree Structure for Delay Sensitive Data Gathering in Wireless Sensor Networks
AINAW '08 Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops
Energy conservation in wireless sensor networks: A survey
Ad Hoc Networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Tree structure based data gathering for maximum lifetime in wireless sensor networks
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Hi-index | 0.00 |
Wireless sensor networks (WSNs), often composed of a large number of sensor nodes with limited power, have been widely used for environmental monitoring and battlefield surveillance. A basic operation in such networks is data gathering. In the applications of data gathering without aggregation, the 1-hop nodes always incur much heavier traffic load compared with other nodes, which determine the lifetime of the whole network. Due to the energy constrained nature of sensor devices, energy-efficient methods should be employed for data gathering. In this paper, we propose a Load-Balanced and energy-efficient Tree (LBT) algorithm to maximize the lifetime of WSNs, which takes into account the load balance and energy efficiency of 1-hop nodes. To the best of our knowledge, we are the first to present the upper bound of network lifetime for data gathering without aggregation with tree-based topology. Simulation results demonstrate that our algorithm utilizes up to 98 % of the total energy of the 1-hop nodes and outperforms the state-of-the-art algorithms in terms of network lifetime. Furthermore, LBT can achieve a lifetime consistently close to the upper bound.