2008/10/17 by Oliver Kennedy, Christoph Koch, Kennedy, Oliver +3
Computer Science · #Data Structures and Algorithms (cs.DS) #Databases (cs.DB) #Distributed #Energy Efficient Wireless Sensor Networks #FOS: Computer and information sciences #Mobile Ad Hoc Networks #Opportunistic and Delay-Tolerant Networks #Parallel #and Cluster Computing (cs.DC) #cs.DB #cs.DC #cs.DS
paper · pdf · doi:10.48550/arxiv.0810.3227
arxiv created 2008/10/17 · openalex publication_date 2008/10/17 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 unexpected peer departures and arrivals. Our analysis of these aggregate maintenance extensions demonstrates their effectiveness in unstructured environments despite high levels of node mobility.