Cooperative secret delivery in wireless sensor networks Online publication date: Wed, 01-Jan-2014
by Jing Deng; Yunghsiang S. Han
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 14, No. 4, 2013
Abstract: In the technical literature, many random key pre-distribution techniques have been proposed to secure wireless sensor networks (WSNs). Such techniques only establish keys for some pairs of physically connected sensors. On the contrary, in many WSN applications, a source node must securely communicate with all of its neighbours. In this work, we address the issue of delivering secret link keys to each of the source's neighbours in WSNs. We propose a scheme called cooperative secret delivery (CSD) that finds bridge nodes to deliver keys to the insecure neighbours, which share no prior keys with the source. The novelty of our scheme is to deliver multiple keys through these bridge nodes and regular paths instead of multi-hop secure paths. Since the secret link keys are delivered cooperatively by the bridge nodes in the CSD scheme, secret disclosure probability is significantly lower compared to other delivery techniques. We perform extensive theoretical analysis and performance evaluation on the CSD scheme and demonstrate its salient features.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook