无线Ad Hoc网络Steiner树实现协议研究

针对无线Ad hoc网络多跳,拓扑结构随时可能动态变化,协作节点间数据传输需实时性强等问题,利用Netlog语言宣告声明最小Steiner树协议的构造算法方法适应解决。协议可快速构造一棵近似最小的Steiner树,每个节点独立运行声明Steiner树协议,构造Steiner节点间的虚拟全联通网络,在此网络上构造最小代价生成树;然后将此树的节点与边对应原网络的节点和边,继续构造最小代价生成树,最后将此树上的非Steiner节点的叶子节点删除,近似得到最小代价Steiner树,该方法在实验平台上得以验证,为无线移动网络中资源的选择利用提供了一种新的可尝试性的新方法。

The Protocol Research on Steiner Tree in Wireless Ad Hoc Network

Due to the feature of multi-hop of wireless Ad hoc network,the topology may dynamic change at any time.To declare minimal Steiner tree protocol in use of Netlog language can quickly construct an approximate minimal Steiner tree.It is one of the most suitable solution in the wireless Ad hoc network as its resources are limited,life cycle is short.When each node independently statement Steiner tree protocol,Steiner nodes construct a virtual fully connected network and the Minimal Spanning Tree can be construct on this network.Then the nodes and edges in this tree correspond to the original network.Continually to construct Minimal Spanning Tree and remove the non-Steiner tree leaf node to get the approximate minimal Steiner tree,the protocol is validated on the experimental platform.It provides a new,tentative method for the utilization of the wireless Ad Hoc network resources.