LKSR: link strength keymatch secure routing in heterogeneous wireless sensor networks
K. Shaila, G. H. Vineet, C. R. Prashanth, Vinnakota Sai Durga Tejaswi, K. R. Venugopal, Lalit Mohan Patnaik · International Journal of Computational Systems Engineering · 2013
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.