Brief Announcement: An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks

Authors:
Antonio Fernández Anta;Miguel A. Mosteiro;Christopher Thraves
Affiliations:
LADyR, GSyC, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain 28933;LADyR, GSyC, Universidad Rey Juan Carlos, Móstoles, Madrid, Spain 28933 and Department of Computer Science, Rutgers University, Piscataway, USA NJ 08854;Universite Bordeaux I, LaBRI, domaine Universitaire, Talence, France 33405
Venue:
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Year:
2008

Citing 5
Cited 0

Conductance and the rapid mixing property for Markov chains: the approximation of permanent resolved

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Gossip-Based Computation of Aggregate Information

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis

IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Randomized gossip algorithms

IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Bootstrapping a hop-optimal network in the weak sensor model

ACM Transactions on Algorithms (TALG)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nodes in a Sensor Network can collaborate to process the sensed data but, due to unreliability, a monitoring strategy can not rely on individual sensors values. Instead, the network should use aggregated information from groups of sensor nodes [2,3,7]. The topic of this work is the efficient computation of aggregate functions in the highly constrained Sensor Network setting, where node restrictions are modeled as in [4], the random node-deployment is modeled as a geometric graph, and the resulting topology, node identifiers assignment and the assignment of input-values to be aggregated is adversarial.