A novel key pre-distribution approach for high security and efficiency using LU-decomposition of matrix Online publication date: Mon, 26-Sep-2016
by S.J. Choi; K.T. Kim; H.Y. Youn
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 23, No. 3/4, 2016
Abstract: Wide-spread deployment of wireless sensor network (WSN) is emerging, which allows an economical solution for numerous applications. For the security of communication network, asymmetric cryptography is usually employed. This approach is, however, often unsuitable to WSN due to limited computational and energy power. Among various approaches the random key pre-distribution approach is regarded as the most effective one for WSN. Here one shortcoming is that a common key is not guaranteed to be found between any two communicating nodes. This paper proposes a new key pre-distribution scheme solving this problem by obtaining the keys with LU-decomposition of a symmetric matrix. Mathematical analysis and computer simulation reveal that the proposed scheme significantly reduces the overhead required for secure connectivity and energy efficiency of the sensor nodes compared to the existing approaches. The superiority of the proposed scheme becomes more substantial when the memory size of the sensor nodes is small.
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