基于无线传感器离散网络模型的Bounding Box定位算法研究  

STUDY OF BOUNDING BOX LOCALISATION ALGORITHM BASED ON WIRELESS SENSOR DISCRETE NETWORK MODEL

作　　者：曾振东[1] 

机构地区：[1]广东青年职业学院,广东广州510507

出　　处：《计算机应用与软件》2013年第12期194-197,257,共5页Computer Applications and Software

基　　金：广东省教育部产学研重点项目(2011A090200068);广东省自然科学基金项目(9151009001000043)

摘　　要：Bounding Box算法是一种典型的基于离散网络模型的无线传感器网络节点定位算法。针对Bounding Box算法定位误差大、覆盖率低的缺点,提出一种采用虚拟锚节点策略的改进定位算法。首先未知节点利用其通信范围内的锚节点进行定位;其次,已定位的节点根据升级策略有选择性的升级为虚拟锚节点;最后,无法定位的节点利用虚拟锚节点实现定位。另外,在离散网络模型的基础上,通过建立双半径网络节点模型从而进一步约束了未知节点的位置。理论分析及仿真结果均表明,该算法在显著提高定位覆盖率的同时,有效地提高了定位精度。Bounding Box algorithm is a typical node localisation algorithm based on discrete network model in wireless sensor network （WSN）. To overcome its disadvantages in low localisation accuracy and coverage rate, we propose an improved localisation algorithm which employs the virtual anchor nodes strategy. First, the unknown nodes will calculate their own coordinates by making use of the anchor nodes within their communication range. Secondly, the located unknown nodes will upgrade themselves as the virtual anchor nodes according to the promotion strategy selectively. Finally, those nodes which are unable to locate themselves will use the virtual anchor nodes to get their own location. Besides, the establishment of the network node model with double radius based on discrete network model further restrict the location of the unknown nodes. Theoretical analysis and simulation result all show that the proposed algorithm can effectively improve the localisation accuracy while significantly raise the coverage rate of localisation.

关 键 词：无线传感器网络 定位 Bounding Box算法 离散网络 虚拟锚节点 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]