基于蜂窝网格的变步长移动节点部署算法  

Sensor Deployment Algorithm with Variable Step Size Based on Hexagonal Grid

作　　者：朱明[1] 金仁成[1] 车志平[1] 李应琛 

机构地区：[1]大连理工大学辽宁省微纳米技术及系统工程重点实验室,大连116024

出　　处：《单片机与嵌入式系统应用》2015年第12期31-34,共4页Microcontrollers & Embedded Systems

基　　金：国家重点基础研究发展计划(973计划)资助项目(2009CB320300);国家"十二五"科技支撑计划资助项目(2011BAG05B02)

摘　　要：针对无线传感器网络节点部署问题,提出了一种基于蜂窝网格的变步长节点部署算法。将监测区域进行正六边形网格划分,利用网格中心位置信息,以及随机散布的节点的位置信息,每个节点会找到自己的目标网格,目标网格中心即为该节点部署位置。根据待部署节点与相应目标网格顶点之间的距离信息,控制节点的移动距离。仿真结果表明,该算法收敛速度快,能以较小的节点平均移动距离获得98%以上的覆盖率。To solve the issue of wireless sensor network deployment, a sensor deployment algorithm with variable step size based on hexa- gonal grid is proposed. The monitoring field is drawn into regular hexagonal grids. Using the location information of each hexagon＇s cen- ter and the random deployed sensor nodes,each node＇s targeting grid can be found. The node should be deployed at the targeting grid^s center. Based on the distance between the deploying nodes and the targeting grid^s center,the move step can be selected. The simulation results show that the proposed algorithm can achieve a coverage of 98% with a faster convergence speed and a lower average moving distance.

关 键 词：无线传感器网络 节点部署 蜂窝网格 

分 类 号：TN929.5[电子电信—通信与信息系统] TP212.9[电子电信—信息与通信工程]