Authors: Mohamed K. Watfa, Marwa El-Ghali, Hiba Halabi
Addresses: Computer Science Department, University of Wollongong, Knowledge Village, Dubai, UAE. ' Computer Science Department, American University of Beirut, Beirut, 1107 2020, Lebanon. ' Computer Science Department, American University of Beirut, Beirut, 1107 2020, Lebanon
Abstract: Sensor nodes used to transmit sensitive data, especially in military applications, require securing the data transmitted through the WSNs to maintain the confidentiality of the data and authenticate the participating sensor nodes. Since sensor nodes suffer from limited resources, in memory storage, computing power, energy capabilities and transmission rates, available network security protocols are inadequate. Symmetric algorithms cannot provide the same degree of security as public key algorithms, leading us to devise a new algorithm SHESP that uses public keys within the limitations of sensor nodes. This paper presents a way to utilise existing public key algorithms such as RSA, Diffie-Hellmann and elliptic curve in the field of WSN security by dividing the network into clusters. Our algorithm supplies data confidentiality, node authentication and data integrity while remaining within acceptable memory, time and energy constraints. We provide theoretical and experimental evidence to validate our algorithms. Results reveal significant improvement in data availability, data confidentiality and authenticity while reducing the communication and computation overhead.
Keywords: wireless sensor networks; WSNs; security protocol; data confidentiality; node authentication; data integrity; public keys; PK; distributed systems; wireless networks; clustering.
International Journal of Communication Networks and Distributed Systems, 2009 Vol.3 No.2, pp.116 - 145
Published online: 26 Jun 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article