| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 570721 | Procedia Computer Science | 2016 | 4 Pages |
The main intention of wireless sensor network is to provide the information about the spatiotemporal characteristics of the observed physical world. In many wireless sensor network applications, namely forest fire detection, animal tracking etc., it is important to locate the sensor with accuracy. Locating the sensors after they have deployed is termed as localization. Most of the localization algorithm relies on the availability of reasonably accurate location information. This is valid only in few networks which has location sensing devices, such as GPS receivers are available at all nodes. In real time, equipping GPS with all sensor nodes are rare due to its cost, power. To overcome these limitations various path have been proposed to derive approximated locations of all nodes using the mobile beacon. In existing systems, Localization techniques that are proposed for sensor nodes are calculated by receiving the mobile beacon signal with their coordinates by incorporating the various path planning scheme like SCAN, DOUBLE SCAN, HILBERT and Z curve for trajectory of mobile beacon. Those path planning strategies resulting in existence of collinear problem and localization error of nodes. In this paper, a novel Tree - Climbing path planning mechanism is proposed. The proposed path ensures to overcome collinear problem by travelling in a tree based path. The performance of a novel tree climbing is analysed using the NS2 simulator.
