分析表明：同一频道上邻居节点的数目接近理想邻居节点数目；
The results show that the number of neighbours in a same channel is close to the ideal neighbour number.
该算法基于概率，每个节点可以得到一份可能不完整的邻居节点清单。
The algorithm is probabilistic: each node obtains a list of its neighbors which is possibly incomplete.
追踪服务器，通过按域划分邻居节点列表，优化了对邻居节点的返回策略。
For optimizing the returning policy of the neighboring nodes, the tracker server divides the neighboring nodes in accordance with the domain.
应用推荐