Online Double Auction for Wireless Spectrum Allocation With General Conflict Graph

Abstract

The spectrum usage often comes in an online fashion. Considering the selfish behaviors of both primary users(PUs) and sencond users(SUs), we design <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">online</i> double spectrum allocation methods. We propose a truthful online double auction for spectrum allocation. Preempting existing spectrum usage is <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">not</i> allowed. We design a strategyproof mechanism for both the primary user side and the SU side. In previous studies, users who do not interfere with each other have not been reasonably allocated to use channels. There is one and only one user on the used spectrum channel at a certain time, which will result in discarding many user requests. Our model allows multiple users to use a spectrum channel at the same time. Aiming at the shortcomings of previous research, we propose the concept of grouping for online auctions, so that all SUs that do not interfere with each other can use spectrum channels at the same time. This will greatly increase the number of users who use the spectrum at the same time. We thus increase the utilization rate of the user market, and a large number of users will not be idle and abandoned.In the design of our experiments, the grouping model proposed in this paper has obtained at least <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"><tex-math notation="LaTeX">$43{\%}$</tex-math></inline-formula> utilization rate on the set channel, and our experiments have obtained good generality for different interference radius.