TY - GEN

T1 - Distributed deterministic broadcasting in wireless networks of weak devices

AU - Jurdzinski, Tomasz

AU - Kowalski, Dariusz R.

AU - Stachowiak, Grzegorz

PY - 2013

Y1 - 2013

N2 - Many futuristic technologies, such as Internet of Things or nano-communication, assume that a large number of simple devices of very limited energy and computational power will be able to communicate efficiently via wireless medium. Motivated by this, we study broadcasting in the model of ad-hoc wireless networks of weak devices with uniform transmission powers. We compare two settings: with and without local knowledge about immediate neighborhood. In the latter setting, we prove Ω(nlogn)-round lower bound and develop an algorithm matching this formula. This result could be made more accurate with respect to network density, or more precisely, the maximum node degree Δ in the communication graph. If Δ is known to the nodes, it is possible to broadcast in O(DΔlog2 n) rounds, which is almost optimal in the class of networks parametrized by D and Δ due to the lower bound Ω(DΔ). In the setting with local knowledge, we design a scalable and almost optimal algorithm accomplishing broadcast in O(Dlog2 n) communication rounds, where n is the number of nodes and D is the eccentricity of a network. This can be improved to O(Dlogg) if network granularity g is known to the nodes. Our results imply that the cost of "local communication" is a dominating component in the complexity of wireless broadcasting by weak devices, unlike in traditional models with non-weak devices in which well-scalable solutions can be obtained even without local knowledge.

AB - Many futuristic technologies, such as Internet of Things or nano-communication, assume that a large number of simple devices of very limited energy and computational power will be able to communicate efficiently via wireless medium. Motivated by this, we study broadcasting in the model of ad-hoc wireless networks of weak devices with uniform transmission powers. We compare two settings: with and without local knowledge about immediate neighborhood. In the latter setting, we prove Ω(nlogn)-round lower bound and develop an algorithm matching this formula. This result could be made more accurate with respect to network density, or more precisely, the maximum node degree Δ in the communication graph. If Δ is known to the nodes, it is possible to broadcast in O(DΔlog2 n) rounds, which is almost optimal in the class of networks parametrized by D and Δ due to the lower bound Ω(DΔ). In the setting with local knowledge, we design a scalable and almost optimal algorithm accomplishing broadcast in O(Dlog2 n) communication rounds, where n is the number of nodes and D is the eccentricity of a network. This can be improved to O(Dlogg) if network granularity g is known to the nodes. Our results imply that the cost of "local communication" is a dominating component in the complexity of wireless broadcasting by weak devices, unlike in traditional models with non-weak devices in which well-scalable solutions can be obtained even without local knowledge.

UR - http://www.scopus.com/inward/record.url?scp=84880265731&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84880265731&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-39212-2_55

DO - 10.1007/978-3-642-39212-2_55

M3 - Conference contribution

AN - SCOPUS:84880265731

SN - 9783642392115

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 632

EP - 644

BT - Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings

T2 - 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013

Y2 - 8 July 2013 through 12 July 2013

ER -