Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks

Mohammad Aghababaie Alavijeh, Behrouz Maham, Zhu Han, Said Nader-Esfahani

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

5 Citations (Scopus)

Abstract

One of the most significant challenges in cognitive radio networks is to design a framework in which the selfish secondary users are obliged to interact with each other truthfully. Moreover, due to the vulnerability of these networks against the jamming attack, providing the security defense is also challenging. In this paper, we investigate a dynamic stochastic medium consisting of some selfish secondary users and a malicious user. Each secondary user participates in an auction and wish to use the unjammed spectrum, and the malicious user aims at jamming a channel by corrupting the communication link. We design a truthful game amongst the secondary users. Furthermore, we propose a zero sum game between the whole set of secondary users and the malicious user. We prove that this problem can be converted to the randomized two-level auctions in which the first auction allocates the vacant channels, and then the second one assigns the remaining unallocated channels. This solution can be changed to a trustful distributed fashion. Finally, simulation results show that the distributed algorithm with much less complexity has almost similar performances to the centralized one.

Original languageEnglish
Title of host publicationIEEE International Conference on Communications
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages2812-2816
Number of pages5
ISBN (Print)9781467331227
DOIs
Publication statusPublished - 2013
Externally publishedYes
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

Atmospheric spectra
Jamming
Cognitive radio
Parallel algorithms
Telecommunication links

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Alavijeh, M. A., Maham, B., Han, Z., & Nader-Esfahani, S. (2013). Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks. In IEEE International Conference on Communications (pp. 2812-2816). [6654966] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICC.2013.6654966

Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks. / Alavijeh, Mohammad Aghababaie; Maham, Behrouz; Han, Zhu; Nader-Esfahani, Said.

IEEE International Conference on Communications. Institute of Electrical and Electronics Engineers Inc., 2013. p. 2812-2816 6654966.

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

Alavijeh, MA, Maham, B, Han, Z & Nader-Esfahani, S 2013, Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks. in IEEE International Conference on Communications., 6654966, Institute of Electrical and Electronics Engineers Inc., pp. 2812-2816, 2013 IEEE International Conference on Communications, ICC 2013, Budapest, Hungary, 6/9/13. https://doi.org/10.1109/ICC.2013.6654966
Alavijeh MA, Maham B, Han Z, Nader-Esfahani S. Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks. In IEEE International Conference on Communications. Institute of Electrical and Electronics Engineers Inc. 2013. p. 2812-2816. 6654966 https://doi.org/10.1109/ICC.2013.6654966
Alavijeh, Mohammad Aghababaie ; Maham, Behrouz ; Han, Zhu ; Nader-Esfahani, Said. / Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks. IEEE International Conference on Communications. Institute of Electrical and Electronics Engineers Inc., 2013. pp. 2812-2816
@inproceedings{831b3eaae2644859b334e9248a263c9d,
title = "Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks",
abstract = "One of the most significant challenges in cognitive radio networks is to design a framework in which the selfish secondary users are obliged to interact with each other truthfully. Moreover, due to the vulnerability of these networks against the jamming attack, providing the security defense is also challenging. In this paper, we investigate a dynamic stochastic medium consisting of some selfish secondary users and a malicious user. Each secondary user participates in an auction and wish to use the unjammed spectrum, and the malicious user aims at jamming a channel by corrupting the communication link. We design a truthful game amongst the secondary users. Furthermore, we propose a zero sum game between the whole set of secondary users and the malicious user. We prove that this problem can be converted to the randomized two-level auctions in which the first auction allocates the vacant channels, and then the second one assigns the remaining unallocated channels. This solution can be changed to a trustful distributed fashion. Finally, simulation results show that the distributed algorithm with much less complexity has almost similar performances to the centralized one.",
author = "Alavijeh, {Mohammad Aghababaie} and Behrouz Maham and Zhu Han and Said Nader-Esfahani",
year = "2013",
doi = "10.1109/ICC.2013.6654966",
language = "English",
isbn = "9781467331227",
pages = "2812--2816",
booktitle = "IEEE International Conference on Communications",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

TY - GEN

T1 - Efficient anti-jamming truthful spectrum auction among secondary users in cognitive radio networks

AU - Alavijeh, Mohammad Aghababaie

AU - Maham, Behrouz

AU - Han, Zhu

AU - Nader-Esfahani, Said

PY - 2013

Y1 - 2013

N2 - One of the most significant challenges in cognitive radio networks is to design a framework in which the selfish secondary users are obliged to interact with each other truthfully. Moreover, due to the vulnerability of these networks against the jamming attack, providing the security defense is also challenging. In this paper, we investigate a dynamic stochastic medium consisting of some selfish secondary users and a malicious user. Each secondary user participates in an auction and wish to use the unjammed spectrum, and the malicious user aims at jamming a channel by corrupting the communication link. We design a truthful game amongst the secondary users. Furthermore, we propose a zero sum game between the whole set of secondary users and the malicious user. We prove that this problem can be converted to the randomized two-level auctions in which the first auction allocates the vacant channels, and then the second one assigns the remaining unallocated channels. This solution can be changed to a trustful distributed fashion. Finally, simulation results show that the distributed algorithm with much less complexity has almost similar performances to the centralized one.

AB - One of the most significant challenges in cognitive radio networks is to design a framework in which the selfish secondary users are obliged to interact with each other truthfully. Moreover, due to the vulnerability of these networks against the jamming attack, providing the security defense is also challenging. In this paper, we investigate a dynamic stochastic medium consisting of some selfish secondary users and a malicious user. Each secondary user participates in an auction and wish to use the unjammed spectrum, and the malicious user aims at jamming a channel by corrupting the communication link. We design a truthful game amongst the secondary users. Furthermore, we propose a zero sum game between the whole set of secondary users and the malicious user. We prove that this problem can be converted to the randomized two-level auctions in which the first auction allocates the vacant channels, and then the second one assigns the remaining unallocated channels. This solution can be changed to a trustful distributed fashion. Finally, simulation results show that the distributed algorithm with much less complexity has almost similar performances to the centralized one.

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

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

U2 - 10.1109/ICC.2013.6654966

DO - 10.1109/ICC.2013.6654966

M3 - Conference contribution

SN - 9781467331227

SP - 2812

EP - 2816

BT - IEEE International Conference on Communications

PB - Institute of Electrical and Electronics Engineers Inc.

ER -