物理学报2016，Vol.65Issue(24)：240201-1-240201-9,9.DOI:10.7498/aps.65.240201
基于最小刚性图代数特性的无线网络拓扑优化算法∗
Top ology optimization algorithm for wireless networks based on the algebraic prop erties of minimum rigid graph
摘要
Abstract
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.关键词
无线传感器网络/拓扑优化/最小刚性图/代数特性Key words
wireless sensor network/topology optimization/minimally rigid graph/algebra property引用本文复制引用
罗小元,李昊,马巨海..基于最小刚性图代数特性的无线网络拓扑优化算法∗[J].物理学报,2016,65(24):240201-1-240201-9,9.基金项目
国家自然科学基金(批准号:61375105)资助的课题.@@@@Project supported by the National Natural Science Foundation of China (Grant No.61375105) （批准号:61375105）
