A Survey on Game Theory Approaches for Improving Security in MANET
American Journal of Electrical and Computer Engineering
Volume 2, Issue 1, June 2018, Pages: 1-4
Received: May 2, 2018; Accepted: May 29, 2018; Published: Jun. 12, 2018
Views 692      Downloads 112
Author
Rahul Krishnan, Department of Electronics and Communication Engineering, Rajalakshmi Institute of Technology, Chennai, India
Article Tools
Follow on us
Abstract
The MANET is the most widely used networks due to the usage of wide range of multimedia applications over the wireless networks. One of the main features of nodes in mobile ad hoc networks (MANETs) is their collaboration with neighbors to propagate data. Exploiting this feature, malicious nodes collaborate with normal nodes to disturb network operation and reduce its efficiency. These nodes attack other network nodes and avoid being detected by other nodes through using the mobility characteristic of nodes in MANETs. Because of the infrastructure less network, battery constraint and the non-cooperative environment it is difficult to provide security to the network. Some nodes try to save their energy and start to exhibit malicious activities like dropping the packet by not forwarding etc. Due to such security problems in the network, the routing also becomes inefficient. Hence to improve the routing efficiency along with security, several techniques have been used so far. One of the effective ways to detect malicious nodes is using game theory. In this work, several such routing techniques have been compared and analyzed and a survey has been made. The different kinds of security attacks have been analyzed and the proposed solutions have been tabulated in this survey.
Keywords
MANET, Malicious, Route Request, Route Reply, Authentication
To cite this article
Rahul Krishnan, A Survey on Game Theory Approaches for Improving Security in MANET, American Journal of Electrical and Computer Engineering. Vol. 2, No. 1, 2018, pp. 1-4. doi: 10.11648/j.ajece.20180201.11
Copyright
Copyright © 2018 Authors retain the copyright of this article.
This article is an open access article distributed under the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0/) which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
References
[1]
Seema Mehla et. al. (2010) “Analyzing security of Authenticated Routing Protocol (ARAN), International Journal on Computer Science and Engineering Vol. 02, No. 03, 664-668.
[2]
Chuanqi Gong, Sheng Wu and Yanmin Jing (2012) “ARAN protocol analysis and improvement”, International conference on System Science, Engineering Design and Manufacturing Informatization, vol. 02, 347-350.
[3]
R. Pushpalakshmi and A. Vincent Antony Kumar (2010) “Security aware minimized dominating set based routing in MANET” Second International conference on Computing, Communication and Networking Technologies, 1-5.
[4]
Yih-Chun Hu, David B. Johnson, Adrian Perrig (2003)” SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks” ELSEVIER, PA 15213.
[5]
Yih Chun Hu, Adrian Perrig and David B. Johnson “Ariadne: A Secure On-Demand Routing Protocol for springer 2005Ad Hoc Networks”.
[6]
S. Buchegger and J. Y. L. Boudec (2002), “Performance analysis of the CONFIDANT Protocol, cooperation of nodes - Fairness in dynamic ad hoc networks,” inProc. IEEE/ACMMOBIHOC, June
[7]
P. Michiardi and R. Molva (2002), “CORE:Acollab orative reputation mechanism to enforce node cooperation in mobile ad hoc networks,” 6th Joint Working Conf. Commun. and Multimedia Security: Advanced Commun. And Multimedia Security, pp. 107–121.
[8]
F. Li and J. Wu (2010), “Attack and Flee: Game theory based analysis on interactions among nodes in MANETs,” IEEE Trans. Syst., Man Cybern., vol. 40, pp. 612-622.
[9]
Manshaei. M. H et al. (2013), “Game theory meets network security and privacy,” J. ACM Comput. Surv, vol. 45, no. 3.
[10]
S. Yi, P. Naldurg and R. Krvets, “Security Aware Ad hoc Routing for Wireless networks”, Proc. 2nd ACM Symp. Mobile Ad Hoc net. and Comp. (Mobihoc’01), Long Beach, CA, Oct. 2001, pp. 299-302.
[11]
M. G. Zapata and N. Asokan, “Secure Ad-Hoc On-demand Distance Vector Routing”, ACM Mobile Comp. and Commun. Review, vol. 3, no., July 2002, pp. 106-07.
[12]
P. Papadimitratos and Z. J. Haas, “Securing the internet routing infrastructure”, IEEE Commun. Mag., vol. 10, no. 40, oct 2002, pp. 60-68.
[13]
David B. Johnson and David A. Maltz, Dynamic Source Routing in Ad-Hoc Wireless Networks, Mobile Computing, edited by Tomasz Imielinski and Hank Korth, Kluwer Academic Publishers, Chapter 5, 1996, pp. 153-181.
[14]
Charles E. Perkins, Elizabeth M. Royer and Samir R. Das, Ad Hoc On Demand Distance Vector (AODV) Routing, IETF Internet Draft draft-ietfmanet-aodv-08. txt, March 2001.
ADDRESS
Science Publishing Group
1 Rockefeller Plaza,
10th and 11th Floors,
New York, NY 10020
U.S.A.
Tel: (001)347-983-5186