Analysis of Opportunistic Spectrum Access in Cognitive Ad Hoc Networks

Kalil, Mohamed A.; Al-Mahdi, Hassan; Mitschele‐Thiel, Andreas

doi:10.1007/978-3-642-02205-0_2

Cited by 24 publications

(17 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…method to select and access a channel for a new sender-receiver pair, was assumed to be performed by a centralized entity. A different flavor of the above model has been analyzed in [10], [11], with only PU channels dedicated to OSA network and with a mixture of PU and SU exclusive channels. No SU connection buffering was allowed, however, SU connections were able to switch to an empty SU exclusive channel on the event of channel preemption by PU.…”

Section: B Related Workmentioning

confidence: 99%

“…In [16] another OSA system consisting of only two SUs was considered. No SU connection arrangement process was included in the analysis and two distinct strategies were assumed: (i) with complete SU connection blocking on the arrival of PU (just like in [10], [12]) and (ii) with SU connection buffering on the arrival of PU (just like in [14]). No spectrum sensing and no connection arrangement process was investigated.…”

Section: B Related Workmentioning

confidence: 99%

“…Obviously we can have four combinations of these groups for OSA MAC, which all be considered in the analysis: (i) with no buffering and no channel switching [17] denoted as B 0 S 0 , where SU connections preempted by PU are lost; (ii) with no buffering and channel switching [10], [12], [13] denoted as B 0 S 1 , where SU connections preempted by PU switch to a free channel and connections that cannot find a free channel are blocked; (iii) with buffering and no channel switching [8], [9], [18] denoted as B 1 S 0 , where SU connections preempted by PU are being suspended from the moment of preemption until PU releases the channel; and (iv) with buffering and channel switching [37] denoted as B 1 S 1 , where SU connections preempted by PU first look for free channels, and when no free channels are found then the connection are being buffered until PU leaves the channel. The detailed procedure of distributed channel selection on the event of switching will be described in Section III-C2.…”

Section: A Description Of New Multichannel Mac Protocols For Osamentioning

confidence: 99%

See 2 more Smart Citations

To Buffer or to Switch: Design of Multichannel MAC for OSA Ad Hoc Networks

Park

Pawełczak

Čabrić

2010

2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)

View full text Add to dashboard Cite

We present an analytical framework to assess the effectiveness of different combinations of medium access control (MAC) protocols for multichannel opportunistic spectrum access (OSA) ad hoc networks. As a performance metric we focus on average link layer throughput, and investigate dedicated control channel (DCC) and hopping control channel (HCC) MAC protocol abstractions. For DCC and HCC protocol classes we analyze two distinct strategies of managing active secondary user (SU) connection on the event of primary user (PU) arrival: to buffer the connection until PU leaves, or to switch the existing SU connection to a vacant channel. We come to an interesting conclusion: while, intuitively, OSA MAC protocols that support both SU connection buffering and SU connection switching should obtain the highest throughput, due to the channel switching overhead SU connection buffering alone performs better than the rest of the protocol combinations considered.

show abstract

Section: B Related Workmentioning

confidence: 99%

Section: B Related Workmentioning

confidence: 99%

Section: A Description Of New Multichannel Mac Protocols For Osamentioning

confidence: 99%

See 1 more Smart Citation

To Buffer or to Switch: Design of Multichannel MAC for OSA Ad Hoc Networks

Park

Pawełczak

Čabrić

2010

2010 IEEE Symposium on New Frontiers in Dynamic Spectrum (DySPAN)

View full text Add to dashboard Cite

show abstract

“…Any forced call termination is a waste of resource. In an attempt to minimize these occurrences, [9]- [11] propose to use a buffer to store dropped SUs until a predefined maximum waiting time is reached, [12] addresses the use of unlicensed bands as backup channels for the SUs and [14], [15] suggest channel reservation schemes for PUs and SUs, respectively.…”

Section: Introductionmentioning

confidence: 99%

Analysis of a buffered cognitive wireless network with dynamic spectrum assignment

Kannappa

Ali

Saquib

2014

2014 IEEE International Conference on Communications (ICC)

View full text Add to dashboard Cite

In a cognitive wireless network, the sudden arrival of a primary user (PU) can force one or more secondary users (SU) to terminate their ongoing communication. Buffers can be utilized to prevent them from dropping, but their effectiveness depends on the tolerance of the SUs to the buffer waiting time. In this paper, we propose to dynamically assign service rates to the SUs to complement the gain offered by the network buffers in reducing the dropping probability of the SUs. Our analysis is based on a two-dimensional Markov chain with four state variables. Performance metrics for the SUs such as dropping, blocking and completion probabilities, and the average time spent in buffer are derived. Our analytical results demonstrate that depending on the network condition, the proposed dynamic spectrum assignment scheme is alone capable of reducing the dropping probability substantially. Since the sum of call completion, blocking and dropping probabilities is 1, the reduction of dropping probability of the SUs is achieved by increasing the sum of call blocking and completion probabilities, which not necessarily implies higher blocking or reduced completion probabilities.

show abstract

“…While spectrum sensing is essential for SUs to detect the channel states before utilizing the channels, in [5][6][7][8][9] the authors optimistically assumed perfect channel state information or perfect spectrum sensing. In [10][11][12][13] the authors did take imperfect sensing into consideration.…”

Section: Introductionmentioning

confidence: 99%

Analysis of Cognitive Radio Networks with Imperfect Sensing and Backup Channels

Wang

Adriman

2013

2013 Seventh International Conference on Innovative Mobile and Internet Services in Ubiquitous Computing

View full text Add to dashboard Cite

We study the performance of cognitive radio networks with imperfect spectrum sensing and backup channels (BCs). The cognitive radio network is an opportunistic spectrum access (OSA) network which consists of a primary system serving primary users (PUs) and a secondary system serving secondary users (SUs). There are N primary channels (PCs) licensed to PUs and M BCs dedicated to SUs. The PUs have strict priority over the SUs in utilizing PCs and the SUs first try to opportunistically access the PCs not occupied by the PUs temporarily. In case an SU is blocked from PCs, it then checks the BCs to find a free one. The system is modeled as a three-dimensional continuous-time Markov chain. We precisely specify the state-dependent transition rates due to imperfect sensing by simple recursive functions so that we are able to investigate the performance of the OSA system with imperfect sensing and BCs. Our results suggest that when the SUs opportunistically access the PCs alone with PUs operating in moderate or heavy loading conditions, the performance of SUs may be poor or unacceptable. By using some BCs to accommodate the SU calls blocked from PCs can significantly improve the performance.

show abstract

Analysis of Opportunistic Spectrum Access in Cognitive Ad Hoc Networks

Cited by 24 publications

References 7 publications

To Buffer or to Switch: Design of Multichannel MAC for OSA Ad Hoc Networks

To Buffer or to Switch: Design of Multichannel MAC for OSA Ad Hoc Networks

Analysis of a buffered cognitive wireless network with dynamic spectrum assignment

Analysis of Cognitive Radio Networks with Imperfect Sensing and Backup Channels

Contact Info

Product

Resources

About