Abstract
In this paper, we study and analyze cooperative cognitive radio networks with arbitrary number of secondary users (SUs). Each SU is considered a prospective relay for the primary user (PU) besides having its own data transmission demand. We consider a multi-packet transmission framework that allows multiple SUs to transmit simultaneously because of dirty-paper coding. We propose power allocation and scheduling policies that optimize the throughput for both PU and SU with minimum energy expenditure. The performance of the system is evaluated in terms of throughput and delay under different opportunistic relay selection policies. Toward this objective, we present a mathematical framework for deriving stability conditions for all queues in the system. Consequently, the throughput of both primary and secondary links is quantified. Furthermore, a moment generating function approach is employed to derive a closed-form expression for the average delay encountered by the PU packets. Results reveal that we achieve better performance in terms of throughput and delay at lower energy cost as compared with equal power allocation schemes proposed earlier in the literature. Extensive simulations are conducted to validate our theoretical findings.
Original language | English (US) |
---|---|
Article number | 7493693 |
Pages (from-to) | 3233-3245 |
Number of pages | 13 |
Journal | IEEE Transactions on Communications |
Volume | 64 |
Issue number | 8 |
DOIs | |
State | Published - Aug 2016 |
Keywords
- Cognitive relaying
- delay
- opportunistic communication
- relay selection
- throughput
ASJC Scopus subject areas
- Electrical and Electronic Engineering