Protocol design and performance analysis for cognitive cooperative networks with multiple antennas

Huang, Yuzhen; Wu, Qihui; Wang, Jinlong; Cheng, Yunpeng

doi:10.1186/1687-1499-2013-70

Cited by 4 publications

(5 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. , Pp,N = µ max p (18) where max{·} and min{·} return the maximum and the minimum of all the values present in their arguments, respectively. The maximum mean primary and secondary service rates are µ max p = 1 − P p,pd min Pp,1, Pp,2, .…”

Section: Random Assignment Decodingmentioning

confidence: 99%

See 1 more Smart Citation

On the design of relay-assisted primary-secondary networks

Shafie

Sultan

Khattab

et al. 2015

2015 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

The use of N cognitive relays to assist primary and secondary transmissions in a time-slotted cognitive setting with one primary user (PU) and one secondary user (SU) is investigated. An overlapped spectrum sensing strategy is proposed for channel sensing, where the SU senses the channel for τ seconds from the beginning of the time slot and the cognitive relays sense the channel for 2τ seconds from the beginning of the time slot, thus providing the SU with an intrinsic priority over the relays. The relays sense the channel over the interval [0, τ ] to detect primary activity and over the interval [τ, 2τ ] to detect secondary activity. The relays help both the PU and SU to deliver their undelivered packets and transmit when both are idle. An optimizationbased formulation with quality of service constraints involving queueing delay is studied. The results show the benefits of relaying and its ability to enhance both primary and secondary performance, especially in the case of no direct link between the PU and the SU transmitters and their respective receivers. Three packet decoding strategies at the relays are also investigated and their performance is compared. 1 The proposed cognitive cooperation protocols and the theoretical development in this paper can be generalized to cognitive radio networks with more PUs and more SUs, in which the PUs and the SUs are operating under time-division multiple access (TDMA) or frequencydivision multiple access (FDMA).

show abstract

Section: Random Assignment Decodingmentioning

confidence: 99%

“…where the inequality E holds with equality when f p,k = 1 for all relays. Since P p,k belongs to the convex set [0, 1] and (18) where max{•} and min{•} return the maximum and the minimum of all the values present in their arguments, respectively. The maximum mean primary and secondary service rates are…”

Section: Random Assignment Decodingmentioning

confidence: 99%

On the design of relay-assisted primary-secondary networks

Shafie

Sultan

Khattab

et al. 2015

2015 IEEE Wireless Communications and Networking Conference (WCNC)

View full text Add to dashboard Cite

show abstract

“…The secondary user's packets arrive according to (8) and are served according to the transmission probabilities calculated via the scheduling algorithm. The resultant average packet delay is compared to the one calculated from the analysis for both Models I and II in Figure 12, and the results verify the correctness of the analysis.…”

Section: Analysis Verificationmentioning

confidence: 99%

“…The number of packets admitted to the secondary user's queue at time slot t (8) α The probability that the secondary user has new packets to transmit…”

Section: Mac Layer Modelmentioning

confidence: 99%

See 1 more Smart Citation

Joint power and rate scheduling for cognitive multi-access networks with imperfect sensing

Saleh

El-Keyi

Nafie

2013

J Wireless Com Network

View full text Add to dashboard Cite

A cognitive multi-access network in which a primary user and a secondary user transmit to a common receiver is considered. The secondary user senses the channel at the beginning of each time slot to determine whether the primary user is active or idle. The sensing is not perfect; hence, the secondary user can miss the detection of an active primary user or erroneously declare an idle primary user as active. The secondary user can vary its transmission rate and power from a time slot to the other. A joint rate and power scheduling algorithm is proposed that minimizes the probability of packet loss of the secondary user under a maximum probability of collision constraint at the primary user and a constraint on the average power transmitted by the secondary user. The case in which no retransmissions are allowed and the cases in which one or both users retransmit the collided packets are also considered. The problem is posed as a linear optimization problem that can be solved efficiently. IntroductionOpportunistic spectrum access has been proposed to overcome the problem of spectrum scarcity. In this frame of work, an unlicensed secondary user attempts to opportunistically access a licensed primary channel in order to use the underutilized spectrum. This network is usually referred to as cognitive radio network. Although cognitive radio is a promising solution of spectrum scarcity problem, maintaining the performance of the licensed primary user unaffected is considered a challenge [1,2]. We consider a time-slotted cognitive network in which a secondary user can transmit simultaneously with an active primary user to a common receiver without adversely affecting the primary user's transmission. The secondary user senses the channel of the primary user at the beginning of each time slot to determine its state. Based on the sensing outcome and a feedback signal at the end of each time slot that indicates the success or failure of the transmission, the secondary user adapts its rate and power to maintain a certain quality of service level for the primary *Correspondence: ghada.hatem@nileu.edu.eg 1 Wireless Intelligent Networks Center (WINC), Nile University, Cairo, Egypt Full list of author information is available at the end of the article user. The adaptation is done via a cross-layer scheduling algorithm that aims to minimize the probability of packet loss of the secondary user under an average power constraint for the secondary user and a quality of service constraint for the primary user.In the last few years, the problem of scheduling for cooperative cognitive networks has been addressed by several authors. In [3], the authors considered a point to multipoint cognitive network in which they maximize the total throughput of the network while maintaining a required signal to interference plus noise ratio for the primary users. They investigated the uplink and downlink power control and channel assignment problem. The problem of power allocation was also investigated in [4] from a game theoretic point of vie...

show abstract