Abstract
Objectives: To compute a new secret common key pair value consuming less energy, time and storage. Methods/Statistical analysis: Finding of effective energy efficient key management scheme is still a challenging task. To produce effective key management system, Hexagonal cluster based routing protocol (HCRP) is proposed with modified Hadamard matrix as a public matrix that is obtained from the balance factor using AVL tree applied in each cluster head in the hexagonal network model where each vertex is considered as cluster head. Public matrix and secret matrix are used for finding common key pair value. Findings: The newly designed public matrix is beneficial to obtain the common key value. Result shows that proposed HCRP protocol consumes less packet ratio with minimum data rate. The work is implemented using NS2 simulator considering various factors like packet drops, computation time, energy consumption and storage overhead. Application/Improvements: The proposed key management scheme is an efficient one and can be used as a security measure for the computational field.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.