Census: Fast, scalable and robust data aggregation in MANETs
Vinod Kulathumani, Anish Arora, Kenneth Parker, Mukundan Sridharan,, Masahiro Nakagawa

TL;DR
Census is a protocol for efficient, scalable, and robust data aggregation in MANETs that uses biased random walks to ensure quick network coverage with minimal messaging overhead.
Contribution
It introduces a structure-free, bias-guided token circulation method achieving fast cover times and low message overhead in mobile ad hoc networks.
Findings
Achieves O(N/k) cover time and O(N log(N)/k) message overhead.
Demonstrates scalability and robustness through simulations with up to 4000 nodes.
Performs well under various network densities and mobility models.
Abstract
This paper describes Census, a protocol for data aggregation and statistical counting in MANETs. Census operates by circulating a set of tokens in the network using biased random walks such that each node is visited by at least one token. The protocol is structure-free so as to avoid high messaging overhead for maintaining structure in the presence of node mobility. It biases the random walks of tokens so as to achieve fast cover time; the bias involves short albeit multi-hop gradients that guide the tokens towards hitherto unvisited nodes. Census thus achieves a cover time of O(N/k) and message overhead of O(Nlog(N)/k) where N is the number of nodes and k the number of tokens in the network. Notably, it enjoys scalability and robustness, which we demonstrate via simulations in networks ranging from 100 to 4000 nodes under different network densities and mobility models.
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
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Energy Efficient Wireless Sensor Networks
