By Topic

Optimal Incentive-Compatible Pricing for Dynamic Bandwidth Trading and Allocation in Efficient Spectrum Management

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sun, Y.S. ; Dept. of Inf. Manage., Nat. Taiwan Univ., Taipei, Taiwan ; Ming-Lung Lu ; Yu-Chun Pan ; Meng Chang Chen

The wireless spectrum is a limited resource. The concepts of cognitive radio and dynamic spectrum allocation (DSA) have been considered as a possible mechanism to improve the efficiency of bandwidth usage and solve the bandwidth deficiency problem. In this work, we propose an open interactive dynamic bandwidth trading model to enable periodic, short-term trading of unused bandwidth by licensed spectrum owners to sublet their surplus resources to service providers that need bandwidth. The model comprises of two phases. The goal of the phase one is to find out the demand of the intended buyers through multiple rounds of learning and revising of the quantity-price schedule. Based on the type distribution of the intended potential buyers, the optimal quantity-price schedule is derived which satisfies the incentive compatibility (aka self-selection) and the individually rational constraints that maximizes the MNO's profit and assures that the quantity-price pair designed for MVNO of a specific type will choose the pair that maximizes its utility. We also present an algorithm to convert the continuous optimal quantity-price schedule to a discrete one so as to provide a simple easy-to-read format for MVNOs' selection. If the total number of bandwidth requests exceeds the total capacity constraint, a bounded knapsack problem is used to resolve for final bandwidth allocation. Lastly, an example is provided to illustrate the process.

Published in:

Global Telecommunications Conference (GLOBECOM 2011), 2011 IEEE

Date of Conference:

5-9 Dec. 2011