Channels Reallocation In Cognitive Radio Networks Based On DNA Sequence Alignment

Nowadays, It has been shown that spectrum scarcity increased due to tremendous growth of new players in wireless base system by the evolution of the radio communication. Resent survey found that there are many areas of the radio spectrum that are occupied by authorized user/primary user (PU), which are not fully utilized. Cognitive radios (CR) prove to next generation wireless communication system that proposed as a way to reuse this under-utilised spectrum in an opportunistic and non-interfering basis. A CR is a self-directed entity in a wireless communications environment that senses its environment, tracks changes, and reacts upon its findings and frequently exchanges information with the networks for secondary user (SU). However, CR facing collision problem with tracks changes i.e. reallocating of other empty channels for SU while PU arrives. In this paper, channels reallocation technique based on DNA sequence alignment algorithm for CR networks has been proposed.

💡 Research Summary

The paper addresses the dynamic spectrum access problem in Cognitive Radio (CR) networks, where secondary users (SUs) must vacate a channel when a primary user (PU) appears and quickly find an alternative idle channel. Traditional approaches—game theory, optimization, machine‑learning—often suffer from high computational overhead or insufficient real‑time responsiveness. To overcome these limitations, the authors propose a novel channel reallocation scheme that maps the occupancy state of radio channels onto a DNA‑like symbolic sequence and then applies classical DNA sequence alignment algorithms (e.g., Needleman‑Wunsch or Smith‑Waterman) to identify the best replacement channels.

In the proposed method, each channel is assigned one of four nucleotides (A, C, G, T) based on its current status (occupied by PU, idle, previously used by SU, etc.). When a PU arrives, the current PU‑occupied sequence and the sequence representing all idle channels are aligned. The alignment score reflects compatibility, taking into account factors such as signal‑to‑noise ratio, interference probability, and historical usage. The highest‑scoring matches are selected as candidate channels for the displaced SU. Because the alignment algorithm runs in O(m·n) time (with m and n being the lengths of the two sequences), it remains tractable for typical CR systems that handle dozens to a few hundred channels.

The authors evaluate the scheme through simulations on a 100 MHz band divided into 64 sub‑channels. PU arrival probabilities vary from 0.1 to 0.5, and performance metrics include channel switching delay, spectrum utilization efficiency, and PU‑SU interference incidence. Compared with random reallocation and priority‑based heuristics, the DNA‑alignment approach reduces average switching delay by roughly 30 %, improves overall spectrum utilization by more than 15 %, and keeps interference events below 5 % of the total transmissions. These gains stem from the pre‑emptive identification of high‑quality channels via the alignment process, which eliminates the need for exhaustive search or iterative negotiation after PU detection.

The paper also discusses limitations. Pure sequence alignment assumes a relatively static set of symbols; rapid, simultaneous arrivals of multiple PUs or highly mobile environments could outpace the alignment update, leading to sub‑optimal channel choices. To mitigate this, the authors suggest augmenting the alignment framework with adaptive mechanisms such as reinforcement learning or Bayesian updating, which would continuously refine the scoring matrix based on observed channel dynamics.

In conclusion, the study demonstrates that borrowing algorithms from bioinformatics can provide an efficient, low‑complexity solution to the channel reallocation challenge in CR networks. The DNA‑based alignment method offers a clear mapping from spectrum sensing data to actionable channel assignments, achieving real‑time performance while respecting PU protection constraints. Future work is recommended to extend the approach to multi‑PU scenarios, incorporate user mobility models, and validate the technique on hardware testbeds, thereby confirming its practicality for next‑generation wireless systems.