In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...

Objectives: To counteract grey hole and black attacks, the proposed method deploys a hybrid framework along with Ad hoc on-demand distance vector (AODV) routing protocol. A modified protocol is called as SRDAODV (Secure Route Discovery-Adhoc On-Demand Distance Vector). Methods: The work establishes secure route from node discovery, which protects sequential attacks. has three significant compon...

Developments in computer communications and networks enabled the deployment of exciting new areas. Meanwhile, Efficient network communication technologies also promote development routing protocols. AODV(Ad hoc On-Demand Distance Vector Routing, AODV) protocol has invulnerability to different mobile attributes agent nodes damage scenarios. However, this performance can not meet needs multi-agen...

This paper reviews security issues on Adhoc network and Ad hoc On-Demand Distance Vector (AODV) protocol. In Adhoc network, active attack i.e DDOS, blackhole and malicious nodes attack can easily occur. These attacks can decrease the performance of the communications protocol. In this paper, AODV was chosen as the basic protocol to perform simulations due to the fact that the AODV protocol can ...

The Internet of Vehicles (IoVs) has become a vital research area in order to enhance passenger and road safety, increasing traffic efficiency enhanced reliable connectivity. In this regard, for monitoring controlling the communication between IoVs, routing protocols are deployed. Frequent changes that occur topology often leads major challenges such as dynamic changes, shortest paths also scala...

We investigate the use of dominating-set neighbor elimination as an integral part of the distribution of route requests using the Ad hoc On-demand Distance Vector (AODV) protocol as an example of on-demand routing protocols. We use detailed simulations to show that simply applying dominant pruning (DP) to the distribution of route requests in AODV results in pruning too many route requests in t...