File Download
 
Links for fulltext
(May Require Subscription)
 
Supplementary

Article: Hop-by-hop routing in wireless mesh networks with bandwidth guarantees
  • Basic View
  • Metadata View
  • XML View
TitleHop-by-hop routing in wireless mesh networks with bandwidth guarantees
 
AuthorsHou, R3
Lui, KS2
Baker, F1
Li, J3
 
KeywordsDistributed Algorithm
Proactive Hop-By-Hop Routing
Qos Routing
Wireless Mesh Networks
 
Issue Date2012
 
PublisherIEEE.
 
CitationIEEE Transactions on Mobile Computing, 2012, v. 11 n. 2, p. 264-277 [How to Cite?]
DOI: http://dx.doi.org/10.1109/TMC.2011.25
 
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.
 
ISSN1536-1233
2012 Impact Factor: 2.395
2012 SCImago Journal Rankings: 3.302
 
DOIhttp://dx.doi.org/10.1109/TMC.2011.25
 
ISI Accession Number IDWOS:000298294100009
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.

 
ReferencesReferences in Scopus
 
DC FieldValue
dc.contributor.authorHou, R
 
dc.contributor.authorLui, KS
 
dc.contributor.authorBaker, F
 
dc.contributor.authorLi, J
 
dc.date.accessioned2012-08-08T08:34:59Z
 
dc.date.available2012-08-08T08:34:59Z
 
dc.date.issued2012
 
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.
 
dc.description.naturepublished_or_final_version
 
dc.identifier.citationIEEE Transactions on Mobile Computing, 2012, v. 11 n. 2, p. 264-277 [How to Cite?]
DOI: http://dx.doi.org/10.1109/TMC.2011.25
 
dc.identifier.doihttp://dx.doi.org/10.1109/TMC.2011.25
 
dc.identifier.epage277
 
dc.identifier.hkuros210662
 
dc.identifier.isiWOS:000298294100009
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.

 
dc.identifier.issn1536-1233
2012 Impact Factor: 2.395
2012 SCImago Journal Rankings: 3.302
 
dc.identifier.issue2
 
dc.identifier.scopuseid_2-s2.0-84555189286
 
dc.identifier.spage264
 
dc.identifier.urihttp://hdl.handle.net/10722/155717
 
dc.identifier.volume11
 
dc.languageeng
 
dc.publisherIEEE.
 
dc.publisher.placeUnited States
 
dc.relation.ispartofIEEE Transactions on Mobile Computing
 
dc.relation.referencesReferences in Scopus
 
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 Algorithm
 
dc.subjectProactive Hop-By-Hop Routing
 
dc.subjectQos Routing
 
dc.subjectWireless Mesh Networks
 
dc.titleHop-by-hop routing in wireless mesh networks with bandwidth guarantees
 
dc.typeArticle
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Hou, R</contributor.author>
<contributor.author>Lui, KS</contributor.author>
<contributor.author>Baker, F</contributor.author>
<contributor.author>Li, J</contributor.author>
<date.accessioned>2012-08-08T08:34:59Z</date.accessioned>
<date.available>2012-08-08T08:34:59Z</date.available>
<date.issued>2012</date.issued>
<identifier.citation>IEEE Transactions on Mobile Computing, 2012, v. 11 n. 2, p. 264-277</identifier.citation>
<identifier.issn>1536-1233</identifier.issn>
<identifier.uri>http://hdl.handle.net/10722/155717</identifier.uri>
<description.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. &#169; 2012 IEEE.</description.abstract>
<language>eng</language>
<publisher>IEEE.</publisher>
<relation.ispartof>IEEE Transactions on Mobile Computing</relation.ispartof>
<rights>IEEE Transactions on Mobile Computing. Copyright &#169; IEEE</rights>
<rights>&#169;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</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<subject>Distributed Algorithm</subject>
<subject>Proactive Hop-By-Hop Routing</subject>
<subject>Qos Routing</subject>
<subject>Wireless Mesh Networks</subject>
<title>Hop-by-hop routing in wireless mesh networks with bandwidth guarantees</title>
<type>Article</type>
<description.nature>published_or_final_version</description.nature>
<identifier.doi>10.1109/TMC.2011.25</identifier.doi>
<identifier.scopus>eid_2-s2.0-84555189286</identifier.scopus>
<identifier.hkuros>210662</identifier.hkuros>
<relation.references>http://www.scopus.com/mlt/select.url?eid=2-s2.0-84555189286&amp;selection=ref&amp;src=s&amp;origin=recordpage</relation.references>
<identifier.volume>11</identifier.volume>
<identifier.issue>2</identifier.issue>
<identifier.spage>264</identifier.spage>
<identifier.epage>277</identifier.epage>
<identifier.isi>WOS:000298294100009</identifier.isi>
<publisher.place>United States</publisher.place>
<bitstream.url>http://hub.hku.hk/bitstream/10722/155717/1/Content.pdf</bitstream.url>
</item>
Author Affiliations
  1. Cisco Systems
  2. The University of Hong Kong
  3. Xidian University