Skip to main content

Studies on TBRPF Routing Algorithm and Detection of Routing Loop Attack in Mobile Ad-Hoc Network

  • Conference paper
Advances in Computer Science and Education Applications

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 202))

  • 2009 Accesses

Abstract

At present, the application Mobile Ad-hoc Network (MANET) is increasing at a steady pace. The basic problem with MANET lies in its ad hoc nature. The lack of infrastructures in MANET makes the detection and control of security hazards all the more difficult. In this paper, an attempt has been made to study the various attacks in MANET. The focus is mainly on the routing-loop attack which is one of the possible attacks in ad hoc networks. In a routing-loop attack, a packet may circulate around a loop for some time before its TTL (Time To Live) or Hop count field goes to zero. Even when only a small portion of the traffic enters these loops and only for a brief time, effect is impact on surrounding medium and traffic, thus degrading network performance. In order to prevent this kind of attack, it is crucial to detect the abnormality that occurs during the attack. In conventional schemes, anomaly detection is achieved by defining the normal state from static training data. However, in mobile ad hoc networks where the network topology dynamically changes, such static training method could not be used efficiently. In this paper, I propose an anomaly Detection scheme using dynamic training method in which sequence number of each packet in transit is calculated each time to discard an errant packet.

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. Khokhar, R.H., Ngadi, A., Mandala, S.: A Review of Current

    Google Scholar 

  2. Routing Attacks in Mobile Ad Hoc Networks. International Journal of Computer Science and Security 2(3)

    Google Scholar 

  3. Lin, T., Midkiff, S.F.: Mobile Ad-hoc Network Routing Protocols. Chair Computer Engineering

    Google Scholar 

  4. Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector (DSDV) for Mobile Computers. In: Proc. ACM Conf. Communications Architectures and Protocols (SIGCOMM 1994), London, UK (1994)

    Google Scholar 

  5. Topology Broadcast Based on Reverse-Path Forwarding (TBRPF). Internet Engineering Task Force (IETF)

    Google Scholar 

  6. Ogier, R.G., Templin, F.L., Bellur, B., Lewis, M.G.: Draft (November 2002)

    Google Scholar 

  7. Royer, E.M., Toh, C.-K.: A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks. IEEE Personal Communications

    Google Scholar 

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

Ghosh, D. (2011). Studies on TBRPF Routing Algorithm and Detection of Routing Loop Attack in Mobile Ad-Hoc Network. In: Zhou, M., Tan, H. (eds) Advances in Computer Science and Education Applications. Communications in Computer and Information Science, vol 202. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22456-0_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22456-0_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22455-3

  • Online ISBN: 978-3-642-22456-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics