Group Source Routing Protocol with Selective Forwarding for Mobile Ad Hoc Networks

  • Hoon Oh
  • Do Minh Ngoc
Part of the IFIP — The International Federation for Information Processing book series (IFIPAICT, volume 256)


In this paper, we have proposed a group dynamic source routing protocol, GDSR, for mobile ad hoc networks with high mobility. We focus on pursuing routing stability and making a fast recovery of link failure. Nodes in a network are divided into clusters, each being assigned a unique cluster label. A routing path is represented by a source route including a sequence of cluster labels, and the nodes having an identical cluster label are responsible for delivering packets cooperatively to the cluster whose label is the next one in the source route. We have also employed a distributed self-pruning algorithm DSP to prevent intermediate nodes from relaying RREQ unnecessarily, thus reducing considerable overhead. We compared our protocol with some existing ones and the result is proven to be highly dependable.


Source Node Cluster Head Intermediate Node Delivery Ratio Route Discovery 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Z. Haas, M. Pcarlman, and P. Samar, “Zone routing protocol (ZRP)”, IETF Internet Draft, draft-ietf-manet-zrp-04.txt, July 2002.Google Scholar
  2. 2.
    D. Johnson, D. Maltz, Y Hu and J Jetchcva, “The dynamic source routing protocol for mobile ad hoc networks,” IETF MANET Internet Draft, Feb 2002.Google Scholar
  3. 3.
    M. Jiang, J. Li, and Y. C. Tay, “Cluster based routing protocol (CBRP) functional specification”, IETF Internet Draft,draft-ietf-rnanet-cbrp-spec-Ol.txt, July 1999.Google Scholar
  4. 4.
    P. Jacquet, P. Muhlethaler and A. Qayyam, “Optimized link-state routing protocol,” IETF MANET Internet Draft, Mar 2002 (work in progress).Google Scholar
  5. 5.
    V. Li, H. S. Park and H. Oh, “A cluster-label based mechanism for backbones on mobile ad hoc networks,” Springer Verlag, LNCS 3970, pp. 26–36, May, 2006.Google Scholar
  6. 6.
    C. Perkins and P. Bhagwat, “Highly dynamic destination sequenced distance vector routing for mobile computers,” In Proceedings of ACM SIGCOMM, 24(4), Oct 1994.Google Scholar
  7. 7.
    E. M. Royer and C. E. Perkins, “Ad-hoc on-demand distance vector routing,” In 2nd IEEE Workshop on Mobile Computing Systems and Applications, pages 90–100, Feb 1999.Google Scholar
  8. 8.
    H. Oh and S. Y. Yun, “Distributed Self-Pruning (DSP) Algorithm for Bridges in Clustered Ad Hoc Networks”, ICESS 2007: 699–707, May 2007.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2008

Authors and Affiliations

  • Hoon Oh
    • 1
  • Do Minh Ngoc
    • 1
  1. 1.Department of Computer Engineering and Information TechnologyUniversity of UlsanKorea

Personalised recommendations