Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

Yousofi, Ahmad; Sabaei, Masoud; Hosseinzadeh, Mehdi

doi:10.4218/etrij.2018-0002

Cited by 4 publications

(3 citation statements)

References 34 publications

(55 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, traditional deterministic routing protocols have many limitations in dealing with unstable links [12]. The studies [13][14][15] showed that opportunistic routing strategies are used more and more widely. It makes full use of the broadcast characteristics and has an obvious advantage over traditional routing in solving unreliable links.…”

Section: Related Workmentioning

confidence: 99%

An Efficient Opportunistic Routing Protocol with Low Latency for Farm Wireless Sensor Networks

Han

Zhu

et al. 2022

Electronics

View full text Add to dashboard Cite

Wireless sensor networks (WSN) can accurately and timely obtain the production information of crops, and provide data basis for intelligent agriculture. The dynamic crop state and unstable climate environment make it difficult to predict the connectivity probability of wireless links. Therefore, this paper studies an energy-saving opportunity routing transmission strategy under the influence of dynamic link interaction. The protocol establishes an importance model based on algebraic connectivity to reduce the energy consumption of network key nodes. At the same time, based on the improved Bellman–Ford algorithm, a method of constructing candidate sets is studied. It converts the opportunistic routing transmission cost of farm WSN into anycast link cost and the remaining opportunistic path cost affected by energy consumption. The priority queue is used to determine the nodes participating in the iteration, thereby reducing the computational overhead. The protocol also designs a backoff strategy considering the current residual energy to select the only forwarding node and reduce the unnecessary packet copies in the transmission process. Simulation results show that the studied method is superior to the existing opportunistic routing schemes in terms of packet overhead, network lifetime, energy consumption, and packet delivery rate.

show abstract

Section: Related Workmentioning

confidence: 99%

An Efficient Opportunistic Routing Protocol with Low Latency for Farm Wireless Sensor Networks

Han

Zhu

et al. 2022

Electronics

View full text Add to dashboard Cite

show abstract

“…Yousofi et al 23 modeled CRN as same as a multigraph first weight was found depending on PU sender's behavior and PU receivers' protection, with subsequent weight depending on the bandwidth of channel. In the subsequent stage, for CRN an ORC is presented which is mentioned as ETED_BEST.…”

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

“…In [22] the author modeled CRN as same as a multigraph rst weight was found depending on PU sender's behavior and PU receivers' protection, with subsequent weight depending on the bandwidth of channel. In the subsequent stage, for CRN an ORC is presented which is mentioned as ETED_BEST.…”

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

Design of optimum criterion for opportunistic multi-hop routing in cognitive radio networks

Cited by 4 publications

References 34 publications

An Efficient Opportunistic Routing Protocol with Low Latency for Farm Wireless Sensor Networks

An Efficient Opportunistic Routing Protocol with Low Latency for Farm Wireless Sensor Networks

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

Contact Info

Product

Resources

About