scientific article; zbMATH DE number 2080260

zbMath1044.68509MaRDI QIDQ4472511

Stephan Olariu, Koji Nakano

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690362.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Network protocols (68M12)

Related Items (10)

Quasi-optimal energy-efficient leader election algorithms in radio networks ⋮ Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election ⋮ Leader election using loneliness detection ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ The energy complexity of diameter and minimum cut computation in bounded-genus networks ⋮ Distributed MIS in O(log log n) Awake Complexity ⋮ Round complexity of leader election and gossiping in bidirectional radio networks ⋮ Transmitting once to elect a leader on wireless networks ⋮ Weak communication in single‐hop radio networks: adjusting algorithms to industrial standards ⋮ Leader Election Using Loneliness Detection

This page was built for publication: