Practical, distributed channel assignment and routing in dual-radio mesh networks

Aditya Dhananjay, Hui Zhang, Jinyang Li, Lakshminarayanan Subramanian

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

Abstract

Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose high throughput routing paths in the face of lossy links, variable channel conditions and external load. This paper presents ROMA, a practical, distributed channel assignment and routing protocol that achieves good multi-hop path performance between every node and one or more designated gateway nodes in a dual-radio network. ROMA assigns non-overlapping channels to links along each gateway path to eliminate intra-path interference. ROMA reduces inter-path interference by assigning different channels to paths destined for different gateways whenever possible. Evaluations on a 24-node dual-radio testbed show that ROMA achieves high throughput in a variety of scenarios.

Original languageEnglish (US)
Title of host publicationComputer Communication Review
Pages99-110
Number of pages12
Volume39
Edition4
DOIs
StatePublished - 2009
EventACM SIGCOMM 2009 Conference on Data Communication, SIGCOMM 2009 - Barcelona, Spain
Duration: Aug 17 2009Aug 21 2009

Other

OtherACM SIGCOMM 2009 Conference on Data Communication, SIGCOMM 2009
CountrySpain
CityBarcelona
Period8/17/098/21/09

Fingerprint

Throughput
Radio receivers
Testbeds
Routing protocols
Telecommunication links

Keywords

  • Channnel assignment
  • Routing
  • Wireless

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

Practical, distributed channel assignment and routing in dual-radio mesh networks. / Dhananjay, Aditya; Zhang, Hui; Li, Jinyang; Subramanian, Lakshminarayanan.

Computer Communication Review. Vol. 39 4. ed. 2009. p. 99-110.

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

Dhananjay, A, Zhang, H, Li, J & Subramanian, L 2009, Practical, distributed channel assignment and routing in dual-radio mesh networks. in Computer Communication Review. 4 edn, vol. 39, pp. 99-110, ACM SIGCOMM 2009 Conference on Data Communication, SIGCOMM 2009, Barcelona, Spain, 8/17/09. https://doi.org/10.1145/1594977.1592581
Dhananjay, Aditya ; Zhang, Hui ; Li, Jinyang ; Subramanian, Lakshminarayanan. / Practical, distributed channel assignment and routing in dual-radio mesh networks. Computer Communication Review. Vol. 39 4. ed. 2009. pp. 99-110
@inproceedings{b2bd03878b014ed894bb8f1905ed4d6b,
title = "Practical, distributed channel assignment and routing in dual-radio mesh networks",
abstract = "Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose high throughput routing paths in the face of lossy links, variable channel conditions and external load. This paper presents ROMA, a practical, distributed channel assignment and routing protocol that achieves good multi-hop path performance between every node and one or more designated gateway nodes in a dual-radio network. ROMA assigns non-overlapping channels to links along each gateway path to eliminate intra-path interference. ROMA reduces inter-path interference by assigning different channels to paths destined for different gateways whenever possible. Evaluations on a 24-node dual-radio testbed show that ROMA achieves high throughput in a variety of scenarios.",
keywords = "Channnel assignment, Routing, Wireless",
author = "Aditya Dhananjay and Hui Zhang and Jinyang Li and Lakshminarayanan Subramanian",
year = "2009",
doi = "10.1145/1594977.1592581",
language = "English (US)",
volume = "39",
pages = "99--110",
booktitle = "Computer Communication Review",
edition = "4",

}

TY - GEN

T1 - Practical, distributed channel assignment and routing in dual-radio mesh networks

AU - Dhananjay, Aditya

AU - Zhang, Hui

AU - Li, Jinyang

AU - Subramanian, Lakshminarayanan

PY - 2009

Y1 - 2009

N2 - Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose high throughput routing paths in the face of lossy links, variable channel conditions and external load. This paper presents ROMA, a practical, distributed channel assignment and routing protocol that achieves good multi-hop path performance between every node and one or more designated gateway nodes in a dual-radio network. ROMA assigns non-overlapping channels to links along each gateway path to eliminate intra-path interference. ROMA reduces inter-path interference by assigning different channels to paths destined for different gateways whenever possible. Evaluations on a 24-node dual-radio testbed show that ROMA achieves high throughput in a variety of scenarios.

AB - Realizing the full potential of a multi-radio mesh network involves two main challenges: how to assign channels to radios at each node to minimize interference and how to choose high throughput routing paths in the face of lossy links, variable channel conditions and external load. This paper presents ROMA, a practical, distributed channel assignment and routing protocol that achieves good multi-hop path performance between every node and one or more designated gateway nodes in a dual-radio network. ROMA assigns non-overlapping channels to links along each gateway path to eliminate intra-path interference. ROMA reduces inter-path interference by assigning different channels to paths destined for different gateways whenever possible. Evaluations on a 24-node dual-radio testbed show that ROMA achieves high throughput in a variety of scenarios.

KW - Channnel assignment

KW - Routing

KW - Wireless

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

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

U2 - 10.1145/1594977.1592581

DO - 10.1145/1594977.1592581

M3 - Conference contribution

VL - 39

SP - 99

EP - 110

BT - Computer Communication Review

ER -