Comments on "Analysis of cognitive radio spectrum access with optimal channel reservation

Ahmed, Waqas; Gao, Jason; Suraweera, Himal A.; Faulkner, M.

doi:10.1109/twc.2009.090446

Cited by 69 publications

(59 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The throughput for SUs is defined as the total number of packets sent by all the successfully completed SU calls in a time slot [13]. Let c n and p n be the average number of completed SU calls per time slot and successfully transmitted packets per SU, respectively.…”

Section: Figure 3 State Transition Diagram Of a Crn-discardmentioning

confidence: 99%

Performance Analysis of Cognitive Radio Networks Adopting Packet Discarding or Buffering Policy

Zhang¹,

Li²

2015

IJGDC

View full text Add to dashboard Cite

show abstract

Section: Figure 3 State Transition Diagram Of a Crn-discardmentioning

confidence: 99%

Performance Analysis of Cognitive Radio Networks Adopting Packet Discarding or Buffering Policy

Zhang¹,

Li²

2015

IJGDC

View full text Add to dashboard Cite

show abstract

“…The case of terminating a dropped SU call happens when the system can not accommodate the dropped SU call because of un-successful intra-handoff, i.e., (i + nj) > (nm − n). To compute the forced-termination probability, denoted by P f t , we divide the termination rate by the effective rate of accepting SU calls [8]. Given that r = [(i + nj) − (nm − n)] ongoing SU calls are terminated because of the incoming PU call with rate λ (p) j , the termination rate is equal to (rλ (p) j π i,j ).…”

Section: Local Cellmentioning

confidence: 99%

Performance of cognitive radio spectrum access with intra- and inter-handoff

Yao

Ngoga

Erman

et al. 2012

2012 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

“…(M − 1)N ) · d(i − (M − j − 1)N = k) in which d(·) specifies the condition of the states that result in forced termination [2]. It is assumed that the arrivals of PUs and CUs are Poisson processes with arrival rates l p and l c , respectively, and the corresponding service times are exponentially distributed with rates m p and m c , respectively.…”

Section: Fig 2 Markov Chains Of Proposed Schemementioning

confidence: 99%

“…Performance analysis: Using simulation (for the case of M ¼ 3 and N ¼ 6) the forced termination probability and throughput of the proposed scheme was compared to the CR-network performance of [2] for the two cases of using and not using SH. Fig.…”

Section: Fig 2 Markov Chains Of Proposed Schemementioning

confidence: 99%

Optimal channel allocation for cognitive radios

et al. 2010

View full text Add to dashboard Cite

A channel allocation mechanism for cognitive radios (CRs) is proposed to enable maximum throughput and minimum forced termination probability for CR users (CUs) that are not capable of spectrum handover (SH). SH is an optimal collision-avoidance scheme used by CUs to evacuate from time-slots that will be used by primary users (PUs) based on time-slot assignment (TA) information obtained in advance. The proposed scheme has extensive applicability for CR-networks where SH is not possible owing to PU TA information not being obtainable in advance, which is very common. For CR-networks without SH capability, the proposed scheme enables remarkable throughput performance, equivalent to the level of when SH is used.Introduction: Owing to the rapidly increasing popularity of mobile devices, techniques that can maximise wireless channel utilisation are needed. In this Letter, an optimal cognitive radio (CR) channel allocation scheme is proposed. The objective of the proposed scheme is to minimise forced termination probability (P F ) and maximise throughput (r) of CR users (CUs). The channel is assumed to be time division multiple access (TDMA) based where primary users (PUs) have priority to access the M time-slots of the TDMA frame. The CUs can access the empty time-slots of the PUs, where each time-slot that a PU can use is divided into N CU sub-time-slots. Therefore, assuming that no PUs are using the TDMA frame, a total of NM time-slots can be used by CUs. When a PU accesses a time-slot, it will pre-empt the CUs that have been using that time-slot, which results in forced termination of CUs. When channel utilisation of the PUs is high, there will be very few vacant time-slots for CUs to access and therefore forced termination of CUs will occur unavoidably. Fig. 1 illustrates the PU and CU timeslots of a TDMA frame.

show abstract

Comments on "Analysis of cognitive radio spectrum access with optimal channel reservation

Cited by 69 publications

References 4 publications

Performance Analysis of Cognitive Radio Networks Adopting Packet Discarding or Buffering Policy

Performance Analysis of Cognitive Radio Networks Adopting Packet Discarding or Buffering Policy

Performance of cognitive radio spectrum access with intra- and inter-handoff

Optimal channel allocation for cognitive radios

Contact Info

Product

Resources

About