File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Adaptive topology-transparent distributed scheduling in wireless networks

TitleAdaptive topology-transparent distributed scheduling in wireless networks
Authors
KeywordsAdaptive algorithms
Distributed scheduling
TDMA
Topology-transparent
Wireless networks
Issue Date2010
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
Ieee International Conference On Communications, 2010 How to Cite?
AbstractTransmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (TDMA) frame length. Most of the scheduling algorithms are topology-dependent. They are generally graph-based and depend on the exact network topology information. Thus, they cannot adapt well to the dynamic wireless environment. In contrast, topology-transparent TDMA scheduling algorithms do not need detailed topology information. However, these algorithms offer very low minimum throughput. The objective of this work is to propose an adaptive topology-transparent scheduling algorithm to offer better throughput performance. With our algorithm, each node finds a transmission schedule so as to reduce the transmission conflicts and adapt better to the changing network environment. The simulation results show that the performance of our algorithm is better than the existing topology-transparent algorithms. ©2010 IEEE.
DescriptionProceedings of the IEEE International Conference on Communications, 2010, p. 1-5
Persistent Identifierhttp://hdl.handle.net/10722/98883
ISSN
References

 

DC FieldValueLanguage
dc.contributor.authorSun, Qen_HK
dc.contributor.authorLi, VOKen_HK
dc.contributor.authorLeung, KCen_HK
dc.date.accessioned2010-09-25T18:06:17Z-
dc.date.available2010-09-25T18:06:17Z-
dc.date.issued2010en_HK
dc.identifier.citationIeee International Conference On Communications, 2010en_HK
dc.identifier.issn0536-1486en_HK
dc.identifier.urihttp://hdl.handle.net/10722/98883-
dc.descriptionProceedings of the IEEE International Conference on Communications, 2010, p. 1-5-
dc.description.abstractTransmission scheduling is a key design problem in wireless multi-hop networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time division multiple access (TDMA) frame length. Most of the scheduling algorithms are topology-dependent. They are generally graph-based and depend on the exact network topology information. Thus, they cannot adapt well to the dynamic wireless environment. In contrast, topology-transparent TDMA scheduling algorithms do not need detailed topology information. However, these algorithms offer very low minimum throughput. The objective of this work is to propose an adaptive topology-transparent scheduling algorithm to offer better throughput performance. With our algorithm, each node finds a transmission schedule so as to reduce the transmission conflicts and adapt better to the changing network environment. The simulation results show that the performance of our algorithm is better than the existing topology-transparent algorithms. ©2010 IEEE.en_HK
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_HK
dc.relation.ispartofIEEE International Conference on Communicationsen_HK
dc.rightsIEEE International Conference on Communications Proceedings. Copyright © IEEE.-
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2010 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.subjectAdaptive algorithmsen_HK
dc.subjectDistributed schedulingen_HK
dc.subjectTDMAen_HK
dc.subjectTopology-transparenten_HK
dc.subjectWireless networksen_HK
dc.titleAdaptive topology-transparent distributed scheduling in wireless networksen_HK
dc.typeConference_Paperen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1044-4556&volume=&spage=1&epage=5&date=2010&atitle=Adaptive+topology-transparent+distributed+scheduling+in+wireless+networks-
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/ICC.2010.5502450en_HK
dc.identifier.scopuseid_2-s2.0-77955345141en_HK
dc.identifier.hkuros169682en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77955345141&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.spage1-
dc.identifier.epage5-
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