| DOI | Trouver le DOI : https://doi.org/10.1109/TCOMM.2013.111213.130235 |
|---|
| Auteur | Rechercher : Zou, Y.; Rechercher : Wang, X.; Rechercher : Shen, W.1 |
|---|
| Affiliation | - Conseil national de recherches du Canada
|
|---|
| Format | Texte, Article |
|---|
| Sujet | Achievable secrecy rates; Cognitive base stations; Cognitive radio network; Cognitive transmissions; Diversity order; Multiuser scheduling; Physical-layer securities; Quality of Service constraints; Cognitive radio; Electric circuit breakers; Probability; Quality of service; Radio systems; Rayleigh fading; Scheduling |
|---|
| Résumé | In this paper, we consider a cognitive radio network that consists of one cognitive base station (CBS) and multiple cognitive users (CUs) in the presence of multiple eavesdroppers, where CUs transmit their data packets to CBS under a primary user's quality of service (QoS) constraint while the eavesdroppers attempt to intercept the cognitive transmissions from CUs to CBS. We investigate the physical-layer security against eavesdropping attacks in the cognitive radio network and propose the user scheduling scheme to achieve multiuser diversity for improving the security level of cognitive transmissions with a primary QoS constraint. Specifically, a cognitive user (CU) that satisfies the primary QoS requirement and maximizes the achievable secrecy rate of cognitive transmissions is scheduled to transmit its data packet. For the comparison purpose, we also examine the traditional multiuser scheduling and the artificial noise schemes. We analyze the achievable secrecy rate and intercept probability of the traditional and proposed multiuser scheduling schemes as well as the artificial noise scheme in Rayleigh fading environments. Numerical results show that given a primary QoS constraint, the proposed multiuser scheduling scheme generally outperforms the traditional multiuser scheduling and the artificial noise schemes in terms of the achievable secrecy rate and intercept probability. In addition, we derive the diversity order of the proposed multiuser scheduling scheme through an asymptotic intercept probability analysis and prove that the full diversity is obtained by using the proposed multiuser scheduling. © 2013 IEEE. |
|---|
| Date de publication | 2013 |
|---|
| Dans | |
|---|
| Langue | anglais |
|---|
| Publications évaluées par des pairs | Oui |
|---|
| Numéro NPARC | 21270913 |
|---|
| Exporter la notice | Exporter en format RIS |
|---|
| Signaler une correction | Signaler une correction (s'ouvre dans un nouvel onglet) |
|---|
| Identificateur de l’enregistrement | 200126c6-855f-45ad-872c-2a1af72da037 |
|---|
| Enregistrement créé | 2014-02-18 |
|---|
| Enregistrement modifié | 2020-04-22 |
|---|
