Abstrakt

Efficient Path Finding Algorithm for Mobile Data-Gathering in Wireless Sensor Networks

M.Tamilarasi, G.Yogarajan, T.Revathi

A new mobile data-gathering mechanisms for wireless sensor networks proposed in this paper. The mobile collector, called MobCar in this paper, directly visits all sensors and collects data by single hop from it. Since data packets are directly gathered without relays and collisions, the energy consumption on data gathering reduces. But data gathering latency is high. To overcome this problem a greedy approach based new mobile data gathering mechanisms are being proposed. Here, Path finding algorithm is used to find the polling points which directly collects the data from its neighbors. A MobCar visits each polling point and collects the data from them then forwards it to the sink node thus reducing the data gathering latency and energy consumption on data gathering and hence lifetime of the network gets increased. For the large scale applications, we consider utilizing multiple MobCars and propose a path finding algorithm where multiple MobCars traverse through several shorter subtours concurrently to satisfy the distance/time constraints. We carry out extensive simulations and the results demonstrate that our proposed algorithms can greatly shorten the moving distance of the MobCars compared with the travelling salesman problem.