scholarly journals Improving Quality of Service Provisioning of Optimised Cuckoo Search Ad Hoc on-demand Distance Vector Routing Scheme for Cognitive Radio Ad Hoc Networks.

Author(s):  
Ramahlapane Lerato Moila ◽  
Mthulisi velempini

Abstract Spectrum mobility, cloud computing and the Internet of Things (IoTs) create large data sets, while the demand for more spectrum is increasing. Unfortunately, the spectrum is a scarce resource which is being underutilized by licensed users. The cognitive radio network, also known as intelligent radio, is a network that can adjust to environment changes and, detect available channels. It has emerged as a promising solution for the underutilization of the licensed spectrum and overcrowded free spectrum. Furthermore, given spectrum mobility, frequent link breakages impact negatively on the delivery of packets and the performance of the network. Hence there is need to address the routing problem. We therefore investigated which control methods can be utilized to improve the QoS provisioning in CRAHNs to minimize the signal overhead and to increase the achievable throughput.The study integrated the QoS requirements with optimized cuckoo search (OCS) algorithm to enhance the ad hoc on-demand distance vector (AODV) algorithm to establish a scheme we refer to as OCS-AODV. NS 2 simulation were run on Linux operating system. The comparative results show that the proposed scheme performed well in terms of end-to-end delay and throughput. However, the scheme does not backup alternative paths which can be used in the event of link breakages. The route discovery has to be re-initiated again. Though the route discovery process is faster because of the capability of the CS technique, it still degrades the performance of the scheme.

Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3464
Author(s):  
Ramahlapane Lerato Moila ◽  
Mthulisi Velempini

A cognitive radio ad hoc network (CRAHN) is a mobile network that can communicate without any form of centralized infrastructure. The nodes can learn about the environment and make routing decisions. Furthermore, distributed computing, spectrum mobility, and the Internet of Things have created large data sets, which require more spectrum for data transmission. Unfortunately, the spectrum is a scarce resource that underutilized by licensed users, while unlicensed users are overcrowding the free spectrum. The CRAHNs technology has emerged as a promising solution to the underutilization of the spectrum. The focus of this study is to improve the effectiveness and energy consumption of routing in order to address the routing problem of CRAHNs through the implementation of the optimized cuckoo search algorithm. In CRAHNs, the node and spectrum mobility cause some frequent link breakages within the network, which degrades the performance of the routing protocols. This requires a routing solution to this routing problem. The proposed scheme was implemented in NS2 installed in Linux operating system, with a cognitive radio cognitive network (CRCN) patch. From the experimental results, we observed that the proposed OCS-AODV scheme outperformed CS-DSDV and ACO-AODV schemes. It obtained at least 3.87% packet delivery ratio and 2.56% and lower packets lost. The scheme enabled the mobile nodes to adjust accordingly to minimize energy consumption. If not busy, they switch to an idle state to save battery power.


2011 ◽  
Vol 403-408 ◽  
pp. 2556-2559
Author(s):  
Yi Zhang ◽  
Li Jia Chen ◽  
Hui Ying Wei

The unstable areas caused by radio interference or rapidly change of nodes' location always emerge inevitably and unpredictably in the WSN (Wireless Sensor Network) of large scale. They may seriously hinder the route discovery procedures in the network. An improved routing strategy named AONDVjr (Ad hoc On-demand Navigated Distance Vector Junior) which keeps monitoring and exploiting unstable areas in ZigBee networks is proposed in this paper. This scheme selects navigation nodes at the borders of unstable areas by comparing and analyzing the parameters including area stability and node’s depth. The navigation nodes will provide source nodes with latest and short routes through unstable areas and forward data packets to sink node.


CRT(Cognitive radio technology) enhances the utilization of available better spectrum in the channel. So to provide better Quality of Service for the user in this paper the Localizability aided localization(LAL) and Water filling Methodologies are proposed. This paper analyzes the routing protocols like AOMDV(Ad-hoc On-demand Multi-path Distance Vector routing), DSR (Dynamic Source Routing) and AODV (Ad-hoc On-Demand Distance Vector). Considering the AODV as the existing routing protocol, this paper proposed with AOMDV and DSR routing algorithms for Localizability aided localization(LAL) and Water filling methodologies respectively. Current work on improving Quality of Service, the different routing protocols are proposed in this paper. The main factors analyzing in this paper are throughput, PDR( packet delivery ratio) and Delay. The simulation results will confirm the accuracy of the proposed techniques.


The proposed work, Cuckoo Search (CS) and M-Tree based Multicast Ad hoc On-demand Distance Vector (MAODV), is a two-step process, which involves M-Tree construction and optimal multicast route selection. Divisional based Cluster (DIVC), a technique of clustering inspired from Divisive clustering, builts the M-Tree using three constraints, destination flag, path-inclusion factor, and multi-factor. This paper aims to provide optimal multicasting with multiple objectives, such as energy, link lifetime, distance and delay


Author(s):  
May Sayed A. Nouh ◽  
Salwa H. El-ramly ◽  
M. Zaki ◽  
Husein A. A. Elsayed

2020 ◽  
Vol 16 (1) ◽  
pp. 155014772090363
Author(s):  
Qingwen Wang ◽  
Haitao Yu

To alleviate the broadcast storm problem in the route discovery process, this article proposes a novel routing protocol considering the boundary effects for ad hoc networks, named NRP. The novelty of NRP lies in the following: first, NRP defines a forwarding area criterion considering the effects of the node transmission area boundary to reduce the broken links due to the mobility of nodes; second, NRP adopts the idea of a piecewise function to estimate the node degree when the nodes are in the center, borderline, and corner areas, respectively, which considers the effects of both network boundaries and node communication boundaries without broadcasting Hello messages periodically; third, NRP applies the static game forwarding strategy to calculate the forwarding probability during the route discovery process. NRP reduces the redundant retransmissions and collision probability among neighboring nodes, thus improving the forwarding efficiency. The extensive simulation results by NS-2 simulator have shown that NRP performs better than AODV + FDG, AODV + Hello, ad hoc on-demand distance vector, ad hoc on-demand multipath distance vector, and energy-efficient ant-based routing in terms of packet delivery ratio, routing overhead, normalized medium access control load, throughput, and network lifetime.


Sign in / Sign up

Export Citation Format

Share Document