Mitigating Black Hole Attacks in AODV Routing Protocol Using Dynamic Graph

  • Arunangshu Pal Department of Computer Applications, NIT Durgapur,India.
  • Prasenjit Choudhury Department of Mathematics, NIT Durgapur,India.

Abstract

With the advancement of wireless technologies, Mobile Ad hoc NETwork (MANET) has been an important field of study. MANETs find useful applications in the real world, for example in military battlefield and disaster management. Since MANET is dynamic in nature, it must be represented by dynamic graph. Evolving graph, a form of dynamic graph, may be used for the purpose. When we talk about a network, a routing protocol comes into the question, and one of the most popular routing protocols is AODV. However, since AODV suffers from a drawback that it may be a victim of black hole attack, we need to find a technique to eliminate the possibility of the phenomenon. This paper makes a study of MANET and an efficient way of representing MANET by dynamic graph. It explains the AODV routing technique and the black hole attack. It then extends the idea of dynamic graph to propose a technique to solve the problem of black hole attack in AODV.

References

J Monteiro, The use of evolving graph combinatorial model in routing protocols for dynamic Networks. Instituto de Matematica e Estatistica - Universidade de Sao Paulo (IME-USP).
[2] J Monteiro, A Goldman and A Ferreira, Performance Evaluation of Dynamic Networks using an Evolving Graph Combinatorial Model. WiMob ’06 – Montreal/Canada.
[3] S Taneja and A Kush, A survey of routing protocols in mobile ad hoc networks. Int. J. Innovation, Management and Technology, vol. 1, 2010.
[4] K Lego, P K Singh and D Sutradhar, Comparative study of adhoc routing protocol AODV, DSR and DSDV in mobile adhoc network. Indian J. Computer Science and Engineering, vol. 1, 364-371.
[5] L Klein-Berndt, A Quick Guide to AODV Routing. National Institute of Standards and Technology, Technology Administration, U.S. Department of Commerce.
[6] B Awerbuch and A Mishra, Ad hoc on demand distance vector (AODV) routing protocol, Advanced Topics in Wireless Networks. Department of Computer Science, Johns Hopkins.
[7] M Al-Shurman and S Yoo, S Park, Black Hole Attack in Mobile Ad Hoc Networks.
[8] R H Khokhar, M A Ngadi and S Mandala, A review of current routing attacks in mobile ad hoc networks. Intl J. Comp. Sci. and Security, vol. 2. No.3, pp. 18-29, 2008
Published
2012-08-22
How to Cite
PAL, Arunangshu; CHOUDHURY, Prasenjit. Mitigating Black Hole Attacks in AODV Routing Protocol Using Dynamic Graph. Mapana - Journal of Sciences, [S.l.], v. 11, n. 4, p. 65-76, aug. 2012. ISSN 0975-3303. Available at: <http://journals.christuniversity.in/index.php/mapana/article/view/281>. Date accessed: 27 may 2019. doi: https://doi.org/10.12723/mjs.23.5.
Section
Research Articles