The nature of wireless ad hoc and sensor
networks make them very attractive to attackers. One of
the most popular and serious attacks in wireless ad hoc
networks is malicious node attack and most proposed
protocols to defend against this attack used positioning
devices, synchronized clocks, or directional antennas.
Each device in a MANET can move freely in any
direction, and will therefore change its links to other
devices easily. Each must forward traffic of others, and
therefore be called a router. The main challenge in
building a MANET is in terms of security. In this paper
the statistical approach is presented to detect malicious
nodes using the probability density function (PDF). The
proposed approach works with existing routing protocol
and the nodes that are suspected of having the malicious
behaviour are given a behavioral test. This approach
formulates this problem with the help of probability and
continuous Bayes’ theorem.
Rajib Das : Department of Computer Science
Assam University, Silchar – 788011, Assam
BipulSyam Purkayastha : Department of Mathematics,
Union Christian College, Ri-Bhoi-793122, Meghalaya
Sanjeev Kumar Singh : Department of Mathematics,
Union Christian College, Ri-Bhoi-793122, Meghalaya
MANET
malicious node
PDF
probability
Bayes’ theorem
Mobile ad hoc networks exhibit new vulnerabilities to
malicious attacks or denial of cooperation. This paper
addresses the statistical approach to detect malicious
nodes using the probability density function. The
challenges of security, scalability, mobility, bandwidth
limitations, and power constraints of these networks
have not been completely unsolvedtill date.
[1] H. Kim, R.B. Chitti and J. Song, “Novel defence
mechanism against data flooding attacks in wireless
ad hoc networks,” IEEE Trans. on Consumer
Electronics, Vol. 56, No. 2, pp. 579-582, 2010.
[2] W. Stallings, Wireless Communications and
Networks, 2nd Edition, Pearson Education, 2007.
[3] M. Jensen, N. Gruschka and N. Luttenberger, “The
Impact of Flooding Attacks on Network-based
Services,” 3rd Int. Conf. on Availability, Reliability
and Security, ARES’ 08, pp. 509-513, 2008.
[4] M. G. Zapata and N. Asokan, “Securing Ad-Hoc
Routing Protocols,” Proc. ACM Wksp. Wireless
Sec., Sept. 2002, pp. 1–10.
[5] B. Kannhavong, H. Nakayama, Y. Nemoto, N. Kato
and A. Jamalipour, “A survey of routing attacks in
mobile ad-hoc networks,” IEEE Wireless
Communications, Vol. 14, No. 5, pp. 85-91, 2007.
[6] E. M. Royer and C. K. Toh, “A Review of Current
Routing Protocols for Ad-Hoc Mobile Wireless
Networks”, IEEE personal communication, 1999.
[7] R. Bai and M. Singhal, “DOA: DSR over AODV
Routing for Mobile Ad Hoc Networks,” IEEE Trans.
on Mobile Comp., Vol. 5, No. 10, pp. 1403-1416,
2006.
[8] D. B. Johnson and D. A. Maltz, “Dynamic Source
Routing in Ad-Hoc Wireless Networks,” Mobile
Computing, T. Imielinski and H. Korth (eds.),
Kluwer Academic Pub., pp. 153–181, 1996.
[9] S. K. Shandilya and S. Sahu, “A trust based security
scheme for RREQ flooding attack in MANET,”
International Journal of Computer Applications, Vol.
5, No.12, 2010.
[10] Md. Amir KhusruAkhtar, V. S. Shankar Sriram, G.
Sahoo, “A Methodology to overcome Selfish Node
Attack in MANETs”, Knowledge Management and
E-learning: An International Journal, Serial
Publication-2009.
