Routing in Wireless Networks with Interferences

Bogdan S. Chlebus, Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski

Research output: Contribution to journalArticle

Abstract

We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into the same node that overlap in time. We consider two classes of adversaries: balanced and unbalanced. We demonstrate that, for each routing algorithm and an unbalanced adversary, the algorithm is unstable against this adversary in some networks. We develop a routing algorithm that has bounded packet latency against each balanced adversary.

Original languageEnglish (US)
Article number7950907
Pages (from-to)2105-2108
Number of pages4
JournalIEEE Communications Letters
Volume21
Issue number9
DOIs
StatePublished - Sep 2017

    Fingerprint

Keywords

  • Wireless network
  • adversarial queuing
  • interference
  • packet latency
  • queue size
  • routing

ASJC Scopus subject areas

  • Modeling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this