Wireless Sensor Network Lifetime improvement is very well demonstrated
using sink mobility effectively in the literature. The challenge taken up in the past
research was to identify the shortest route that avoids obstacles and delivers the mobile
sinks at the designated nodes. In this paper, we present a cluster-based approach for
collecting the data and a heuristic algorithm for a well-planned work. The routing
protocols may differ from application to application, due to a large number of sensor
nodes the algorithm should be studied in a novel way. In this method, the nodes known
as cluster heads collect information from different cluster points and sends data to the
mobile sink following this clustering process. We also propose an energy-efficient data
gathering algorithm for the collection of mobile sinks. Simulations were conducted
using NS2 software to verify the efficiency of the proposed algorithm.
Keywords: Clusters, Energy efficiency Algorithms, Heuristic tour plan algorithm,
Mobile Sinks, Wireless sensor Networks.
