Abstract

In this paper, given a single mobile element and a time deadline, we investigate the problem of designing the mobile element tour to visit subset of nodes, such that the length of this tour is bounded by the time deadline and the communication cost between nodes outside and inside the tour is minimized. The nodes that the mobile element tour visits, works as cache points that store the data of the other nodes. Several algorithms in the literature have tackled this problem by separating two phases; the construction of the mobile element tour from the computation of the forwarding trees to the cache points. In this paper, we propose algorithmic solutions that alternate between these phases and iteratively improves the outcome of each phase based on the result of the other. We compare the resulting performance of our solutions with that of previous work.