The distributed wireless gathering problem

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.

[1]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

[2]  Jean-Claude Bermond,et al.  Optimal gathering protocols on paths under interference constraints , 2009, Discret. Math..

[3]  Leen Stougie,et al.  Minimizing Flow Time in the Wireless Gathering Problem , 2008, STACS.

[4]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels , 2005, IEEE/ACM Transactions on Networking.

[5]  Bala Kalyanasundaram,et al.  Speed is as powerful as clairvoyance , 2000, JACM.

[6]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[7]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[8]  Stéphane Pérennes,et al.  Hardness and approximation of gathering in static radio networks , 2006, Fourth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW'06).

[9]  Massimo Franceschetti,et al.  Lower bounds on data collection time in sensory networks , 2004, IEEE Journal on Selected Areas in Communications.

[10]  Aravind Srinivasan,et al.  End-to-end packet-scheduling in wireless ad-hoc networks , 2004, SODA '04.

[11]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[12]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[13]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[14]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[15]  Allan Borodin,et al.  Adversarial queuing theory , 2001, JACM.

[16]  Cynthia A. Phillips,et al.  Optimal Time-Critical Scheduling via Resource Augmentation , 1997, STOC '97.

[17]  Ivan Stojmenovic,et al.  Handbook of Sensor Networks: Algorithms and Architectures , 2005, Handbook of Sensor Networks.

[18]  Dariusz R. Kowalski,et al.  Maximum throughput of multiple access channels in adversarial environments , 2017, Distributed Computing.

[19]  Ivan Stojmenovic,et al.  Ad hoc Networking , 2004 .

[20]  Kay Römer,et al.  Time Synchronization and Calibration in Wireless Sensor Networks , 2005, Handbook of Sensor Networks.

[21]  Bhaskar Krishnamachari,et al.  (www.interscience.wiley.com) DOI: 10.1002/wcm.503 An adaptive energy-efficient and low-latency MAC for tree-based data gathering in sensor networks , 2022 .

[22]  Bhaskar Krishnamachari,et al.  An adaptive energy-efficient and low-latency MAC for data gathering in wireless sensor networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[23]  Aravind Srinivasan,et al.  Provable Algorithms for Joint Optimization of Transport , Routing and MAC layers in Wireless Ad Hoc Networks , 2007 .

[24]  David E. Culler,et al.  Versatile low power media access for wireless sensor networks , 2004, SenSys '04.

[25]  Jean-Claude Bermond,et al.  Gathering with Minimum Completion Time in Sensor Tree Networks , 2010, J. Interconnect. Networks.

[26]  Frank Thomson Leighton,et al.  Analysis of backoff protocols for multiple access channels , 1987, STOC '87.

[27]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[28]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless networks: the joint routing and scheduling problem , 2003, MobiCom '03.

[29]  Stefan Schmid,et al.  Algorithmic models for sensor networks , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[30]  Leandros Tassiulas,et al.  Routing for network capacity maximization in energy-constrained ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[31]  Baruch Awerbuch,et al.  Universal-stability results and performance bounds for greedy contention-resolution protocols , 2001, JACM.

[32]  Leen Stougie,et al.  An approximation algorithm for the wireless gathering problem , 2008, Oper. Res. Lett..

[33]  Jack M. Holtzman,et al.  Wireless information networks , 2010, 2010 International Conference on Wireless Information Networks and Systems (WINSYS).