A survey on secure multipath routing protocols in WSNs
Computer Networks: The International Journal of Computer and Telecommunications Networking
Secure clustering and symmetric key establishment in heterogeneous wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on security and resilience for smart devices and applications
Cooperative secret delivery in wireless sensor networks
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
In random key pre-distribution techniques for wireless sensor networks, a relatively small number of keys are randomly chosen from a large key pool and loaded on the sensors prior to deployment. After deployment, each sensor tries to find a common key shared by itself and each of its neighbors to establish a link key to protect the wireless communication between themselves. One intrinsic disadvantage of such techniques is that some neighboring sensors do not share any common key. In order to establish a link key among such neighbors, a multi-hop secure path may be used to deliver the secret. Unfortunately, the possibility of sensors being compromised on the path may render such establishment process insecure. In this work, we propose and analyze a Just Enough Redundancy Transmission (JERT) scheme that uses the powerful Maximum Distance Separable (MDS) codes to address the problem. In the JERT scheme, the secret link key is encoded in (n, k) MDS code and transmitted through multiple multi-hop paths. To reduce the total information that needs to be transmitted, the redundant symbols of the MDS codes are transmitted only if the destination fails to decode the secret. The JERT scheme is demonstrated to be efficient and resilient against node capture. One salient feature of the JERT scheme is its flexibility of trading transmission for lower information disclosure.