Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks

Fan Wu; Vijay Raman; Nitin Vaidya

doi:10.1109/SECON.2010.5508210

Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks

Fan Wu, Vijay Raman, Nitin Vaidya

Electrical and Computer Engineering

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

Original language	English (US)
Title of host publication	SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks
DOIs	https://doi.org/10.1109/SECON.2010.5508210
State	Published - 2010
Event	7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010 - Boston, MA, United States Duration: Jun 21 2010 → Jun 25 2010

Publication series

Name	SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

Other

Other	7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010
Country/Territory	United States
City	Boston, MA
Period	6/21/10 → 6/25/10

ASJC Scopus subject areas

Computer Networks and Communications
Electrical and Electronic Engineering

Online availability

10.1109/SECON.2010.5508210

Library availability

Discover UIUC Full Text

Cite this

Wu, F., Raman, V., & Vaidya, N. (2010). Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks. In SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks Article 5508210 (SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks). https://doi.org/10.1109/SECON.2010.5508210

Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks. / Wu, Fan; Raman, Vijay; Vaidya, Nitin.
SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. 2010. 5508210 (SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks).

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

Wu, F, Raman, V & Vaidya, N 2010, Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks. in SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks., 5508210, SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010, Boston, MA, United States, 6/21/10. https://doi.org/10.1109/SECON.2010.5508210

Wu F, Raman V, Vaidya N. Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks. In SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. 2010. 5508210. (SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks). doi: 10.1109/SECON.2010.5508210

Wu, Fan ; Raman, Vijay ; Vaidya, Nitin. / Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks. SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks. 2010. (SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks).

@inproceedings{eb554b9b376d4539bcbada5cb2f07b7a,

title = "Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks",

author = "Fan Wu and Vijay Raman and Nitin Vaidya",

note = "Copyright: Copyright 2010 Elsevier B.V., All rights reserved.; 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010 ; Conference date: 21-06-2010 Through 25-06-2010",

year = "2010",

doi = "10.1109/SECON.2010.5508210",

language = "English (US)",

isbn = "9781424471515",

series = "SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks",

booktitle = "SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks",

}

TY - GEN

T1 - Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks

AU - Wu, Fan

AU - Raman, Vijay

AU - Vaidya, Nitin

PY - 2010

Y1 - 2010

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

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

U2 - 10.1109/SECON.2010.5508210

DO - 10.1109/SECON.2010.5508210

M3 - Conference contribution

AN - SCOPUS:77955101419

SN - 9781424471515

T3 - SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

BT - SECON 2010 - 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks

T2 - 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, SECON 2010

Y2 - 21 June 2010 through 25 June 2010

ER -

Being opportunistic or being concurrent- On designing channel assignment algorithms in multi-radio, multi-channel wireless mesh networks

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Cite this