Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks
Security is a critical issue in cognitive radio (CR) relay networks. Most previous work concentrates on maximizing secrecy capacity (SC) as a criterion to guarantee the security requirements in CR relay networks. However, under the requirement of “green” radio communication, the energy consumption i...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2015-01-01
|
Series: | Mathematical Problems in Engineering |
Online Access: | http://dx.doi.org/10.1155/2015/587104 |
id |
doaj-e3b5df69ecab4ccb960550faa76e012e |
---|---|
record_format |
Article |
spelling |
doaj-e3b5df69ecab4ccb960550faa76e012e2020-11-24T22:48:21ZengHindawi LimitedMathematical Problems in Engineering1024-123X1563-51472015-01-01201510.1155/2015/587104587104Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio NetworksLi Jiang0Hui Tian1State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaState Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, ChinaSecurity is a critical issue in cognitive radio (CR) relay networks. Most previous work concentrates on maximizing secrecy capacity (SC) as a criterion to guarantee the security requirements in CR relay networks. However, under the requirement of “green” radio communication, the energy consumption is largely ignored. This paper proposes a relay selection scheme which jointly considers the best relay selection and dynamic power allocation in order to maximize SC and to minimize energy consumption. Moreover, we consider finite-state Markov channels and residual relay energy in the relay selection and power allocation process. Specifically, the formulation of the proposed relay selection and power allocation scheme is based on the restless bandit problem, which is solved by the primal-dual index heuristic algorithm. Additionally, the obtained optimal relay selection policy has an indexability property that dramatically reduces the computational complexity. Numerical results are presented to show that our proposed scheme has the maximum SC and minimum energy consumption compared to the existing ones.http://dx.doi.org/10.1155/2015/587104 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Li Jiang Hui Tian |
spellingShingle |
Li Jiang Hui Tian Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks Mathematical Problems in Engineering |
author_facet |
Li Jiang Hui Tian |
author_sort |
Li Jiang |
title |
Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks |
title_short |
Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks |
title_full |
Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks |
title_fullStr |
Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks |
title_full_unstemmed |
Energy-Efficient Relay Selection Scheme for Physical Layer Security in Cognitive Radio Networks |
title_sort |
energy-efficient relay selection scheme for physical layer security in cognitive radio networks |
publisher |
Hindawi Limited |
series |
Mathematical Problems in Engineering |
issn |
1024-123X 1563-5147 |
publishDate |
2015-01-01 |
description |
Security is a critical issue in cognitive radio (CR) relay networks. Most previous work concentrates on maximizing secrecy capacity (SC) as a criterion to guarantee the security requirements in CR relay
networks. However, under the requirement of “green” radio communication, the energy consumption is largely ignored. This paper proposes a relay selection scheme which jointly considers the best relay
selection and dynamic power allocation in order to maximize SC and to minimize energy consumption. Moreover, we consider finite-state Markov channels and residual relay energy in the relay selection and power allocation process. Specifically, the formulation of the proposed relay selection and power allocation scheme is based on the restless bandit problem, which is solved by the primal-dual index heuristic algorithm. Additionally, the obtained optimal relay selection policy has an indexability property that dramatically reduces the computational complexity. Numerical results are presented to show that our proposed scheme has the maximum SC and minimum energy consumption compared to the existing ones. |
url |
http://dx.doi.org/10.1155/2015/587104 |
work_keys_str_mv |
AT lijiang energyefficientrelayselectionschemeforphysicallayersecurityincognitiveradionetworks AT huitian energyefficientrelayselectionschemeforphysicallayersecurityincognitiveradionetworks |
_version_ |
1725678585082019840 |