Truthful online spectrum allocation and auction in multi-channel wireless networks

We propose efficient spectrum channel allocation and auction methods for the online wireless channel scheduling. Assume that each user requests for the exclusive usage of a number of wireless channels for a certain time interval. The scheduler has to decide whether to grant its exclusive usage an how much will be charged. To possibly serve users with higher priority, preemptions are allowed with penalties. We analytically prove that our protocols are efficient, truthful, and they have asymptotically optimum competitive ratios. Our extensive simulations show that they perform almost optimum: most of our methods can achieve more than 50% of the optimum by offline method.