摘要
无线传感器网络经常会部署在三维区域内,但目前大部分节点定位方法仅考虑的是二维应用。针对无线传感器网络节点能量有限特点,提出1种三维节点定位算法bounding cube,研究算法的原理和实现方法,并进行仿真分析。仿真结果表明,在100 m×100 m×100 m的三维空间内随机部署400个节点,当已知节点密度>20%,通信半径分别为r=30 m,r=40 m,r=50 m时,相对定位误差均<40%,当已知节点密度>20%、通信半径>30 m时,一次定位比例可以达到100%。该算法的突出特点是方法简单、计算量小。
Despite the fact that sensor networks could often be deployed over three-dimensional（3D） terrains, most approaches on sensor localizations are designed and evaluated considering only two-dimensional（2D） applications. According to the shortage of energy in wireless sensor networks, The authors present a localization scheme Bounding Cube for 3D. Both principles and practice were discussed, simulazations were done. The simulation results show that when 400 nodes are randomly deployed in 100 m ×100 m ×100 m the three-dimensional terrains, the known node density is greater than 20 % and the communication radius r is 30 m, 40 m and 50 m, the relative positioning error will be less than 40 %. When the known nodes density is greater than 20 % and communication radius is greater than 30 m, the proportion of a targeted is 100 %. The outstanding characteristic of the algorithm is that the method is simple and the calculation is small.
出处
《中国海洋大学学报（自然科学版）》
CAS
CSCD
北大核心
2009年第6期1265-1268,共4页
Periodical of Ocean University of China
基金
国家高科技计划项目(2007AA12Z242)资助
