Census：在MANN中实现快速、可扩展和强大的数据聚合
Census: Fast, scalable and robust data aggregation in MANETs
摘要：
本文介绍了人口普查，协议的数据聚合和统计计数在MANNETWORK。普查通过使用有偏随机游走在网络中循环一组令牌来操作，使得每个节点被至少一个令牌访问。该协议是无结构的，以避免在节点移动性的存在下用于维持结构的高消息传递开销。它偏向令牌的随机行走，以实现快速覆盖时间;该偏差涉及短但多跳的梯度，将令牌引导到迄今为止未访问的节点。因此，普查实现了O（N/k）的覆盖时间和O（Nlog（N）/k）的消息开销，其中N是网络中节点的数量，k是令牌的数量。值得注意的是，它具有可扩展性和鲁棒性，我们通过在不同网络密度和移动模型下的100到4000个节点的网络中进行模拟来证明这一点。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
