File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Topology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees

TitleTopology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees
Authors
Issue Date2012
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6299180
Citation
The 46th Annual Conference on Information Sciences and Systems (CISS 2012), Princeton, United States, 21-23 March 2012. In Proceedings of the Annual Conference on Information Sciences and Systems, 2012, p. 1-6, article no. 6310759 How to Cite?
Abstract
Transmission scheduling plays a critical role in mobile ad hoc networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most algorithms require information on the network topology and cannot adapt to the dynamic topology in mobile scenarios. To overcome this limitation, topology-transparent scheduling algorithms have been proposed. Most of them, based on Galois field theory, Latin square, and block design theory, assign time slots to users and guarantee that there is at least one collision-free slot in each frame for each user. To the best of our knowledge, none of these topology-transparent algorithms support multiple quality of service (QoS) requirements. In this paper, we exploit the variable-weight optical orthogonal codes (VW-OOC) to design a topology-transparent scheduling algorithm in wireless ad hoc networks with multiple QoS levels. We study the performance, in terms of minimum guaranteed throughput and average throughput, of our proposed algorithm analytically and by extensive simulations.
Persistent Identifierhttp://hdl.handle.net/10722/153070
ISBN

 

Author Affiliations
  1. The University of Hong Kong
  2. Tsinghua University
DC FieldValueLanguage
dc.contributor.authorLiu, Yen_US
dc.contributor.authorZhang, Len_US
dc.contributor.authorLi, VOKen_US
dc.contributor.authorLeung, KCen_US
dc.contributor.authorZhang, W-
dc.date.accessioned2012-07-16T09:55:43Z-
dc.date.available2012-07-16T09:55:43Z-
dc.date.issued2012en_US
dc.identifier.citationThe 46th Annual Conference on Information Sciences and Systems (CISS 2012), Princeton, United States, 21-23 March 2012. In Proceedings of the Annual Conference on Information Sciences and Systems, 2012, p. 1-6, article no. 6310759en_US
dc.identifier.isbn9781467331395-
dc.identifier.urihttp://hdl.handle.net/10722/153070-
dc.description.abstractTransmission scheduling plays a critical role in mobile ad hoc networks. Many transmission scheduling algorithms have been proposed to maximize the spatial reuse and minimize the time-division multiple-access (TDMA) frame length. Most algorithms require information on the network topology and cannot adapt to the dynamic topology in mobile scenarios. To overcome this limitation, topology-transparent scheduling algorithms have been proposed. Most of them, based on Galois field theory, Latin square, and block design theory, assign time slots to users and guarantee that there is at least one collision-free slot in each frame for each user. To the best of our knowledge, none of these topology-transparent algorithms support multiple quality of service (QoS) requirements. In this paper, we exploit the variable-weight optical orthogonal codes (VW-OOC) to design a topology-transparent scheduling algorithm in wireless ad hoc networks with multiple QoS levels. We study the performance, in terms of minimum guaranteed throughput and average throughput, of our proposed algorithm analytically and by extensive simulations.-
dc.languageengen_US
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6299180-
dc.relation.ispartofProceedings of the Annual Conference on Information Sciences and Systemsen_US
dc.rightsProceedings of the Annual Conference on Information Sciences and Systems. Copyright © I E E E.-
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.titleTopology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guaranteesen_US
dc.typeConference_Paperen_US
dc.identifier.emailLi, VOK: vli@eee.hku.hken_US
dc.identifier.emailLeung, KC: kacleung@hkucc.hku.hken_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.identifier.authorityLeung, KC=rp00147en_US
dc.description.naturepublished_or_final_version-
dc.identifier.doi10.1109/CISS.2012.6310759-
dc.identifier.scopuseid_2-s2.0-84868595723-
dc.identifier.hkuros201147en_US
dc.identifier.spage1, article no. 6310759-
dc.identifier.epage6, article no. 6310759-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats