Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks

Authors Varsha Dani, Aayush Gupta, Thomas P. Hayes, Seth Pettie



PDF
Thumbnail PDF

File

LIPIcs.DISC.2021.19.pdf
  • Filesize: 0.59 MB
  • 14 pages

Document Identifiers

Author Details

Varsha Dani
  • Department of Computer Science, Rochester Institute of Technology, NY, USA
Aayush Gupta
  • Department of Computer Science, University of New Mexico, Albuquerque, NM, USA
Thomas P. Hayes
  • Dept. of Computer Science, University of New Mexico, Albuquerque, NM, USA
Seth Pettie
  • Computer Science and Engineering, University of Michigan, Ann Arbor, MI, USA

Cite AsGet BibTex

Varsha Dani, Aayush Gupta, Thomas P. Hayes, and Seth Pettie. Wake up and Join Me! an Energy-Efficient Algorithm for Maximal Matching in Radio Networks. In 35th International Symposium on Distributed Computing (DISC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 209, pp. 19:1-19:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.DISC.2021.19

Abstract

We consider networks of small, autonomous devices that communicate with each other wirelessly. Minimizing energy usage is an important consideration in designing algorithms for such networks, as battery life is a crucial and limited resource. Working in a model where both sending and listening for messages deplete energy, we consider the problem of finding a maximal matching of the nodes in a radio network of arbitrary and unknown topology. We present a distributed randomized algorithm that produces, with high probability, a maximal matching. The maximum energy cost per node is O(log² n), and the time complexity is O(Δ log n). Here n is any upper bound on the number of nodes, and Δ is any upper bound on the maximum degree; n and Δ are parameters of our algorithm that we assume are known a priori to all the processors. We note that there exist families of graphs for which our bounds on energy cost and time complexity are simultaneously optimal up to polylog factors, so any significant improvement would need additional assumptions about the network topology. We also consider the related problem of assigning, for each node in the network, a neighbor to back up its data in case of eventual node failure. Here, a key goal is to minimize the maximum load, defined as the number of nodes assigned to a single node. We present an efficient decentralized low-energy algorithm that finds a neighbor assignment whose maximum load is at most a polylog(n) factor bigger that the optimum.

Subject Classification

ACM Subject Classification
  • Networks
Keywords
  • Distributed Algorithms
  • Energy-Aware Computation
  • Radio Networks
  • Maximal Matching
  • Sensor Networks

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection. Distributed Computing, 5(2):67-71, 1991. Google Scholar
  2. Reuven Bar-Yehuda, Oded Goldreich, and Alon Itai. On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. Journal of Computer and System Sciences, 45(1):104-126, 1992. Google Scholar
  3. Matthew Barnes, Chris Conway, James Mathews, and DK Arvind. Ens: An energy harvesting wireless sensor network platform. In 2010 Fifth International Conference on Systems and Networks Communications, pages 83-87. IEEE, 2010. Google Scholar
  4. Yi-Jun Chang, Varsha Dani, Thomas P Hayes, Qizheng He, Wenzheng Li, and Seth Pettie. The energy complexity of broadcast. In Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing, pages 95-104, 2018. Google Scholar
  5. Yi-Jun Chang, Varsha Dani, Thomas P Hayes, and Seth Pettie. The energy complexity of BFS in radio networks. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 273-282, 2020. Google Scholar
  6. Soumyottam Chatterjee, Robert Gmyr, and Gopal Pandurangan. Sleeping is efficient: Mis in o(1)-rounds node-averaged awake complexity. In Proceedings of the 39th Symposium on Principles of Distributed Computing, pages 99-108, 2020. Google Scholar
  7. Andrzej Czygrinow, Michał Hanćkowiak, Edyta Szymańska, and Wojciech Wawrzyniak. On the distributed complexity of the semi-matching problem. Journal of Computer and System Sciences, 82(8):1251-1267, 2016. Google Scholar
  8. Ran Duan and Seth Pettie. Linear-time approximation for maximum weight matching. J. ACM, 61(1):1-23, 2014. Google Scholar
  9. Nicholas JA Harvey, Richard E Ladner, László Lovász, and Tami Tamir. Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, 59(1):53-78, 2006. Google Scholar
  10. Wendi R. Heinzelman, Anantha Chandrakasan, and Hari Balakrishnan. Energy-efficient communication protocol for wireless microsensor networks. In Proceedings of the 33rd Annual Hawaii International Conference on System Sciences, pages 10-pp. IEEE, 2000. Google Scholar
  11. Dénes König. Über graphen und ihre anwendung auf determinantentheorie und mengenlehre. Mathematische Annalen, 77(4):453-465, 1916. Google Scholar
  12. Thomas Moscibroda and Roger Wattenhofer. Maximal independent sets in radio networks. In Proceedings of the 24th Annual ACM Symposium on Principles of Distributed Computing, pages 148-157, 2005. Google Scholar
  13. Joseph Polastre, Robert Szewczyk, and David Culler. Telos: Enabling ultra-low power wireless research. In Proceedings of the Fourth International Symposium on Information Processing in Sensor Networks, pages 364-369. IEEE, 2005. Google Scholar
  14. Xiumei Wang, Xiaoxin Song, and Jinjiang Yuan. On matching cover of graphs. Mathematical Programming, 147(1):499-518, 2014. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail