特殊区域的无线传感网络布点优化算法  

Optimal Deployment Algorithm for Particular Region of Wireless Sensor Network

作　　者：朱凡[1] 刘宏立[1] 刘述钢[1] 

机构地区：[1]湖南大学电气与信息工程学院,长沙410082

出　　处：《传感技术学报》2009年第4期552-557,共6页Chinese Journal of Sensors and Actuators

基　　金：国家863项目资助(2007AA1A121)

摘　　要：通过讨论无线传感网络中节点传感距离与通信距离间的特殊关系,针对封闭、半封闭空间等特殊形状的区域进行布点方案研究,提出一种以尽可能少的节点且满足覆盖性和联通性的优化布点算法。分析、计算节点在不同传感距离与通信范围下,相邻传感器覆盖的最大有效范围,并考虑区域边界和障碍的复杂性,结合EMST算法保证全局通信。基于MATLAB的仿真结果表明:该算法能在最少节点要求下保证整个区域的覆盖和网络的通信。This work discusses the special relationship between the sensor range and the communication range in WSN, and researches on the deployment methods in closed or semi-closed area with particular shape, also figures out an optimal deployment algorithm which can satisfy both coverage and connectivity by using nodes as few as possible. We compute the maximum efficient range of several neighbor sensors based-on the different relationships between sensor range and communication range and consider the complex boundary or obstacles in the region. Besides, we also combine it with the Euclidean minimum spanning tree （EMST） algorithm to ensure the coverage and communication of entire region. Eventually, simulation results based-on MATLAB are presented, which do show that this optimal deployment algorithm can ensure the coverage and communication of entire region by requiring least nodes.

关 键 词：优化布点 覆盖性 联通性 特殊区域 欧几里德最小生成树 

分 类 号：TN92[电子电信—通信与信息系统] TP393.17[电子电信—信息与通信工程]