【摘要】 在无线信道环境下,如何解决逻辑拓扑与物理拓扑之间的失配是设计P2P网络的主要挑战之一。本文提出一种适用于无线系统的P2P组网协议。在该协议中,首先,新入网节点从其邻居节点处获得一个数值上相近的节点标号,从而实现网络的瞬时拓扑感知。当节点的位置改变时,它们向中心节点更新自己的位置信息。然后,在中心节点处将节点标号的最优分配转换为旅行商问题,并用模拟退火算法对旅行商问题进行最优化求解,得到优化标号序列。最后,由中心节点向网络广播更新信息,引导节点进行标号和数据交换,从而使无线P2P网络在任何时刻都具有拓扑感知性。仿真结果表明,在基于该协议的无线P2P网络中,文件的定位路径明显缩短,定位延时明显减小。更多还原

【Abstract】 How to deal with the mismatch between physical topology and logical topology is one of the greatest challenges for P2P network, especially in wireless scenario. In this paper, a P2P protocol suitable for wireless system is proposed. At first, the new entering node gets an identify (ID) from one of its nearest neighbors, the ID is similar to its neighbors’, and instantaneous topology awareness is realized. Secondly, when nodes change their position great enough, they update their position information to a central node, where the problem of optimal ID allocation is induced to Traveling Salesman Problem (TSP). Finally, through solving typical TSP with simulated annealing, optimal ID sequence is obtained, which is broadcast globally, through which the nodes exchange their IDs each other, and dynamic to-pology awareness is realized all the time. Simulation shows that the proposed P2P protocol has shorten the accessing path during file location, meanwhile, latency are minimized signifi cantly.更多还原