A Delay-bound Efficient Path Design Algorithm for Mobile Sink in Wireless Sensor Networks

Hotspot problem is one of the major hindrance in the long run functioning of the wireless sensor network. Sink mobility has strongly emerged as a potential solution to it. Here, mobile sink visits the proximity of sensor nodes to collect data from them. However, this results into a lengthy path which is undesirable in most of the applications bounded by some delay. In our work, we propose a rendezvous point(RP)-based delay bound path design for the mobile sink. In the proposed method, the target area is partitioned into hexagonal cells whose centers are considered as the potential positions of RPs. These potential positions are minimized on the basis of several network parameters to select minimum number of RPs to form the delay bound path. Extensive simulations were carried over the proposed algorithm to compare its results with some existing algorithm using several performance metrics like hop count, network lifetime and many more to prove its effectiveness.