Name
Abstract | ||
|---|---|---|
To address the demand of exponentially increasing end users, efficient use of limited spectrum is a necessity. For this, spectrum allocation among co-existing operators in licensed and unlicensed spectrum band is required to cater to the temporal and spatial traffic variations in the wireless network. In this paper, we consider multiple operator spectrum allocation problem via auctions. The classical Vickrey-Clarke-Groves (VCG) approach provides a strategy-proof and social welfare maximizing auction at the cost of high computational complexity which makes it intractable for practical implementation. We propose a sealed bid auction for spectrum allocation, which is computationally tractable and can hence be applied as per the dynamic load variations of the network. We show that the proposed algorithm is strategy-proof. Simulation results are presented to exhibit the performance comparison of the proposed algorithm and the VCG mechanism. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/WCNC.2019.8886155 | 2019 IEEE Wireless Communications and Networking Conference (WCNC) |
Keywords | Field | DocType |
strategy-proof spectrum allocation,multiple operators,end users,licensed spectrum band,unlicensed spectrum band,temporal traffic variations,spatial traffic variations,wireless network,multiple operator spectrum allocation problem,classical Vickrey-Clarke-Groves approach,social welfare maximizing auction,high computational complexity,sealed bid auction | Wireless network,Mathematical optimization,Spectrum management,End user,Common value auction,Vickrey–Clarke–Groves auction,Operator (computer programming),Frequency allocation,Mathematics,Computational complexity theory | Journal |
Volume | ISSN | ISBN |
abs/1812.00192 | 1525-3511 | 978-1-5386-7647-9 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Indu Yadav | 1 | 0 | 0.68 |
| Ankur A. Kulkarni | 2 | 106 | 20.95 |
| A. Karandikar | 3 | 5 | 3.27 |