Elsevier

Computer Communications

Volume 30, Issue 1, 15 December 2006, Pages 202-206
Computer Communications

Short communication
Gathering-based routing protocol in mobile ad hoc networks

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

Abstract

A gathering-based routing protocol (GRP) for mobile ad hoc networks is presented. The idea is to rapidly collect network information at a source node at an expense of a small amount of control overheads. The source node can equip promising routes on the basis of the collected information, thereby continuously transmitting data packets even if the current route is disconnected. It results in achieving fast (packet) transfer delay without unduly compromising on (control) overhead performance.

Introduction

Since all nodes in the mobile ad hoc networks can be mobile and communicate with one another either directly or through intermediate nodes with no fixed infrastructure, it is necessary to design an efficient routing protocol [1].

Proactive routing protocol (PRP) requires every node to maintain full routing information, while reactive routing protocol (RRP) typically relies on the flooding of queries to discover a destination [1]. PRP is, therefore, suitable for supporting the delay sensitive services such as voice and video [1], [2], [3]. However, it consumes a significant portion of the network capacity in order to keep the routing information current. The class of distance-vector based protocols such as destination-sequenced distance-vector routing protocol (DSDV) [2] and wireless routing protocol (WRP) [3] are representative examples of PRP. Although RRP may not be suited for real-time communication, it does not generally incur significant control overheads [1], [4], [5]. The query-reply handshake assisted protocols such as ad hoc on-demand distance-vector routing protocol (AODV) [4], dynamic source routing protocol (DSR) [5], and temporally ordered routing algorithm (TORA) [6] belong to the RRP.

Naturally, an approach for simultaneously taking the strengths of PRP and RRP has attracted due attention of late. This approach is widely known as hybrid routing protocol. Cluster-based routing protocol [7], zone routing protocol [8], and fisheye state routing protocol [9] are representative examples. However, the genuine objective has not been effectuated. In other words, they fall within the purview of a compromise between PRP and RRP.

In this regard, this paper proposes a simple, but efficient routing protocol in the mobile ad hoc networks. This is the gathering-based routing protocol (GRP). The aim is to somehow garner the benefits accruing from the short transfer delay of PRP and the small overheads of RRP.

Section snippets

Gathering-based routing protocol

A mobile ad hoc network is modeled as an undirected graph where a set of nodes and a set of (full-duplex) links are time-varying sets. We assume the use of a MAC protocol which resolves the problem of hidden/expose nodes. A representative instance is given in [10]. It is also assumed that all the nodes can enable a promiscuous receive mode. There is another assumption that every node recognizes its own neighbors (by incorporating a neighbor discovering protocol) and thus all the information

Experimental results

Since GRP makes an attempt to incorporate the strengths of PRP and RRP, the reference instances are taken from DSDV [2] and AODV [4]. In this experiment, average (packet) transfer delay and control overhead are chosen as performance measures. This is because DSDV and AODV can be of great benefit for packet transfer and control overhead, respectively.

An analogous idea in route establishment has been introduced in [11]. But there is an important difference in discovering network knowledge. That

Conclusion

An efficient routing protocol for mobile ad hoc networks has been proposed. It rapidly collects network information at the source node using a small amount of control overheads. Since the source node effectively manages promising routes based on the gathered information, it can speedily transfer data packets without unduly wasting control overheads. It means that the proposed protocol simultaneously gets the best of both PRP and RRP.

Chang Wook Ahn recevied his Ph.D. degree in the department of Information and Communication, Gwangju Institute of Science and Technology (GIST), Korea, in 2005. Currently, he is working in the Samsung Advanced Institute of Technology (SAIT). His research interests include the design and analysis of MAC protocols and QoS-oriented routing for broadband radio access networks and mobile ad-hoc networks. In particular, he has focused on developing intelligent wireless networks using evolutionary

References (12)

  • E.M. Royer et al.

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

    IEEE Personal Communications

    (1999)
  • C.E. Perkins

    Highly dynamic destination-sequenced distance-vector routing (DSDV) for mobile computers

    Computer Communications Review

    (1994)
  • S. Murth et al.

    An efficient routing protocol for wireless networks

    ACM Mobile Networks and Application Journal – Special Issue on Routing in Mobile Communication Networks

    (1996)
  • C.E. Perkins, E.M. Royer, S.R. Das, Ad hoc on-demand distance vector (AODV) routing, IETF Mobile Ad Hoc Networks...
  • D.B. Johnson, D.A. Maltz, Dynamic source routing in ad hoc wirless networks, in: T. Imielinski, H. Korth (Eds.), Mobile...
  • V.D. Park, M.S. Corson, A highly adaptive distributed routing algorithm for mobile wireless networks, in: Proceedings...
There are more references available in the full text version of this article.

Cited by (9)

  • Routing protocols in ad hoc networks: A survey

    2011, Computer Networks
    Citation Excerpt :

    Once this timer expires, the expired routes are purged from the route cache to free up memory and remove redundancy. Gathering based routing protocol (GRP) [3]: Ahn presents the gathering based routing protocol which collects network information during route discovery to be used later by the source node. Initially, the source node broadcasts a destination query (DQ) packet which is continuously forwarded towards the destination.

  • Taxonomy of Routing Protocols

    2022, 2022 International Conference for Advancement in Technology, ICONAT 2022
  • A Review on Routing in Internet of Things

    2020, Wireless Personal Communications
  • An efficient gateway routing scheme for disaster recovery scenario

    2019, International Conference on Information Networking
  • A Brief Survey on Energy Efficient Routing Parameters Protocols in WSN

    2018, Proceedings - 2018 3rd International Conference On Internet of Things: Smart Innovation and Usages, IoT-SIU 2018
  • Analysis of Encryption Dgrp-Data Gather Routing Protocol Based on Opnet in VANETs

    2016, Proceedings - 2015 International Conference on Computational Intelligence and Communication Networks, CICN 2015
View all citing articles on Scopus

Chang Wook Ahn recevied his Ph.D. degree in the department of Information and Communication, Gwangju Institute of Science and Technology (GIST), Korea, in 2005. Currently, he is working in the Samsung Advanced Institute of Technology (SAIT). His research interests include the design and analysis of MAC protocols and QoS-oriented routing for broadband radio access networks and mobile ad-hoc networks. In particular, he has focused on developing intelligent wireless networks using evolutionary computing and machine-learning techniques.

View full text