Date Added: Oct 2012
Using a mobile Base Station (BS) in a wireless sensor network can alleviate non-uniform energy consumption among sensor nodes and accommodate partitioned networks. In the work of Jerew and Liang (2009), the authors have proposed a novel clustering-based heuristic algorithm for finding a trajectory of the mobile BS that strikes a nontrivial tradeoff between the traffic load among sensor nodes and the tour time constraint of the mobile BS. In this paper, they show how to choose the number of clusters to ensure there is no packet loss as the BS moves between clusters. They provide an analytical solution to the problem in terms of the speed of the mobile BS. They also provide analytical estimates of the unavoidable packet loss as the network size increases.