Probabilistic and deterministic path selection in cognitive radio network

Saifan, Ramzi; Msaeed, Anood M.; Darabkh, Khalid A.

doi:10.1049/iet-com.2019.0748

Cited by 19 publications

(5 citation statements)

References 34 publications

(48 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Saifan et al 12 presented the deterministic and probabilistic path recognition protocol (PDPS) intended for the CR networks. This presented PDPS intends at enhancing the path probability recognition in an optimum and best manner eminence having any source and destination.…”

Section: Related Workmentioning

confidence: 99%

QoS aware routing protocol using robust spatial gabriel graph based clustering scheme for ad hoc network

Sugitha¹,

Sivakumar

Hussain

2022

Concurrency and Computation

View full text Add to dashboard Cite

MANET (mobile ad hoc network) comprises of a set of wireless mobile node connected in a self-healing and self-configured network devoid of any fixed infrastructure.The cognitive radio (CR) in the MANET system has been developed for addressing the spectrum congestion issue. However, the existing techniques failed to solves the complex convex problem of channel assignment. To address this issue, the proposed protocol is designed. In the proposed scheme, both primary user (PU) and secondary user (SU) are clustered initially based on the graph theory process. After that, in each cluster, formation of robust spatial Gabriel graph (RS-GG) takes place at which the neighboring nodes are predicted by estimating the weighted end-to-end delay. Once the multi path decision-making condition is satisfied, the route path is established, and the communication takes place based on QoS constraint. This can lead to the enhancement of PDR, network connectivity maintenance and network lifetime. The performance analysis of the proposed methods is carried out for PDR, control overheads, energy consumption, and End-to-End delay and the analysis is compared with existing protocols to prove the effectiveness of proposed design. The simulation outcomes illustrate that the suggested strategy performs well and improves the data transmission.

show abstract

Section: Related Workmentioning

confidence: 99%

QoS aware routing protocol using robust spatial gabriel graph based clustering scheme for ad hoc network

Sugitha¹,

Sivakumar

Hussain

2022

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…The suggested model [11] offers the deterministic and probabilistic path recognition Protocol (PDPS) intended for the CR networks. This presented PDPS intends at enhancing the path probability recognition in an optimum and best manner eminence having any source and destination.…”

Section: Related Workmentioning

confidence: 99%

Qos Aware Routing Protocol Using Robust Spatial Gabriel Graph Based Custering Scheme for Adhoc Network

T.B

Hussain

Sugitha³

2022

Preprint

View full text Add to dashboard Cite

MANET (Mobile Ad hoc Network) comprises of a set of wireless mobile node connected in a self-healing and self-configured network devoid of any fixed infrastructure. The major challenge in this ad-hoc network is that the network should adapts the multicast interactions to the condition at which there is an occurrence of infinite flexibility and repeated failures. The cognitive radio (CR) in the MANET system has been developed for addressing this problem of spectrum congestion thereby enabling the cognitive users to utilize the spectrum that are underused in that way mitigating the interference among the users. Also, at the transmission process there is a problem of primary radio’s protection (PRs). In traditional approaches, the problem of transmission process is rectified by employing an optimal solution based on various algorithms and in turn reduces the PRs interference. However, the existing techniques failed to solves the complex convex problem of channel assignment. To address this issue, the proposed protocol is designed. In the proposed scheme, both primary user (PU) and secondary user (SU) are clustered initially based on the graph theory process. After that, in each cluster, formation of Robust spatial Gabriel Graph takes place at which the neighbouring nodes are predicted by estimating the weighted end-to-end delay approach. Once the multi path decision making condition is satisfied, the route path is established, and the communication takes place based on QoS constraint. This RS-GG can easily update their neighbouring list and is capable of adjusting the transmission power. This can lead to the improved rate of PDR, network connectivity maintenance and too enhances the network lifetime. The performance analysis of the proposed methods is carried out in terms of PDR, control overheads, energy consumption, and End-to-End delay and the analysis is compared with existing protocols to compare the variation and to prove the effectiveness of proposed protocol designed. The simulation outcomes illustrate that the suggested strategy performs well and improves the transmission of data with the best optimal solutions.

show abstract

“…Solving the integrals in (13) and (14) using [36, (3.194.1)], the tight formula of the , 's CDF is going to be as (11) and , 's CDF is going to be as (12).…”

Section: Proofmentioning

confidence: 99%

“…Interestingly, such systems need to be designed carefully, and studies are encouraged to plan the link budget [4][5][6][7]. Designing modern communication systems to provide wide coverage and high data rates cannot be done only with direct transmissions [8][9][10][11]. Therefore, studies considered multi-hop relaying in the designing of these systems to overcome the coverage problem [12].…”

Section: Introductionmentioning

confidence: 99%

Performance evaluation of decode and forward cooperative diversity systems over nakagami-m fading channels with non-identical interferers

Al-Mistarihi

Mohaisen

Darabkh

2020

IJECE

Self Cite

View full text Add to dashboard Cite

The deficiencies of regular cooperative relaying schemes were the main reason behind the development of Incremental Relaying (IR). Fixed relaying is one of the regular cooperative relaying schemes and it relies on using the relay node to help in transmitting the signal of the source towards the destination despite the channel’s condition. However, adaptive relaying methods allocate the channel resources efficiently; thus, such methods have drawn the attention of researchers in recent years. In this study, we analyze a two-hop Decode-and-Forward (DF) IR system’s performance via Nakagami-m fading channels with the existence of the several L distinguishable interferers placed close to the destination which diminishes the overall performance of the system due to the co-channel interference. Tight formulas for the Bit Error Rate (BER) and the Outage Probability (OP) are drawn. The assumptions are consolidated by numerical calculations.

show abstract

Probabilistic and deterministic path selection in cognitive radio network

Cited by 19 publications

References 34 publications

QoS aware routing protocol using robust spatial gabriel graph based clustering scheme for ad hoc network

QoS aware routing protocol using robust spatial gabriel graph based clustering scheme for ad hoc network

Qos Aware Routing Protocol Using Robust Spatial Gabriel Graph Based Custering Scheme for Adhoc Network

Performance evaluation of decode and forward cooperative diversity systems over nakagami-m fading channels with non-identical interferers

Contact Info

Product

Resources

About