File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Topology-transparent distributed scheduling in multi-hop wireless networks

TitleTopology-transparent distributed scheduling in multi-hop wireless networks
Authors
KeywordsDistributed scheduling
Multi-hop wireless networks
TDMA
Topology-transparent
Issue Date2008
PublisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308
Citation
Globecom - IEEE Global Telecommunications Conference, 2008, p. 5203-5207 How to Cite?
AbstractTransmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most of scheduling algorithms are graph-based, dependent on the exact network topology information and cannot adapt to the dynamic wireless environment. Some topology-independent TDMA scheduling algorithms have been proposed, and do not need accurate topology information. Our proposed algorithm follows a similar approach but with a different design strategy. Instead of minimizing the TDMA frame length, we maximize the minimum expected throughput, and we consider multicasting and broadcasting. The simulation result shows that the performance of our algorithm is better than the conventional TDMA and other existing algorithms in most cases. © 2008 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/61999
References

 

DC FieldValueLanguage
dc.contributor.authorSun, Qen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorLeung, KCen_HK
dc.date.accessioned2010-07-13T03:51:49Z-
dc.date.available2010-07-13T03:51:49Z-
dc.date.issued2008en_HK
dc.identifier.citationGlobecom - IEEE Global Telecommunications Conference, 2008, p. 5203-5207en_HK
dc.identifier.urihttp://hdl.handle.net/10722/61999-
dc.description.abstractTransmission scheduling is a key design problem in wireless multi-hop networks and many scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most of scheduling algorithms are graph-based, dependent on the exact network topology information and cannot adapt to the dynamic wireless environment. Some topology-independent TDMA scheduling algorithms have been proposed, and do not need accurate topology information. Our proposed algorithm follows a similar approach but with a different design strategy. Instead of minimizing the TDMA frame length, we maximize the minimum expected throughput, and we consider multicasting and broadcasting. The simulation result shows that the performance of our algorithm is better than the conventional TDMA and other existing algorithms in most cases. © 2008 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://www.ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000308-
dc.relation.ispartofGLOBECOM - IEEE Global Telecommunications Conferenceen_HK
dc.rights©2008 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 schedulingen_HK
dc.subjectMulti-hop wireless networksen_HK
dc.subjectTDMAen_HK
dc.subjectTopology-transparenten_HK
dc.titleTopology-transparent distributed scheduling in multi-hop wireless networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.emailLi, VOK:vli@eee.hku.hken_HK
dc.identifier.emailLeung, KC:kcleung@eee.hku.hken_HK
dc.identifier.authorityLi, VOK=rp00150en_HK
dc.identifier.authorityLeung, KC=rp00147en_HK
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/GLOCOM.2008.ECP.994en_HK
dc.identifier.scopuseid_2-s2.0-67249124256en_HK
dc.identifier.hkuros144958en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-67249124256&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage5203en_HK
dc.identifier.epage5207en_HK
dc.description.otherProceedings of the IEEE Global Telecommunications Conference (GLOBECOM 2008), New Orleans, LO.,USA, 30 November-4 December 2008.-
dc.identifier.scopusauthoridSun, Q=55231750600en_HK
dc.identifier.scopusauthoridLi, VOK=7202621685en_HK
dc.identifier.scopusauthoridLeung, KC=7401860663en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats