EAODV: detection and removal of multiple black hole attacks through sending forged packets in MANETs

被引:27
作者
Delkesh, Taher [1 ]
Jamali, Mohammad Ali Jabraeil [1 ]
机构
[1] Islamic Azad Univ, Shabestar Branch, Dept Comp Engn, Shabestar, Iran
关键词
Mobile ad-hoc networks; Black hole attack; Detecting black hole attack; Malicious nodes; Routing protocol security; AODV protocol; AD HOC NETWORKS; INTRUSION DETECTION; ALGORITHM; PROTOCOL; AODV; PERFORMANCE; PREVENTION; SECURITY;
D O I
10.1007/s12652-018-0782-7
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Detecting and removing black hole attacks are considered to be one major routing security issue in mobile ad hoc networks (MANETs). Malicious nodes existing on the delivery route of packets change a secure route into an insecure route in these networks. Hence, rather than delivering them to the next node, the malicious nodes discard data packets. In this paper, a routing algorithm is proposed based on sending forged packets so as to enhance the accuracy of detecting and removing malicious nodes. According to the proposed method, malicious nodes in a network are detected through sending forged route request (RREQ) and route reply (RREP) routing packets which include the address of unreal destination node. Then, they are removed from routing tables of nodes via sending an RREP message. The method proposed in this paper was able to improve traffic load in the network, identify a short and secure route, detect a number of malicious nodes and optimize the criteria of packet deliver rate, throughput and routing overhead. Simulations results indicated that the percentage of the delivered data packets by the proposed algorithm is higher than that of Intrusion Detection System (IDS) algorithm. Furthermore, thanks to the accuracy improvement in detecting black hole, lack of many conditions for RREQ and RREP and quick routing detection process, the delay in the proposed method was lower than other methods. The above-mentioned factors led to the optimization of throughput.
引用
收藏
页码:1897 / 1914
页数:18
相关论文
共 40 条
  • [1] Abraham A., 2007, Int. J. Netw. Secur, V4, P328
  • [2] [Anonymous], 2016, NOV PROACT ROUT PROT
  • [3] Ardakani S, 2016, AD HOC NETWORKS
  • [4] Struggling against simple and cooperative black hole attacks in multi-hop wireless ad hoc networks
    Baadache, Abderrahmane
    Belmehdi, Ali
    [J]. COMPUTER NETWORKS, 2014, 73 : 173 - 184
  • [5] Bansal Jagdish Chand, 2013, International Journal of Advanced Intelligence Paradigms, V5, P123
  • [6] Bica I, 2015, LECT NOTES COMPUTER, V9522, pIII, DOI [10.1007/978-3-319-27179-8, DOI 10.1007/978-3-319-27179-8]
  • [8] Ant colony optimization based enhanced dynamic source routing algorithm for mobile Ad-hoc network
    Chatterjee, Shubhajeet
    Das, Swagatam
    [J]. INFORMATION SCIENCES, 2015, 295 : 67 - 90
  • [9] Cherkaoui B, 2017, CLUSTERING ALGORITHM, P481
  • [10] Computing Personal Engineering Management Kuang-fu Road Information Technology and Sungai Besi Camp, 2012, INT J INNOV COMPUT I, V8, P8231