Абстрактный

A NEW ALGORITHM FOR END TO END SECURITY OF DATA IN A SECURE SELF ORGANIZED WIRELESS SENSOR NETWORK

Hemanta Kumar Kalita and Avijit Kar

We consider a self-organized wireless sensor network where sensor nodes are multi-hop away from base station. This means data communication happens through several intermediate nodes before it reaches the base station from source. End to end security of data ensures data sent from the source to destination through several intermediate nodes preserve confidentiality, integrity, authentication and nonrepudiation of data. Due to resource-constrained sensor nodes it was considered that implementing confidentiality, integrity, authentication and non repudiation of data using public key infrastructure based scheme would be a challenge in Wireless Sensor Network. Consequently we have seen a lot of secure data communication schemes based on symmetric key in the literature. Although symmetric key based schemes are easy to implement, yet it has a single point of failure, i.e. the key. If a node’s key falls in the hand of attacker, then the whole network is compromised. In this paper we propose a secure data communication scheme for wireless sensor network. Our scheme takes advantage of both asymmetric and symmetric key based schemes and preserves confidentiality, integrity, authentication and non-repudiation of data.