File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1145/1530748.1530810
- Scopus: eid_2-s2.0-70450206068
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Routing in multi-hop wireless mesh networks with bandwidth guarantees
Title | Routing in multi-hop wireless mesh networks with bandwidth guarantees |
---|---|
Authors | |
Keywords | Distributed algo- rithms QoS routing Wireless mesh networks |
Issue Date | 2009 |
Citation | Proceedings Of The International Symposium On Mobile Ad Hoc Networking And Computing (Mobihoc), 2009, p. 353-354 How to Cite? |
Abstract | This paper presents a distributed polynomial algorithm for ̄nding the maximum bandwidth path in Wireless Mesh Net- works (WMNs). Our proposed algorithm can be applied for designing the proactive hop-by-hop routing protocol with bandwidth guarantee. To the best of our knowledge, our work is the ̄rst distributed path calculation algorithm in WMNs. Copyright 2009 ACM. |
Description | Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (MobiHoc’09), New Orleans, USA |
Persistent Identifier | http://hdl.handle.net/10722/62058 |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hou, R | en_HK |
dc.contributor.author | Lui, KS | en_HK |
dc.contributor.author | Chiu, HS | en_HK |
dc.contributor.author | Yeung, KL | en_HK |
dc.contributor.author | Baker, F | en_HK |
dc.date.accessioned | 2010-07-13T03:53:02Z | - |
dc.date.available | 2010-07-13T03:53:02Z | - |
dc.date.issued | 2009 | en_HK |
dc.identifier.citation | Proceedings Of The International Symposium On Mobile Ad Hoc Networking And Computing (Mobihoc), 2009, p. 353-354 | en_HK |
dc.identifier.uri | http://hdl.handle.net/10722/62058 | - |
dc.description | Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (MobiHoc’09), New Orleans, USA | en_HK |
dc.description.abstract | This paper presents a distributed polynomial algorithm for ̄nding the maximum bandwidth path in Wireless Mesh Net- works (WMNs). Our proposed algorithm can be applied for designing the proactive hop-by-hop routing protocol with bandwidth guarantee. To the best of our knowledge, our work is the ̄rst distributed path calculation algorithm in WMNs. Copyright 2009 ACM. | en_HK |
dc.language | eng | en_HK |
dc.relation.ispartof | Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) | en_HK |
dc.subject | Distributed algo- rithms | en_HK |
dc.subject | QoS routing | en_HK |
dc.subject | Wireless mesh networks | en_HK |
dc.title | Routing in multi-hop wireless mesh networks with bandwidth guarantees | en_HK |
dc.type | Conference_Paper | en_HK |
dc.identifier.email | Lui, KS:kslui@eee.hku.hk | en_HK |
dc.identifier.email | Yeung, KL:kyeung@eee.hku.hk | en_HK |
dc.identifier.authority | Lui, KS=rp00188 | en_HK |
dc.identifier.authority | Yeung, KL=rp00204 | en_HK |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1145/1530748.1530810 | en_HK |
dc.identifier.scopus | eid_2-s2.0-70450206068 | en_HK |
dc.identifier.hkuros | 163992 | en_HK |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-70450206068&selection=ref&src=s&origin=recordpage | en_HK |
dc.identifier.spage | 353 | en_HK |
dc.identifier.epage | 354 | en_HK |
dc.identifier.scopusauthorid | Hou, R=35147964300 | en_HK |
dc.identifier.scopusauthorid | Lui, KS=7103390016 | en_HK |
dc.identifier.scopusauthorid | Chiu, HS=7401986712 | en_HK |
dc.identifier.scopusauthorid | Yeung, KL=7202424908 | en_HK |
dc.identifier.scopusauthorid | Baker, F=35316712100 | en_HK |