摘要
为了延长无线传感网(WSN)的生存时间,依据图谱理论提出了一种节点自适应的本地通信链路优化算法,动态地优化网络拓扑结构。通过引入拉式谱矩,每个节点仅需了解有限的本地局部信息即能在每次迭代过程中在与邻居节点的通信链路上做出追加或删除的最优决策,进而保证网络动态地朝着预定的目标不断优化。实验结果表明,仅通过有限次迭代后即可使网络结构逼近预定目标,验证了算法的有效性。
In order to prolong the life of the wireless sensor network(WSN),an adaptive local communication link optimization algorithm of nodes was proposed to optimize the network structure dynamically.By introducing the term of Laplacian spectrum moment,each node can make the decision of adding or deleting a link iteratively with their neighborsusinglimited local network structural information,and then the whole network can evolve to a predefined structure.The experimental results show that each node takes only finite iterations and then the network structure can converge quickly to the target,which prove the effectiveness of the algorithm.
出处
《通信学报》
EI
CSCD
北大核心
2017年第S2期170-177,共8页
Journal on Communications
关键词
无线传感网
拓扑优化
拉氏谱
谱矩
分布式迭代
wireless sensor network
topology control
Laplacian spectrum
spectral moment
distributed iterative algorithm