Scheme for tour planning of mobile sink in wireless sensor networks

Abstract

Exploiting mobile sink (MS) for data gathering in the wireless sensor networks has been extensively studied in the recent researches to address energy-hole issues, thereby facilitating balanced energy consumption among nodes and so prolonging network lifetime. However, such approaches suffer from an extended data collection delay causing buffer overflow problem. In this regard, finding the optimal number of locations (i.e. rendezvous points (RPs) where the MS sojourns for data collection), is not only of utmost importance, but also a challenging task. A novel scheme for trajectory design of MS for data collection is presented in this study. The authors' primary goal is to optimise the number of RPs and their locations to minimise the travelling length of the MS. First, they reduced the problem size by using a combination of breadth-first search and Tarjan's algorithm and then applied spectral clustering to find the optimal set of RPs to plan the tour for the MS. They have performed extensive simulations, and the results are compared with relevant existing schemes. The comparative results confirm the effectiveness of their approach in terms of the number of RPs, path length, the variance of RPs, and energy consumption per round.