An Efficient Localization Scheme for Mobile WSN
Kailas Tambe1, G. Krishna Mohan2
1Kailas Tambe, Research Scholar, KL University, Andhra Pradesh, India.
2Dr. G. Krishna Mohan, Professor, KL University, Vijayawada, Andhra Pradesh, India.
Manuscript received on 10 December 2018 | Revised Manuscript received on 17 December 2018 | Manuscript Published on 30 December 2018 | PP: 86-89 | Volume-8 Issue- 2S December 2018 | Retrieval Number: BS2683128218/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Localization is an extremely important service in wireless sensor network and when nodes are mobile then it is the utmost challenge to keep the information of all nodes in the wireless sensor network. In last many years a good research has been conducted using many localization algorithms to provide solution for accurate positioning of nodes along with minimum energy consumptions by the nodes. But when nodes are moving continuously and positions are changing at every time period t then it might be difficult to localize all nodes at a time but it is achieved using trilateration techniques using cooperative approach among neighboring nodes of the network. In presented algorithm where each node is tracked by its current position after every fixed time interval period ‘t’ which will keep track of nodes current position for time t as well also predicts its position for next period of t i.e. 2t. In proposed algorithm to keep the localization error minimum we have selected two neighboring nodes for each node and every node updates its current and predicted position after every fixed time interval period. The minimum distance can be calculated by performing trilateration among two neighboring nodes with unknown position node. Trilateration is mainly used in range based localization. These coordinate differences between current and predicted positions for time t and 2t time slot give us a localization error. With presented algorithm we have found the efficient time period where average localization error will be minimum with minimum energy consumption. In Future with quality of service parameter as Packet delivery ratio (PDR) and ultimately increased in throughput of the network can be achieved.
Keywords: Localization, AoA, PDR, TDOA, TOA.
Scope of the Article: Communication