Latency Constrained Trajectory Planning in Wireless Sensor Networks with Mobile Sink

Data collection is a fundamental task in Wireless Sensor Networks (WSNs). Recent research shows that significant benefits can be achieved for data collection in WSNs by introducing mobile sink (MS). However, the slow movement speed of MS usually incur unbearable latency. The rendezvous-based data collection scheme provides an efficient approach to tackle this problem. In this paper, we propose an rendezvous algorithm based on k-hop domination set to construct the rendezvous nodes (RNs). We first give the problem definition and then we propose an efficient distributed algorithm to construct k-hop domination sets. After that, we apply algorithm of solving Traveling Salesman Problem (TSP) to generate the traveling trajectory of MS, along which the MS collects the cached data when it arrives the communication range of RNs. Finally, the effectiveness of our algorithm is validated by performance simulations.