洪刚, 汤宝平, 裴勇. 分布式无线传感器节点覆盖集近似算法研究[J]. 微电子学与计算机, 2013, 30(6): 97-100,104.
引用本文: 洪刚, 汤宝平, 裴勇. 分布式无线传感器节点覆盖集近似算法研究[J]. 微电子学与计算机, 2013, 30(6): 97-100,104.
HONG Gang, TANG Bao-ping, PEI Yong. Research on Distributed Approximation Algorithms for Node Cover Set of Wireless Sensor Network[J]. Microelectronics & Computer, 2013, 30(6): 97-100,104.
Citation: HONG Gang, TANG Bao-ping, PEI Yong. Research on Distributed Approximation Algorithms for Node Cover Set of Wireless Sensor Network[J]. Microelectronics & Computer, 2013, 30(6): 97-100,104.

分布式无线传感器节点覆盖集近似算法研究

Research on Distributed Approximation Algorithms for Node Cover Set of Wireless Sensor Network

  • 摘要: 针对实际网络中节点感应半径不一致,且现有无线传感器网络中节点调度算法查找冗余节点效率低的问题,提出了一种分布式节点覆盖集算法.用感应区域像素点的点阵来近似节点感应区域,进而判定节点是否冗余.讨论了影响算法精度的因素,将算法与现有的节点覆盖集算法作了对比实验.仿真实验结果表明,在对初始覆盖有较小影响的情况下,算法能有效地判定在各种感应半径下的冗余节点,扩展了算法的适应面.

     

    Abstract: Aiming at the problems of low efficiency to find redundant nodes in Wireless Sensor Network(WSN),this paper considers the situation of different node's sensing radius in actual network and proposes a distributed algorithm of cover set based on pixels of sensing region.The node sensing region is discredited into a series of pixels to find the redundant nodes.Factors that affect the algorithm's accuracy is discussed.Comparative experiments to existing algorithm show that this algorithm will affect the initial cover set slightly,and the redundant nodes can be selected out effectively.

     

/

返回文章
返回