File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Hop-by-hop routing in wireless mesh networks with bandwidth guarantees

TitleHop-by-hop routing in wireless mesh networks with bandwidth guarantees
Authors
KeywordsDistributed Algorithm
Proactive Hop-By-Hop Routing
Qos Routing
Wireless Mesh Networks
Issue Date2012
PublisherIEEE.
Citation
IEEE Transactions on Mobile Computing, 2012, v. 11 n. 2, p. 264-277 How to Cite?
Abstract
Wireless Mesh Network (WMN) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-of-service in WMNs. Due to interference among links, bandwidth, a well-known bottleneck metric in wired networks, is neither concave nor additive in wireless networks. We propose a new path weight which captures the available path bandwidth information. We formally prove that our hop-by-hop routing protocol based on the new path weight satisfies the consistency and loop-freeness requirements. The consistency property guarantees that each node makes a proper packet forwarding decision, so that a data packet does traverse over the intended path. Our extensive simulation experiments also show that our proposed path weight outperforms existing path metrics in identifying high-throughput paths. © 2012 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/155717
ISSN
2013 Impact Factor: 2.912
2013 SCImago Journal Rankings: 2.258
ISI Accession Number ID
Funding AgencyGrant Number
Cisco Research Initiative
National Science Fund for Distinguished Young Scholars60725105
National Basic Research Program of China2009CB320404
Program for Changjiang Scholars and Innovative Research Team in University
Funding Information:

This work was supported in part by the Cisco Research Initiative Award, the National Science Fund for Distinguished Young Scholars under Grant 60725105, the National Basic Research Program of China under Grant 2009CB320404, and the Program for Changjiang Scholars and Innovative Research Team in University.

References

 

Author Affiliations
  1. Cisco Systems
  2. The University of Hong Kong
  3. Xidian University
DC FieldValueLanguage
dc.contributor.authorHou, Ren_US
dc.contributor.authorLui, KSen_US
dc.contributor.authorBaker, Fen_US
dc.contributor.authorLi, Jen_US
dc.date.accessioned2012-08-08T08:34:59Z-
dc.date.available2012-08-08T08:34:59Z-
dc.date.issued2012en_US
dc.identifier.citationIEEE Transactions on Mobile Computing, 2012, v. 11 n. 2, p. 264-277en_US
dc.identifier.issn1536-1233en_US
dc.identifier.urihttp://hdl.handle.net/10722/155717-
dc.description.abstractWireless Mesh Network (WMN) has become an important edge network to provide Internet access to remote areas and wireless connections in a metropolitan scale. In this paper, we study the problem of identifying the maximum available bandwidth path, a fundamental issue in supporting quality-of-service in WMNs. Due to interference among links, bandwidth, a well-known bottleneck metric in wired networks, is neither concave nor additive in wireless networks. We propose a new path weight which captures the available path bandwidth information. We formally prove that our hop-by-hop routing protocol based on the new path weight satisfies the consistency and loop-freeness requirements. The consistency property guarantees that each node makes a proper packet forwarding decision, so that a data packet does traverse over the intended path. Our extensive simulation experiments also show that our proposed path weight outperforms existing path metrics in identifying high-throughput paths. © 2012 IEEE.en_US
dc.languageengen_US
dc.publisherIEEE.-
dc.relation.ispartofIEEE Transactions on Mobile Computingen_US
dc.rightsIEEE Transactions on Mobile Computing. Copyright © IEEE-
dc.rights©2012 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectDistributed Algorithmen_US
dc.subjectProactive Hop-By-Hop Routingen_US
dc.subjectQos Routingen_US
dc.subjectWireless Mesh Networksen_US
dc.titleHop-by-hop routing in wireless mesh networks with bandwidth guaranteesen_US
dc.typeArticleen_US
dc.identifier.emailLui, KS:kslui@eee.hku.hken_US
dc.identifier.authorityLui, KS=rp00188en_US
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1109/TMC.2011.25en_US
dc.identifier.scopuseid_2-s2.0-84555189286en_US
dc.identifier.hkuros210662-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84555189286&selection=ref&src=s&origin=recordpageen_US
dc.identifier.volume11en_US
dc.identifier.issue2en_US
dc.identifier.spage264en_US
dc.identifier.epage277en_US
dc.identifier.isiWOS:000298294100009-
dc.publisher.placeUnited Statesen_US
dc.identifier.scopusauthoridHou, R=35147964300en_US
dc.identifier.scopusauthoridLui, KS=7103390016en_US
dc.identifier.scopusauthoridBaker, F=35316712100en_US
dc.identifier.scopusauthoridLi, J=34870112100en_US

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats