移动自组网中自排斥随机游动的覆盖特性
Coverage characteristics of self-repelling random walks in mobile ad-hoc networks
摘要:
图上令牌的自排斥随机游走是指在每一步中,令牌移动到最不经常访问的邻居(关系随机断开)。本文分析了二维的格上自排斥随机游动的性质,并证明了这些游动在访问图中的节点时具有显著的一致性。在本文中,我们将这种分析扩展到移动网络上的自排斥随机游动,其中底层图形本身是随时间演变的。使用ns-3中的网络模拟,我们描述了每个节点从开始到所有节点至少被访问一次的访问次数。我们评估不同的移动模型和网络范围从100到1000个节点。我们的研究结果表明,直到约85%的覆盖率,重复访问是非常罕见的,突出了网络中的大多数节点可以被访问的效率。即使在100%覆盖率下,探索开销(步骤数与唯一访问节点数的比率)仍然很低,低于2。我们的分析表明,自排斥随机游动是有效的,无结构的工具,在移动自组织网络中的数据聚合。
英文摘要:
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 (with ties broken randomly). The properties of self-repelling random walks have been analyzed for two dimensional lattices and these walks have been shown to exhibit a remarkable uniformity with which they visit nodes in a graph. In this paper, we extend this analysis to self-repelling random walks on mobile networks in which the underlying graph itself is temporally evolving. Using network simulations in ns-3, we characterize the number of times each node is visited from the start until all nodes have been visited at least once. We evaluate under different mobility models and on networks ranging from 100 to 1000 nodes. Our results show that until about 85% coverage, duplicate visits are very rare highlighting the efficiency with which a majority of nodes in the network can be visited. Even at 100% coverage, the exploration overhead (the ratio of number of steps to number of unique visited nodes) remains low and under 2. Our analysis shows that self-repelling random walks are effective, structure-free tools for data aggregation in mobile ad-hoc networks.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。