论文部分内容阅读
在无线传感器网络中,如何布置给定数量的中继节点以最小化传输数据的整体功耗是个值得关注的问题.对中继节点的最小功耗布置问题进行了形式化描述,提出一种时间复杂度为O(n2)的近似算法,其中n为传感器节点数目.该算法先构造一棵中继节点数目不受限制时的最优生成树,然后每次从生成树中删除一个使得整体功耗增加最少的中继节点,直至生成树中的中继节点数目满足要求.实验结果表明该算法的执行时间较短,在传输数据的整体功耗方面要优于现有算法.
In wireless sensor networks, how to arrange a given number of relay nodes to minimize the overall power consumption of transmitted data is a concern.Describing the minimum power consumption of relay nodes, The complexity of the algorithm is O (n2), where n is the number of sensor nodes.This algorithm first constructs an optimal spanning tree with unlimited number of relay nodes, and then removes one spanning tree from the spanning tree, The relay nodes with the least increase in consumption until the number of relay nodes in the spanning tree meet the requirements.The experimental results show that the algorithm has a shorter execution time and is superior to the existing algorithms in transmitting the overall power consumption of the data.