Optimal Sub-Path Selection for Maximum Data Gathering Using Mobile Sink in WSN

In recent years, mobile sink based data gathering in Wireless Sensor Networks (WSNs) is getting popular among researchers. Sink mobility enhances the lifetime of the sensor network by distributing data traffic load among the sensors. In certain applications, a mobile sink is passed on a fixed path. However, due to the constrained path (fixed path) and relatively slower speed of mobile sink, data delivery is delayed. In practice, some data-intensive applications have strict delay requirements to collect sensors' data. Thus, data collection with a strict time deadline in a constrained path environment using mobile sink has increased attention among the researchers. In this article, our focus is to find a sub-path on a given path for the mobile sink to collect the maximum amount of data from the sensors in the network within a given time deadline, referred as maximum data gathering sub-path finding problem (MDSP). We propose a polynomial time algorithm for the problem. Furthermore, we evaluate the performance of the proposed algorithm using simulation in MATLAB.