Performance Analysis of the Mobile WSN for Efficient Localization

Abstract

Localization is a most important thing in wireless sensor network and when node is mobile, then it’s a challenging task for the user to maintain the information of each node. From last some years many user try to maintain the position of each node by using the different method and maintain it in table so we can able to get the data in less time with less energy consummation. But when all nodes are moving in some random direction in a particular area, then it is little difficult to maintain its information, and it can be achieved by using different methods to store information in one place by gathering the information from the neighboring network. In the current situation by using algorithm where node position is tracked by some constant time interval “t”, which we maintain in the table that contains its current position at a particular time interval “t”, as well as they try to predict the future position at a particular time interval “2t”. In the proposed algorithm to keep the localization error minimum, we have selected two neighboring nodes for each node and every node updates its current position and predicted the future position after every fixed time interval. The minimum distance can be calculated by performing trilateration among two neighboring nodes with unknown position node. RSS 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 the presented algorithm, we have found the efficient time period where average localization error will be minimum with minimum energy consumption. In this paper with quality of service other parameter we try to calculate like Packet delivery ratio (PDR), throughput and Delay in the network with energy consumed.