An ImprovedμTESLA Protocol Based on Queuing Theory and Benaloh-Leichter SSS in WSNs

Abstract

Broadcast authentication is a fundamental security technology in wireless sensor networks (ab. WSNs). As an authentication protocol, the most widely used in WSN,μTESLA protocol, its publication of key is based on a fixed time interval, which may lead to unsatisfactory performance under the unstable network traffic environment. Furthermore, the frequent network communication will cause the delay authentication for some broadcast packets while the infrequent one will increase the overhead of key computation. To solve these problems, this paper improves the traditionalμTESLA by determining the publication of broadcast key based on the network data flow rather than the fixed time interval. Meanwhile, aiming at the finite length of hash chain and the problem of exhaustion, a self-renewal hash chain based on Benaloh-Leichter secret sharing scheme (SRHC-BL SSS) is designed, which can prolong the lifetime of network. Moreover, by introducing the queue theory model, we demonstrate that our scheme has much lower key consumption thanμTESLA through simulation evaluations. Finally, we analyze and prove the security and efficiency of the proposed self-renewal hash chain, comparing with other typical schemes.

Simple and Effective Secure Group Communications in Dynamic Wireless Sensor Networks

“…Thus, it is crucial to keep nodes in synchronization time with the cluster head to avoid losing the corresponding key during the interval time. Huang et al [48], improved μTESLA by replacing the interval time to divide and release the corresponding key using Queuing Theory. They claimed that the fixed time interval in original μTESLA could increase unnecessarily a node’s computation.…”