By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Subhasis Bhattacharjee ; Indian Statistical Institute, India ; Nabanita Das

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 shows that the proposed algorithm performs better as more and more nodes die out

Published in:

Computing: Theory and Applications, 2007. ICCTA '07. International Conference on

Date of Conference:

5-7 March 2007