Analysis and Comparision of Position Based Routing Protocol in Mobile Adhoc Network

  • Vimal Upadhyay
  • Gori Shankar
  • Amritpal
  • Jai Balwan
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 205)


This Paper introduces the concept of ad hoc network and its applications. It also presents a brief review of conventional routing protocols and various routing approaches proposed for mobile ad hoc network. A brief description of various parameters used for performance evaluation of routing algorithms is also presented. An ad hoc wireless network is “a collection of two or more devices equipped with wireless communications and network capability” that creates a network “on the fly” without any network infrastructure. They offer quick and easy network deployment in situations where it is not possible otherwise. That’s why the idea of ad hoc networking is sometimes also called infrastructure less networking. Mobile Ad-hoc networks are self-organizing and self-configuring multi-hop wireless networks where, the structure of the network changes dynamically. This paper is intended to bring out the details of mainly two Position Based Routing Protocol named as LAR, DREAM. In position based routing the position (location) plays an important role in routing decisions. The position of a node can be made available by using GPS receivers or by evaluating relative positions using signal strength .Position based routing does not require knowledge of the entire network to find a route from source to destination Position based routing require that information about the physical position of the participating nodes be available and describing various parameters for LAR ,DREAM used by various authors and Proposed parameters for evaluating their performance.


Mobile Host Successful Delivery Greedy Perimeter Stateless Route Distance Route Request Zone 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lang, D.: A Comprehensive overview about selected Ad-Hoc Networking Routing Protocols, Technical Report, Department of Computer Science, Teclmische University (March 14, 2003)Google Scholar
  2. 2.
    Ramakrishanan, K.: An Improved Model for the Dynamic Effect Algorithm for Mobility protocol, PhD thesis, Department of Science, University of Waterloo (2004)Google Scholar
  3. 3.
    Ko, Y.-B., Vaidhya, N.H.: Location-Aided Routing in Mobile Adhoc Networks. In: Proc. Of MOBICOM 1998 (1998)Google Scholar
  4. 4.
    Basagni, S., Chlamtac, I., Syrotiuk, V.R., Woodward, B.A.: A Distance Routing Effect Algorithm for Mobility (DREAM). In: Proc. ACM/IEEE Intl. Conference on Mobile Computing and Networking (MOBICOM), Dallas, TX, pp. 76–84 (October 1998)Google Scholar
  5. 5.
    Su, W., Lee, S.-J., Gerla, M.: Mobility Prediction and Routing in Adhoc Wireless Networks, Department of Computer Science, University of California (wsu, sjlee, gerla)@cs.ucla.eduGoogle Scholar
  6. 6.
    Luo, X.: Predictive Methods for Location Services in Mobile Ad hoc Networks, Technical Report, Department of Mathematical and Computer Science (2004)Google Scholar
  7. 7.
    Karp, B., Kung, H.T.: GPSR: Greedy Perimeter Stateless Routing for Wireless Networks. In: MobiCom 2000, Conference of the IEEE Computer and Communication Societies (INFOCOM 2002) (2000)Google Scholar
  8. 8.
    The Network Simulator – ns-2,
  9. 9.
  10. 10. -Marc Greis Tutorial for ns-2

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Vimal Upadhyay
    • 1
  • Gori Shankar
    • 1
  • Amritpal
    • 1
  • Jai Balwan
    • 1
  1. 1.Department of CS/ECSt. Margaret Engineering CollegeNeemrana AlwarIndia

Personalised recommendations