基于最小刚性图代数特性的无线网络拓扑优化算法

Topology optimization algorithm for wireless networks based on the algebraic properties of minimum rigid graph

对于能量受限的无线传感器网络,拓扑优化能够降低能耗,优化通信链路结构.本文基于最小刚性图原理提出了一种新的拓扑优化算法,算法综合考虑了生成拓扑链路图中通信链路的权值与生成刚性图的代数特性问题,既保证了通信链路较短,有利于延长网络的生命周期,同时使生成的通信链路图结构更加稳定,网络具有较好的鲁棒性.仿真实验表明,与相关算法比较,提出的算法中通信链路较短,具有较好的网络连通性与结构稳定性,同时生成刚性图矩阵的迹较大,具有较好的刚度代数性能.

For wireless sensor networks,with energy constrained,topology optimization can reduce energy consumption and improve the structure of communication link.Based on the minimum rigid graph,a new topology optimization algorithm is presented in this paper,by considering the weights of communication links in graph and the generated algebraic properties of rigid graph.The proposed algorithm not only ensures the communication link is shorter which can prolong the network life cycle,but also keeps the graph structure more stable,which means that the network has good robustness.It is shown that communication link obtained by the proposed algorithm is shorter than that obtained by the related existing algorithms.As a result,the proposed algorithm has good network connectivity and structure stability.At the same time the trace of the generated rigid matrix is very big so that the proposed algorithm has excellent algebraic rigidity properties of a network.