A delay efficient path selection strategy for mobile sink in wireless sensor networks

Sink mobility has been proven to be an effective way for minimizing delay in data delivery and mitigating the hot spot problem in wireless sensor networks (WSNs). However, there is an impact of the path selection for the mobile sink on the data delivery delay. Hence selection of optimal number of halting positions called rendezvous points (RPs) and their locations are challenging in WSNs. In this paper, we propose an efficient scheme to select RPs for construction of path for the mobile sink in WSNs. We first propose a technique for generating a set of potential positions which act as the possible positions for the RPs. Next, we propose a greedy algorithm for selecting the minimum number of potential positions as RPs. These RPs used to construct the path for the mobile sink. We simulate the proposed algorithm with some existing algorithms and compare the results using various performance metrics such as number of RPs, average waiting time and path length etc. to show the effectiveness of the proposed algorithm.