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

Tomasz Jurdzinski, Dariusz R. Kowalski

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

26 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationDistributed Computing - 26th International Symposium, DISC 2012, Proceedings
Pages106-120
Number of pages15
DOIs
StatePublished - Nov 9 2012
Externally publishedYes
Event26th International Symposium on Distributed Computing, DISC 2012 - Salvador, Brazil
Duration: Oct 16 2012Oct 18 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7611 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference26th International Symposium on Distributed Computing, DISC 2012
CountryBrazil
CitySalvador
Period10/16/1210/18/12

Keywords

  • Backbone structure
  • Distributed algorithms
  • Leader Election
  • Multi-message broadcast
  • SINR
  • Wireless networks

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Distributed backbone structure for algorithms in the SINR model of wireless networks'. Together they form a unique fingerprint.

  • Cite this

    Jurdzinski, T., & Kowalski, D. R. (2012). Distributed backbone structure for algorithms in the SINR model of wireless networks. In Distributed Computing - 26th International Symposium, DISC 2012, Proceedings (pp. 106-120). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7611 LNCS). https://doi.org/10.1007/978-3-642-33651-5_8