CFP last date
20 January 2025
Reseach Article

AODVB: Ad hoc On-Demand Distance Vector with Black Hole Avoidance

by Venkatesh, Raj Mohammed
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 178 - Number 1
Year of Publication: 2017
Authors: Venkatesh, Raj Mohammed
10.5120/ijca2017915706

Venkatesh, Raj Mohammed . AODVB: Ad hoc On-Demand Distance Vector with Black Hole Avoidance. International Journal of Computer Applications. 178, 1 ( Nov 2017), 5-10. DOI=10.5120/ijca2017915706

@article{ 10.5120/ijca2017915706,
author = { Venkatesh, Raj Mohammed },
title = { AODVB: Ad hoc On-Demand Distance Vector with Black Hole Avoidance },
journal = { International Journal of Computer Applications },
issue_date = { Nov 2017 },
volume = { 178 },
number = { 1 },
month = { Nov },
year = { 2017 },
issn = { 0975-8887 },
pages = { 5-10 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume178/number1/28636-2017915706/ },
doi = { 10.5120/ijca2017915706 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-07T00:49:11.911304+05:30
%A Venkatesh
%A Raj Mohammed
%T AODVB: Ad hoc On-Demand Distance Vector with Black Hole Avoidance
%J International Journal of Computer Applications
%@ 0975-8887
%V 178
%N 1
%P 5-10
%D 2017
%I Foundation of Computer Science (FCS), NY, USA
Abstract

A Wireless ad-hoc network is a temporary network set up by nodes moving arbitrary in the places that have no network infrastructure. The nodes find a path to the destination node using routing protocols. However, due to security vulnerabilities of the routing protocols, wireless ad-hoc networks are unprotected to attacks of the malicious nodes. One of these attacks is the Black Hole Attack against network integrity absorbing all data packets in the network. Since the data packets do not reach the destination node on account of this attack, data loss will occur. In this paper work, we propose A AODVB (Ad hoc On-Demand Distance Vector with Black-hole Avoidance) protocol for avoiding black-hole attack. AODVB forms link disjoint multi-path during path discovery to provide greater path selection in order to avoid malicious nodes in the path using legitimacy table maintained by each node in the network. Non-malicious nodes gradually isolate the black-hole nodes based on the values collected in their legitimacy table and avoid them while making path between source and destination. We simulated AODV protocol with and without Black-hole attack and our solution AODVB protocol. From our simulation results AODV network has normally 3.21 % data loss and if a Black Hole Node is introducing in this network data loss is increased to 92.59 %. When we used AODVB protocol in the same network, the data loss decreased to 65 %.

References
  1. M.A. Shurman, S.M. Yoo, and S. Park, “Black hole attack in mobile adhoc networks,” 42nd ACM Southeast Regional Conf., 2004, pp. 11-14.
  2. L. Tamilselvan, and V. Sankaranarayanan, “Prevention of cooperative black hole attack in manet”, Journal of Networks, Vol. (5), 2008, pp.13-20.
  3. S. Marti, T. Giuli, K. Lai, and M. Baker, “Mitigating routing misbehavior in mobile adhoc networks”, Proceedings of the ACM Conf. on Mobile Computing and Networking (Mobicom), 2000, pp. 255-265.
  4. S. Buchegger, and J. Le Boudec, “A testbed for misbehavior detection in mobile adhoc networks-how much can watchdogs really do”, Technical Report IC/2003/72 EPFL-DI-ICA, 2003. pp. 32-41.
  5. H. Deng, W. Li, and D. P. Agrawal. “Routing Security in Adhoc Networks.” In: IEEE Communications Magazine, Vol. 40, No. 10, pp. 70-75, Oct. 2002.
  6. Sanjay Ramaswamy, Huirong Fu, Manohar Sreekantaradhya, John Dixon, and Kendall Nygard, “Prevention of Cooperative Black Hole Attack in Wireless Ad Hoc Networks”, 2003. International Conference on Wireless Networks (ICWN-03), Las Vegas, Nevada.
  7. Hesiri Weerasinghe and Huirong Fu, Member of IEEE, Preventing Cooperative Black Hole Attacks in Mobile Adhoc Networks: Simulation Implementation And Evaluation, IJSEA,Vol2,No.3,July 2008.
  8. Y.C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad hoc Networks,” Proc. 4th IEEE Workshop on Mobile Computing Systems and Applications, Callicoon, NY, June 2002, pp. 3-13.
  9. Y.C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure On-Demand Routing Protocol for Ad hoc Networks,” Proc. 8th ACM Int’l. Conf. Mobile Computing and Networking (Mobicom’02), Atlanta, Georgia, September 2002, pp. 12- 23.
  10. Kimaya Sanzgiti, Bridget Dahill, Brian Neil Levine, Clay shields, Elizabeth M, Belding-Royer, “A secure Routing Protocol for Ad hoc networks” In Proceedings of the 10th IEEE International Conference on Network Protocols (ICNP’ 02), 2002.
  11. S. Yi, P. Naldurg, and R. Kravets, “Security-Aware Ad hoc Routing for Wireless Networks,” Proc. 2nd ACM Symp. Mobile Ad hoc Networking and Computing (Mobihoc’01), Long Beach, CA, October 2001, pp. 299-302.
  12. M. Zapata, ―Secure Ad Hoc On-Demand Distance Vector (SAODV), Internet draft, draft-guerrero-manet-saodv-01.txt, 2002.
  13. The Network Simulator Wiki. [Online]. http://nsnam.isi.edu/nsnam/index.php/
  14. The Network Simulator – ns-2. [Online]. Available: http://www.isi.edu/nsnam/ns/
  15. M. Greis. Tutorial for the Network Simulator NS2. [Online]. Available: http:// www.isi.edu/nsnam/ns/tutorial/
  16. C.Perkins, “(RFC) Request for Comments – 3561”, Category: Experimental, Network, Working Group, July 2003.
  17. F. J. Ros and P. M. Ruiz, “Implementing a New Manet Unicast Routing Protocol in NS2”, December, 2004, http://masimum.dif.um.es/nsrt-howto/pdf/nsrt-howto.pdf
Index Terms

Computer Science
Information Sciences

Keywords

Black Hole Attack link disjoint multi-path legitimacy table.