Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks

In this paper, the authors address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularly challenging since they need to consider both mobility scheme and storage constraint. Previous works suggest to use a simple single-hop routing model in which source nodes can only communication with the sink node directly in those mobile networks, However, they notice that this statement is unsuitable for sensor networks with storage constraint because they prove it is a NP-complete problem under single-hop routing model by reducing the Traveling Salesman Problem (TSP) to it in polynomial time.