File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Routing in multi-radio multi-channel multi-hop wireless mesh networks with bandwidth guarantees

TitleRouting in multi-radio multi-channel multi-hop wireless mesh networks with bandwidth guarantees
Authors
Hou, RLui, KSLi, J
KeywordsAvailable bandwidth
Bandwidth guarantee
Channel assignment
Multi-channel
Multi-hop wireless mesh networks
Issue Date2011
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000784
Citation
The IEEE 73rd Vehicular Technology Conference (VTC Spring 2011), Budapest, Hungary, 15-18 May 2011. In IEEEVTS Vehicular Technology Conference Proceedings, 2011, p. 1-5 How to Cite?
DOI: http://dx.doi.org/10.1109/VETECS.2011.5956132
AbstractIn this paper, we propose a new path metric for finding the maximum available bandwidth path in the multiradio multi-channel wireless mesh networks. We formally prove that the path metric is isotonic, which is the necessary and sufficient condition for assuring the proper operation of the routing algorithm. Based on the metric, we develop a routing protocol which jointly considers the path selection and the channel assignment. The time complexity of our routing algorithm is polynomial. We conduct the simulation experiments to compare the proposed metric with the existing metrics for finding the maximum available bandwidth path. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/158718
ISBN
978-1-4244-8331-0
ISSN
1550-2252
2020 SCImago Journal Rankings: 0.277
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorHou, Ren_US
dc.contributor.authorLui, KSen_US
dc.contributor.authorLi, Jen_US
dc.date.accessioned2012-08-08T09:01:01Z-
dc.date.available2012-08-08T09:01:01Z-
dc.date.issued2011en_US
dc.identifier.citationThe IEEE 73rd Vehicular Technology Conference (VTC Spring 2011), Budapest, Hungary, 15-18 May 2011. In IEEEVTS Vehicular Technology Conference Proceedings, 2011, p. 1-5en_US
dc.identifier.isbn978-1-4244-8331-0-
dc.identifier.issn1550-2252en_US
dc.identifier.urihttp://hdl.handle.net/10722/158718-
dc.description.abstractIn this paper, we propose a new path metric for finding the maximum available bandwidth path in the multiradio multi-channel wireless mesh networks. We formally prove that the path metric is isotonic, which is the necessary and sufficient condition for assuring the proper operation of the routing algorithm. Based on the metric, we develop a routing protocol which jointly considers the path selection and the channel assignment. The time complexity of our routing algorithm is polynomial. We conduct the simulation experiments to compare the proposed metric with the existing metrics for finding the maximum available bandwidth path. © 2011 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000784-
dc.relation.ispartofIEEEVTS Vehicular Technology Conference Proceedingsen_US
dc.subjectAvailable bandwidth-
dc.subjectBandwidth guarantee-
dc.subjectChannel assignment-
dc.subjectMulti-channel-
dc.subjectMulti-hop wireless mesh networks-
dc.titleRouting in multi-radio multi-channel multi-hop wireless mesh networks with bandwidth guaranteesen_US
dc.typeConference_Paperen_US
dc.identifier.emailHou, R: rhhou@eee.hku.hken_US
dc.identifier.emailLui, KS: kslui@eee.hku.hk-
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturelink_to_subscribed_fulltexten_US
dc.identifier.doi10.1109/VETECS.2011.5956132en_US
dc.identifier.scopuseid_2-s2.0-80052020042en_US
dc.identifier.hkuros210673-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-80052020042&selection=ref&src=s&origin=recordpageen_US
dc.identifier.spage1-
dc.identifier.epage5-
dc.publisher.placeUnited Statesen_US
dc.description.otherThe IEEE 73rd Vehicular Technology Conference (VTC Spring 2011), Budapest, Hungary, 15-18 May 2011. In IEEEVTS Vehicular Technology Conference Proceedings, 2011, p. 1-5-
dc.identifier.scopusauthoridLi, J=34870112100en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US
dc.identifier.scopusauthoridHou, R=35147964300en_US

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats