A Token Based Algorithm to Distributed Computation in Sensor Networks
Venkatesh Saligrama, Murat Alanyali

TL;DR
This paper introduces token-based distributed algorithms for data aggregation in sensor networks, balancing message and time complexity through permit control strategies, and demonstrates their efficiency in various graph topologies.
Contribution
It proposes novel token-based algorithms with permit revocation and restoration, achieving improved message and time complexity tradeoffs in sensor network data aggregation.
Findings
Per-node message complexity scales as O(polylog(n))
Time complexity scales as O(n)
Hybrid algorithms significantly reduce message and time costs
Abstract
We consider distributed algorithms for data aggregation and function computation in sensor networks. The algorithms perform pairwise computations along edges of an underlying communication graph. A token is associated with each sensor node, which acts as a transmission permit. Nodes with active tokens have transmission permits; they generate messages at a constant rate and send each message to a randomly selected neighbor. By using different strategies to control the transmission permits we can obtain tradeoffs between message and time complexity. Gossip corresponds to the case when all nodes have permits all the time. We study algorithms where permits are revoked after transmission and restored upon reception. Examples of such algorithms include Simple-Random Walk(SRW), Coalescent-Random-Walk(CRW) and Controlled Flooding(CFLD) and their hybrid variants. SRW has a single node permit,…
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
TopicsOpportunistic and Delay-Tolerant Networks · Energy Efficient Wireless Sensor Networks · Mobile Ad Hoc Networks
