摘要
针对分布式贪心算法(DGreedy)以传感器节点的剩余能量为优先级,节点处理顺序没有考虑相邻节点间的关系对网络覆盖率的影响,从而影响覆盖率的不足,在此提出了一种新的有向传感器网络覆盖算法。基于全局贪心的原则,以节点一重覆盖区域面积的大小为优先级,优先确定一重覆盖区域面积最大的传感器节点方向,从而保证传感器网络的一重覆盖区域面积更大,重叠覆盖区域较少。对比实验结果表明,该算法能有效提高覆盖率。
To solve the deficiency of DGreedy （distributed greedy algorithm） which evaluates the priority level in view of remaining energy of terminals, and does not consider the influence of the relationship between neighbor nodes on the network coverage ratio in the aspect of the processing sequence of nodes, a new coverage algorithm for direetonal sensor networks is proposed in this paper. It is based on the principle of global greedy and takes the single coverage area of nodes as priority level. The directionof node with maximum single coverage area is deployed first. Thereby, it reduces the sensing overlapping regions and accomplishes coverage enhancement of the networks. The results of simulation experiments show that the pro- posed algorithm can improve the coverage rate effectively.
出处
《现代电子技术》
2012年第14期59-61,共3页
Modern Electronics Technique
基金
航空基金资助项目(2010ZC56006)
江西省教育厅科技基金资助项目(GJJ10189
GJJ10197)
