Regret minimization-based robust game theoretic solution for dynamic spectrum access

摘要

This paper presents a game theoretic solution for hierarchical spectrum sharing between primary users (PUs) and secondary users (SUs) in the presence of cognitive interferers. There exist several forms of uncertainty, including channel conditions, packet traffic, and spectrum occupancy of users across channels. This uncertainty is further aggravated by delays (such as propagation delays observed over satellite links) that make spectrum-efficient communication a challenging task. A robust game theoretic framework is developed for dynamic spectrum access (DSA) management over multiple channels. Cognitive functionalities employed in the game solution include selecting channels for data transmission and performing power control at each user to sustain target rates. By considering random utility functions, the game engine based on regret minimization provides low complexity and fast solutions compared to traditional game solutions based on expected utility maximization. Detailed numerical results with comparison to benchmark schemes (the ideal case and the random case where users have perfect or no knowledge on channel availability, respectively) are provided to show the effectiveness of robust game theory-enabled approach.