利用空间换取时间的基本思想,提出一种基于邻居路由表的Chord改进算法NRToChord,该算法中每一个节点都维护一个具有更多节点信息的感知表,在路由过程中能够获取到与目标更加接近的下一跳节点,以提高路由效率,满足对路由时延有着更为苛刻要求的应用需要(如紧急通信,实时语音业务等).通过仿真实验证明:该算法在少量增加节点路由表容量的前提下,资源查找过程中的逻辑路由路径长度和物理路由时延都能缩短30%以上. By using the basic idea of ​​time in exchange for space, this paper proposes a Chord-based NRToChord algorithm based on neighborhood routing table. Each node in the algorithm maintains a perception table with more node information, which can get closer to the target in the routing process To improve the routing efficiency and satisfy the application requirements (such as emergency communication and real-time voice service) which have more stringent requirements on the routing delay.The simulation results show that the proposed algorithm can increase the capacity of the routing table in a small amount Under the premise, the length of the logical routing path and the physical routing delay in the resource discovery process can be shortened by more than 30%.