摘要： 针对Ad hoc无线网络带宽受限和拓扑变化的特点，提出一种基于Prüfer码和网络流量的半分循环迭代拓扑推测算法。通过获取树型网络TCP业务报文中的TTL字段域值建立网络节点间的路径距离矩阵POD，利用Prüfer树编译码思想，推测出Ad hoc网络节点间内部逻辑拓扑结构。仿真结果表明，该算法的推断正确率可达到100%，推测结果具有高可靠性。
关键词:
Ad hoc网络,
TCP报文,
Prüfer码,
路径距离矩阵,
逻辑拓扑推测,
合并拓扑
Abstract: Aiming at the characteristics of bandwidth constrained and topology variation in Ad hoc wireless network, a new Dimidiate Cycle Iteration(DCIA) topology inference algorithm based on Prüfer code and network traffic is proposed. Path distance matrix called POD is constructed by acquiring the value of TTL in TCP packets in tree network, and the inner topology structure topology is inferred with the proposed algorithm. Simulation experiments show that the proposed algorithm’s correctness ratio on inference topology is up to 100 percent, and possess high dependability.
Key words:
Ad hoc network,
TCP packet,
Prüfer code,
path distance matrix,
logical topology inference,
merge topology
中图分类号:
崔电东, 李鸥, 朱贤斌, 高卿. 基于Prüfer码的无线网络拓扑推测算法[J]. 计算机工程, 2012, 38(23): 109-111,122.
CUI Dian-Dong, LI Ou, SHU Xian-Bin, GAO Qing. Topology Inference Algorithm in Wireless Network Based on Prüfer Code[J]. Computer Engineering, 2012, 38(23): 109-111,122.