A Performance Analysis of AODV Routing Protocol under Combined Byzantine Attacks in MANETs

The concept of byzantine attack comes from Byzantine Generals Problem. In this abstract concept, the loyal byzantine army general are suppose to coordinate in a battlefield to conclude a common plan in the presence of traitor generals which can disrupt such coordination. This Generals Problem resembles the attacks initiated by authenticated nodes/devices in Ad Hoc Network to disrupt the network. Although these attacks can be initiated individually but are more devastating if initiate in a combined way. This paper discusses and highlights the performance degradation of AODV routing protocol, mainly when the byzantine attack are initiated in a combination

[1]  Sajal K. Das,et al.  Cooperative black and gray hole attacks in mobile ad hoc networks , 2008, ICUIMC '08.

[2]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[3]  Jorge Nuevo A Comprehensible GloMoSim Tutorial , 2004 .

[4]  Tarek Khalifa,et al.  Secure Data Aggregation Protocol with Byzantine Robustness for Wireless Sensor Networks , 2007 .

[5]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[6]  Farooq Anjum,et al.  Security for Wireless Ad Hoc Networks: Anjum/Ad hoc Networks , 2007 .

[7]  Uyen Trang Nguyen,et al.  A study of different types of attacks on multicast in mobile ad hoc networks , 2008, Ad Hoc Networks.

[8]  Yih-Chun Hu,et al.  Rushing attacks and defense in wireless ad hoc network routing protocols , 2003, WiSe '03.

[9]  Dharma P. Agrawal,et al.  Security in Wireless Ad Hoc Networks , 2005, Handbook of Algorithms for Wireless Networking and Mobile Computing.

[10]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[11]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[12]  Li Xu,et al.  Analysis and Countermeasure of Selfish Node Problem in Mobile Ad Hoc Network , 2006, 2006 10th International Conference on Computer Supported Cooperative Work in Design.

[13]  Reza Curtmola,et al.  ODSBR: An on-demand secure Byzantine resilient routing protocol for wireless ad hoc networks , 2008, TSEC.

[14]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.