Abstract:
In some Wireless Sensor Network(WSN) where nodes are placed randomly, several beacon nodes are concentrated in the area of border. It is difficult to separate them evenly only by virtual forces, based on the issue, area density coverage algorithm based on virtual square is proposed. According to node density of zoning, the area is divided into virtual grids. In each iteration the virtual force coefficient are updated according to the regional density. Lastly boundary forces are used to avoid beacon nodes being deployed in the corners or blind areas. Beacon nodes are deployed reasonably in a area, improving network coverage ratio.
Key words:
Wireless Sensor Network(WSN),
virtual force,
area density,
beacon re-localization,
coverage ratio
摘要: 当随机部署的信标节点集中在监视区域边界处时,仅依靠虚拟力无法均匀部署。针对该问题,提出基于虚拟方格的区域密度覆盖算法,根据节点密度将整个区域划分为虚拟方格,每次迭代根据区域密度更新虚拟力系数。利用边界力避免信标节点处于区域边界或死角,使信标节点合理分布在监视区域中。仿真结果证明,该算法可有效提高信标节点网络覆盖率。
关键词:
无线传感器网络,
虚拟力,
区域密度,
信标重定位,
覆盖率
CLC Number:
NIU Zhi-Xian, LI Xia, FENG Xiu-Fang, LI Wu-Feng-. Area Density Coverage Algorithm Based on Virtual Square[J]. Computer Engineering, 2011, 37(19): 99-100,103.
牛之贤, 李霞, 冯秀芳, 李武鹏. 基于虚拟方格的区域密度覆盖算法[J]. 计算机工程, 2011, 37(19): 99-100,103.