Node Deployment Optimization for Target Coverage and Connectivity in WSNs with a Delay-constrained Mobile Sink

Mobile sink problems in wireless sensor networks (WSNs) have gained increasing worldwide attention in recent years because of a great number of applications and advantages. In this paper, we proposed a problem model consisting of a WSN with a mobile sink (MS) and a set of fixed targets which the MS needs to collect information. In this case, the MS just receives information from targets by transmitting it through sensors. The objective of the problem is to determine the location and trajectory of the MS to optimize the number of sensors that need to be set, thereby reducing the cost to build WSNs in practice. We proposed a heuristic algorithm to solve the problem with the set of targets that form a convex polygon on the 2-dimensional plane and consider this heuristic algorithm in the case of a random set of targets on the plane and in some special cases.