A new routing protocol for wireless ad-hoc networks

Abstract-In recent years, a number of routing protocols for Mobile Ad Hoc wireless networks have been developed and have found many applications including multiple routing protocols In Ad-Hoc mobile network, multi-hop wireless links are popular applications as they are less routing overhead in order to reduce the network congestion as well as bandwidth utilization. In this paper, we studied the Ad-Hoc Ondemand Distance Vector (AODV) Routing protocol with deep analyzing. Then we have proposed a Direct Forward Routing Protocol scheme (DFRP) where the new approach is built on demand and maintained by direct forward mechanism through a double functions agent node. This double function forwarding node was built and equipped with at least two hopes connectivity.In other words, if an intermediate node has discovered that the next forwarding node to the destination is moved from the network and it is no more its neighbor,then on behalf of the moved node; the current node has ability to forward direct to the next hop (the moved node’s neighbor) for the moved node. This means that the moved node neighbors perform as a neighbor of the current node. In addition, the source node will not broadcasts a Route Request packet on its entire neighbors, it just broadcasts half of nodes in order to avoid the network congestion and deliver the packet to the destination routes with minimum overhead. This new protocol comes up a very useful mechanism which eliminates the route regenerating by the source as well as repair or local repair and many other mechanisms when a route breaks due to node mobility or failure.This study aims at enhancing the AODV Quality of Service (QoS) capabilities by DFRP to mitigate the route breakdown of ad hoc networks

An Overview of Mobile Ad Hoc Networks for the Existing Protocols and Applications

Mobile Ad Hoc Network (MANET) is a collection of two or more devices or nodes or terminals with wireless communications and networking capability that communicate with each other without the aid of any centralized administrator also the wireless nodes that can dynamically form a network to exchange information without using any existing fixed network infrastructure. And it's an autonomous system in which mobile hosts connected by wireless links are free to be dynamically and some time act as routers at the same time, and we discuss in this paper the distinct characteristics of traditional wired networks, including network configuration may change at any time, there is no direction or limit the movement and so on, and thus needed a new optional path Agreement (Routing Protocol) to identify nodes for these actions communicate with each other path, An ideal choice way the agreement should not only be able to find the right path, and the Ad Hoc Network must be able to adapt to changing network of this type at any time. and we talk in details in this paper all the information of Mobile Ad Hoc Network which include the History of ad hoc, wireless ad hoc, wireless mobile approaches and types of mobile ad Hoc networks, and then we present more than 13 types of the routing Ad Hoc Networks protocols have been proposed. In this paper, the more representative of routing protocols, analysis of individual characteristics and advantages and disadvantages to collate and compare, and present the all applications or the Possible Service of Ad Hoc Networks.Comment: 24 Pages, JGraph-Hoc Journa

On Energy Efficiency and Delay Minimization in Reactive Protocols in Wireless Multi-hop Networks

In Wireless Multi-hop Networks (WMhNs), routing protocols with energy efficient and delay reduction techniques are needed to fulfill users demands. In this paper, we present Linear Programming models (LP_models) to assess and enhance reactive routing protocols. To practically examine constraints of respective LP_models over reactive protocols, we select AODV, DSR and DYMO. It is deduced from analytical simulations of LP_models in MATLAB that quick route repair reduces routing latency and optimizations of retransmission attempts results efficient energy utilization. To provide quick repair, we enhance AODV and DSR. To practically examine the efficiency of enhanced protocols in different scenarios of WMhNs, we conduct simulations using NS- 2. From simulation results, enhanced DSR and AODV achieve efficient output by optimizing routing latencies and routing load in terms of retransmission attempts

Efficient Mobile Data Collection with Mobile Collect

WISENET (NES)PromosCONE

Improved AODV route recovery in mobile ad-hoc networks using a genetic algorithm

An important issue in ad-hoc on-demand distance vector (AODV) routing protocols is route failure caused by node mobility in the MANETs. The AODV requires a new route discovery procedure whenever a route breaks and these frequent route discoveries increase transmission delays and routing overhead. The present study proposes a new method for AODVs using a genetic algorithm to improve the route recovery mechanism. When failure occurs in a route, the proposed method (GAAODV) makes decisions regarding the QOS parameter to select source or local repair. The task of the genetic algorithm is to find an appropriate combination of weights to optimize end-to-end delay. This paper evaluates the metrics of routing overhead, average end-to-end delay, and packet delivery ratio. Comparison of the new algorithm and AODV (RFC 3561) using a NS-2 simulator shows that GAAODV obtains better results for the QOS parameters