LKSR: link strength keymatch secure routing in heterogeneous wireless sensor networks Online publication date: Sat, 26-Jul-2014
by K. Shaila; G.H. Vineet; C.R. Prashanth; V. Tejaswi; K.R. Venugopal; L.M. Patnaik
International Journal of Computational Systems Engineering (IJCSYSE), Vol. 1, No. 4, 2013
Abstract: We consider the problem of multi-hop communication among the nodes of a heterogeneous wireless sensor networks using an unbalanced key distribution to ensure enhanced security. The concept of link strength is introduced, which determines the path to be selected for secure routing. The paths are classified into less secure, moderately secure and highly secure based on the values of link strength. Higher value of link strength ensures enhanced stability against node compromise and masquerading. Numerical analysis and curve fitting techniques are used to determine the relationship among the keys, number of nodes and link strength. Extensive simulation on random and uniformly distributed nodes exhibits exponential behaviour of the link strengths, where link strength directly impacts the security of the paths chosen. Our simulation and empirical results show that the LKSR scheme provides secure routing and exhibits the property of increasing link strength with keymatches. This establishes the stability and scalability of LKSR scheme.
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 Computational Systems Engineering (IJCSYSE):
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