Geographic Gossip: Efficient Aggregation for Sensor Networks

Details Geographic Gossip: Efficient Aggregation for Sensor Networks Geographic Gossip: Efficient Aggregation for Sensor Networks

2006-02-20

arxiv.org/abs/cs/0602071v1

Computer Science

Information Theory

8 pages total; to appear in Information Processing in Sensor Networks (IPSN) 2006

Scientific paper

Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain environments. However, gossip algorithms can waste significant energy by essentially passing around redundant information multiple times. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is caused by slow mixing times of random walks on those graphs. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing a simple resampling method, we can demonstrate substantial gains over previously proposed gossip protocols. In particular, for random geometric graphs, our algorithm computes the true average to accuracy $1/n^a$ using $O(n^{1.5}\sqrt{\log n})$ radio transmissions, which reduces the energy consumption by a $\sqrt{\frac{n}{\log n}}$ factor over standard gossip algorithms.

Affiliated with

Also associated with

No associations

Rating

Geographic Gossip: Efficient Aggregation for Sensor Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Geographic Gossip: Efficient Aggregation for Sensor Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Geographic Gossip: Efficient Aggregation for Sensor Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520421