File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: A distributed bandwidth reservation algorithm for QoS routing in TDMA-based mobile ad hoc networks

TitleA distributed bandwidth reservation algorithm for QoS routing in TDMA-based mobile ad hoc networks
Authors
Shao, WLi, VOKChan, JS
Issue Date2005
PublisherIEEE.
Citation
2005 Workshop On High Performance Switching And Routing, Hpsr 2005, 2005, p. 317-321 How to Cite?
DOI: http://dx.doi.org/10.1109/HPSR.2005.1503246
AbstractIn this paper, we propose a distributed bandwidth reservation algorithm for QoS routing in mobile ad hoc networks (MANET). The bandwidth resource is organized into TDMA time slots. Previous methods either rely on global information for time slot reservation, which is impractical, or suffer from the shortcut collision problem. In our method, both the hidden terminal problem and the shortcut collision problem are eliminated. Furthermore, our method is performed in a distributed manner, thus has a low computational complexity. Simulation results show that the reserved bandwidth of our algorithm is close to the upper bound. ©2005 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/45800
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorShao, Wen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorChan, JSen_HK
dc.date.accessioned2007-10-30T06:35:45Z-
dc.date.available2007-10-30T06:35:45Z-
dc.date.issued2005en_HK
dc.identifier.citation2005 Workshop On High Performance Switching And Routing, Hpsr 2005, 2005, p. 317-321en_HK
dc.identifier.urihttp://hdl.handle.net/10722/45800-
dc.description.abstractIn this paper, we propose a distributed bandwidth reservation algorithm for QoS routing in mobile ad hoc networks (MANET). The bandwidth resource is organized into TDMA time slots. Previous methods either rely on global information for time slot reservation, which is impractical, or suffer from the shortcut collision problem. In our method, both the hidden terminal problem and the shortcut collision problem are eliminated. Furthermore, our method is performed in a distributed manner, thus has a low computational complexity. Simulation results show that the reserved bandwidth of our algorithm is close to the upper bound. ©2005 IEEE.en_HK
dc.format.extent988109 bytes-
dc.format.extent4152649 bytes-
dc.format.extent23319 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE.en_HK
dc.relation.ispartof2005 Workshop on High Performance Switching and Routing, HPSR 2005en_HK
dc.rights©2005 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.titleA distributed bandwidth reservation algorithm for QoS routing in TDMA-based mobile ad hoc networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailShao, W: wjshao@eee.hku.hken_HK
dc.identifier.emailLi, VOK: vli@eee.hku.hken_HK
dc.identifier.authorityShao, W=rp00165en_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/HPSR.2005.1503246en_HK
dc.identifier.scopuseid_2-s2.0-27644438990en_HK
dc.identifier.hkuros105312-
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-27644438990&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage317en_HK
dc.identifier.epage321en_HK
dc.identifier.scopusauthoridShao, W=15036921000en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridChan, JS=15030954500en_HK

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats