The Community for Technology Leaders
Green Image
Issue No. 12 - December (2010 vol. 59)
ISSN: 0018-9340
pp: 1691-1702
Ping Xu , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
ShiGuang Wang , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
Xiang-Yang Li , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
It is imperative to design efficient and effective online spectrum allocation methods since requests for spectrums often come in an online fashion. In this paper, we propose SALSA, strategyproof online spectrum admission for wireless networks. We assume that the requests arrival follows the Poisson distribution. Upon receiving an online spectrum request, our protocol will decide immediately whether to grant its exclusive usage or not, and how much the request should pay. Preempting existing spectrum usage is not allowed. We proposed two protocols that have guaranteed performances for two different scenarios: 1) random-arrival case: the bid values and requested time durations follow some distributions that can be learned, or 2) semi-arbitrary-arrival case: the bid values could be arbitrary, but the request arrival sequence is random. We analytically prove that our protocols are strategyproof, and are both approximately social efficient and revenue efficient. Our extensive simulation results show that they perform almost optimum. Our method for semi-arbitrary-arrival model achieves social efficiency and revenue efficiency almost 20-30 percent of the optimum, while it has been proven that no mechanism can achieve social efficiency ratio better than 1/e \simeq 37 \rm percent. Our protocol for the random-arrival case even achieves social efficiency and revenue efficiency two-six times the expected performances by the celebrated VCG mechanism.
Protocols, Resource management, Cost accounting, Wireless networks, Load modeling, Economics, Wireless sensor networks

Ping Xu, ShiGuang Wang and Xiang-Yang Li, "SALSA: Strategyproof Online Spectrum Admissions for Wireless Networks," in IEEE Transactions on Computers, vol. 59, no. 12, pp. 1691-1702, 2010.
166 ms
(Ver 3.3 (11022016))