Enhancement of clustering routing protocol with addition of Q-routing in cognitive radio ad hoc network

Mohd Zahir, Nor Hafifah (2025) Enhancement of clustering routing protocol with addition of Q-routing in cognitive radio ad hoc network. Masters thesis, Universiti Teknologi MARA (UiTM).

Abstract

As the need for huge capacity, high throughput and low latency from users keeps on growing, the current deployment of 5G spectrum continues to reveal the system's fundamental limitations in comparison to its original expectations. An effective routing protocol must be effectively designed to utilise its maximum radio spectrum capacity and adaptable across diverse application domains by simultaneously utilise various new techniques and technologies such as Cognitive Radio Ad Hoc Networks (CRAHNs) which continue to experience rapid growth. The evolving landscape of CRAHNs poses challenges for identifying optimal routing protocols, as some existing solutions fail to address the unique complexities of these networks. To harness the spectrum efficiently, there is a requirement for large-sized clusters to accommodate more nodes. However, maintaining stability in such large clusters becomes a challenge. Therefore, in order to achieve network scalability while maintaining network stability, a resolution must be discovered in increasing the number of nodes within large clusters. The issue can be resolved while preserving CRAHNs stable and scalable by improving a revised cluster-based routing protocol. The protocol makes use of the capabilities of a Q-routing scheme created specifically for cluster routing in CRAHNs, where performance of networks is the main objective, along with management on the topology of a cluster network. Q-learning, a Reinforcement Learning approach, serves as the foundation for the Q-routing scheme, which aims to improve stability and scalability in dynamic environments. Four performance metrics which are packet delivery ratio, hop count, routing overhead, and throughput are used to evaluate the performance of the revised routing protocol using OMNeT++ by comparing it to AODV. From the simulation results, the revised cluster-based routing protocol effectively selects shorter and more reliable routes, as shown by improved packet delivery ratio, throughput, fewer hops, and lower routing overhead results. As the number of hosts increased, the revised cluster-based routing protocol significantly outperformed AODV in different performance metrics. Clustering and Q-Routing together have greatly improved the routing protocol's overall performance while significantly enhanced the scalability and stability in CRAHNs. This improvement holds the potential to facilitate effective spectrum utilisation and support a variety of application domains in subsequent designs. It is essential to note that simulation results are scenario-dependent, varying across layers and types of traffic. Consequently, while these results provide valuable insights, their accuracy may not fully capture the nuanced behaviour of CRAHNs routing protocols. Future work should prioritise implementing these simulations in real-world scenarios to obtain more accurate assessments of network performance.

Metadata

Item Type: Thesis (Masters)
Creators:
Creators
Email / ID Num.
Mohd Zahir, Nor Hafifah
UNSPECIFIED
Contributors:
Contribution
Name
Email / ID Num.
Thesis advisor
Darus, Mohamad Yusof
UNSPECIFIED
Thesis advisor
Mat Taib, Abidah
UNSPECIFIED
Subjects: Q Science > Q Science (General)
T Technology > TK Electrical engineering. Electronics. Nuclear engineering > Radio frequency identification systems
Divisions: Universiti Teknologi MARA, Shah Alam > Faculty of Computer and Mathematical Sciences
Programme: Master of Science (Computer Science)
Keywords: Cognitive radio ad hoc networks, CRAHNs, Q-routing scheme, Reinforcement learning, Cluster-based routing protocol, Network scalability, AODV
Date: July 2025
URI: https://ir.uitm.edu.my/id/eprint/143809
Edit Item
Edit Item

Download

[thumbnail of 143809.pdf] Text
143809.pdf

Download (260kB)

Digital Copy

Digital (fulltext) is available at:

Physical Copy

Physical status and holdings:
Item Status:

ID Number

143809

Indexing

Statistic

Statistic details