Truthful online spectrum allocation and auction in multi-channel wireless networks

Ping Xu; Xiaohua Xu; Shaojie Tang; Xiang Yang Li

doi:10.1109/INFCOM.2011.5935100

Truthful online spectrum allocation and auction in multi-channel wireless networks

Ping Xu
, Xiaohua Xu
, Shaojie Tang
, Xiang Yang Li

Management Science and Systems

Illinois Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

35 Scopus citations

Abstract

We propose efficient spectrum channel allocation and auction methods for the online wireless channel scheduling. Assume that each user requests for the exclusive usage of a number of wireless channels for a certain time interval. The scheduler has to decide whether to grant its exclusive usage an how much will be charged. To possibly serve users with higher priority, preemptions are allowed with penalties. We analytically prove that our protocols are efficient, truthful, and they have asymptotically optimum competitive ratios. Our extensive simulations show that they perform almost optimum: most of our methods can achieve more than 50% of the optimum by offline method.

Original language	English
Title of host publication	2011 Proceedings IEEE INFOCOM
Pages	26-30
Number of pages	5
DOIs	https://doi.org/10.1109/INFCOM.2011.5935100
State	Published - 2011
Event	IEEE INFOCOM 2011 - Shanghai, China Duration: Apr 10 2011 → Apr 15 2011

Publication series

Name	Proceedings - IEEE INFOCOM
ISSN (Print)	0743-166X

Conference

Conference	IEEE INFOCOM 2011
Country/Territory	China
City	Shanghai
Period	04/10/11 → 04/15/11

Keywords

competitive ratio
mechanisms
online algorithm
Spectrum
strategyproof
wireless networks

Access to Document

10.1109/INFCOM.2011.5935100

Cite this

@inproceedings{aeb36b9e22584fc698d1a621e97c48e1,

title = "Truthful online spectrum allocation and auction in multi-channel wireless networks",

abstract = "We propose efficient spectrum channel allocation and auction methods for the online wireless channel scheduling. Assume that each user requests for the exclusive usage of a number of wireless channels for a certain time interval. The scheduler has to decide whether to grant its exclusive usage an how much will be charged. To possibly serve users with higher priority, preemptions are allowed with penalties. We analytically prove that our protocols are efficient, truthful, and they have asymptotically optimum competitive ratios. Our extensive simulations show that they perform almost optimum: most of our methods can achieve more than 50\% of the optimum by offline method.",

keywords = "competitive ratio, mechanisms, online algorithm, Spectrum, strategyproof, wireless networks",

author = "Ping Xu and Xiaohua Xu and Shaojie Tang and Li, \{Xiang Yang\}",

year = "2011",

doi = "10.1109/INFCOM.2011.5935100",

language = "English",

isbn = "9781424499212",

series = "Proceedings - IEEE INFOCOM",

pages = "26--30",

booktitle = "2011 Proceedings IEEE INFOCOM",

note = "IEEE INFOCOM 2011 ; Conference date: 10-04-2011 Through 15-04-2011",

}

TY - GEN

T1 - Truthful online spectrum allocation and auction in multi-channel wireless networks

AU - Xu, Ping

AU - Xu, Xiaohua

AU - Tang, Shaojie

AU - Li, Xiang Yang

PY - 2011

Y1 - 2011

N2 - We propose efficient spectrum channel allocation and auction methods for the online wireless channel scheduling. Assume that each user requests for the exclusive usage of a number of wireless channels for a certain time interval. The scheduler has to decide whether to grant its exclusive usage an how much will be charged. To possibly serve users with higher priority, preemptions are allowed with penalties. We analytically prove that our protocols are efficient, truthful, and they have asymptotically optimum competitive ratios. Our extensive simulations show that they perform almost optimum: most of our methods can achieve more than 50% of the optimum by offline method.

AB - We propose efficient spectrum channel allocation and auction methods for the online wireless channel scheduling. Assume that each user requests for the exclusive usage of a number of wireless channels for a certain time interval. The scheduler has to decide whether to grant its exclusive usage an how much will be charged. To possibly serve users with higher priority, preemptions are allowed with penalties. We analytically prove that our protocols are efficient, truthful, and they have asymptotically optimum competitive ratios. Our extensive simulations show that they perform almost optimum: most of our methods can achieve more than 50% of the optimum by offline method.

KW - competitive ratio

KW - mechanisms

KW - online algorithm

KW - Spectrum

KW - strategyproof

KW - wireless networks

UR - https://www.scopus.com/pages/publications/79960875406

U2 - 10.1109/INFCOM.2011.5935100

DO - 10.1109/INFCOM.2011.5935100

M3 - Conference contribution

AN - SCOPUS:79960875406

SN - 9781424499212

T3 - Proceedings - IEEE INFOCOM

SP - 26

EP - 30

BT - 2011 Proceedings IEEE INFOCOM

T2 - IEEE INFOCOM 2011

Y2 - 10 April 2011 through 15 April 2011

ER -

Truthful online spectrum allocation and auction in multi-channel wireless networks

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this