基于无线Ad hot网络的低代价节能最短路径树算法

拓扑控制与拓扑维护是优化无线Ad hot网络拓扑结构的重要方面,本研究以无线Ad hot网络中各节点在失效情况下,为维护网络的连通性,提出一种以Dijkstra SPT算法为基础,以减少Ad hot网络拓扑维护开销,低代价节能运行的最短路径树算法—ELSPT。其仿真实验表明,该算法有利于对Ad hoc无线网络带宽的空间重利用,提高网络容量,减少分组碰撞的概率,对优化网络的拓扑控制和拓扑维护有着显著的有效性。

Low-cost Energy Shortest Path Tree Algorithm Based on Wireless Ad hot Network

Topology control and topology maintenance is an important aspect of optimizing the topology of the wireless Ad hot network.In case of failure wireless of each node in Ad hot network,to maintain the network connectivity,an algorithm was proposed based on the Dijkstra SPT to Ad hot network topology to reduce maintenance overhead,the shortest path tree algorithm-ELSPT with low-cost energy.The simulation results showed that the algorithm was beneficial for Ad hoc wireless network bandwidth re-use of space,increasing network capacity,reducing the probability of packet collisions on the optimization of the network topology,and had a significant effectiveness on topology control and maintenance.