对等计算主要关注构造在应用层的虚拟覆盖网络.在上层的覆盖网络和底层的物理网络之间,通常都存在着拓扑失配.这种失配会导致P2P应用耗费相当大的通信开销.在移动自组网中,由于资源(比如带宽,电池能量等)和节点移动性的限制,拓扑失配问题变得更加严重.而已有工作对这一问题没有进行充分的研究.本文研究了移动自组网中的拓扑失配问题对非结构化P2P覆盖网中目标搜索的影响,并提出一个分布式的、能感知拓扑失配的覆盖网络构建算法D—TAOC.分析和实验表明在D—TAOC构建的拓扑失配感知的覆盖网中,P2P应用能够在较少牺牲目标搜索效率的前提下,明显地降低网络中的通信负载.
Peer-to-Peer computing mainly focuses on the virtual overlay network constructed in the application layer. There is topology mismatching between the overlay network and the physical network, which may cause great traffic overhead for P2P applications. The topology mismatching problem becomes more severe in mobile ad hoc networks, mainly due to the resource (e. g. bandwidth and battery power) and mobility constraints. However, this problem has not been sufficiently studied in the existing work. This paper studies the topology mismatching problem and its impact on object discovery in mobile ad hoc networks. A fully distributed algorithm named D-TAOC is proposed, which achieves construction of topology mismatching aware overlays in ad hoc networks. Qualitative analysis and experimental evaluations show that in the topology mismatching aware overlay constructed by D-TAOC, P2P applications can significantly reduce the traffic overhead, while slightly sacrificing the efficiency in object discovery.