图论在无线传感网络路由协议中的应用研究

Research of graph theory in wireless sensor network routing protocol

为降低无线传感网络节点能耗,延长网络生存时间,将图论最优选址问题用于分簇路由协议设计。依据节点剩余能量,结合图论的中心论算法进行簇头选举,以降低和平衡簇内能耗。依据下一跳簇头的能量消耗情况,使用Dijkstra算法设计最佳路由,确定最佳跳数,以降低数据传输的通信能耗,均衡全网能量。将此算法用于机场助航单灯监控系统,并与AL-CAME和ECOMP协议进行对比,仿真结果表明,此算法网络开销最小,节点剩余能量值远大于其他两种算法,网络能耗分布更为均衡,有效延长了网络的生命周期。

To reduce the energy consumption of wireless sensor network nodes and prolong the lifetime of the network, the optimal location of graph theory is applied to the clustering routing protocol. In order to reduce and balance the energy consumption in the cluster, the cluster head election is carried out according to the residual energy of the nodes and the center theory algorithm of graph theory. According to the energy of the next hop cluster head, Dijkstra algorithm is used to build the best route and determine the best hop number to save energy consumption of data transmission and balance the whole network energy consumption. The algorithm is applied to the airport single light monitoring system, and the simulation results show that compared with AL-CAME and ECOMP, the algorithm based on graph theory has the least network overhead, the residual energy value is far greater than the other two algorithms, the distribution of network energy consumption is more balanced, and the life cycle of the network is effectively extended.