Abstract
In a Mobile Ad hoc Network (MANET), mobile nodes constructing a network, nodes may join and leave at any time, and the topology changes dynamically. Routing in a MANET is challenging because of the dynamic topology and the lack of an existing fixed infrastructure. In this paper, we explore the difficulties encountered in implementing MANET routing protocols in real oper¬ating systems, and study the common requirements im¬posed by MANET routing on the underlying operating system services. Also, it explains implementation techniques of the AODV protocol to determine the needed events, such as: Snooping, Kernel Modification, and Netfilter. In addition, this paper presents a discussion of the advantages as well as disadvantages of each implementation of this architecture in Linux.
Highlights
Ad-hoc On Demand Distance Vector Routing (AODV) is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes
The Ad-hoc On Demand Distance Vector Routing (AODV) protocol is an algorithm used for the implementation of such networks
If the destination node get the Rout Requests (RREQ), it sends back Route Reply (RREP) to the source node
Summary
AODV is an on demand algorithm, meaning that it builds routes between nodes only as desired by source nodes. It maintains these routes as long as they are needed by the sources. The Ad-hoc On Demand Distance Vector Routing (AODV) protocol is an algorithm used for the implementation of such networks. In this paper we first give an overview of the challenges implementers face when implementing an on-demand ad hoc routing protocol. These challenges emerge, as the on-demand routing model does not fit into the standard operating system routing and packet forwarding model. The intention is to give an overview of the developed solutions and point out best practices and experiences learnt
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have