两种主/从Ad Hoc网络规模估计算法
Two Algorithms for Network Size Estimation for Master/Slave Ad Hoc Networks
摘要：
本文提出了一种适应的两种网络规模估计方法：随机巡回赛和流言为基础的聚合，以适应主/从移动ad hoc网络。我们表明，它是可行的，以准确地估计ad hoc网络的规模时，由于移动性的拓扑结构的变化。算法进行了修改，占主/从ad hoc网络的具体约束条件，结果表明，建议的修改在这些网络上比原来的协议更好地执行。这两种算法的优点和缺点，这些都在本文中概述。
英文摘要：
This paper proposes an adaptation of two network size estimation methods: random tour and gossip-based aggregation to suit master/slave mobile ad hoc networks. We show that it is feasible to accurately estimate the size of ad hoc networks when topology changes due to mobility using both methods. The algorithms were modified to account for the specific constraints of master/slave ad hoc networks and the results show that the proposed modifications perform better on these networks than the original protocols. Each of the two algorithms presents strengths and weaknesses and these are outlined in this paper.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
