Algorithm Aspects of Dynamic Coordination of Beacons in Localization of Wireless Sensor Networks

Wireless Sensor Networks(WSNs) consists of hundreds of nodes which are of low power, low cost, and tiny devices. The main functionality of these nodes is to sense the environment and send the sensed data to the observer. In order to validate and get the significance of sensing data, location information of the sensor node needs to be combined with the sensed data. In addition to this, there are many other issues of WSN such as routing, coverage, etc. which also need the location information of sensor nodes. Several approaches, including range-based and range-free, have been proposed to calculate positions for randomly deployed sensor nodes. In this paper, we proposed a distributed technique for localization of sensor nodes using few mobile anchor nodes. These mobile anchor nodes move in the network space and periodically broadcast beacon messages about their location. Static sensor nodes receive these messages as soon as they come under the communication range of any mobile anchor node and compute their position based on the range based technique. Another contribution of this paper is to identify the importance of mobile anchor node over static anchor node in localization. The performance of the proposed algorithm is carried out using the Castalia simulator. The simulation result shows that mobile anchor node provide better accuracy as compared to static anchor node for sensor node localization.