TY - GEN
T1 - Distributed communication in bare-bones wireless networks
AU - Chlebus, Bogdan S.
AU - Vaya, Shailesh
N1 - Publisher Copyright:
© 2016 ACM.
PY - 2016/1/4
Y1 - 2016/1/4
N2 - We consider wireless networks in which the effects of interference are determined by the SINR model. We address the question of structuring distributed communication when stations have very limited individual capabilities. In particular, nodes do not know their geographic coordinates, neighborhoods or even the size n of the network, nor can they sense collisions. Each node is equipped only with its unique name from a range {1,...,N}. We study the following three settings and distributed algorithms for communication problems in each of them. In the uncoordinatedstart 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 which wakes up all the nodes in O(nlog2 N) rounds with high probability. In the synchronized-start case, when all the nodes simultaneously start an execution, we give a randomized algorithm that computes a backbone of the network in O(Δ log7 N) rounds with high probability. Finally, 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 network in time O(nlog2 N + Δ log7 N) with high probability.
AB - We consider wireless networks in which the effects of interference are determined by the SINR model. We address the question of structuring distributed communication when stations have very limited individual capabilities. In particular, nodes do not know their geographic coordinates, neighborhoods or even the size n of the network, nor can they sense collisions. Each node is equipped only with its unique name from a range {1,...,N}. We study the following three settings and distributed algorithms for communication problems in each of them. In the uncoordinatedstart 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 which wakes up all the nodes in O(nlog2 N) rounds with high probability. In the synchronized-start case, when all the nodes simultaneously start an execution, we give a randomized algorithm that computes a backbone of the network in O(Δ log7 N) rounds with high probability. Finally, 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 network in time O(nlog2 N + Δ log7 N) with high probability.
KW - Backbone structure
KW - Broadcast
KW - Knowledge
KW - Signal-to-interference-plus-noise ratio
KW - Wireless network
UR - http://www.scopus.com/inward/record.url?scp=84961160607&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84961160607&partnerID=8YFLogxK
U2 - 10.1145/2833312.2833454
DO - 10.1145/2833312.2833454
M3 - Conference contribution
AN - SCOPUS:84961160607
T3 - ACM International Conference Proceeding Series
BT - Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016
PB - Association for Computing Machinery
T2 - 17th International Conference on Distributed Computing and Networking, ICDCN 2016
Y2 - 4 January 2016 through 7 January 2016
ER -