scispace - formally typeset
Search or ask a question
Proceedings ArticleDOI

An Optimized Ad-hoc On-demand Multipath Distance Vector(AOMDV) Routing Protocol

12 Dec 2005-pp 569-573
TL;DR: An optimization of ad hoc on-demand multipath distance vector (OAOMDV) is presented to solve the "route cutoff" problem in AOMVV and simulation results show the performance improvement.
Abstract: To avoid frequent route discovery, various multipath routing protocol has been proposed based on the existing single path routing protocol in ad hoc networks. Ad hoc on-demand multipath distance vector (AOMDV) is one of extensions to the well-studied ad hoc on distance vector (AODV). In this paper an optimized AOMDV (OAOMDV) is presented to solve the "route cutoff" problem in AOMDV. The proposed protocol adds a new scheme into AOMDV and simulation results show the performance improvement
Citations
More filters
Journal ArticleDOI
01 Jan 2015
TL;DR: A survey on multihop ad hoc network paradigms for disaster scenarios highlights their applicability to important tasks in disaster relief operations and discusses the open challenges and the future research directions for each different ad hoc paradigm.
Abstract: Disastrous events are one of the most challenging applications of multihop ad hoc networks due to possible damages of existing telecommunication infrastructure. The deployed cellular communication infrastructure might be partially or completely destroyed after a natural disaster. Multihop ad hoc communication is an interesting alternative to deal with the lack of communications in disaster scenarios. They have evolved since their origin, leading to different ad hoc paradigms such as MANETs, VANETs, DTNs, or WSNs. This paper presents a survey on multihop ad hoc network paradigms for disaster scenarios. It highlights their applicability to important tasks in disaster relief operations. More specifically, the paper reviews the main work found in the literature, which employed ad hoc networks in disaster scenarios. In addition, it discusses the open challenges and the future research directions for each different ad hoc paradigm.

137 citations

Journal ArticleDOI
01 Feb 2020
TL;DR: A secure routing and monitoring protocol with multi-variant tuples using Two-Fish (TF) symmetric key approach to discover and prevent the adversaries in the global sensor network is proposed.
Abstract: Internet of Things (IoT) has advanced its pervasiveness across the globe for the development of smart networks. It is aimed to deploy network edge that enables smart services and computation for the IoT devices. In addition, this deployment would not only improve the user experience but also provide service resiliency in case of any catastrophes. In IoT applications, the edge computing exploits distributed architecture and closeness of end-users to provide faster response and better quality of service. However, the security concern is majorly addressed to resist the vulnerability of attacks (VoA). Existing methodologies deal only with static wireless sensor web to deduce the intrusions in which the sensor nodes are deployed in a uniform manner to retain the constancy. Since the sensor nodes are constantly being in question through different transmission regions with several levels of velocities, selection of sensor monitoring nodes or guard nodes has become a challenging job in recent research. In addition, the adversaries are also moving from one location to another to explore its specific chores around the network. Thus, to provide flexible security, we propose a secure routing and monitoring protocol with multi-variant tuples using Two-Fish (TF) symmetric key approach to discover and prevent the adversaries in the global sensor network. The proposed approach is designed on the basis of the Authentication and Encryption Model (ATE). Using Eligibility Weight Function (EWF), the sensor guard nodes are selected and it is hidden with the help of complex symmetric key approach. A secure hybrid routing protocol is chosen to be built by inheriting the properties of both Multipath Optimized Link State Routing (OLSR) and Ad hoc On-Demand Multipath Distance Vector (AOMDV) protocols. The result of the proposed approach is shown that it has a high percentage of monitoring nodes in comparison with the existing routing schemes. Moreover, the proposed routing mechanism is resilient to multiple mobile adversaries; and hence it ensures multipath delivery.

114 citations

Journal ArticleDOI
TL;DR: This work presents a holistic view on various trust management frameworks geared for MANETs, capable to handle main existing attacks deceiving trustworthiness computation to mislead trust-based network operations, referred to as trust-distortion attacks.
Abstract: Trust management is a promising approach to conduct nodes’ transactions and establish management interactions in distributed mobile ad hoc networks (MANETs) in which nodes’ collaboration is critical to achieve system goals. Lack of centralized management, severe resource constraints (e.g., computing power, energy, and bandwidth), and important network dynamics (e.g., topology changes, node mobility, node failure, and propagation channel conditions) make trust management a challenging task in such a network. Mainly, some trust management basis may be exploited to fulfill new attacks. In this work, we present a holistic view on various trust management frameworks geared for MANETs, capable to handle main existing attacks deceiving trustworthiness computation to mislead trust-based network operations, referred to as trust-distortion attacks. Besides, we propose a taxonomy of main identified trust-distortion attacks based on how the trustworthiness estimation of a node about another node is distorted. Moreover, we provide a holistic classification of main evaluation metrics, which can be used to evaluate and compare such frameworks. For each framework, a unified approach is used to describe the trust model, taking each component required for trust management as a guideline. Moreover, each framework is analyzed regarding its resistance against different trust-distortion attacks, the framework unique features, merits, demerits, and findings. Finally, we compare different trust-distortion resistant frameworks and outline the open issues and future research directions.

88 citations


Cites background from "An Optimized Ad-hoc On-demand Multi..."

  • ...[49] (a multi-path extension of AODV) which distributes trust information through RREQ packets in order to resist bad mouthing and double-face attacks....

    [...]

Journal ArticleDOI
TL;DR: Fault-Tolerant Disjoint Multipath Distance Vector Routing Algorithm (FD-AOMDV) is proposed that sprints path discovery phase with a reduced amount of delay and finds disjoint paths in a way that routing overloads decrease considerably.
Abstract: Mobile ad-hoc network (MANET) plays a significant role in the field of communication. Due to the dynamic movement of nodes, the network infrastructure is frequently changed. All nodes have the capacity to configure themselves and are communicated either directly through some intermediate nodes based on signal strength or through multi-hop routing. However, selection of the intermediate nodes will increase the routing overload in the route discovery procedure. Destination nodes are selected using intermediate nodes for broadcasting data packets with link scalability. The previous works for this problem have limitations such as they are not flexible to deliver the Quality of Service in the network model, and the possibility of packet delivery is less. In this paper, we propose Fault-Tolerant Disjoint Multipath Distance Vector Routing Algorithm (FD-AOMDV) that sprints path discovery phase with a reduced amount of delay. It finds disjoint paths in a way that routing overloads decrease considerably. FD-AOMDV can increase the scalability by reducing the routing overload when the latest route is established. Moreover, owing to the mobility of the node in MANETs, subsequent breakages of a link will cause the active path disconnection and also enlarge the routing overload. The simulation results prove that the proposed work reduces the routing overload, decreases the end-to-end delay, and reduces the packet delivery ratio compared with AOMDV and ZD-AOMDV on Network Simulator 2.

54 citations

Proceedings ArticleDOI
14 Dec 2009
TL;DR: A cross-layer Ad hoc On-demand Multipath Distance Vector with retransmission counts metric (R-AOMDV) routing protocol is designed to make use of advantages of multi-path routing protocol, such as decrease of route discovery frequency.
Abstract: Vehicular Ad hoc Network (VANET) is a special class of wireless mobile communication network. For vehicle-to-vehicle (V2V) communication, suitable routing protocols are needed. A routing metric combining hop counts and retransmission counts at MAC layer is proposed with consideration of link quality and delay reduction. Based on the new routing metric, a cross-layer Ad hoc On-demand Multipath Distance Vector with retransmission counts metric (R-AOMDV) routing protocol is designed to make use of advantages of multi-path routing protocol, such as decrease of route discovery frequency. Compared with AOMDV with minimum hop-count metric, simulation results show that R-AOMDV achieves better performance with Pareto On/Off distribution traffic model in urban VANET, no matter in sparse or dense scenarios.

50 citations


Cites background or methods from "An Optimized Ad-hoc On-demand Multi..."

  • ...First Hop is used to find out ignored reverse paths and ensure the established reverse paths that are ignored before are linkdisjoint with other established reverse paths [3]....

    [...]

  • ...Routing “cutoff” problem can be solved with method proposed in [3]....

    [...]

  • ...During the route discovery above, “cutoff” problem [3] will cause some reverse paths to be ignored....

    [...]

  • ...RREP First Hop field is used to ensure the link-disjoint character of forward paths, and RREQ First Hop field is used to decide whether route “cutoff” problem exists [3]....

    [...]

References
More filters
01 Jul 2003
TL;DR: A logging instrument contains a pulsed neutron source and a pair of radiation detectors spaced along the length of the instrument to provide an indication of formation porosity which is substantially independent of the formation salinity.
Abstract: The Ad hoc On-Demand Distance Vector (AODV) routing protocol is intended for use by mobile nodes in an ad hoc network. It offers quick adaptation to dynamic link conditions, low processing and memory overhead, low network utilization, and determines unicast routes to destinations within the ad hoc network. It uses destination sequence numbers to ensure loop freedom at all times (even in the face of anomalous delivery of routing control messages), avoiding problems (such as "counting to infinity") associated with classical distance vector protocols.

11,490 citations


Additional excerpts

  • ...[3] Lee, S. J. and Gerla, M., “AODV-BR: Backup Routing in Ad hoc Networks,” Proc. of IEEE Wireless Communications and Networking Conference, pp. 1311-1316 (2000)....

    [...]

  • ...It uses the routing information already available in the AODV protocol as much as possible....

    [...]

  • ...It makes use of AODV control packets with a few extra fields in the packet header such as advertised hop count and route list which contains multiple paths....

    [...]

  • ...[2] Perkins, C., Belding-Royer, E., and Das, S., “Ad hoc On-Demand Distance Vector (AODV) Routing,” rfc3561.txt (2003)....

    [...]

  • ...Ⅳ SIMULATION RESULT As AOMDV has been proved to outperform AODV in [5], here we only evaluate the performance of AOMDV and OAOMDV protocol using Network Simulator 2 (ns 2) and compare them....

    [...]

Proceedings ArticleDOI
01 Nov 2001
TL;DR: Performance comparison of AOMDV with AODV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.
Abstract: We develop an on-demand multipath distance vector protocol for mobile ad hoc networks. Specifically, we propose multipath extensions to a well-studied single path routing protocol known as ad hoc on-demand distance vector (AODV). The resulting protocol is referred to as ad hoc on-demand multipath distance vector (AOMDV). The protocol computes multiple loop-free and link-disjoint paths. Loop-freedom is guaranteed by using a notion of "advertised hopcount". Link-disjointness of multiple paths is achieved by using a particular property of flooding. Performance comparison of AOMDV with AODV using ns-2 simulations shows that AOMDV is able to achieve a remarkable improvement in the end-to-end delay-often more than a factor of two, and is also able to reduce routing overheads by about 20%.

1,522 citations


"An Optimized Ad-hoc On-demand Multi..." refers background or methods in this paper

  • ...As AOMDV has been proved to outperform AODV in [5], here we only evaluate the performance of AOMDV and OAOMDV protocol using Network Simulator 2 (ns 2) and compare them....

    [...]

  • ...[5] tries to find link-disjoint paths....

    [...]

  • ...AOMDV[5] extends the prominent AODV to discover multiple link-disjoint paths between the source and the destination in every route discovery....

    [...]

  • ...To overcome such inefficiency, several studies [3], [4], [5], [6], [7] have been presented to compute multiple paths....

    [...]

  • ...To decrease route discovery frequency in single path routing, some multipath routing protocols have been proposed to extend AODV [3], [4], [5]....

    [...]

Journal ArticleDOI
01 Jan 2004
TL;DR: In this article, a wide range of routing protocols have been proposed in the literature and a performance comparison of all routing protocols and suggest which protocols may perform best in large networks is provided.
Abstract: The 1990s have seen a rapid growth of research interests in mobile ad hoc networking. The infrastructureless and the dynamic nature of these networks demands new set of networking strategies to be implemented in order to provide efficient end-to-end communication. This, along with the diverse application of these networks in many different scenarios such as battlefield and disaster recovery, have seen MANETs being researched by many different organisations and institutes. MANETs employ the traditional TCP/IP structure to provide end-to-end communication between nodes. However, due to their mobility and the limited resource in wireless networks, each layer in the TCP/IP model require redefinition or modifications to function efficiently in MANETs. One interesting research area in MANET is routing. Routing in the MANETs is a challenging task and has received a tremendous amount of attention from researches. This has led to development of many different routing protocols for MANETs, and each author of each proposed protocol argues that the strategy proposed provides an improvement over a number of different strategies considered in the literature for a given network scenario. Therefore, it is quite difficult to determine which protocols may perform best under a number of different network scenarios, such as increasing node density and traffic. In this paper, we provide an overview of a wide range of routing protocols proposed in the literature. We also provide a performance comparison of all routing protocols and suggest which protocols may perform best in large networks.

1,281 citations

Proceedings ArticleDOI
23 Sep 2000
TL;DR: This work proposes a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes to the Ad-hoc On-Demand Distance Vector protocol and evaluates the performance improvements by simulation.
Abstract: Nodes in mobile ad hoc networks communicate with one another via packet radios on wireless multihop links. Because of node mobility and power limitations, the network topology changes frequently. Routing protocols therefore play an important role in mobile multihop network communications. A trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, use a single route and do not utilize multiple alternate paths. We propose a scheme to improve existing on-demand routing protocols by creating a mesh and providing multiple alternate routes. Our algorithm establishes the mesh and multipaths without transmitting any extra control message. We apply our scheme to the Ad-hoc On-Demand Distance Vector (AODV) protocol and evaluate the performance improvements by simulation.

711 citations


"An Optimized Ad-hoc On-demand Multi..." refers background in this paper

  • ...[3] Lee, S. J. and Gerla, M., “AODV-BR: Backup Routing in Ad hoc Networks,” Proc. of IEEE Wireless Communications and Networking Conference, pp. 1311-1316 (2000)....

    [...]

  • ...It uses the routing information already available in the AODV protocol as much as possible....

    [...]

  • ...It makes use of AODV control packets with a few extra fields in the packet header such as advertised hop count and route list which contains multiple paths....

    [...]

  • ...[2] Perkins, C., Belding-Royer, E., and Das, S., “Ad hoc On-Demand Distance Vector (AODV) Routing,” rfc3561.txt (2003)....

    [...]

  • ...Ⅳ SIMULATION RESULT As AOMDV has been proved to outperform AODV in [5], here we only evaluate the performance of AOMDV and OAOMDV protocol using Network Simulator 2 (ns 2) and compare them....

    [...]

Proceedings ArticleDOI
16 Nov 2004
TL;DR: Simulation results show that the proposed protocol achieves lower data delay and control overhead as well as higher packet delivery ratio.
Abstract: An on-demand node-disjoint multipath routing protocol is proposed to overcome the shortcomings of on-demand unipath routing protocols like AODV and DSR. The protocol has two novel aspects compared to the other on-demand multipath protocols: it reduces routing overhead dramatically and achieves multiple node-disjoint routing paths. Simulation results show that the proposed protocol achieves lower data delay and control overhead as well as higher packet delivery ratio.

93 citations


"An Optimized Ad-hoc On-demand Multi..." refers background in this paper

  • ...To overcome such inefficiency, several studies [3], [4], [5], [6], [7] have been presented to compute multiple paths....

    [...]

  • ...[4] selects node-disjoint paths, and it only performs well with high density of mobile nodes....

    [...]

  • ...To decrease route discovery frequency in single path routing, some multipath routing protocols have been proposed to extend AODV [3], [4], [5]....

    [...]