A Rough Set Based Approach to Classify Node Behavior in Mobile Ad Hoc Networks
-
3296
Downloads
-
4914
Views
Authors
M. Jain
- Department of Computer Engineering Netaji Subhas Institute of Technology (N.S.I.T) University of Delhi, New Delhi, India.
M. P. S. Bhatia
- Department of Computer Engineering Netaji Subhas Institute of Technology (N.S.I.T) University of Delhi, New Delhi, India.
Abstract
Mobile Ad Hoc Network are used in places where providing a network infrastructure is difficult. In Ad
Hoc Network the mobile nodes are not controlled by any other controlling entity, they have
unrestricted mobility and form the dynamic topology. This dynamically changing network topology of
MANETs makes it vulnerable to many security related issues. There are some situations when one or
more nodes in the network become selfish or malicious and tend to annihilate the capacity of the
network. This research investigate the classification of good and bad nodes in the network by using the
concept of rough set theory , that can be employed to generate simple rules and to remove irrelevant
attributes for discerning the good nodes from bad nodes. Our experiment results reveals that the rough
set based approach increases the network capacity and throughput of the network up to 98.9%.
Share and Cite
ISRP Style
M. Jain, M. P. S. Bhatia, A Rough Set Based Approach to Classify Node Behavior in Mobile Ad Hoc Networks , Journal of Mathematics and Computer Science, 11 (2014), no. 1, 64-78
AMA Style
Jain M., Bhatia M. P. S., A Rough Set Based Approach to Classify Node Behavior in Mobile Ad Hoc Networks . J Math Comput SCI-JM. (2014); 11(1):64-78
Chicago/Turabian Style
Jain, M., Bhatia, M. P. S.. "A Rough Set Based Approach to Classify Node Behavior in Mobile Ad Hoc Networks ." Journal of Mathematics and Computer Science, 11, no. 1 (2014): 64-78
Keywords
- Indiscernibility
- Equivalence Class
- Reducts
- Malicious Nodes
- Rough Sets
- Crisp Sets
- Decision Rules.
MSC
References
-
[1]
Ehsan Hemmati, Mansour Sheikhan, Reliable disjoint path selection in Mobile ad hoc network using noisy hop field neural network , 5th International symposium on Telecommunications, (2010)
-
[2]
Uman Singh, B. V. R. Reddy, M. N.Hoda, GNDA: Detecting good neighbor nodes in ad hoc routing protocol, Second International Conference on Emerging Applications of Information Technology, (2011)
-
[3]
Jan Komorowski, Lech Polkowski, Andrej Skowron, Rough Sets: A Tu., , ()
-
[4]
Srdjan Krco, Marina Dupcinov, Improved Neighbor Detection Algorithm for AODV Routing Protocol, IEEECOMMUNICATIONS LETTERS, VOL 7, NO. 12, DECEMBER (2003)
-
[5]
Youngrag Kim, Shuhrat Dehkanov, Heejoo Park, Jaeil Kim, Chonggun Kim, The Number of Necessary Nodes for Ad Hoc Network Areas ”,, IEEE Asia-Pacific Services Computing Conference. , (2007)
-
[6]
S. Marti, T. J. Giuli, K. Lai, M. Baker, Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, in 6th International Conference on Mobile computing and Networking, MOBICOM’00, (2000), 255-265
-
[7]
A. Hasswa, M. Zulker, H. Hassanein, Route guard: an intrusion detection and response system for mobile ad hoc networks, Wireless and Mobile Computing, Networking and Communication , 3 (2005), 336-343
-
[8]
C. Manikopoulos, Li Ling, Architecture of the mobile ad hoc network security (MANS) system, in: Proceedings of the IEEE International conference on Systems. Man and Cybernetics, 4 (2003), 3122-3127.
-
[9]
Y. Zhang, W. Lee, Intrusion Detection in Wireless ad hoc Networks, Mobicom 2000, August 6-11, Boston,Massachusetts, USA (2000)
-
[10]
RSES , Homepage http://logic.mimuw.edu.pl/»rses , , ()
-
[11]
, NS by Example, http://nile.wpi.edu/NS/overview.html, 14 May (2006)
-
[12]
K. Fall, K. Varadhan, The NS Manual, November 18, http://www.isi.edu/nsnam/ns/doc/ns_doc.pdf. , 25 July (2005)
-
[13]
M. Riki, H. Rezaei, Introduction of rough set theory and Application in Data analysis, Journal of Mathematics and Computer Science , 9 (2014), 25-32.