On Efficient Data Transport With Mobile Carriers
In this paper, the authors consider a network of stationary nodes that rely on mobile nodes to transport data between them. They assume the mobile nodes can control their mobility pattern to respond to traffic loads, as well as satisfy some other secondary objectives, such as surveillance requirements. They study this problem in the framework of cost minimization, where they derive a dual iterative algorithm that results in optimal mobility pattern for minimizing network wide cost. They then implement their proposed algorithm and evaluate its performance on a testbed.