File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Auction-based bandwidth allocation and scheduling in noncooperative wireless networks

TitleAuction-based bandwidth allocation and scheduling in noncooperative wireless networks
Authors
KeywordsAuction-based routing
Bandwidth allocation
Scheduling
Non-cooperative Wireless Network
Issue Date2014
PublisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104
Citation
The IEEE International Conference on Communications (ICC 2014), Sydney, Australia, 10-14 June 2014. In I E E E International Conference on Communications, 2014, p. 2556-2561 How to Cite?
AbstractWe investigate bandwidth allocation and scheduling in non-cooperative wireless networks as a mixed integer programming problem. Fast Vickrey-Clarke-Groves (VCG) auction-based bandwidth allocation (FABA), incorporating relaxation-based greedy algorithm (RGA) and split-flow-based algorithm (SFA), is proposed by modifying the traditional VCG auction to make it computationally feasible. With incentives provided by FABA, the dominant strategy of any selfish node in the network is to be cooperative so that the system cost is minimized. We implement FABA via a batching-based mechanism which allocates bandwidth for all call routing requests arriving in a certain batching period simultaneously. Our simulation evaluates the performance in terms of system cost, payment-cost ratio, and setup time.
Persistent Identifierhttp://hdl.handle.net/10722/201223
ISBN
ISSN

 

DC FieldValueLanguage
dc.contributor.authorZhou, Hen_US
dc.contributor.authorLeung, KCen_US
dc.contributor.authorLi, VOKen_US
dc.date.accessioned2014-08-21T07:18:16Z-
dc.date.available2014-08-21T07:18:16Z-
dc.date.issued2014en_US
dc.identifier.citationThe IEEE International Conference on Communications (ICC 2014), Sydney, Australia, 10-14 June 2014. In I E E E International Conference on Communications, 2014, p. 2556-2561en_US
dc.identifier.isbn9781479920037-
dc.identifier.issn1550-3607-
dc.identifier.urihttp://hdl.handle.net/10722/201223-
dc.description.abstractWe investigate bandwidth allocation and scheduling in non-cooperative wireless networks as a mixed integer programming problem. Fast Vickrey-Clarke-Groves (VCG) auction-based bandwidth allocation (FABA), incorporating relaxation-based greedy algorithm (RGA) and split-flow-based algorithm (SFA), is proposed by modifying the traditional VCG auction to make it computationally feasible. With incentives provided by FABA, the dominant strategy of any selfish node in the network is to be cooperative so that the system cost is minimized. We implement FABA via a batching-based mechanism which allocates bandwidth for all call routing requests arriving in a certain batching period simultaneously. Our simulation evaluates the performance in terms of system cost, payment-cost ratio, and setup time.-
dc.languageengen_US
dc.publisherIEEE. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/conhome.jsp?punumber=1000104en_US
dc.relation.ispartofIEEE International Conference on Communicationsen_US
dc.rightsI E E E International Conference on Communications. Copyright © I E E E.en_US
dc.rights©2014 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.en_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectAuction-based routing-
dc.subjectBandwidth allocation-
dc.subjectScheduling-
dc.subjectNon-cooperative Wireless Network-
dc.titleAuction-based bandwidth allocation and scheduling in noncooperative wireless networksen_US
dc.typeConference_Paperen_US
dc.identifier.emailLeung, KC: kacleung@hkucc.hku.hken_US
dc.identifier.emailLi, VOK: vli@eee.hku.hken_US
dc.identifier.authorityLeung, KC=rp00147en_US
dc.identifier.authorityLi, VOK=rp00150en_US
dc.description.naturepostprint-
dc.identifier.doi10.1109/ICC.2014.6883708-
dc.identifier.scopuseid_2-s2.0-84906995133-
dc.identifier.hkuros233572en_US
dc.identifier.hkuros240504-
dc.identifier.spage2556-
dc.identifier.epage2561-
dc.publisher.placeUnited States-
dc.customcontrol.immutablesml 140826-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats