Time-sensitive data collection with path-constrained mobile sink in WSN

Recently, several studies have considered the use of mobile sink (MS) for data gathering in wireless sensor networks. As, it can enhance lifetime of the sensor network by distributing load among the sensors. In some delay-critical applications, a mobile sink is allowed to move along a predefined path. However, due to the predefined path and relatively slower speed of mobile sink, data gathering from sensors may delayed. Thus, time-sensitive data collection in a constrained path environment using mobile sink has increased attention in the research community. Our proposed paper focuses on finding a sub-path on a given path in the network such that the mobile sink can collect maximum data from the network within given time. We refer it as maximum data gathering by optimal sub-path finding problem (MDGOSP). We develop a deterministic algorithm to solve it. Furthermore, performance of the proposed algorithm is validated through simulation experiments using MATLAB.