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
  • Basic View
  • Metadata View
  • XML View
TitleTopology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees
 
AuthorsLiu, Y2
Zhang, L2
Li, VOK
Leung, KC
Zhang, W2
 
Issue Date2012
 
PublisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6299180
 
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. 6310759 [How to Cite?]
DOI: http://dx.doi.org/10.1109/CISS.2012.6310759
 
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.
 
ISBN9781467331395
 
DOIhttp://dx.doi.org/10.1109/CISS.2012.6310759
 
DC FieldValue
dc.contributor.authorLiu, Y
 
dc.contributor.authorZhang, L
 
dc.contributor.authorLi, VOK
 
dc.contributor.authorLeung, KC
 
dc.contributor.authorZhang, W
 
dc.date.accessioned2012-07-16T09:55:43Z
 
dc.date.available2012-07-16T09:55:43Z
 
dc.date.issued2012
 
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.description.naturepublished_or_final_version
 
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. 6310759 [How to Cite?]
DOI: http://dx.doi.org/10.1109/CISS.2012.6310759
 
dc.identifier.doihttp://dx.doi.org/10.1109/CISS.2012.6310759
 
dc.identifier.epage6, article no. 6310759
 
dc.identifier.hkuros201147
 
dc.identifier.isbn9781467331395
 
dc.identifier.scopuseid_2-s2.0-84868595723
 
dc.identifier.spage1, article no. 6310759
 
dc.identifier.urihttp://hdl.handle.net/10722/153070
 
dc.languageeng
 
dc.publisherI E E E. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6299180
 
dc.publisher.placeUnited States
 
dc.relation.ispartofProceedings of the Annual Conference on Information Sciences and Systems
 
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 Guarantees
 
dc.typeConference_Paper
 
<?xml encoding="utf-8" version="1.0"?>
<item><contributor.author>Liu, Y</contributor.author>
<contributor.author>Zhang, L</contributor.author>
<contributor.author>Li, VOK</contributor.author>
<contributor.author>Leung, KC</contributor.author>
<contributor.author>Zhang, W</contributor.author>
<date.accessioned>2012-07-16T09:55:43Z</date.accessioned>
<date.available>2012-07-16T09:55:43Z</date.available>
<date.issued>2012</date.issued>
<identifier.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</identifier.citation>
<identifier.isbn>9781467331395</identifier.isbn>
<identifier.uri>http://hdl.handle.net/10722/153070</identifier.uri>
<description.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.</description.abstract>
<language>eng</language>
<publisher>I E E E. The Journal&apos;s web site is located at http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6299180</publisher>
<relation.ispartof>Proceedings of the Annual Conference on Information Sciences and Systems</relation.ispartof>
<rights>Proceedings of the Annual Conference on Information Sciences and Systems. Copyright &#169; I E E E.</rights>
<rights>&#169;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.</rights>
<rights>Creative Commons: Attribution 3.0 Hong Kong License</rights>
<title>Topology-Transparent Scheduling in Mobile Ad Hoc Networks Supporting Heterogeneous Quality of Service Guarantees</title>
<type>Conference_Paper</type>
<description.nature>published_or_final_version</description.nature>
<identifier.doi>10.1109/CISS.2012.6310759</identifier.doi>
<identifier.scopus>eid_2-s2.0-84868595723</identifier.scopus>
<identifier.hkuros>201147</identifier.hkuros>
<identifier.spage>1, article no. 6310759</identifier.spage>
<identifier.epage>6, article no. 6310759</identifier.epage>
<publisher.place>United States</publisher.place>
<bitstream.url>http://hub.hku.hk/bitstream/10722/153070/1/Content.pdf</bitstream.url>
</item>
Author Affiliations
  1. The University of Hong Kong
  2. Tsinghua University