The Distributed Wireless Gathering Problem

Authors:
Vincenzo Bonifaci;Peter Korteweg;Alberto Marchetti-Spaccamela;Leen Stougie
Affiliations:
Università degli Studi dell'Aquila, Italy and Sapienza Università di Roma, Italy;Eindhoven University of Technology, The Netherlands;Sapienza Università di Roma, Italy;Eindhoven University of Technology, The Netherlands and CWI, Amsterdam, The Netherlands
Venue:
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
Year:
2008

Citing 16
Cited 0

Multiple communication im multihop radio networks

SIAM Journal on Computing
On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization

Journal of Computer and System Sciences
Wireless information networks

Wireless information networks
Analysis of Backoff Protocols for Mulitiple AccessChannels

SIAM Journal on Computing
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
Adversarial queuing theory

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Wireless sensor networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem

Proceedings of the 9th annual international conference on Mobile computing and networking
End-to-end packet-scheduling in wireless ad-hoc networks

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Multi-processor scheduling to minimize flow time with ε resource augmentation

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Versatile low power media access for wireless sensor networks

SenSys '04 Proceedings of the 2nd international conference on Embedded networked sensor systems
Ad Hoc Networking

Ad Hoc Networking
Algorithmic models for sensor networks

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
An approximation algorithm for the wireless gathering problem

SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Lower bounds on data collection time in sensory networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 驴(logm) on the competitive ratio of any distributed algorithm minimizing the maximum flow time, where mis 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 + 驴)-competitive, when the algorithm sends packets a factor O(log(驴/驴) logΔ) faster than the optimal offline solution; here 驴is the diameter of the network and Δthe maximum degree. We finally extend this result to a more complex interference model.