The Research And Implementation Of The Interleaved Encryption Scheme In Wireless Sensor Networks

Wireless sensor networks are often deployed in public and unattended environments. As a result, any malicious node can easily eavesdrop on communications and retrieve sensitive information. It is therefore essential to encrypt communications. However encryption is problematic since nodes have limited energy, computation and memory capabilities.In this paper, we propose a new scheme that allows nodes of a sensor network to exchange messages securely without sharing a common key or using public key cryptography. The scheme is based on Claude Castelluccia's work which names interleaved encryption. It assumes that one node shares symmetric keys with its 2-hop neighbors, and it allows a node to send encrypted packets to dynamic sets of nodes. Any passive attacker could not be able to decrypt and recover the message. Then the security and efficiency of our new scheme are analyzed. Compared with the cryptography scheme in the original paper, our scheme has less operations of encryption and decryption. So it reduces computation and saves energy of the sensor nodes.At last, we make a simulation of a wireless sensor network with the OMNET++ Network Simulator in the Linux Operating System, and implement our interleaved encryption scheme on it. By the experimental data, we can find that our cryptography scheme is an efficient method for protecting the sensitive data in wireless sensor networks.