TY - GEN

T1 - Distributed backbone structure for algorithms in the SINR model of wireless networks

AU - Jurdzinski, Tomasz

AU - Kowalski, Dariusz R.

PY - 2012

Y1 - 2012

N2 - The Signal-to-Interference-and-Noise-Ratio (SINR) physical model is one of the most popular models of wireless networks. Despite of the vast amount of study done in design and analysis of centralized algorithms supporting wireless communication under the SINR physical model, little is known about distributed algorithms in this model, especially deterministic ones. In this work we construct, in a deterministic distributed way, a backbone structure on the top of a given wireless network, which can be used for efficient transformation of many algorithms designed in a simpler model of ad hoc broadcast networks without interference into the SINR physical model with uniform power of stations. The time cost of the backbone data structure construction is only O(Δ polylog N) rounds, where Δ is roughly the network density and {1,...,N} is the range of identifiers (IDs) and thus N is an upper bound on the number of nodes in the whole network. The core of the construction is a novel combinatorial structure called SINR-selector, which is introduced in this paper. We demonstrate the power of the backbone data structure by using it for obtaining efficient O(D + Δ polylog N) round and O(D + k + Δ polylog N) round deterministic distributed solutions for leader election and multi-broadcast, respectively, where D is the network diameter and k is the number of messages to be disseminated.

AB - The Signal-to-Interference-and-Noise-Ratio (SINR) physical model is one of the most popular models of wireless networks. Despite of the vast amount of study done in design and analysis of centralized algorithms supporting wireless communication under the SINR physical model, little is known about distributed algorithms in this model, especially deterministic ones. In this work we construct, in a deterministic distributed way, a backbone structure on the top of a given wireless network, which can be used for efficient transformation of many algorithms designed in a simpler model of ad hoc broadcast networks without interference into the SINR physical model with uniform power of stations. The time cost of the backbone data structure construction is only O(Δ polylog N) rounds, where Δ is roughly the network density and {1,...,N} is the range of identifiers (IDs) and thus N is an upper bound on the number of nodes in the whole network. The core of the construction is a novel combinatorial structure called SINR-selector, which is introduced in this paper. We demonstrate the power of the backbone data structure by using it for obtaining efficient O(D + Δ polylog N) round and O(D + k + Δ polylog N) round deterministic distributed solutions for leader election and multi-broadcast, respectively, where D is the network diameter and k is the number of messages to be disseminated.

KW - Backbone structure

KW - Distributed algorithms

KW - Leader Election

KW - Multi-message broadcast

KW - SINR

KW - Wireless networks

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

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

U2 - 10.1007/978-3-642-33651-5_8

DO - 10.1007/978-3-642-33651-5_8

M3 - Conference contribution

AN - SCOPUS:84868375499

SN - 9783642336508

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

SP - 106

EP - 120

BT - Distributed Computing - 26th International Symposium, DISC 2012, Proceedings

T2 - 26th International Symposium on Distributed Computing, DISC 2012

Y2 - 16 October 2012 through 18 October 2012

ER -