Paper Info
Title
Reverse spectrum auction algorithm for cellular network offloading.
Abstract
The explosion of mobile traffic and highly dynamic property often make it increasingly stressful for a cellular service provider to provide sufficient cellular spectrum resources to support the dynamic change of traffic demand in a day. In this paper, considering the dynamic characteristics of the cellular network traffic demands, we propose an optimal, truthful reverse auction incentive framework, which can minimize the leasing costs sustained by the mobile network operator at the premise of meeting the traffic demand of each time period. Such an issue is formulated as an Integer Programming (IP) optimization problem and we use an adaptive Lagrangian relaxation algorithm to solve the optimal reverse auction allocation problem. Besides, we propose a payment rule satisfying the truthfulness property (incentive compatibility) and the individual rationality property. Numerical results demonstrate that our proposed adaptive algorithm well captures the economical and networking essence of the reverse auction allocation problem, thus representing a promising approach to solve the optimal reverse auction allocation problem.
Year
DOI
Venue
2017
10.1016/j.adhoc.2016.03.003
Ad Hoc Networks
Keywords
Field
DocType
Cellular offloading,Spectrum auction,Payment rule,Adaptive Lagrangian relaxation
Mobile network operator,Incentive compatibility,Computer science,Combinatorial auction,Algorithm,Computer network,Cellular network,Lagrangian relaxation,Spectrum auction,Auction algorithm,Reverse auction,Distributed computing
Journal
Volume
Issue
ISSN
58
C
1570-8705
Citations 
PageRank 
References 
0
0.34
17
Authors
3
Name
Order
Citations
PageRank
Feng Zhao11119.07
Xiaofei Xu240870.26
Hongbin Chen3756.30