By Topic

Randomized Sequential Algorithms for Data Aggregation in Sensor Networks

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
$31 $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

3 Author(s)
Savas, O. ; Dept. of Electr. & Comput. Eng., Boston Univ., MA ; Alanyali, M. ; Saligrama, V.

We consider distributed algorithms for data aggregation in sensor networks. The algorithms are admitted via message passing hence through pairwise computations. Under these algorithms a transmitting node becomes inactive until it is reactivated, yielding to substantial energy gains. We study the per-node message and time complexities of the algorithms in explicit graphs as a function of the network size. The obtained complexities are compared to those of so-called gossip algorithms. The results suggest trade-offs between the number of messages transmitted and the computation times.

Published in:

Information Sciences and Systems, 2006 40th Annual Conference on

Date of Conference:

22-24 March 2006