基于移动信标节点的无线传感器网络定位算法研究

Location Algorithm Based on the Mobile Beacon Node in Wireless Sensor Networks

研究了无线传感器网络中的节点定位算法问题,提出了一种新的基于移动信标节点的定位算法。该算法利用一个移动信标节点遍历整个网络,并周期性地广播包含其当前位置信息的分组,当未知节点接收到三个(或以上)与它的距离为通信半径的位置信息分组后,利用三边法计算自身位置。进而,考虑通信半径存在摄动的情况,利用极大似然法替代三边法提高算法的抗干扰能力。最后,通过仿真研究了该算法的特性,并与DV-Hop定位法进行了比较,仿真结果表明该定位方法在定位误差、通信量和网络结构适应性等方面均表现出良好的性能和优越性。

The design problem of location algorithm in wireless sensor networks is investigated, and a new node positioning algorithm is proposed based on the mobile beacon node method. The main idea of the proposed algorithm is to use the mobile beacon node to traverse the entire network and to broadcast periodically the packet containing its current location information. The unknown node can calculate its location by the trilateration as long as it has received three or more such location information packets which have distances of one communication radius from the unknown node. Furthermore, in the case that there exists uncertainty in the communication radius, the maximum likehood estimation algorithm is adopted instead of the trilateration to improve the anti-noise property of the proposed node positioning algorithm. Simulations are carried out to study the characteristics of the algorithm, and they are compared with the DV-Hop node positioning algorithm. The simulation results demonstrate that the proposed location algorithm performs well on the aspects of location error, communication traffic and adaptability of the network architecture.