Showing papers on "Ad hoc On-Demand Distance Vector Routing published in 2019"

AODV Route Discovery and Route Maintenance in MANETs

Abstract: An Adhoc network is self configuring, self organizing, and infrastructure-less network without any centralized administration. In networking (wired and wireless), routing has been one of the important function we need to concentrate. Routing is the process in which, we will be sending the packets or messages from the source to the destination. In this paper, we will discuss on AODV (Adhoc On-demand Distance Vector) Routing Protocol which is a reactive protocol and it will create the route on-demand. In AODV, there are three types of messages that will govern the working process. They are RREQ, RREP, RERR messages. Here, we will discuss the functioning of AODV and how the process of route discovery and route maintenance takes place.

A Secure, Energy- and SLA-Efficient (SESE) E-Healthcare Framework for Quickest Data Transmission Using Cyber-Physical System.

Abstract: Due to advances in technology, research in healthcare using a cyber-physical system (CPS) opens innovative dimensions of services. In this paper, the authors propose an energy- and service-level agreement (SLA)-efficient cyber physical system for E-healthcare during data transmission services. Furthermore, the proposed phenomenon will be enhanced to ensure the security by detecting and eliminating the malicious devices/nodes involved during the communication process through advances in the ad hoc on-demand distance vector (AODV) protocol. The proposed framework addresses the two security threats, such as grey and black holes, that severely affect network services. Furthermore, the proposed framework used to find the different network metrics such as average qualifying service set (QSS) paths, mean hop and energy efficiency of the quickest path. The framework is simulated by calculating the above metrics in mutual cases i.e., without the contribution of malevolent nodes and with the contribution of malevolent nodes over service time, hop count and energy constraints. Further, variation of SLA and energy shows their expediency in the selection of efficient network metrics.

BP-AODV: Blackhole Protected AODV Routing Protocol for MANETs Based on Chaotic Map

Abstract: Even though the ad-hoc on-demand distance vector (AODV) is a broadly used routing protocol for mobile ad-hoc networks (MANETs), it is vulnerable to a blackhole attack. Lu et al. developed a secure MANET routing protocol called SAODV to address the security weakness associated with the original AODV protocol and to remedy the blackhole attack. Specifically, the SAODV protocol can protect against blackhole attack performed by a malicious node during the routing process. However, it cannot resist the cooperative blackhole attack, in which two nodes are participating together to mount such attack. Therefore, this paper proposes a secure MANET routing protocol called BP-AODV to overcome the security breaches related to the SAODV protocol along with the original AODV protocol. In addition, the BP-AODV is able to protect against a cooperative blackhole attack launched during the routing process and guards against the blackhole attack that might take place during the forwarding process. The BP-AODV is developed by extending the functionality of the AODV protocol along with utilizing the chaotic map features. The experimental results assure that the BP-AODV protocol is more secure than the SAODV protocol and can effectively fight the blackhole attack achieved by a malicious node or cooperative malicious nodes during the routing process. The results also reveal that the BP-AODV can strongly guard against the blackhole attack that occurs during the forwarding process.

Efficient energy optimization in mobile ad hoc network (MANET) using better-quality AODV protocol

Abstract: Mobile Ad hoc Network (MANET) is a collection of nodes formed together to make communication without need of infrastructure. Due to restricted characteristics of MANET has to relay on wireless communication. This causes the battery power is an important factor in MANET to provide reliable communication without any power failure. Many research works has been carried out to improve the battery power to avoid packet dropping or packet loss while transmitting of packets. The battery power optimization in MANET is still not come in to the wrapping up. This research article proposed a method to improve the battery power in MANET and provide the better quality in packet transmission. This is achieved by using AODV protocol with improving the routing strategy in packet transmission. The result was implemented in Network simulator and shows better improvement comparing with the existing power optimization strategy.

Ticket-based QoS routing optimization using genetic algorithm for WSN applications in smart grid

Abstract: Wireless sensor network (WSN) information network in Smart Grid is envisioned to handle diversified traffic such as real-time sensitive data and non-real-time traffic. Therefore, QoS routing protocol in smart grid network is essential. Ticket-based routing (TBR) protocol is a promising protocol because it can select routes based on several desired metrics, for example route cost and delay. However, the original TBR suffers the need for transmitting a huge number of tickets to probe the sensor network and discover the path cost and delay. Genetic algorithm can be used to minimize the number of tickets as well as discovery messages overhead. In this work, we implement genetic algorithm (GA-TBR) at the source sensor node to collect the state information inside the WSN environment of Smart Grid and hence optimize the selection of routes to ensure the required QoS. Extensive simulation experiments have been conducted to investigate the performance of GA-TBR. The simulation results have shown that with few tickets, the proposed algorithm is able to select routes with minimum possible delay and shows 28% improvement compared to ad hoc on demand distance vector routing (AODV) protocol.

Malicious node analysis in MANETS

Abstract: The mobile ad hoc networks (MANETS) are decentralized, multi-hop networks in which the intermediate nodes play an role of routers to pass data packets to destination. The Routing protocols are playing very vital role in effectiveness of MANETS due to mobility and dynamically changing of topology. Due to the nature of broadcast wireless medium and not have central control now many routing protocols are vulnerable to attacks. These attacks are black hole attack, greyhole attack, sinkhole attack, byzantine attack, sleep deprivation attack and wormhole attack. The paper is discussing all these attacks. From these routing protocols, one of protocol is ad hoc on-demand distance vector routing (AODV). It is a very trendy routing protocol and it is very susceptible to black hole attacks. In black hole attack a mobile node mistakenly publicize the route and sinks data packets to incorrect destination instead of sending to accurate destination. It analyzes the related work and position a solution based on analysis.

Secure routing in mobile Ad hoc networks: a predictive approach

Abstract: In recent years, wireless technologies have gained enormous popularity and used vastly in a variety of applications. Mobile Ad hoc Networks (MANETs) are temporary networks which are built for specific purposes; they do not require any pre-established infrastructure. The dynamic nature of these networks makes them more utilizable in ubiquitous computing. These autonomous systems of wireless mobile nodes can be set up anywhere and anytime. However, due to high mobility, absence of centralized authority and open media nature, MANETs are more vulnerable to various security threats. As a result, they are prone to more security issues as compared to the traditional networks. Ad hoc networks are highly susceptible to various types of attacks. Sequence number attacks are such hazardous attacks which greatly diminish the performance of the network in different scenarios. Sequence number attacks suck some or all data packets and discard them. In past few years, various researchers proposed different solutions for detecting the sequence number attacks. In this paper, first we review notable works done by various researchers to detect sequence number attacks. The review thoroughly presents distinct aspects of the proposed approach. In addition, we propose a proactive predictive approach to mitigate sequence number attacks which discovers misbehaving nodes during route discovery phase. The proposed approach suggests modifications in Ad hoc on-demand distance vector (AODV) routing protocol.

Performance Comparison Routing Protocol AODV, DSDV, and AOMDV with Video Streaming In Manet

Abstract: Mobile Adhoc Network (MANET) is a collection of nodes that can communicate with each other via radio waves. Each node in the radio room can be used independently and independently. One of the transmission protocols in manet, UDP, is a protocol that is unreliable or untrusted. UDP allows the application to accept the freedom to delete packages that are very successful for sending video and sound. One of the main problems in MANET is energy, which is very influential in network performance and quality. What needs to be done is the routing protocol selection based on energy parameters and service quality. In this study using a simulation method with NS2 and NAM tools to compare the performance of AODV, DSDV and AOMDV routing protocol with Streaming video. Simulation is done by measuring network size. The results of the study show that AODV routing protocol has the best value of throughput and packet loss compared to DSDV and AOMDV. Whereas based on energy measurement, DSDV protocol routing has the best average information compared to AODV and AOMDV.

Mobile Ad-Hoc Network (MANET) Routing Protocols: A Performance Assessment

Abstract: Mobile Ad Hoc network (MANET) is a collection of mobile devices which form a communication network. There are multiple type of routing protocols that de-signed for MANETs. This paper presents an investigation of four MANET protocols’ performance, namely the Ad Hoc On-Demand Distance Vector (AODV), Destination-Sequenced Distance-Vector (DSDV), Dynamic Source Routing (DSR) and Ad Hoc On-Demand Multipath Distance (AOMDV). These protocols are evaluated using three difference performance metrics; average end-to-end, throughput and packet delivery ratio. Simulations of MANET is conducted to analyze the behavior of these protocols with different node mobility and node speed. From the results, it is indicated that different protocols performs better than the other on different performance metrics. For Average end-to-end metric, AODV is shown as the best performer even with the increment of speed. All four protocols meanwhile shows similar performance when node speed are increased for the throughput performance metric. For the final metric, it is shown that AOMDV returns the highest packet delivery ratio.

A dynamic threshold based algorithm for improving security and performance of AODV under black-hole attack in MANET

Abstract: Mobile Ad hoc network (MANET) is a wireless network which is characterized by dynamic network topology, open medium, multi-hop communication etc. in which each device not only acts as a router but also as a host. Security in the mobile ad-hoc network is one of the most sought-after research topic. The performance of MANET is greatly affected by the presence of malicious nodes in the network. One of the most common attacks in MANET is a denial of service attack in which the source node is not able to communicate with the destination node due to malicious behaviour of the node. The malicious node which drops the packet is known as a black-hole node. In order to mitigate the black-hole attack problem, various techniques have been used by many researchers. In this paper, based on a dynamic sequence number threshold value, MBDP-AODV protocol is used. The main contribution of this paper is the performance evaluation of MBDP-AODV protocol under black-hole attack. Through simulation, it has been found that MBDP-AODV protocol is able to mitigate the impact of black-hole attack under different network density. Although it improves the network performance in terms of packet delivery, throughput and reduces the normalized routing load but it has high routing overhead.

Reliability Factor Based AODV Protocol: Prevention of Black Hole Attack in MANET

Abstract: The characteristic of the ad hoc network that it is formed as per the requirements in absence of any administrator and every node in this network acts as a router makes it prone to attacks. This paper proposes a reliability-based AODV protocol using which malicious node can be prevented. It considers black hole attack in which the malicious node becomes a part of the network by sending fake RREP with high sequence number and drops all the packets, instead of forwarding. The proposed method is successful in increasing packet delivery ratio and throughput, and it also reduces end to end delay in a network.

Modeling Displacement and Direction Aware Ad Hoc On-Demand Distance Vector Routing Standard for Mobile Ad Hoc Networks

Abstract: The mobile ad hoc network (MANETs) is increasingly emerging wireless standards with the immense extent of applications. The MANET routing experiences disputes in terms of their autonomous nature and due to the presence of diverse routing schemes. The reactive routing standards are chosen due to minimized control overheads and expandability but they experience regular path breakdowns because of increased displacement of the nodes. For minimizing the connection breakdowns and to acquire a constant path a fresh reactive routing standard is designed based on hierarchy based displacements. The designed displacement and magnitude aware ad hoc on demand distance vector routing standard intends to address the displacements and magnitude features over the ad hoc networks. The DDC – AODV directs the path identification and path acknowledgment based on the displacement of the contributing nodes and their magnitudes. The NS2 offers two load assessment employing assessments to explore the consequences and benefits of DDC – AODV over the AODV standards.

FAPRP: A Machine Learning Approach to Flooding Attacks Prevention Routing Protocol in Mobile Ad Hoc Networks

Abstract: Request route flooding attack is one of the main challenges in the security of Mobile Ad Hoc Networks (MANETs) as it is easy to initiate and difficult to prevent. A malicious node can launch an attack simply by sending an excessively high number of route request (RREQ) packets or useless data packets to nonexistent destinations. As a result, the network is rendered useless as all its resources are used up to serve this storm of RREQ packets and hence unable to perform its normal routing duty. Most existing research efforts on detecting such a flooding attack use the number of RREQs originated by a node per unit time as the threshold to classify an attacker. These algorithms work to some extent; however, they suffer high misdetection rate and reduce network performance. This paper proposes a new flooding attacks detection algorithm (FADA) for MANETs based on a machine learning approach. The algorithm relies on the route discovery history information of each node to capture similar characteristics and behaviors of nodes belonging to the same class to decide if a node is malicious. The paper also proposes a new flooding attacks prevention routing protocol (FAPRP) by extending the original AODV protocol and integrating FADA algorithm. The performance of the proposed solution is evaluated in terms of successful attack detection ratio, packet delivery ratio, and routing load both in normal and under RREQ attack scenarios using NS2 simulation. The simulation results show that the proposed FAPRP can detect over 99% of RREQ flooding attacks for all scenarios using route discovery frequency vector of sizes larger than 35 and performs better in terms of packet delivery ratio and routing load compared to existing solutions for RREQ flooding attacks.

Comparative study of zigBee topologies for IoT-based lighting automation

Abstract: ZigBee standard is the popular communication protocol for wireless sensor networks (WSN) and Internet of Things (IoT) networks. An energy efficient WSN technology is a good choice for an IoT based lighting control technology. This article is a comparative analysis for finding the quality of service parameters provided by the different topologies of ZigBee for a wireless networked lighting control system. In order to estimate the energy consumption in ZigBee topologies for lighting automation, this work analyses the star, mesh, and tree topology-based WSN with two routing protocols Adhoc on-demand distance vector (AODV) and dynamic source routing (DSR). Lighting automation using wireless control networks with sensor-actuator nodes in a laboratory is considered as the test scenario. The applicability of ZigBee topologies for IoT-based lighting automation is discussed by the evaluation of performance parameters like average jitter, throughput, end-to-end delay, and energy model.

A new energy consumption technique for mobile ad hoc networks

Abstract: A dynamic temporary network is created through wireless mobile nodes without the need for considerable infrastructure as well as a central manager. In a mobile ad hoc network, routing protocols allow a mobile for transmission and receiving packets. In the last decade, many variants have come up for the AODV. A minimum number of hop counts are chosen for enhancing routing protocols to include additional factors that can have an impact on path selections. As the distance between each node grows, the transmission power also rises accordingly. Hence, this impacts the network’s entire performance and the most important feature is the quality of service. Most of the traditional routing protocols include energy consumption levels of the nodes and various parameters, like residual battery power, consumption of energy per packet and energy needed per transmission. A new technique is proposed in this paper to enhance the routing efficiency by making use of lion optimization algorithm after identifying all possible paths in the network. This technique not only enhances the energy efficiency of each node but also the performance metrics.

Design and analysis of an improved AODV protocol for black hole and flooding attack in vehicular ad-hoc network (VANET)

Abstract: Today Vehicular Networks is not a new term. In the past three to four years, Vehicular Networking has acquired immense publicity especially in the area of Research and Academic Industry. VA...

Clustering-Based Modified Ant Colony Optimizer for Internet of Vehicles (CACOIOV)

Abstract: The Internet of Vehicles (IoV) has recently become an emerging promising field of research due to the increasing number of vehicles each day. IoV is vehicle communications, which is also a part of the Internet of Things (IoT). Continuous topological changes of vehicular communications are a significant issue in IoV that can affect the change in network scalability, and the shortest routing path. Therefore, organizing efficient and reliable intercommunication routes between vehicular nodes, based on conditions of traffic density is an increasingly challenging issue. For such issues, clustering is one of the solutions, among other routing protocols, such as geocast, topology, and position-based routing. This paper focuses mainly on the scalability and the stability of the topology of IoV. In this study, a novel intelligent system-based algorithm is proposed (CACOIOV), which stabilizes topology by using a metaheuristic clustering algorithm based on the enhancement of Ant Colony Optimization (ACO) in two distinct stages for packet route optimization. Another algorithm, called mobility Dynamic Aware Transmission Range on Local traffic Density (DA-TRLD), is employed together with CACOIOV for the adaptation of transmission range regarding of density in local traffic. The results presented through NS-2 simulations show that the new protocol is superior to both Ad hoc On-demand Distance Vector (AODV) routing and (ACO) protocols based on evaluating routing performance in terms of throughput, packet delivery, and drop ratio, cluster numbers, and average end-to-end delay.

Greedy Forwarding and Limited Flooding based Routing Protocol for UAV Flying Ad-Hoc networks

Abstract: UAV flying ad-hoc networks (UAV-FANETs) usually consist of multiple Unmanned Aerial Vehicles (UVAs) using the ad-hoc networking manner. This paper proposes an ad-hoc routing protocol (PSO-GLFR) for FANETs based on greedy forwarding and limited flooding. PSO-GLFR combines the greedy peripheral stateless routing protocol (GPSR) and the ad hoc on-demand distance vector routing protocol (AODV). PSO-GLFR divides the routing process of FANETs into the greedy routing stage and the flooding path-finding stage, and uses the particle swarm optimization (PSO) strategy to solve the suboptimal choice problem of greedy forwarding. Simulation results show that PSO-GLFR is efficient and may provide low-latency, low-energy routing support for UAV-FANETs.

Integrating African Buffalo Optimization Algorithm in AODV Routing Protocol for improving the QoS of MANET

Abstract: A Mobile Ad-Hoc Network (MANET) is made up of wireless mobile nodes that do not require a central infrastructure or administration to establish a network. It is possible for the MANET nodes to function as a router or host. MANET works with an independent multi-hop mobile network which can be used in several real-time applications. Thus, an important issue associated with MANET is the identification of paths with high-level Quality of Service (QoS), like topology. The purpose of having a QoS-aware protocol in MANETs is to enable the discovery of paths that are more efficient between the source and destination nodes of the network and hence, the need for QoS. In this paper, a novel algorithm which can be used in the African Buffalo Optimization (ABO) to improve the QoS of routing protocol MANETs. With ABO, path selection is optimized in the Ad-hoc On-demand Distance Vector (AODV) routing protocol. Results of the test revealed that when ABO is used in AODV, delay and energy-aware routing protocol is manifested. Keywords: Mobile Ad-Hoc Network (MANET), Quality of Service (QoS), Ad-hoc On-demand Distance Vector (AODV), African Buffalo Optimization (ABO). DOI : https://doi.org/10.35741/issn.0258-2724.54.3.13

Robust Defense Scheme Against Selective Drop Attack in Wireless Ad Hoc Networks

Abstract: Performance and security are two critical functions of wireless ad-hoc networks (WANETs). Network security ensures the integrity, availability, and performance of WANETs. It helps to prevent critical service interruptions and increases economic productivity by keeping networks functioning properly. Since there is no centralized network management in WANETs, these networks are susceptible to packet drop attacks. In selective drop attack, the neighboring nodes are not loyal in forwarding the messages to the next node. It is critical to identify the illegitimate node, which overloads the host node and isolating them from the network is also a complicated task. In this paper, we present a resistive to selective drop attack (RSDA) scheme to provide effective security against selective drop attack. A lightweight RSDA protocol is proposed for detecting malicious nodes in the network under a particular drop attack. The RSDA protocol can be integrated with the many existing routing protocols for WANETs such as AODV and DSR. It accomplishes reliability in routing by disabling the link with the highest weight and authenticate the nodes using the elliptic curve digital signature algorithm. In the proposed methodology, the packet drop rate, jitter, and routing overhead at a different pause time are reduced to 9%, 0.11%, and 45%, respectively. The packet drop rate at varying mobility speed in the presence of one gray hole and two gray hole nodes are obtained as 13% and 14% in RSDA scheme.

A Multi-Agent Reinforcement Learning Routing Protocol for Underwater Optical Sensor Networks

Abstract: Much attention has been paid to underwater optical wireless sensor networks with the characteristics of high transmission rate and low delay for high-bandwidth underwater applications. However, several issues may take place and hinder the routing of underwater optical communication nodes due to the highly dynamic topology caused by the ocean current movement. On the purpose of addressing the problem and enhancing the robustness of dynamic network, in this paper, we propose a novel routing protocol, based on multi-agent reinforcement learning (MARL) for underwater optical sensor networks. The network is firstly modeled as a multi-agent system and the protocol based on reinforcement learning algorithm is designed to realize dynamic route selection by information interacting between adjacent nodes and maximize the network lifetime. The simulation results demonstrate that MARL has lower energy consumption and higher delivery ratio (about 95%) in a dynamic topology than the existing Q-learning, QDTR and AODV routing protocols.

DAPV: Diagnosing Anomalies in MANETs Routing With Provenance and Verification

Abstract: Routing security plays an important role in the mobile ad hoc networks (MANETs). Despite many attempts to improve its security, the routing mechanism of MANETs remains vulnerable to attacks. Unlike most existing solutions that prevent the specific problems, our approach tends to detect the misbehavior and identify the anomalous nodes in MANETs automatically. The existing approaches offer support for detecting attacks or debugging in different routing phases, but many of them cannot answer the absence of an event. Besides, without considering the privacy of the nodes, these methods depend on the central control program or a third party to supervise the whole network. In this paper, we present a system called DAPV that can find single or collaborative malicious nodes and the paralyzed nodes which behave abnormally. DAPV can detect both direct and indirect attacks launched during the routing phase. To detect malicious or abnormal nodes, DAPV relies on two main techniques. First, the provenance tracking enables the hosts to deduce the expected log information of the peers with the known log entries. Second, the privacy-preserving verification uses Merkle Hash Tree to verify the logs without revealing any privacy of the nodes. We demonstrate the effectiveness of our approach by applying DAPV to three scenarios: 1) detecting injected malicious intermediated routers which commit active and passive attacks in MANETs; 2) resisting the collaborative black-hole attack of the AODV protocol, and; 3) detecting paralyzed routers in university campus networks. Our experimental results show that our approach can detect the malicious and paralyzed nodes, and the overhead of DAPV is moderate.

An enhanced energy efficient routing protocol for VANET using special cross over in genetic algorithm

Abstract: Wireless networks are gaining popularity now a days. A Vehicular Ad-hoc network that is able to configure all network devices, which means all devices work as host and as a router in networ...

Evaluation of neighbor credit value based AODV routing algorithms for selfish node behavior detection

Abstract: Mobile ad hoc networks (MANETs) nodes interchange information by means of numerous intermediate nodes without the requirement of infrastructure (Toh, Ad hoc mobile wireless networks: protocols and systems, pp 34–37, 2002) Owing to the exposed arrangement and inadequate energy of the nodes, some nodes may not involve in the routing process properly (Laay et al, IEEE Commun Surv Tutor 10(4):78–93, 2008) This leads to selfish behavior of the nodes and moreover, some nodes do not have the chance to forward the packets, so they still idle in the network Hence, these genuine idle nodes are also considered as selfish nodes and they are avoided in the routing process To address this issue, credit-based protocols namely Neighbor credit value based and improved Neighbor credit value based Ad Hoc on demand distance vector (AODV) routing algorithms are proposed These two protocols are evaluated against AODV for the better detection of selfish node behavior Earlier works addressed the methods to overwhelm selfish behavior attack but fail in performance A simple neighbor credit value based AODV (NCV-AODV) routing protocol was proposed to avoid such false detection Some simple assumption is made on NCV-AODV that the nodes in the network are fundamentally not malicious and only some of the new nodes may be added to behave maliciously This improved version is called improved Neighbor credit value based AODV (iNCV-AODV) protocol is proposed The proposed two mechanisms are implemented in AODV routing protocol An extensive analysis of the performance of the proposed detection mechanisms against the selfish behavior attack

Channel Busyness Based Multipath Load Balancing Routing Protocol for Ad hoc Networks

Abstract: Mobile ad hoc networks or MANETs are wireless networks designed to allow communication between mobile wireless nodes. In dense network areas, MANETs suffer mainly from frequent link failures and longer delays. These dense network areas are generally located in the core of the network, where the number of nodes as it is for network traffic is higher. A new parameter to measure the centrality of the network based on the channel busyness ratio is proposed. The proposed protocol called CBMLB is an enhancement of the already existing multipath protocol AOMDV. CBMLB tries to reduce load on central congested nodes that have a raised channel busyness ratio, by distributing load among available alternative paths. The proposed protocol relies on the least congested disjoint paths to route packets. A performance comparison with AODV, AOMDV and QMLB protocols shows that CBMLB performs well in terms of packet delivery ratio, end to end delay and communication overhead.

Compressed fuzzy logic based multi-criteria AODV routing in VANET environment

Abstract: Vehicular ad hoc networks (VANETs) are the core of intelligent transportation systems (ITS) to obtain safety, better transportation services, and improved traffic management. Providing more reliable and efficient on demand routing protocol is one of the main challenges in these networks research scope. This paper argues a compressed fuzzy logic based method to enhance Ad hoc on demand distance vector (AODV) routing decision by jointly considering number of relays, distance factor, direction angle, and vehicles speed variance. The proposed scheme is simulated in both freeway and urban scenarios with different number of vehicles using real time interaction between both OMNet++ and SUMO simulators. Simulation results show that the proposed approach can get better performance in terms of packet delivery ratio, throughput, mean delay, and number of sent control packets.

An Efficient Connected Dominating Set Clustering Based Routing Protocol with Dynamic Channel Selection in Cognitive Mobile Ad Hoc Networks

Abstract: In mobile ad-hoc networks (MANETs), nodes are mobility naturally which renders a great challenge in topology controls. Connected dominating set (CDS) has been considered as an efficient solution to solve such a problem by constructing a virtual backbone network to achieve the scalability and efficiency of wireless networks. In this paper, we propose an efficient connected dominating set clustering based routing protocol with dynamic channel selection (CRD) in multi-channel cognitive radio MANETs to obtain high packet delivery ratio (PDR), low control overheads, low delay and low energy consumption when node is moving in high speed. Moreover, CRD protocol can apply for Vehicular Ad Hoc Network, IoT and 5G. The proposed CRD protocol includes clustering and routing phases under multi-channel cognitive radio approach. In the clustering phase, we propose CDS selection, CDS size reduction and CDS based clustering algorithms to formulate clusters and provide a set of intermediate nodes which is latter used as a route searching space for the routing phase. In the routing phase, a sending channel based focus region selection (CFS) algorithm is adopted dynamically to establish an efficient route from a set of intermediate nodes that avoids the affected region of a primary user. The CRD routing protocol is then implemented in environmental conditions close to reality (OMNET++ platform) to demonstrate its superiority over the conventional AODV protocol in terms of PDR, control overhead, delay and energy consumption.