Dynamic Approaches to In-Network Aggregation
Oliver Kennedy, Christoph Koch, Al Demers

TL;DR
This paper introduces extensions to distributed aggregation protocols that enable mobile wireless devices to accurately estimate global properties like count, sum, and average despite high mobility and dynamic network conditions.
Contribution
It presents novel modifications to existing unstructured aggregation protocols to maintain accurate estimates in highly dynamic, mobile wireless environments.
Findings
Protocols effectively estimate aggregates despite node mobility.
Extensions handle unexpected peer departures and arrivals.
Analysis confirms robustness in dynamic environments.
Abstract
Collaboration between small-scale wireless devices hinges on their ability to infer properties shared across multiple nearby nodes. Wireless-enabled mobile devices in particular create a highly dynamic environment not conducive to distributed reasoning about such global properties. This paper addresses a specific instance of this problem: distributed aggregation. We present extensions to existing unstructured aggregation protocols that enable estimation of count, sum, and average aggregates in highly dynamic environments. With the modified protocols, devices with only limited connectivity can maintain estimates of the aggregate, despite \textit{unexpected} peer departures and arrivals. Our analysis of these aggregate maintenance extensions demonstrates their effectiveness in unstructured environments despite high levels of node mobility.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsEnergy Efficient Wireless Sensor Networks · Mobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks
