scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Survey on Mobile Ad Hoc Network Routing Protocols

18 Sep 2014-International Journal of Computer Applications (Foundation of Computer Science (FCS))-Vol. 101, Iss: 12, pp 28-33
TL;DR: This review paper provides an overview of existing mobile ad-hoc proactive and reactive routing protocols depending on their reactive and reactive nature respectively by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance.
Abstract: mobile ad-hoc network is characterized as network without any physical connections. In this network there is no fixed topology due to the mobility of nodes, interference, multipath propagation and path loss. Many Routing protocols have been developed to overcome these characteristics. The purpose of this paper is to review existing mobile ad-hoc proactive and reactive routing protocols depending on their proactive and reactive nature respectively. This review paper provides an overview of these protocols by presenting their characteristics, functionality, benefits and limitations and then makes their comparative analysis so to analyze their performance. The objective of this review paper is to provide analysis about improvement of these existing protocols.

Content maybe subject to copyright    Report

Citations
More filters
Journal ArticleDOI
TL;DR: A survey of the routing algorithms proposed for wireless networks is presented, which offers a comprehensive review of various categories such as Geographical, Geo-casting, Hierarchical, Multi-path, Power-aware, and Hybrid routing algorithms.

278 citations


Cites background from "Survey on Mobile Ad Hoc Network Rou..."

  • ...Hierarchical routing and cluster-based routing are studied in different surveys such as [52,80]....

    [...]

  • ...[80] also discusses Multi-cast routing....

    [...]

  • ...Therefore, the Reactive RA is considered to be more scalable than the Proactive RA [80]....

    [...]

Journal ArticleDOI
TL;DR: A vivid taxonomy of DHT-based routing protocols and the guidelines to design such protocols for MANETs is presented and serves as a guide for anyone willing to delve into research on DHT -based routing in MANets.
Abstract: Mobile ad hoc networks (MANETs) are infrastructureless and distributed communication systems that require sophisticated approaches to routing to cope with node mobility and heterogeneous application requirements. In the past few years, distributed hash table (DHT) has come forth as a useful additional technique to the design and specification of spontaneous and self-organized networks. Researchers have exploited its advantages by implementing it at the network layer and developing scalable routing protocols for MANETs. The implementation of DHT-based routing in a MANET requires different algorithms and specifications compared to routing in the Internet because a MANET has its unique characteristics, such as node mobility, spontaneous networking, decentralized architecture, limited transmission range, dynamic topology, and frequent network partitioning/merging.In this article, we present a comprehensive survey of research related to DHT-based routing that aims at enhancing the scalability of MANETs. We present a vivid taxonomy of DHT-based routing protocols and the guidelines to design such protocols for MANETs. We compare the features, strengths, and weaknesses of existing DHT-based routing protocols and highlight key research challenges that are vital to address. The outcome of the analysis serves as a guide for anyone willing to delve into research on DHT-based routing in MANETs.

52 citations

Proceedings ArticleDOI
02 Apr 2012
TL;DR: In this paper, the authors provide researchers many structures for mobile ad hoc protocol that also could be implemented in VANET protocols and classify the routing protocols according to their design philosophy, network structure, or routing protocol characteristic.
Abstract: This paper provides researchers many structures for mobile Ad hoc protocol that also could be implemented in VANET protocols. In the literature, there are numerous mobile Ad hoc network (MANET) routing protocols aiming to find the most suitable path from source to destination. Therefore these protocols should be categorized and classified. This classification helps in understanding, analyzing, comparing, and evaluating the routing protocols. Also, the classification can assist researchers and designers to differentiate the characteristics of the routing protocols and to find the relationships between them. The routing protocols cannot be included under one category or one classification, therefore, the known characteristics should be listed and the MANET routing protocols classified according to these attributes. In this paper, varies routing protocol classifications are presented that depend on design philosophy, on network structure, or on the routing protocol characteristic (packet casting and network routing metrics).

52 citations

Journal ArticleDOI
TL;DR: Simulation results indicate that applying Swarm Intelligence based routing protocols offers a significant level of adaptability and efficiency that, under several network conditions, allow the protocol to outperform traditional approaches.

45 citations


Cites background from "Survey on Mobile Ad Hoc Network Rou..."

  • ...Routing protocols for wireless ad hoc networks are traditionally classified into several types (proactive, reactive, or hybrid), based on their routing approach and mechanisms [40,9]....

    [...]

10 Mar 2012
TL;DR: An application suite designed to provide people with opportunistic communication means such as email, text and voice messaging, file sharing, etc, and some results of a preliminary experimentation campaign conducted in order to evaluate these applications in a real setting.
Abstract: Delay/disruption-tolerant networking and opportunistic networking have emerged as promising solutions to support communication between people in environments devoid of any infrastructure network. Although many protocols have been proposed in the literature to support message forwarding or message dissemination in such conditions, a very few of these protocols have been implemented in fully-functional communication systems, and can thus be used to conduct experiments with real applications and real users. In this paper we present an application suite we designed in order to provide people with opportunistic communication means such as email, text and voice messaging, file sharing, etc. We also present some results of a preliminary experimentation campaign we conducted in order to evaluate these applications in a real setting.

23 citations

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


"Survey on Mobile Ad Hoc Network Rou..." refers background in this paper

  • ...AODV deals nippy and effectively against deviation in vigorous link disorders, stumpy network consumption, overhead in process and memory with discovery of unicast paths to target nodes within network....

    [...]

  • ...AODV [17] is anticipated to use on-demand in mobile adhoc network....

    [...]

01 Jan 1994
TL;DR: In this article, the authors present a protocol for routing in ad hoc networks that uses dynamic source routing, which adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

8,614 citations

Book ChapterDOI
01 Jan 1996
TL;DR: This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing that adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently.
Abstract: An ad hoc network is a collection of wireless mobile hosts forming a temporary network without the aid of any established infrastructure or centralized administration. In such an environment, it may be necessary for one mobile host to enlist the aid of other hosts in forwarding a packet to its destination, due to the limited range of each mobile host’s wireless transmissions. This paper presents a protocol for routing in ad hoc networks that uses dynamic source routing. The protocol adapts quickly to routing changes when host movement is frequent, yet requires little or no overhead during periods in which hosts move less frequently. Based on results from a packet-level simulation of mobile hosts operating in an ad hoc network, the protocol performs well over a variety of environmental conditions such as host density and movement rates. For all but the highest rates of host movement simulated, the overhead of the protocol is quite low, falling to just 1% of total data packets transmitted for moderate movement rates in a network of 24 mobile hosts. In all cases, the difference in length between the routes used and the optimal route lengths is negligible, and in most cases, route lengths are on average within a factor of 1.01 of optimal.

8,256 citations


"Survey on Mobile Ad Hoc Network Rou..." refers methods in this paper

  • ...DSR consents numerous paths to specific target node and permits each sender node to manage and select the paths used in its packets routing....

    [...]

  • ...DSR uses unidirectional links for both inter and intra cluster routing....

    [...]

  • ...All features of DSR runs on demand exclusively that further countenances routing packet overhead of DSR to scale inevitably to only what is obligatory to counter alteration in active routes....

    [...]

  • ...DSR [16] is a proficient and simple protocol intended precisely for use in MANET....

    [...]

  • ...Route discovery and Route maintenance are two focal procedures of DSR that works collectively to countenance nodes to determine and sustain paths to haphazard destinations in network....

    [...]

Book
01 Jan 1987
TL;DR: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages.
Abstract: Undergraduate and graduate classes in computer networks and wireless communications; undergraduate classes in discrete mathematics, data structures, operating systems and programming languages. Also give lectures to both undergraduate-and graduate-level network classes and mentor undergraduate and graduate students for class projects.

6,991 citations

Proceedings ArticleDOI
01 Oct 1994
TL;DR: The modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile hosts.
Abstract: An ad-hoc network is the cooperative engagement of a collection of Mobile Hosts without the required intervention of any centralized Access Point. In this paper we present an innovative design for the operation of such ad-hoc networks. The basic idea of the design is to operate each Mobile Host as a specialized router, which periodically advertises its view of the interconnection topology with other Mobile Hosts within the network. This amounts to a new sort of routing protocol. We have investigated modifications to the basic Bellman-Ford routing mechanisms, as specified by RIP [5], to make it suitable for a dynamic and self-starting network mechanism as is required by users wishing to utilize ad hoc networks. Our modifications address some of the previous objections to the use of Bellman-Ford, related to the poor looping properties of such algorithms in the face of broken links and the resulting time dependent nature of the interconnection topology describing the links between the Mobile Hosts. Finally, we describe the ways in which the basic network-layer routing can be modified to provide MAC-layer support for ad-hoc networks.

6,877 citations