scholarly journals A Model to Improve the Effectiveness and Energy Consumption to Address the Routing Problem for Cognitive Radio Ad Hoc Networks by Utilizing an Optimized Cuckoo Search Algorithm

Energies ◽  
2021 ◽  
Vol 14 (12) ◽  
pp. 3464
Author(s):  
Ramahlapane Lerato Moila ◽  
Mthulisi Velempini
Keyword(s):  
Energy Consumption ◽  
Cognitive Radio ◽  
Ad Hoc ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Delivery Ratio ◽  
Routing Problem ◽  
Free Spectrum ◽  
Spectrum Mobility

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.

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.

2021 ◽  
Author(s):  
Ramahlapane Lerato Moila ◽  
Mthulisi velempini
Keyword(s):  
Cognitive Radio ◽  
Ad Hoc ◽  
Large Data ◽  
Cuckoo Search ◽  
Route Discovery ◽  
Routing Problem ◽  
On Demand ◽  
Free Spectrum ◽  
Spectrum Mobility ◽  
Distance Vector

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.

scholarly journals An effective transmit packet coding with trust-based relay nodes in VANETs

2020 ◽  
Vol 9 (2) ◽  
pp. 685-697
Author(s):  
Omar A. Hammood ◽  
Mohd Nizam Mohmad Kahar ◽  
Waleed A. Hammood ◽  
Raed Abdulkareem Hasan ◽  
Mostafa Abdulghfoor Mohammed ◽  
...  
Keyword(s):  
Network Coding ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Search Algorithm ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Delivery Ratio ◽  
Network Resources ◽  
Relay Nodes ◽  
Battery Capacity

Vehicular ad-hoc networks (VANETs) are characterized by limited network resources such as limited bandwidth and battery capacity. Hence, it is necessary that unnecessary use of network resources (such as unnecessary packet transfers) is reduced in such networks so that the available power can be conserved for efficient multicast communications. In this paper, we have presented a Transmit Packet Coding (TPC) Network Coding in VANET to ensure reliable and efficient multicasting. With network coding, the number of transmitted packets over the network can be reduced, ensuring efficient utilization of network devices and resources. Here, the trust-based graph optimization is performed using Cuckoo search algorithm to select the secure relay nodes. The experimental results showed the superiority of the presented approach compared to the existing techniques in terms of throughput, latency, hop delay, packet delivery ratio, network decoder outage probability, and block error rate.

Multi-path selection based on fractional cuckoo search algorithm for QoS aware routing in MANET

Sensor Review ◽  
2019 ◽  
Vol 39 (2) ◽  
pp. 218-232 ◽  
Author(s):  
Rama Rao A. ◽  
Satyananda Reddy ◽  
Valli Kumari V.
Keyword(s):  
Ad Hoc ◽  
Search Algorithm ◽  
Life Time ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Path Selection ◽  
Content Type ◽  
Time Distance ◽  
Multiple Qos Constraints ◽  
Multiple Qos

Purpose Multimedia applications such as digital audio and video have stringent quality of service (QoS) requirement in mobile ad hoc network. To support wide range of QoS, complex routing protocols with multiple QoS constraints are necessary. In QoS routing, the basic problem is to find a path that satisfies multiple QoS constraints. Moreover, mobility, congestion and packet loss in dynamic topology of network also leads to QoS performance degradation of protocol. Design/methodology/approach In this paper, the authors proposed a multi-path selection scheme for QoS aware routing in mobile ad hoc network based on fractional cuckoo search algorithm (FCS-MQARP). Here, multiple QoS constraints energy, link life time, distance and delay are considered for path selection. Findings The experimentation of proposed FCS-MQARP is performed over existing QoS aware routing protocols AOMDV, MMQARP, CS-MQARP using measures such as normalized delay, energy and throughput. The extensive simulation study of the proposed FCS-based multipath selection shows that the proposed QoS aware routing protocol performs better than the existing routing protocol with maximal energy of 99.1501 and minimal delay of 0.0554. Originality/value This paper presents a hybrid optimization algorithm called the FCS algorithm for the multi-path selection. Also, a new fitness function is developed by considering the QoS constraints such as energy, link life time, distance and delay.

Sign in / Sign up

Export Citation Format

Share Document