关键词: 无线传感器网络/
节点定位/
非测距/
质心定位
English Abstract
An improved centroid localization algorithm based on iterative computation for wireless sensor network
Jiang Rui,Yang Zhen
1.College of Telecommunications and Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210023, China
Fund Project:Project supported by the National Basic Research Program of China (Grant No. 2011CB302903), the Key Project supported by the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (Grant No. 14KJA510003), the China Postdoctoral Science Foundation (Grant No. 2014M551631), Project supported by the Jiangsu Postdoctoral Sustentation Fund, China (Grant No. 1302088B) and the NUPTSF (Grant Nos. NY213009, NY214042).Received Date:09 September 2015
Accepted Date:24 November 2015
Published Online:05 February 2016
Abstract:Wireless sensor network (WSN) is a basic component of internet and it plays an important role in many application areas, such as military surveillance, environmental monitoring and medical treatment. Node localization is one of the interesting issues in the field of WSN. Now, most of the existing node localization algorithms can be divided into two categories. One is range-based measurement and the other is range-free measurement. The localization algorithm of range-based measurement can achieve better location accuracy than the localization algorithm of range-free measurement. However, they are generally very energy consuming. Therefore, the range-free measurements are most widely used in practical applications. According to the application of localization algorithm in WSN by range-free measurements, an improved centroid localization algorithm based on iterative computation for wireless sensor network is proposed. In this algorithm, the position relationship of the closed area surrounded by the anchor nodes inside the unknown node's communication range and the unknown node is obtained by approximate point-in-triangulation test at first. Different position relationships determine different stopping criteria for iteration. Then, the centroid coordinates of the closed area surrounded by the anchor nodes inside the unknown node's communication range and the received signal strength (RSSI) between the centroid node and the unknown node are calculated. The anchor node with the weakest RSSI would be replaced by the centroid node. By this method, the closed area surrounded by the anchor nodes inside the unknown node's communication range is reduced. The location accuracy is increased by the cyclic iterative method. With the change of the anchor node ratio, the communication radius of the unknown node and the effect of RSSI error, the algorithm performance is investigated by using simulated data. The simulation results validate that although the improved centroid localization algorithm performance will be lost when the number of the anchor nodes inside the unknown node communication range decreases, the new approach can achieve good performance under the condition of few anchor nodes inside the unknown node communication range and this method is of strong robusticity against RSSI error disturbance.
Keywords: wireless sensor network/
node self-localization/
range-free/
centroid localization
