Elsevier

Computer Communications

Volume 30, Issue 5, 8 March 2007, Pages 1152-1163
Computer Communications

A low overhead dynamic route repairing mechanism for mobile ad hoc networks

https://doi.org/10.1016/j.comcom.2006.12.008Get rights and content

Abstract

Ad hoc networks are wireless networks with no fixed infrastructure. Each mobile node in the network functions as a router that discovers and maintains routes for other nodes. These nodes may move arbitrarily, therefore network topology changes frequently and unpredictably. Many routing protocols have been designed for ad hoc networks. However, most of these kinds of protocols are not able to react fast enough to maintain routing. In this paper, we propose a new protocol that repairs the broken route by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Theoretical analysis reveals that, in a given circumstance, our proposed protocol can find a backup route in more than 60% of time. Simulation results also demonstrate that our protocol achieves better (or as good) in terms of the packet delivery rate, control packet overhead and communication delay than the major ad hoc routing protocols under light and moderate traffic conditions.

Introduction

Ad hoc networks are wireless networks with no fixed infrastructure. Each mobile node in the network functions as a router that discovers and maintains routes for other nodes. These nodes may move arbitrarily, therefore network topology changes frequently and unpredictably. Other limitations of ad hoc networks include high power consumption, low bandwidth, and high error rates [1]. Applications of ad hoc networks are emergency search-and-rescue operations, meetings or conventions in which persons wish to quickly share information, data acquisition operations in inhospitable terrain, and automated battlefield [1].

For years numerous routing protocols have been developed for ad hoc networks including Destination-Sequenced Distance-Vector Routing protocol (DSDV) [2], Clusterhead Gateway Switch Routing protocol (CGSR) [3], Wireless Routing Protocol (WRP) [4], Ad Hoc On-Demand Distance Vector (AODV) [5], [6], Dynamic Source Routing (DSR) [7], [8], Temporally Ordered Routing Algorithm (TORA) [9], [10], Associativity-Based Routing (ABR) [11], and Zone Routing Protocol (ZRP) [12].

In general, the existing routing protocols may be categorized as table-driven and source-initiated on-demand [1]. Table-driven protocols try to maintain routing information from each node to every other node in the network. As network topology changes, these protocols propagate updates throughout the network in order to maintain a consistent global network view. A large portion of network capacity is used to keep the routing information up-to-date, even though most of the information is never used. On the other hand, source-initiated on-demand protocol [1] creates routes only when desired. Once a route has been established, it is maintained by a route maintenance procedure until either link failures occur or the transmission job is complete. Because routing information may not be available when a route request is received, the latency to determine a route can be quite significant. When the rate of topological changes in the network is sufficiently high, most of the above protocols may not be able to react fast enough to maintain necessary routing.

In this paper, we propose a new routing algorithm, which overcomes the drawback associated with the conventional routing algorithms. The proposed new protocol dynamically repairs broken routes by using information provided by nodes overhearing the main route communication. When links go down, our protocol intelligently replaces these failed links or nodes with backup ones that are adjacent to the main route. Theoretical analysis reveals that, in a given circumstance, our proposed protocol can find a backup route in more than 60% of time. Simulations also show that the proposed algorithm achieves better in most aspects than most of the notable protocols. Note that an earlier concise version of this work has appeared in [13].

The rest of paper is organized as follows. In Section 2, we give a survey of how relevant routing protocols react to link failure. The main ideas of our protocol and brief comparison of ours and two other notable dynamic route repairing protocols are described in Section 3, with analysis of the proposed protocol and its simulation results presented in Sections 4 Effectiveness of the proposed protocol in repairing broken route, 5 Performance of the proposed protocol as compared to major protocols. Section 6 concludes the paper.

Section snippets

Related work

Table-driven routing protocols require constant propagation of routing information, which incurs extra communication overhead and power consumption. As a result, these become the limiting factors of their applications in ad hoc network environment since both bandwidth and battery power is scare resource in mobile devices [1]. On the other hand, on-demand routing protocols establish a route only when a source requires to send messages to some destination without requiring periodic update of

The proposed new routing protocol

In the following, we present a new fully distributed and on-demand based ad hoc routing protocol with nearly real time repairable route that handles the broken-link recovery in a more efficient way. Before moving on to the details, we first present the intuitive ideas behind our protocol.

The proposed routing protocol begins by finding a route from a source node S to a destination node D, which we call the main route. All data packets are then sent along this main route to the destination. As

Effectiveness of the proposed protocol in repairing broken route

In this section, we will show the effectiveness of our proposed protocol by first giving a theoretical analysis derived from random geometric graphs, and followed by presenting the simulation results.

Given a geometric graph G = (V, r), which consists of nodes placed in 2-dimension space R2 and edge set E = {(i, j)∣d(i, j)  r, where i, j  V and d(i, j) denotes the Euclidian distance between node i and node j}. Let Xn = {x1, x2, …, xn} be a set of independently and uniformly distributed random points. We use Ψ(

Performance of the proposed protocol as compared to major protocols

Three on-demand protocols including AODV, DSR, and TORA are used as the basis of comparison to our protocol. These three protocols are all supported by NS-2. Four aspects in evaluating how these algorithms perform are simulated and given in the following four subsections, include (1) data delivery rate, (2) routing overhead, (3) communication latency, and (4) average number of hops a message needs to traverse to reach its destination.

In addition to the three major routing protocols, we will

Conclusion and future work

In this paper, we present a new on-demand routing protocol that is able to quickly repair a link or node failure with less communication overhead. Compared with the other notable on-demand routing protocols, our protocol has a higher successful data delivery rate than AODV and DSR, and saves approximately 10–25% in the number of control packets compared to AODV. In term of communication delay, our protocol also performs very well compared to the two major routing protocols, AODV and DSR. In

Chang Wu Yu received the BS degree from Soochow University in 1985, MS degree from National Tsing Hua University in 1989, and PhD degree from National Taiwan University in 1993, Taiwan, all in computer sciences. From 1995 to 1998, he was an Associate Professor at the Department of Information Management, Ming Hsin Institute of Technology. In 1999, he joined the Department of Computer Science & Information Engineering, Chung Hua University. His current research interests include graph

References (27)

  • E.M. Royer et al.

    A review of current routing protocols for ad hoc mobile wireless networks

    IEEE Personal Communication

    (1999)
  • C.E. Perkins, P. Bhagwat, Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers, in:...
  • C.C. Chiang, Routing in clustered multi-hop, mobile wireless networks with fading channel, in: Proceedings of IEEE...
  • S. Murthy, J.J. Garcia-Luna-Aceves, A routing protocol for packet radio networks, in: ACM MOBICOM, 1995, pp....
  • C.E. Perkins, Ad hoc on demand distance vector (AODV) routing, in: IETF Internet-Draft, draft-ietf-manet-aodv-00.txt,...
  • C.E. Perkins, E.M. Royer, Ad-hoc on-demand distance vector routing, in: Proceedings of the Second IEEE Workshop on...
  • J. Broch, D.B. Johnson, D. Malt, The dynamic source routing protocol for mobile ad hoc networks, in: IETF Internet...
  • D.B. Johnson et al.

    Dynamic Source Routing in Ad-Hoc Wireless Networks

  • M.S. Corson, V.D. Park, Temporally ordered routing algorithm (TORA) Version 1: functional specification,...
  • V.D. Park, M.S. Corson, A highly adaptive distributed routing protocol for mobile ad hoc networks, in: Proceedings of...
  • C.-K. Toh

    Associativity based routing for ad-hoc mobile networks

    Wireless Personal Communication

    (1997)
  • Z.J. Haas, The zone routing protocol (ZRP) for ad-hoc networks, IETF Internet Draft,...
  • Chang Wu Yu, Tung-Kuang Wu, Rei Heng Cheng, Po Tsang Chen, A low overhead ad hoc routing protocol with route recovery,...
  • Cited by (31)

    • An improvement in performance of mobile ad hoc networks using modified route maintenance

      2016, Computers and Electrical Engineering
      Citation Excerpt :

      We have assumed overhearing factor (OF) which indicates the availability of alternate route for destination. In [25], height table is managed by all mobile nodes. A height value is used to select the forward and backward node in route repair process.

    • Routing protocols in ad hoc networks: A survey

      2011, Computer Networks
      Citation Excerpt :

      This can be approached from several directions: Improving the speed of rebuilding the routes: protocols of this class are TORA [89], AODV-ABR[65] (rebuilding with backup routes), low overhead dynamic route repair [135], SLR [108] (using bypass routing), DBR2P [125] (backup routes), RBR [75] (using route redirectors). Choosing paths which are predicted to be more stable: ABR [116] (based on associativity), SSBR [37] (based on signal stability), FORP [113] (by predicting future changes), LLR [28] (favoring long lifetime routes), QMRB [52] and LBAQ [136] (based on prediction of future link availability).

    • Route Maintenance in IEEE 802.11 wireless mesh networks

      2011, Computer Communications
      Citation Excerpt :

      Most existing approaches rely upon the IEEE 802.11 link layer based feedback to declare link breakages. While there are a number of solutions on how to cope with route breakages, including local route recovery and using alternate routes [8–11,31–34], the fact that many link breakages are transient and Route Maintenance can be optimized has been neglected. The first class of solutions employs backup routes in case the original fails.

    • Study and design of route repairing mechanism in MANET

      2020, Lecture Notes in Networks and Systems
    • Prediction based topology reconfiguration using clustering for power efficient operation in mobile adhoc networks

      2017, 2017 4th International Conference on Signal Processing, Communication and Networking, ICSCN 2017
    View all citing articles on Scopus

    Chang Wu Yu received the BS degree from Soochow University in 1985, MS degree from National Tsing Hua University in 1989, and PhD degree from National Taiwan University in 1993, Taiwan, all in computer sciences. From 1995 to 1998, he was an Associate Professor at the Department of Information Management, Ming Hsin Institute of Technology. In 1999, he joined the Department of Computer Science & Information Engineering, Chung Hua University. His current research interests include graph algorithms, wireless networks, and distributed computing.

    Tung-Kuang Wu received his PhD degree in computer engineering from the Department of Computer Science & Engineering at Pennsylvania State University in 1995. He is currently an associate professor in the Department of Information Management at National Changhua University of Education, Changhua, Taiwan. His current research interests include wireless communication, special education technologies, and e-Learning.

    Reig Heng Cheng received the MS and PhD degrees in Computer Science and Information Engineering from National Chiao Tung University, Taiwan, R.O.C. in 1989 and 1995 respectively. Since 1999, he has been on the faculty of Hsuan Chuang University, HsinChu, Taiwan. He is currently an Associate Professor at the Department of Computer Science. His research interests include wireless and sensor networks, image processing, and character recognition.

    View full text