Path Planning for Mobile Sink in Wireless Sensor Networks

Abstract

Recent investigations have demonstrated that critical advantages which are going to be accomplished in Wireless Sensor Networks (WSNs) with illustration in mobile sink to gather information from sensor nodes by utilizing small range communications. A portable sink is avehicle or a versatile robot furnished with an intense handsethaving expansive battery and memory. As the deployment of sensor nodes is mostly random, the WSN splits into number of disconnected subnetworks. To address this issue, we deploy a mobile sink which travels through the selected polling points (locations) and collects data. Selection of polling points is strictlybased on the availability of number of sensor nodes. Sincethe collection of data from sensor nodes is done via single hopcommunication, accuracy of collected data is expected tobe maintained and data delivery latency is reduced. We aim todesign a path for mobile sink where both tour length and energyconsumption of sensor nodes is minimized. In Simulation results, we can see that the proposed algorithm performs better than some of the well-known existing algorithms described in the literature survey.