Skip to main content

A New Markov Chain Based Cost Evaluation Metric for Routing in MANETs

  • Conference paper
Information Technology and Mobile Communication (AIM 2011)

Abstract

In recent time, routing remains a major concern in Mobile adhoc networks (MANETs) due to the mobility of nodes. In particular, the link stability remains a major concern in existing protocols. In this paper, we propose a Markov Chain based Cost Evaluation Metric (MCCE) which is an extension of existing WCETT metric with an enhancement of link stability. The proposed routing metric is capable of providing better link stability and higher packet delivery fraction than the other proposed metrics in this category.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Safwat, A.M., Hassanein, H.S.: Infrastructure-based routing in wireless mobile ad hoc networks. Computer Communications 25(3), 210–224 (2002)

    Article  Google Scholar 

  2. IETF MANET Working Group Charter, http://www.ietf.org/html.charters/manetcharter.html

  3. Raimundo, J., Macêdo, A., Assis Silva, F.M.: The mobile groups approach for the coordination of mobile agents. J. Parallel Distributed Computing 65, 275–288 (2005)

    Article  Google Scholar 

  4. Das, S.R., Perkins, C.E., Royer, E.M.: Performance Comparison of Two On demand Routing Protocols for Ad Hoc Networks. In: IEEE INFOCOM (March 2000)

    Google Scholar 

  5. Spohn, M., Garcia-Luna-Aceves, J.J.: Neighborhood aware source routing. In: Proceedings of ACM MobiHoc, 6th IEEE/ ACIS International Conference on Computer and Information Science, LongBeach, CA (2001)

    Google Scholar 

  6. Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc Wireless networks. Mobile Computing, 153–181 (1996)

    Google Scholar 

  7. Perkins, C., Belding-Royer, E., Das, S.: Ad hoc On-Demand Distance Vector (AODV) Routing. In: IETF.RFC, vol. 3561 (2003), http://tools.ietf.org/html/rfc3561

  8. Tønnesen, A.: Implementing and extending the Optimized Link State Routing Protocol. UniK University Graduate Center, University of Oslo (2004)

    Google Scholar 

  9. Couto, D.S.J.D., Aguayo, D., Bicket, J., Morris, R.: A high throughput path metric for multi-hop wireless routing. In: Proc. MOBICOM (2003)

    Google Scholar 

  10. Draves, R., Padhye, J., Zill, B.: Routing in multi-radio, multi-hop wireless mesh network. In: Proc. MOBICOM (2004)

    Google Scholar 

  11. Fall, K., Varadhan, K. (eds.): NS notes and documentation. The VINT project, LBL (February 2000), http://www.isi.edu/nsnam/ns/S

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tiwari, A., Wadhawan, N., Kumar, N. (2011). A New Markov Chain Based Cost Evaluation Metric for Routing in MANETs. In: Das, V.V., Thomas, G., Lumban Gaol, F. (eds) Information Technology and Mobile Communication. AIM 2011. Communications in Computer and Information Science, vol 147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20573-6_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20573-6_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20572-9

  • Online ISBN: 978-3-642-20573-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics