Zorana Bankovic
José Manuel Moya
ABSTRACT
In this article we propose to couple reputation systems for wireless sensor networks with a genetic algorithm in order to improve their time of response to adversarial activities. The reputation of each node is assigned by an unsupervised genetic algorithm trained for detecting outliers in the data. The response of the system consists in assigning low reputation values to the compromised nodes cutting them off from the rest of the network. The genetic algorithm uses the feature extraction process that does not capture the properties of the attacks, but rather relies on the existing temporal and spatial redundancy in sensor networks and tries to detect temporal and spatial inconsistencies in the sequences of sensed values and the routing paths used to forward these values to the base station. This solution offers many benefits: scalable solution, fast response to thwart activities, ability to detect unknown attacks, high adaptability, and high ability in detecting and confining attacks. Comparing to the standard clustering algorithms, the benefit of this one is that it is not necessary to assign the number of clusters from the beginning. The solution is also robust to both parameter changes and the presence of large amounts of malicious data in the training and testing datasets.
- Mármol, F. and Pérez, G. Security threats scenarios in trust and reputation models for distributed systems, Computers & Security 28 (2009) 545--556.Google Scholar
Digital Library
- Aliguliyev, R. M. Performance evaluation of density-based clustering methods, Inf. Sciences 179 (2009) 3583 - 3602. Google ScholarDigital Library
- Moya, J. M. et al. Improving security for SCADA sensor networks with reputation systems and Self-Organizing maps, Sensors 9 (2009) 9380--9397.Google ScholarCross Ref
- Boukerch, A.; Xu, L.; EL-Khatib, K. Trust-based Security for Wireless Ad Hoc and Sensor Networks. Comput. Commun. 2007, 30, 2413--2427. Google ScholarDigital Library
- Papaioannou, T.G.; Stamoulis, G.D. Effective use of reputation of peer-to-peer environments. In Proc. of IEEE/ACM CCGRID 2004, GP2PC workshop. IEEE Comp. Soc: Chicago, IL, USA, April 19--22, 2004; pp. 259--268. Google ScholarDigital Library
- Antoniadis, P.; Courcoubetis, C.; Efstathiou, E.; Polyzos, G.; Strulo, B. Peer-to-Peer wireless LAN consortia: Economic modeling and architecture. In Proc. of the Third IEEE Int.l Conf. on Peer-to-Peer Comp., IEEE Comp. Soc.: Linköping, Sweeden, Sept. 1--3, 2003; pp. 198--199. Google ScholarDigital Library
- Hu Y, Perrig A, Johnson D. Packet leashes: a defense against wormhole attacks in wireless networks. Proc. of 22nd annual joint conference of the IEEE computer and communications societies (INFOCOM 2003 ). vol. 3, 2003. pp. 1976--86.Google ScholarCross Ref
- Bar El, H. Introduction to Side Channel Attacks. Discretix Technologies Ltd., 2003.Google Scholar
- Mukhopadhyay D, Saha I. Location verification based defense against sybil attack in sensor networks. In: Distr. comp. and networking. Springer, 2006. p. 509--521. Google ScholarDigital Library
- Liu, Y.G., Chen, K.F., Liao, X.F., Zhang ,W. A genetic clustering method for intrusion detection. Pattern Recognition, 37(5), 927--942. (2004)Google ScholarCross Ref
- Renjit, J. A. and K. L. Shunmuganathan, Distributed and cooperative multi-agent based intrusion detection system, Indian Journal of Science and Technology 3(10): 1070--1074. (2010).Google Scholar
- Hortos, W. S. Unsupervised algorithms for intrusion detection and identification in wireless ad hoc sensor networks, Proc. SPIE 7352, pp. 73520J, 2009.Google Scholar
- Renjit, J. A. and K. L. Shunmuganathan. Distributed and cooperative multi-agent based intrusion detection system, Indian Journal of Science and Technology 3(10): 1070--1074. (2010).Google Scholar
- Roosta, T. G. Attacks and Defenses on Ubiquitous Sensor Networks, Ph. D. Dissertation, Univ.of California at Berkeley, 2008 Google ScholarDigital Library
- Rieck, K.; Laskov, P. Linear Time Computation of Similarity for Sequential Data. J. Mach. Learn. Res. 2008, 9, 23--48. Google ScholarDigital Library
- Muñoz, A.; Muruzábal. J. Self-Organizing Maps for Outlier Detection. Neurocomputing 18(1--3), 1998, 33--60Google Scholar
- Goldberg, D. E. Genetic algorithms for search, optimization, and machine learning. 1st Ed. Addison-Wesley Longman Publishing Co., Inc.: Boston, MA, USA, 1989. Google ScholarDigital Library
- Mitra, S.; Acharya, T. Data Mining: Multimedia, Soft Computing, and Bioinformatics; John Wiley & Sons, Inc.: Hoboken, New Jersey, USA, 2003; pp. 257--269.Google Scholar
Index Terms
- Improving reputation systems for wireless sensor networks using genetic algorithms
Recommendations
An integration of fuzzy inference systems and Genetic Algorithms for Wireless Sensor Networks
Wireless sensor networks WSNs consist of a set of sensor nodes in order to detect and transmit environmental characteristics, such as, temperature, humidity or lightness. These sensor nodes, after capturing an event, should communicate with a special ...
Power-efficient communication algorithms for wireless mobile sensor networks
PE-WASUN '04: Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networksOne important issue in wireless sensor networks is how to gather sensed information in an energy efficient way since the energy is a scarce resource in a sensor node. Many protocols have been proposed for data-gathering between wireless sensor nodes. ...
Relay Node Placement in Wireless Sensor Networks
A wireless sensor network consists of many low-cost, low-power sensor nodes, which can perform sensing, simple computation, and transmission of sensed information. Long distance transmission by sensor nodes is not energy efficient since energy ...
Comments