Document Type
Conference Proceeding
Publication Date
8-2009
Publication Title
The 18th International Conference on Computer Communications and Networks (ICCCN)
Abstract
We explore the link scheduling optimization problem in the context of scalable in-network data aggregation, extending results for broadcast networks to routing in general networks. The primary vehicle for resource preservation is transmission suppression. For certain types of queries, nodes can avoid transmitting records if they can locally infer that their data is not needed to execute the query. We introduce a novel protocol paradigm for duplicate-insensitive exemplary monotonic (e.g. MIN and MAX) data aggregation queries. Performance of query execution in these networks is measured through collective expected number of transmissions in the network, and is linked to the minimum and maximum connectivity (δ, ∆) of nodes in general graphs. Nodes can reduce transmissions and save power by forcibly broadcasting partial results to the network during data collection. An algorithm running in time O(nm) is presented which achieves O((n ln n ln ∆)/δ) expected transmissions.
Recommended Citation
Macbeth, Jamie and Sarrafzadeh, Majid, "Link Scheduling for Scalable Data Aggregation" (2009). Computer Science: Faculty Publications, Smith College, Northampton, MA.
https://scholarworks.smith.edu/csc_facpubs/375
Comments
Archived as published.
Presented at The 18th International Conference on Computer Communications and Networks (ICCCN), San Francisco, California, August, 2009