Distributed Data Gathering Scheduling in Multihop Wireless Sensor Networks for Improved Lifetime

Authors:
Subhasis Bhattacharjee;Nabanita Das
Affiliations:
Indian Statistical Institute, India;Indian Statistical Institute, India
Venue:
ICCTA '07 Proceedings of the International Conference on Computing: Theory and Applications
Year:
2007

Citing 0
Cited 3

Data aggregation in wireless sensor networks using ant colony algorithm

Journal of Network and Computer Applications
Data management within WSN through multi-hop transmissions

Proceedings of the 8th International Conference on Advances in Mobile Computing and Multimedia
Management Scheme for Data Collection within Wireless Sensor Networks

International Journal of Adaptive, Resilient and Autonomic Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

For a multihop sensor network with n sensors, this paper presents an O(n) distributed greedy algorithm for extracting a rooted spanning tree to improve the lifetime of the overall network. It spontaneously determines a data gathering schedule from the sensors towards the base station (the root). No global knowledge about the topology is required for the computation and also each sensor does not need to access the base station directly. Simulation studies show that in terms of system lifetime, the proposed algorithm significantly outperforms the scheduling based on the Minimum Spanning Tree (MST), or the Shortest Path (SP) routing techniques. Performance comparison with PEGASIS [7] shows that the proposed algorithm performs better as more and more nodes die out.