An efficient scheme for secure data transmission in wireless sensor networks

In this paper, we propose an efficient security scheme for wireless sensor networks which provides good level of confidentiality and authenticity of the data that are transmitted from the sensors to the base station. We use one-way hash chain and pre-stored shared secret keys for ensuring the data transmission security in the network. In our scheme, we first create a tree structure in the network and then use it for authenticated and encrypted data delivery. To introduce data freshness, our scheme includes an optional key refreshment mechanism which could be applied depending upon the requirement or the application at hand. We present a brief analysis along with the detailed description of our scheme.

[1]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[2]  Choong Seon Hong,et al.  Wasteful Energy Conserving Maximum Lifetime Routing for Wireless Sensor Network , 2005 .

[3]  Sushil Jajodia,et al.  An interleaved hop-by-hop authentication scheme for filtering of injected false data in sensor networks , 2004, IEEE Symposium on Security and Privacy, 2004. Proceedings. 2004.

[4]  Markus Jakobsson,et al.  Almost Optimal Hash Sequence Traversal , 2002, Financial Cryptography.

[5]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[6]  Haiyun Luo,et al.  Statistical en-route filtering of injected false data in sensor networks , 2004, IEEE INFOCOM 2004.

[7]  Markus Jakobsson,et al.  Fractal hash sequence representation and traversal , 2002, Proceedings IEEE International Symposium on Information Theory,.

[8]  Lemin Li,et al.  Research and analysis on routing protocols for wireless sensor networks , 2005, Proceedings. 2005 International Conference on Communications, Circuits and Systems, 2005..

[9]  Yaron Sella On The Computation-Storage Trade-Offs of Hash Chain Traversal , 2003, Financial Cryptography.