A scalable and efficient key establishment protocol for wireless sensor networks
Ali Fanian, Mehdi Berenjkoub, Hossein Saidi, Thomas Aaron Gulliver
Abstract
Ali Fanian, Mehdi Berenjkoub, Hossein Saidi, Thomas Aaron Gulliver
Abstract
An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not impose significant overhead on them. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, but the resources needed in the sensors is substantial. Others are appropriate from the resource consumption perspective, but have weak performance. This paper proposes a key establishment protocol based on symmetric polynomials. To improve performance, the protocol uses a new model to distribute key information among sensors. The main feature of the proposed protocol is a tradeoff between performance and resource consumption. Additionally, the proposed scheme is able to establish a common key between every pair of nodes. Analysis shows that the proposed solution has good performance compared to established approaches.
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An essential requirement for providing secure services in wireless sensor networks is the ability to establish pairwise keys among sensors. Due to resource constraints on the sensors, the key establishment scheme should not impose significant overhead on them. To date, several key establishment schemes have been proposed. Some of these have appropriate connectivity and resistance against key exposure, but the resources needed in the sensors is substantial. Others are appropriate from the resource consumption perspective, but have weak performance. This paper proposes a key establishment protocol based on symmetric polynomials. To improve performance, the protocol uses a new model to distribute key information among sensors. The main feature of the proposed protocol is a tradeoff between performance and resource consumption. Additionally, the proposed scheme is able to establish a common key between every pair of nodes. Analysis shows that the proposed solution has good performance compared to established approaches.
Key concepts: Computer science, Key (lock), Scalability, Overhead (engineering), Wireless sensor network, Computer network, Protocol (science), Distributed computing