Novel Localization Algorithms Base On Mobile Beacon for Wireless Sensor Networks

In wireless sensor networks (WSN), localization is an essential and fundamental problem. One obvious method for localization of network nodes is equipping them with GPS (Global Positioning System). To counteract against the problems caused by nodes using of GPS, different algorithms are proposed for sensor nodes localization that did not need placing GPS on all the nodes. In such conditions, a useful method is using of a mobile robot. Mobile robot is equipped with GPS and is moved in network space in order to obtain the place of other nodes. In this paper, path planning of mobile robot is studied using of Graph theory and considering wireless sensor network as non – directional graph; assistance of covering tree illustrated this problem. For this purpose, two algorithms of path traverse are called as MMNF (Most Margin Neighborhood First)and LDF(Least Distance First)are suggested for covering tree which the proposed algorithm provides more powerful localization for path planning compared to the present algorithms such as BRF (Breadth First) and BTG (Back Tracking Greedy) and also in real conditions and simulation, it exhibited higher efficiency and has an important role in decreasing the consumed energy by the mobile robot.

کلیدواژه ها:

wireless sensor network ، localization ، path planning ، Graph theory ، LDF algorithm ، MMNF algorithm