Skip to main content

Abstract

The routing is able to send request message from source to destination hop through intermediate hops. The intermediate hops forward the received messages to its neighbours. The replicated copies of the request message will received at each hop. Each hop transmits the copy of message to its neighbours. In receiving and transmitting the messages, it consumes much of energy of hop, which can be saved by using selective hop forwarding approach. This paper proposed a model name as dynamic probabilistic broadcast for route discovery (DPBRD), which tries to reduce the replicated copies of control messages to save energy. This method determines the forward probability by consider extended area and hop density to forwards request messages to its neighbours. The performance of the proposed protocol has been evaluated and compared with AODV (Flooding), THPRD and DPBSC protocols across different performance metrics—Average received duplicate messages, saved percentage of forward messages, and energy consumption. The results demonstrate that the proposed DPBRD protocol outperforms other. NS-2 environment was used to simulate and analyse the proposed protocol.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Jae-soo, K.: Probabilistic broadcasting based on coverage area and neighbour confirmation in mobile ad hoc networks. In: Global Telecommunications Conference Workshops, 2004, GlobeCom Workshops 2004, pp. 96–101. IEEE (2004)

    Google Scholar 

  2. Perkins, C., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers, vol. 24, Issue-4, pp. 234–244. ACM, UK (1994)

    Google Scholar 

  3. Johnson, D.B., Maltz, D.A., Hu, Y.C.: The dynamic source routing protocol for mobile Ad Hoc networks (DSR). In: Internet Draft, IETF Mobile Ad hoc Networks (MANET) Working Group, pp. 1–108 (2003)

    Google Scholar 

  4. Perkins, C.E., Belding-Royer, E.M., Das, S.R.: Adhoc On-Demand Distance Vector (AODV) Routing, pp. 125–150. IETF, Internet Draft (2003)

    Google Scholar 

  5. Agarwal, M.M., Govil, M.C., Jhankal, A.K.: A Probabilistic method to optimize energy consumption in mobile Ad-hoc networks. In: Proceedings of the ICRAIE-2014, India, IEEE Xplore, pp. 1–5, May 2014

    Google Scholar 

  6. Lipman, J., Liu, H., Stojmenovic, I.: Broadcast in Ad Hoc Networks, pp. 121—150. Springer-Verlag London Limited (2009). doi:10.1007/978-1-84800-328-6_6

    Google Scholar 

  7. Wang, Q., Shi, H., Qi, Q.: A dynamic probabilistic broadcasting scheme based on cross-layer design for MANET. IJMECS, pp. 40–47 (2010)

    Google Scholar 

  8. Ni, S., Tseng, Y., Chen, Y., Sheu, J.: The broadcast storm problem in a mobile ad-hoc network. In: Proceedings of the ACM/IEEE International Conference on Mobile Computing and Networking, Seattle, pp. 151–162. Washington, United States (1999)

    Google Scholar 

  9. Christian, B., Giovanni, R., Paolo, S.: The hop distribution of the random waypoint mobility model for wireless ad hoc networks. IEEE Trans. Mob. Comput. 2(3), pp. 257–269, July 2003

    Google Scholar 

  10. Gowrishankar, S., Basavaraju, T.G., Sarkar, S.K.: Simulation based overhead analysis of AOMDV, TORA and OLSR in MANET using various energy models. In: Proceedings of the World Congress on Engineering and Computer Science, WCECS 2010, vol. I, pp. 1–15. San Francisco, USA (2010)

    Google Scholar 

  11. Fall, K., Varadhan, K.: The ns Manual (formerly ns Notes and Documentation), The VINT Project, UC Berkeley, LBL, USC/ISI, and Xerox PARC, 11 Feb 2007

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Madan Mohan Agarwal .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Agarwal, M.M., Govil, M.C., Jhankal, A.K. (2016). Probabilistic-Based Energy Efficient Dynamic Route Discovery in MANET’s. In: Afzalpulkar, N., Srivastava, V., Singh, G., Bhatnagar, D. (eds) Proceedings of the International Conference on Recent Cognizance in Wireless Communication & Image Processing. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2638-3_67

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2638-3_67

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2636-9

  • Online ISBN: 978-81-322-2638-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics