Multiple communication im multihop radio networks
SIAM Journal on Computing
Journal of Computer and System Sciences
Wireless information networks
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
An architecture for building self-configurable systems
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Distributed Algorithms
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Data Gathering Algorithms in Sensor Networks Using Energy Metrics
IEEE Transactions on Parallel and Distributed Systems
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Versatile low power media access for wireless sensor networks
SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels
IEEE/ACM Transactions on Networking (TON)
Wireless Communications & Mobile Computing - Advances in Resource-Constrained Device Networking
Algorithmic models for sensor networks
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Minimizing flow time in the wireless gathering problem
ACM Transactions on Algorithms (TALG)
An approximation algorithm for the wireless gathering problem
Operations Research Letters
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 5.23 |
We address the problem of data gathering in a wireless network using multi-hop 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 @W(n) on the expected competitive ratio of any acknowledgment-based distributed algorithm minimizing the maximum flow time, where n is the number of nodes of the network. 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. [R. Bar-Yehuda, O. Goldreich, A. Itai, On the time complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization, Journal of Computer and Systems Sciences 45 (1) (1992) 104-126] we prove that the algorithm is (1+@e)-competitive, when the algorithm sends packets a factor O(log(@d/@e)log@D) faster than the optimal off-line solution; here @d is the radius of the network and @D the maximum degree. We finally extend this result to a more complex interference model.