A game-theoretic view on the physical layer security of cognitive radio networks

Ali Houjeij, Walid Saad, Tamer Bascar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

In this paper, we investigate the problem of secure communication between secondary users (SUs) and their serving base station in the presence of multiple eavesdroppers and multiple primary users. We analyze the interactions between the SUs and eavesdroppers using the framework of noncooperative game theory. To solve the formulated game, 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. We study and analyze several properties of the equilibrium resulting from the proposed algorithm. Simulation results show that the proposed approach yields significant improvements of at least 32.7%, in terms of the average secrecy rate per SU, relative to a classical spectrum sharing scheme. Moreover, the results show that the proposed scheme enables the SUs to reach Nash equilibrium with up to 86.5% less computation than standard learning algorithms.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
Pages2095-2099
Number of pages5
DOIs
StatePublished - Dec 1 2013
Event2013 IEEE International Conference on Communications, ICC 2013 - Budapest, Hungary
Duration: Jun 9 2013Jun 13 2013

Other

Other2013 IEEE International Conference on Communications, ICC 2013
CountryHungary
CityBudapest
Period6/9/136/13/13

Fingerprint

Cognitive radio
Game theory
Base stations
Learning algorithms
Secure communication

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Houjeij, A., Saad, W., & Bascar, T. (2013). A game-theoretic view on the physical layer security of cognitive radio networks. In IEEE International Conference on Communications (pp. 2095-2099). [6654835] https://doi.org/10.1109/ICC.2013.6654835

A game-theoretic view on the physical layer security of cognitive radio networks. / Houjeij, Ali; Saad, Walid; Bascar, Tamer.

IEEE International Conference on Communications. 2013. p. 2095-2099 6654835.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Houjeij, A, Saad, W & Bascar, T 2013, A game-theoretic view on the physical layer security of cognitive radio networks. in IEEE International Conference on Communications., 6654835, pp. 2095-2099, 2013 IEEE International Conference on Communications, ICC 2013, Budapest, Hungary, 6/9/13. https://doi.org/10.1109/ICC.2013.6654835
Houjeij A, Saad W, Bascar T. A game-theoretic view on the physical layer security of cognitive radio networks. In IEEE International Conference on Communications. 2013. p. 2095-2099. 6654835 https://doi.org/10.1109/ICC.2013.6654835
Houjeij, Ali ; Saad, Walid ; Bascar, Tamer. / A game-theoretic view on the physical layer security of cognitive radio networks. IEEE International Conference on Communications. 2013. pp. 2095-2099
@inproceedings{f7d90f4eb0d34f6ba578e4751e3bd4cf,
title = "A game-theoretic view on the physical layer security of cognitive radio networks",
abstract = "In this paper, we investigate the problem of secure communication between secondary users (SUs) and their serving base station in the presence of multiple eavesdroppers and multiple primary users. We analyze the interactions between the SUs and eavesdroppers using the framework of noncooperative game theory. To solve the formulated game, 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. We study and analyze several properties of the equilibrium resulting from the proposed algorithm. Simulation results show that the proposed approach yields significant improvements of at least 32.7{\%}, in terms of the average secrecy rate per SU, relative to a classical spectrum sharing scheme. Moreover, the results show that the proposed scheme enables the SUs to reach Nash equilibrium with up to 86.5{\%} less computation than standard learning algorithms.",
author = "Ali Houjeij and Walid Saad and Tamer Bascar",
year = "2013",
month = "12",
day = "1",
doi = "10.1109/ICC.2013.6654835",
language = "English",
isbn = "9781467331227",
pages = "2095--2099",
booktitle = "IEEE International Conference on Communications",

}

TY - GEN

T1 - A game-theoretic view on the physical layer security of cognitive radio networks

AU - Houjeij, Ali

AU - Saad, Walid

AU - Bascar, Tamer

PY - 2013/12/1

Y1 - 2013/12/1

N2 - In this paper, we investigate the problem of secure communication between secondary users (SUs) and their serving base station in the presence of multiple eavesdroppers and multiple primary users. We analyze the interactions between the SUs and eavesdroppers using the framework of noncooperative game theory. To solve the formulated game, 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. We study and analyze several properties of the equilibrium resulting from the proposed algorithm. Simulation results show that the proposed approach yields significant improvements of at least 32.7%, in terms of the average secrecy rate per SU, relative to a classical spectrum sharing scheme. Moreover, the results show that the proposed scheme enables the SUs to reach Nash equilibrium with up to 86.5% less computation than standard learning algorithms.

AB - In this paper, we investigate the problem of secure communication between secondary users (SUs) and their serving base station in the presence of multiple eavesdroppers and multiple primary users. We analyze the interactions between the SUs and eavesdroppers using the framework of noncooperative game theory. To solve the formulated game, 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. We study and analyze several properties of the equilibrium resulting from the proposed algorithm. Simulation results show that the proposed approach yields significant improvements of at least 32.7%, in terms of the average secrecy rate per SU, relative to a classical spectrum sharing scheme. Moreover, the results show that the proposed scheme enables the SUs to reach Nash equilibrium with up to 86.5% less computation than standard learning algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84891365081&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84891365081&partnerID=8YFLogxK

U2 - 10.1109/ICC.2013.6654835

DO - 10.1109/ICC.2013.6654835

M3 - Conference contribution

SN - 9781467331227

SP - 2095

EP - 2099

BT - IEEE International Conference on Communications

ER -