Distance's Quantification Algorithm in AODV Protocol

Mobility is one of the basic features that define an ad hoc network, an asset that leaves the field free for the nodes to move. The most important aspect of this kind of network turns into a great disadvantage when it comes to commercial applications, take as an example: the automotive networks that allow communication between a groups of vehicles. The ad hoc on-demand distance vector (AODV) routing protocol, designed for mobile ad hoc networks, has two main functions. First, it enables route establishment between a source and a destination node by initiating a route discovery process. Second, it maintains the active routes, which means finding alternative routes in a case of a link failure and deleting routes when they are no longer desired. In a highly mobile network those are demanding tasks to be performed efficiently and accurately. In this paper, we focused in the first point to enhance the local decision of each node in the network by the quantification of the mobility of their neighbours. Quantification is made around RSSI algorithm a well known distance estimation method.Comment: 12 pages, Necom 2014 in Duba

Smart identification of MANET nodes using AODV routeing protocol

MANET routeing protocols can be either straightforward focusing on establishing and maintaining the path only, or too sophisticated with heavy key-based authentication/encryption algorithms. The consequence for both cases creates issues in the QoS implementation of MANET. This thesis focuses on providing three enhancements to the well-known AODV routeing protocol, without altering the functionality or impeding its performance. It proposes a scheme that improves AODV routeing discovery process without the overhead associated with integrity/authenticity that we called SIMAN (Smart Identification for Mobile Ad-hoc Networks). First, SIMAN introduces a prime number based mathematical algorithm in a thin layer between the communication links of the IP layer of the AODV routeing protocol. The algorithm replaces existing AODV “retrieval of node addresses” from the routeing table, with a “prime factorization of two values”. These two values are calculated during the RREP process, and thus enhances the AODV routeing protocol to provide knowledge of nodes in the RREP path beyond neighbouring nodes that are out of the transmission range. The second SIMAN enhancement is to attach the node’s geographical coordinates to the RREP message to enable the trilateration calculation of newly joined nodes. This process enhances AODV further by providing the nodes with the knowledge of the physical location of every node inside the path. Consequently, by combining both enhancements, AODV can have abstract authentication to prevent from hidden nodes like wormholes. The final enhancement is to enable SIMAN to construct most efficient paths with nodes that have high battery energy. This is achieved by adding each node’s battery level to the RREP message, where the source will examine the available knowledge of the possible routes that can work efficiently without disconnections or link breakage. The OPNET simulation platform is used for the implementation, verification and testing of this scheme. The results show that the AODV route discovery procedure was not affected in function or performance by our scheme and that the overhead caused by our three enhancements has improved the performance of AODV in certain conditions