Skip to main content
SpringerLink
Log in

Network Forensics on Mobile Ad-Hoc Networks

  • Conference paper
Knowledge-Based Intelligent Information and Engineering Systems (KES 2008)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 5179))

Abstract

A variety of countermeasures for every eventuality are more important than maintaining a mechanism that does not suffer any kind of assaults in mobile adhoc networks. From the experimental results, the ratio of the number of evidence packets and the total number of nodes was confirmed with the ratios of the transmission range and the objective range. The number of the evidence packets is controlled by the level of reliability. All nodes in mobile ad hoc networks need to be free from all suspicions.

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

Access this chapter

Log in via an institution
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. Perkins, C., Belding-Royer, E., Das, S.: Ad Hoc On Demand Distance Vector (AODV) Routing. IETF-Request-for-Comments, rfc3561.txt (2003)

    Google Scholar 

  2. Johnson, D., Hu, Y., Maltz, D.: The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4. IETF-Request-for-Comments, rfc4728.txt (2007)

    Google Scholar 

  3. Mori, T., Mori, I., Takahashi, O.: A Classification of Defense Method in Ad-Hoc Networks and Proposal for the Anti Attack Ad-hoc Routing Protocol Architecture, MBL-41. In: MBL, vol. 41, pp. 73–78 (2007)

    Google Scholar 

  4. Mori, I., Mori, T., Takahashi, O.: Classification of Attacks and Defense method and Proposal of AODV-based Secure Routing Protocol in Mobile Ad Hoc Networks, MBL-41. In: MBL, vol. 41, pp. 79–84 (2007)

    Google Scholar 

  5. Yu, W., Sun, Y., Ray Liu, K.J.: HADOF: Defense Against Routing Disruptions in Mobile Ad Hoc Networks. In: INFOCOM 2005, Miami (2005)

    Google Scholar 

  6. Marti, S., Giuli, T., Lai, K., Baker, M.: Mitigating routing misbehavior in mobile ad hoc networks. In: Proceedings of Mobicom 2000, Boston (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Systems Information Science, Future University-Hakodate, 116-2 Kamedanakano-cho, Hakodate Hokkaido, Japan

    Akira Otaka, Tsuyoshi Takagi & Osamu Takahashi

Authors
  1. Akira Otaka
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tsuyoshi Takagi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Osamu Takahashi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ignac Lovrek Robert J. Howlett Lakhmi C. Jain

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Otaka, A., Takagi, T., Takahashi, O. (2008). Network Forensics on Mobile Ad-Hoc Networks. In: Lovrek, I., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2008. Lecture Notes in Computer Science(), vol 5179. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85567-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85567-5_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85566-8

  • Online ISBN: 978-3-540-85567-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation