The distributed wireless gathering problem

We address the problem of data gathering in a wireless network using multihop communication; our main goal is the analysis of simple algorithms suitable for implementation in realistic scenarios. We study the performance of distributed algorithms, which do not use any form of local coordination, and we focus on the objective of minimizing average flow times of data packets. We prove a lower bound of O(logm) on the competitive ratio of any distributed algorithm minimizing the maximum flow time, where m is the number of packets. Next, we consider a distributed algorithm which sends packets over shortest paths, and we use resource augmentation to analyze its performance when the objective is to minimize the average flow time. If interferences are modeled as in Bar-Yehuda et al. (J. of Computer and Systems Science, 1992) we prove that the algorithm is (1?+?e)-competitive, when the algorithm sends packets a factor O(log(d/e) log?) faster than the optimal offline solution; here d is the diameter of the network and ? the maximum degree. We finally extend this result to a more complex interference model.