This paper describes EZ-AG, a structure-free protocol for duplicate insensitive data aggregation in MANETs. The key idea in EZ-AG is to introduce a token that performs a self-repelling random walk in the network and aggregates information from nodes when they are visited for the first time. A self-repelling random walk of a token on a graph is one in which at each step, the token moves to a neighbor that has been visited least often. While self-repelling random walks visit all nodes in the network much faster than plain random walks, they tend to slow down when most of the nodes are already visited. In this paper, we show that a single step push phase at each node can significantly speed up the aggregation and eliminate this slow down. By doing so, EZ-AG achieves aggregation in only O(N) time and messages. In terms of overhead, EZ-AG outperforms existing structure-free data aggregation by a factor of at least log(N) and achieves the lower bound for aggregation message overhead. We demonstrate the scalability and robustness of EZ-AG using ns-3 simulations in networks ranging from 100 to 4000 nodes under different mobility models and node speeds. We also describe a hierarchical extension for EZ-AG that can produce multi-resolution aggregates at each node using only O(NlogN) messages, which is a poly-logarithmic factor improvement over existing techniques.

中文翻译：

---

EZ-AG：MANET中使用推助自排斥随机游走的无结构数据聚合

本文介绍了EZ-AG，这是一种无结构协议，用于在MANET中复制不敏感的数据。EZ-AG中的关键思想是引入一个令牌，该令牌在网络中执行自排斥随机游走，并在首次访问节点时聚合来自节点的信息。图上令牌的自我排斥性随机游走是其中令牌在每个步骤中移动到访问最少的邻居的过程。自排斥随机游走比纯随机游走访问网络中所有节点的速度快得多，但当大多数节点已经被访问时，它们往往会变慢。在本文中，我们证明了在每个节点上执行单步推送阶段可以显着加快聚合速度，并消除这种降低速度的情况。这样，EZ-AG仅在O（N）时间和消息中实现了聚合。就间接费用而言 EZ-AG的性能优于现有的无结构数据聚合至少为log（N），并达到了聚合消息开销的下限。我们使用ns-3仿真在不同移动性模型和节点速度下的100到4000个节点范围内的网络中使用ns-3仿真来演示EZ-AG的可伸缩性和鲁棒性。我们还描述了EZ-AG的分层扩展，它可以仅使用O（NlogN）消息在每个节点上生成多分辨率聚合，这是对现有技术的多对数因子改进。