Resource allocation in multi-radio multi-channel multi-hop wireless networks

Simone Merlin; Nitin Vaidya; Michele Zorzi

doi:10.1109/INFOCOM.2007.110

Resource allocation in multi-radio multi-channel multi-hop wireless networks

Simone Merlin, Nitin Vaidya, Michele Zorzi

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multi-hop wireless networks is discussed. The goal of maximizing a utility function of the injected traffic, while guaranteeing queue stability, is defined as an optimization problem where the input traffic intensity, channel loads, interface to channel binding and transmission schedules are jointly optimized by a dynamic algorithm. Due to the inherent NP-Hardness of the scheduling problem, a simple centralized heuristic is used to define a lower bound for the performance of the whole optimization algorithm. The behavior of the algorithm for different numbers of channels, interfaces and traffic flows is shown through simulations.

Original language	English (US)
Title of host publication	INFOCOM 2008
Subtitle of host publication	27th IEEE Communications Society Conference on Computer Communications
Pages	1283-1291
Number of pages	9
DOIs	https://doi.org/10.1109/INFOCOM.2007.110
State	Published - 2008
Event	INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States Duration: Apr 13 2008 → Apr 18 2008

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Other

Other	INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
Country/Territory	United States
City	Phoenix, AZ
Period	4/13/08 → 4/18/08

ASJC Scopus subject areas

General Computer Science
Electrical and Electronic Engineering

Online availability

10.1109/INFOCOM.2007.110

Library availability

Discover UIUC Full Text

Cite this

Merlin, S, Vaidya, N & Zorzi, M 2008, Resource allocation in multi-radio multi-channel multi-hop wireless networks. in INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications., 4509705, Proceedings - IEEE INFOCOM, pp. 1283-1291, INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications, Phoenix, AZ, United States, 4/13/08. https://doi.org/10.1109/INFOCOM.2007.110

@inproceedings{9ebe164df430435caacfca8bd732d654,

title = "Resource allocation in multi-radio multi-channel multi-hop wireless networks",

abstract = "A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multi-hop wireless networks is discussed. The goal of maximizing a utility function of the injected traffic, while guaranteeing queue stability, is defined as an optimization problem where the input traffic intensity, channel loads, interface to channel binding and transmission schedules are jointly optimized by a dynamic algorithm. Due to the inherent NP-Hardness of the scheduling problem, a simple centralized heuristic is used to define a lower bound for the performance of the whole optimization algorithm. The behavior of the algorithm for different numbers of channels, interfaces and traffic flows is shown through simulations.",

author = "Simone Merlin and Nitin Vaidya and Michele Zorzi",

year = "2008",

doi = "10.1109/INFOCOM.2007.110",

language = "English (US)",

isbn = "9781424420261",

series = "Proceedings - IEEE INFOCOM",

pages = "1283--1291",

booktitle = "INFOCOM 2008",

note = "INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications ; Conference date: 13-04-2008 Through 18-04-2008",

}

TY - GEN

T1 - Resource allocation in multi-radio multi-channel multi-hop wireless networks

AU - Merlin, Simone

AU - Vaidya, Nitin

AU - Zorzi, Michele

PY - 2008

Y1 - 2008

N2 - A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multi-hop wireless networks is discussed. The goal of maximizing a utility function of the injected traffic, while guaranteeing queue stability, is defined as an optimization problem where the input traffic intensity, channel loads, interface to channel binding and transmission schedules are jointly optimized by a dynamic algorithm. Due to the inherent NP-Hardness of the scheduling problem, a simple centralized heuristic is used to define a lower bound for the performance of the whole optimization algorithm. The behavior of the algorithm for different numbers of channels, interfaces and traffic flows is shown through simulations.

AB - A joint congestion control, channel allocation and scheduling algorithm for multi-channel multi-interface multi-hop wireless networks is discussed. The goal of maximizing a utility function of the injected traffic, while guaranteeing queue stability, is defined as an optimization problem where the input traffic intensity, channel loads, interface to channel binding and transmission schedules are jointly optimized by a dynamic algorithm. Due to the inherent NP-Hardness of the scheduling problem, a simple centralized heuristic is used to define a lower bound for the performance of the whole optimization algorithm. The behavior of the algorithm for different numbers of channels, interfaces and traffic flows is shown through simulations.

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

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

U2 - 10.1109/INFOCOM.2007.110

DO - 10.1109/INFOCOM.2007.110

M3 - Conference contribution

AN - SCOPUS:51349145723

SN - 9781424420261

T3 - Proceedings - IEEE INFOCOM

SP - 1283

EP - 1291

BT - INFOCOM 2008

T2 - INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications

Y2 - 13 April 2008 through 18 April 2008

ER -

Resource allocation in multi-radio multi-channel multi-hop wireless networks

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this