QDV: A Quality-of-Security-Based Distance Vector Routing Protocol for Wireless Sensor Networks Using Ant Colony Optimization

In wireless sensor networks (WSNs), message security is an important concern. The protection of integrity and confidentiality of information and the protection from unauthorized access are important issues. However, due to factors such as resource limitations, absence of centralized access points, open wireless medium and small size of the sensor nodes, the implementation of security in WSNs is a challenging task. In this paper, we propose a protocol, quality-based distance vector routing (QDV), for securing WSNs using concepts based on ant colony optimization (ACO). Two fundamental parameters: quality-of-service (QoS) and reputation are used. The high value of reputation of a node signifies that the node is trusted and is more reliable for data communication purposes. As a node shows signs of misbehavior, its reputation decreases, which, in turn, affect its quality-of-security (QSec), thereby disabling the malicious nodes from gaining access to the network. By incorporating these two factors, we are able to distinguish the nodes present in the network. We, then, present a method to achieve "equilibrium" where the node is able to guarantee that its neighbors are secure.

[1]  Mario Gerla,et al.  GloMoSim: A Scalable Network Simulation Environment , 2002 .

[2]  Sajal K. Das,et al.  A game theory based approach for security in wireless sensor networks , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[3]  Anupam Joshi,et al.  Security for wireless sensor networks , 2004 .

[4]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[5]  Frank Stajano,et al.  The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks , 1999, Security Protocols Workshop.

[6]  Leandro Nunes de Castro,et al.  Recent Developments In Biologically Inspired Computing , 2004 .

[7]  Zygmunt J. Haas,et al.  Securing ad hoc networks , 1999, IEEE Netw..

[8]  Bernd Scheuermann,et al.  Population based ant colony optimization on FPGA , 2002, 2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings..

[9]  Shivakant Mishra,et al.  A Performance Evaluation of Intrusion-Tolerant Routing in Wireless Sensor Networks , 2003, IPSN.

[10]  C. Karlof,et al.  Secure routing in wireless sensor networks: attacks and countermeasures , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[11]  Yaping Li,et al.  ARRIVE: Algorithm for Robust Routing in Volatile Environments , 2003 .

[12]  Sasikanth Avancha,et al.  Security for Sensor Networks , 2004 .

[13]  Alfred Menezes,et al.  Handbook of Applied Crytography.@@@The Crytographic Imagination: Secret Writing from Edgar Poe to the Internet. , 1999 .

[14]  Jürgen Branke,et al.  Ant Colony Optimization , 2005, Handbook of Bioinspired Algorithms and Applications.

[15]  David A. Wagner,et al.  TinySec: a link layer security architecture for wireless sensor networks , 2004, SenSys '04.

[16]  Sajal K. Das,et al.  WCA: A Weighted Clustering Algorithm for Mobile Ad Hoc Networks , 2002, Cluster Computing.