In this study, the implementation of a multicast router protocol with a multilayer and multi-hop consideration on the ad hoc CRN mobile was achieved through the use of a combined expected transmission count metric (ETX) with the Steiner minimal tree (SMT). The conjoined SMT-ETX multicast CRN channel spectrums, which were used for measuring the availability of channels and the time required for data transmission from a given cognitive radio (CR) source to all of the CR destinations nodes was found to have resulted in the most efficient channel that was largely based on the possibility of success (POS) channel assignment scheme's probability success. Apart from demonstrating the best throughput and packet delivery rate performances for SMT-ETX multicast CRN with POS scheme than those of the three multicast router protocol (MASA, MDR and RS) schemes with different primary users (PUs) traffic load and network parameters at Rayleigh fading channel, the SMT-ETX multicast CRN with the decreasing PUs traffic load had also implied a higher chance of achieving the available secondary users channels in the CR network.

https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/iet-com.2019.0595

Performance evaluation of combining SMT-ETX metric with POS scheme for implementing multilayer multicast mobile ad hoc network (MANET) CRN

Cognitive radio network (CRN) is an emerging field of research in wireless communication environment. The basic entities involve primary user (PU), secondary user (SU), and vacant spectrum. PU holds the license of the spectrum whereas SU exploits the unused spectrum in order to construct a network. The CRN solves the inefficiency in spectrum usage in opportunistic manner. Any two SU nodes are called neighbor if they reside within their communication range and spectrum is not in used by PU. It is noticed that the PU nodes select its spectrum, arbitrarily. Therefore, to hold a path from any source to destination is always a challenge in CRN. In this work, we propose a distributed algorithm to design a minimum spanning tree algorithm using bio-inspired method in CRN. The minimum spanning tree is useful in various applications such as, optimization, data dissemination, synchronization, routing etc. for various distributed systems. The correctness proof is included for algorithm verification.

A Bio-Inspired Approach to Construct Minimum Spanning Tree in Cognitive Radio Networks

In this work, the authors propose a novel technique to extend the scope of cognitive radio (CR) networks to multiple source–destination pairs. To accomplish this, a simplified feasible path set is formed and then three types of criteria or methods are employed to reach a solution for the best path for each pair. This set is defined by non-intersecting paths which do not share any relay nodes. This not only solves the problem at hand but also greatly reduces the complexity which leads to a fast solution. The first method uses the maximum probability of success as a means for selecting the best path. In the second method, a fast and simple technique is used by choosing the minimum number of overall hops for path selection. The element with the minimum overall transmission time is selected for data transmission in the third technique. Finally, the proposed methods are compared through simulation to a unicast single user case in terms of throughput and packet delivery rate. The simulation results show that the first method has the best performance while the second method is slightly worse but faster.

https://ietresearch.onlinelibrary.wiley.com/doi/epdf/10.1049/iet-com.2020.0101

Techniques for extending unicast CR networks to multi‐source multi‐destination over Rayleigh fading channels

The increasing interest in cognitive radio ad hoc network (CRAHN) has driven study and development for latest approaches. The minimum spanning trees are advantageous for data broadcasting and disseminating. This article presents an associate in nursing algorithm rule for the construction of minimum spanning tree (MST) in cognitive radio network (CRN). For communication network, MST square measure is used for important network tasks like broadcast, leader election, and synchronization. We tend to be commenced our message and time restriction-based cost or weight estimation efficient distributed algorithm for construction of a minimum spanning tree. Proposed algorithm describes including facilitates of state diagram illustration. The verification demonstration of the proposed algorithm is additionally enclosed.

An Efficient Distributed Approach to Construct a Minimum Spanning Tree in Cognitive Radio Network

The minimum spanning tree is a fundamental problem in distributed networks. We wish to extend this problem into cognitive radio networks. In general, a tree spanner is minimum spanning tree T which has a real-weight with n vertex (or secondary user (SU)) and m edges. It approximately preserves distances to multiple stretch factor 6 in graph G. A tree spanner with good stretch factor may be useful to find the applications in distributed system, communication network, and network design. However, to find valuable tree spanner in CRN is very tough computational task. If we face an edge failure due to randomly appearance of primary user (PU) in cognitive radio network (may be minimum spanning tree), the effort must be afforded to reconstruct a new minimum spanning tree can be excessive. To avoid this drawback, we propose an efficient algorithm in CRN. The method aims to lists all finest feasible edge and applies swapping of edges in order to find MST in CRN. Moreover, the article acquainted and resolved issues related to all finest swap edges of MST in a cognitive radio network.

Akheel M. Firoz

Papers

A Distributed Minimum Spanning Tree for Cognitive Radio Networks