移动Ad Hoc网络覆盖节点聚集问题研究

An Overlay Network Node Clustering Model Research of Mobile Ad Hoc Networks

移动Ad Hoc网络和p2p覆盖网络技术的结合是一个引人瞩目的方向,覆盖网络拓扑构造是其中的关键问题。本文提出基于拓扑匹配的移动Ad Hoc网络覆盖节点聚集模型,给出一种分布式的贪婪启发式算法,避免了热点和瓶颈问题,保证了拓扑匹配的覆盖结构的相对稳定性。仿真结果表明,该算法在不增加开销的情况下,确保生成权和极大的覆盖代理的同时也建立了拓扑匹配的聚集,因此能有效地用于基于覆盖网络的Ad Hoc路由设计中。

A promising research direction in networking is to exploit the synergy between p2p overlay and Mobile Ad Hoc Networks （MANETs） to design better protocols for MANETs. Overlay network topology optimization is one of the key issues. Topology-aware overlay node clustering model for MANETs was proposed. A greedy heuristic algorithm for the problem was presented. To avoid single-point bottleneck failures, the algorithm guaranteed the relative stability of overlay network topology. Simulation results show that in the condition of not adding to the expenses, the algorithm could ensure the maximality of weight of OA, and a topology-aware clustering .So the scheme can be potentially used in designing efficient routing algorithms