Cluster-Based Collection point Energy Efficient Routing Protocol for the Mobile Sink in Wireless Sensor Network

Abstract

In order to extend the lifetime of a network, the advantages of using the sink mobility have been considered
in wireless sensor networks (WSNs). In the field of sensing, all types of obstructions could be existed in
physical environments. To determine the shortest route with an obstacle-avoiding, a research challenge is
executed based on a procedure of efficient dispatch the mobile sink. For finding out the shortest route of
obstacle-avoidance, an existing system is developed for mobile sink as an algorithm of heuristic tour
planning. The traditional algorithms are tough to resolve owing to the scheduling problem’s complexity in
WSNs with obstacles that includes more tour time. An efficient scheme based on collection data-point is
proposed to overcome this problem. A collection point algorithm is presented according to the data
collection for the mobile sink to discover the route for cluster heads and for collection of data from CH’s
and store it. From the initial phase, a periodic data-gathering route is started by the mobile sink and the
data is collected from collector point in a single hop’s range. In the final phase, it is returned to the initial
stage. The method’s effectiveness is verified through the simulation results based on NS2 software.