TY - JOUR
T1 - Distributed bare-bones communication in wireless networks
AU - Chlebus, Bogdan S.
AU - Kowalski, Dariusz R.
AU - Vaya, Shailesh
N1 - Funding Information:
The work of the first author was partly supported by the National Science Foundation Grant No. 1016847. The work of the second author was partly supported by the National Science Foundation Grant No. 2131538 and the Polish National Science Center NCN grant UMO-2017/25/B/ST6/02553
Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.
PY - 2022/2
Y1 - 2022/2
N2 - We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their neighborhoods, nor do they know the size of the network n, and finally they cannot sense collisions resulting from simultaneous transmissions by at least two neighbors. Each node is equipped with a unique integer name, where N as an upper bound on the a range of names. We refer as a backbone to a subnetwork induced by a diameter-preserving dominating set of nodes. Let Δ denote a maximum number of nodes that can successfully receive a message transmitted by a node when no other nodes transmit concurrently. We study distributed algorithms for communication problems in three settings. In the single-node-start case, when one node starts an execution and other nodes are awoken by receiving messages from already awoken nodes, we present a randomized broadcast algorithm that wakes up all nodes in O(nlog 2N) rounds with high probability. For the synchronized-start case, when all nodes start an execution simultaneously, we give a randomized algorithm computing a backbone in O(Δ log 7N) rounds with high probability. In the partly-coordinated-start case, when a number of nodes start an execution together and other nodes are awoken by receiving messages from the already awoken nodes, we develop an algorithm that creates a backbone in time O(nlog 2N+ Δ log 7N) with high probability
AB - We consider wireless networks operating under the SINR model of interference. Nodes have limited individual knowledge and capabilities: they do not know their positions in a coordinate system in the plane, further they do not know their neighborhoods, nor do they know the size of the network n, and finally they cannot sense collisions resulting from simultaneous transmissions by at least two neighbors. Each node is equipped with a unique integer name, where N as an upper bound on the a range of names. We refer as a backbone to a subnetwork induced by a diameter-preserving dominating set of nodes. Let Δ denote a maximum number of nodes that can successfully receive a message transmitted by a node when no other nodes transmit concurrently. We study distributed algorithms for communication problems in three settings. In the single-node-start case, when one node starts an execution and other nodes are awoken by receiving messages from already awoken nodes, we present a randomized broadcast algorithm that wakes up all nodes in O(nlog 2N) rounds with high probability. For the synchronized-start case, when all nodes start an execution simultaneously, we give a randomized algorithm computing a backbone in O(Δ log 7N) rounds with high probability. In the partly-coordinated-start case, when a number of nodes start an execution together and other nodes are awoken by receiving messages from the already awoken nodes, we develop an algorithm that creates a backbone in time O(nlog 2N+ Δ log 7N) with high probability
KW - Backbone
KW - Broadcast
KW - Signal-to-interference-plus-noise ratio
KW - Wireless network
UR - http://www.scopus.com/inward/record.url?scp=85119871489&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85119871489&partnerID=8YFLogxK
U2 - 10.1007/s00446-021-00413-7
DO - 10.1007/s00446-021-00413-7
M3 - Article
AN - SCOPUS:85119871489
VL - 35
SP - 59
EP - 80
JO - Distributed Computing
JF - Distributed Computing
SN - 0178-2770
IS - 1
ER -