A game-theoretic approach to the security of emerging cognitive radio and small cell networks

Game Theory;Security;Cognitive Radio Networks;Small Cell Networks.

Houjeij, Ali ; Basar ; Tamer

关键词: Game Theory;    Security;    Cognitive Radio Networks;    Small Cell Networks.;   

Others  :  https://www.ideals.illinois.edu/bitstream/handle/2142/44131/Ali_Houjeij.pdf?sequence=1&isAllowed=y

美国|英语

来源: The Illinois Digital Environment for Access to Learning and Scholarship

【 摘 要 】

In this thesis, we provide mathematical formulations for and investigate a number of problems that arise in the security of some emerging wireless technologies. First, we address the problem of secure communication between secondary users (SUs) and their serving base station in the presence of multiple eavesdroppers and multiple primary users (PUs) in cognitive radio networks. We analyze the interactions between the SUs and eavesdroppers using the framework of noncooperative game theory. Assuming that the SUs have full knowledge of the eavesdroppers, we propose a novel secure channel selection algorithm that enables the SUs and eavesdroppers to take distributed decisions so as to reach a Nash equilibrium point. Then, we solve the same problem using a different approach and under a different set of assumptions. Here, the SUs aim at mitigating the effect of eavesdropping by changing their positions using only partial information about the locations of the eavesdroppers. Accordingly, for each SU, we propose an appropriate utility function and then maximize the social welfare of all SUs without interfering with the PUs' radio receivers and taking into account the interference thresholds set by the PUs on each channel. Given these constraints, we formulate the problem so as to optimize the social welfare of all SUs and we present three different algorithms to solve the emerging constrained optimization problem, depending on the possible communication links and the available information. Finally, we investigate the problem of placing small cell base stations (SCBSs) in adversarial heterogeneous wireless networks. We consider a continuum of wireless users facing three types of attacks: eavesdropping, jamming and a combination of both. For each attack, we propose a suitable utility function for the wireless users. Then, we propose a novel optimal placement algorithm for finding the optimal locations of the SCBSs given the underlying security considerations. Simulations were carried out for all the proposed algorithms