Conference Paper: Optimal rate assignment strategy to minimize average waiting time in wireless networks

File Download Links for fulltext
(May Require Subscription)
Supplementary
  • Basic View
  • Metadata View
  • XML View
TitleOptimal rate assignment strategy to minimize average waiting time in wireless networks
AuthorsZeng, H1
Hou, R2
Lui, KS1
KeywordsAllocation strategy
Average waiting-time
Bandwidth resource
Critical problems
General networks
Issue Date2011
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000784
CitationThe 2011 IEEE Vehicular Technology Conference (VTC Fall), San Francisco, CA., 5-8 September 2011. In IEEEVTS Vehicular Technology Conference Proceedings, 2011, p. 1-5 [How to Cite?]
DOI: http://dx.doi.org/10.1109/VETECF.2011.6092840
AbstractIn a wireless network that supports multiple flows, allocation of bandwidth resource among the flows is one of the critical problems. Different allocation strategies have been developed based on different optimization objectives. Unfortunately, these objectives may not reflect directly the time needed for a flow to transmit what it wants. In this paper, we define a new objective, average waiting time, that reflects the average time needed for the flows to finish their transmissions. For small networks, we develop an optimal scheme that minimizes the average waiting time. We extend the mechanism for general networks, and simulation results show that it can significantly reduce the average waiting time when compared with other existing mechanisms. © 2011 IEEE.
ISBN978-1-4244-8327-3
ISSN1550-2252
DOIhttp://dx.doi.org/10.1109/VETECF.2011.6092840
ReferencesReferences in Scopus
DC Field
Value
dc.contributor.authorZeng, H
dc.contributor.authorHou, R
dc.contributor.authorLui, KS
dc.date.accessioned2012-08-08T09:01:12Z
dc.date.available2012-08-08T09:01:12Z
dc.date.issued2011
dc.description.abstractIn a wireless network that supports multiple flows, allocation of bandwidth resource among the flows is one of the critical problems. Different allocation strategies have been developed based on different optimization objectives. Unfortunately, these objectives may not reflect directly the time needed for a flow to transmit what it wants. In this paper, we define a new objective, average waiting time, that reflects the average time needed for the flows to finish their transmissions. For small networks, we develop an optimal scheme that minimizes the average waiting time. We extend the mechanism for general networks, and simulation results show that it can significantly reduce the average waiting time when compared with other existing mechanisms. © 2011 IEEE.
dc.description.naturepublished_or_final_version
dc.description.otherThe 2011 IEEE Vehicular Technology Conference (VTC Fall), San Francisco, CA., 5-8 September 2011. In IEEEVTS Vehicular Technology Conference Proceedings, 2011, p. 1-5
dc.identifier.citationThe 2011 IEEE Vehicular Technology Conference (VTC Fall), San Francisco, CA., 5-8 September 2011. In IEEEVTS Vehicular Technology Conference Proceedings, 2011, p. 1-5 [How to Cite?]
DOI: http://dx.doi.org/10.1109/VETECF.2011.6092840
dc.identifier.doihttp://dx.doi.org/10.1109/VETECF.2011.6092840
dc.identifier.epage5
dc.identifier.hkuros210671
dc.identifier.isbn978-1-4244-8327-3
dc.identifier.issn1550-2252
dc.identifier.scopuseid_2-s2.0-83755163598
dc.identifier.spage1
dc.identifier.urihttp://hdl.handle.net/10722/158761
dc.languageeng
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000784
dc.publisher.placeUnited States
dc.relation.ispartofIEEEVTS Vehicular Technology Conference Proceedings
dc.relation.referencesReferences in Scopus
dc.rightsIEEEVTS Vehicular Technology Conference Proceedings. Copyright © IEEE.
dc.rights©2011 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.subjectAllocation strategy
dc.subjectAverage waiting-time
dc.subjectBandwidth resource
dc.subjectCritical problems
dc.subjectGeneral networks
dc.titleOptimal rate assignment strategy to minimize average waiting time in wireless networks
dc.typeConference_Paper
Author Affiliations
  1. The University of Hong Kong
  2. Xidian University