Distributed communication in bare-bones wireless networks

Bogdan S. Chlebus, Shailesh Vaya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationProceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016
PublisherAssociation for Computing Machinery
ISBN (Electronic)9781450340328
DOIs
StatePublished - Jan 4 2016
Externally publishedYes
Event17th International Conference on Distributed Computing and Networking, ICDCN 2016 - Singapore, Singapore
Duration: Jan 4 2016Jan 7 2016

Publication series

NameACM International Conference Proceeding Series
Volume04-07-January-2016

Conference

Conference17th International Conference on Distributed Computing and Networking, ICDCN 2016
CountrySingapore
CitySingapore
Period1/4/161/7/16

Fingerprint

Wireless networks
Bone
Communication
Parallel algorithms

Keywords

  • Backbone structure
  • Broadcast
  • Knowledge
  • Signal-to-interference-plus-noise ratio
  • Wireless network

ASJC Scopus subject areas

  • Software
  • Human-Computer Interaction
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

Cite this

Chlebus, B. S., & Vaya, S. (2016). Distributed communication in bare-bones wireless networks. In Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016 [a1] (ACM International Conference Proceeding Series; Vol. 04-07-January-2016). Association for Computing Machinery. https://doi.org/10.1145/2833312.2833454

Distributed communication in bare-bones wireless networks. / Chlebus, Bogdan S.; Vaya, Shailesh.

Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016. Association for Computing Machinery, 2016. a1 (ACM International Conference Proceeding Series; Vol. 04-07-January-2016).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chlebus, BS & Vaya, S 2016, Distributed communication in bare-bones wireless networks. in Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016., a1, ACM International Conference Proceeding Series, vol. 04-07-January-2016, Association for Computing Machinery, 17th International Conference on Distributed Computing and Networking, ICDCN 2016, Singapore, Singapore, 1/4/16. https://doi.org/10.1145/2833312.2833454
Chlebus BS, Vaya S. Distributed communication in bare-bones wireless networks. In Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016. Association for Computing Machinery. 2016. a1. (ACM International Conference Proceeding Series). https://doi.org/10.1145/2833312.2833454
Chlebus, Bogdan S. ; Vaya, Shailesh. / Distributed communication in bare-bones wireless networks. Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016. Association for Computing Machinery, 2016. (ACM International Conference Proceeding Series).
@inproceedings{a8945cc77b204290822f8469a34c2d93,
title = "Distributed communication in bare-bones wireless networks",
abstract = "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.",
keywords = "Backbone structure, Broadcast, Knowledge, Signal-to-interference-plus-noise ratio, Wireless network",
author = "Chlebus, {Bogdan S.} and Shailesh Vaya",
year = "2016",
month = "1",
day = "4",
doi = "10.1145/2833312.2833454",
language = "English (US)",
series = "ACM International Conference Proceeding Series",
publisher = "Association for Computing Machinery",
booktitle = "Proceedings of the 17th International Conference on Distributed Computing and Networking, ICDCN 2016",

}

TY - GEN

T1 - Distributed communication in bare-bones wireless networks

AU - Chlebus, Bogdan S.

AU - Vaya, Shailesh

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

ER -