针对Ad hoc无线网络带宽受限和拓扑变化的特点,提出一种基于Prüfer码和网络流量的半分循环迭代拓扑推测算法。通过获取树型网络TCP业务报文中的TTL字段域值建立网络节点间的路径距离矩阵POD,利用Prüfer树编译码思想,推测出Ad hoc网络节点间内部逻辑拓扑结构。仿真结果表明,该算法的推断正确率可达到100%,推测结果具有高可靠性。 Aimed at the limited bandwidth and topology change of Ad hoc wireless networks, a half-cycle iterative topology estimation algorithm based on Prüfer code and network traffic is proposed. The path distance matrix (POD) between network nodes is established by obtaining the TTL field value in the TCP service packet of the tree network. By using the idea of ​​codec of Prüfer tree, the internal logical topology between nodes in Ad hoc network is deduced. Simulation results show that the proposed algorithm can reach 100% accuracy, and the result is highly reliable.