Efficient path key establishment for wireless sensor networks

Noureddine Mehallegue, Ahmed Bouridane, Emi Garcia

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)
2 Downloads (Pure)


Key predistribution schemes have been proposed as means to overcome wireless sensor network constraints such as limited communication and processing power. Two sensor nodes can establish a secure link with some probability based on the information stored in their memories, though it is not always possible that two sensor nodes may set up a secure link. In this paper, we propose a new approach that elects trusted common nodes called “Proxies” which reside on an existing secure path linking two sensor nodes. These sensor nodes are used to send the generated key which will be divided into parts (nuggets) according to the number of elected proxies. Our approach has been assessed against previously developed algorithms, and the results show that our algorithm discovers proxies more quickly which are closer to both end nodes, thus producing shorter path lengths. We have also assessed the impact of our algorithm on the average time to establish a secure link when the transmitter and receiver of the sensor nodes are “ON.” The results show the superiority of our algorithm in this regard. Overall, the proposed algorithm is well suited for wireless sensor networks.
Original languageEnglish
Pages (from-to)9
JournalEurasip Journal on Wireless Communications and Networking
Publication statusPublished - 21 Feb 2008


Dive into the research topics of 'Efficient path key establishment for wireless sensor networks'. Together they form a unique fingerprint.

Cite this