scholarly journals An efficient scheme for authenticating public keys in sensor networks

Author(s):  
Wenliang Du ◽  
Ronghua Wang ◽  
Peng Ning
Author(s):  
Abedelaziz Mohaisen ◽  
Tamer AbuHmed ◽  
DaeHun Nyang

The use of public key algorithms to sensor networks brings all merits of these algorithms to such networks: nodes do not need to encounter each other in advance in order to be able to communicate securely. However, this will not be possible unless “good” key management primitives that guarantee the functionality of these algorithms in the wireless sensor networks are provided. Among these primitives is public key authentication: before sensor nodes can use public keys of other nodes in the network to encrypt traffic to them, they need to make sure that the key provided for a particular node is authentic. In the near past, several researchers have addressed the problem and proposed solutions for it as well. In this chapter we review these solutions. We further discuss a new scheme which uses collaboration among sensor nodes for public key authentication. Unlike the existing solutions for public key authentication in sensor network, which demand a fixed, yet high amount of resources, the discussed work is dynamic; it meets a desirable security requirement at a given overhead constraints that need to be provided. It is scalable where the accuracy of the authentication and level of security are merely dependent upon the desirable level of resource consumption that the network operator wants to put into the authentication operation.


SIMULATION ◽  
2008 ◽  
Vol 84 (2-3) ◽  
pp. 131-146 ◽  
Author(s):  
Chandrasekar Ramachandran ◽  
Mohammad S. Obaidat ◽  
Sudip Misra ◽  
Feniosky Peña-Mora

2013 ◽  
Vol 2013 ◽  
pp. 1-12 ◽  
Author(s):  
Hongju Cheng ◽  
Yongzhao Chen ◽  
Naixue Xiong ◽  
Feifei Li

Due to the similarity and correlation among sensed data in wireless sensor network, it is an important way to reduce the number of packets transmitted with data aggregation technology so as to prolong the network lifetime. However, data aggregation is still a challenging issue since quality-of-service, such as end-to-end delay, is generally considered as a severe criterion required in many applications. We focus on the minimum-latency data aggregation problem and proposed a new efficient scheme for it. The basic idea is that we first build an aggregation tree by ordering nodes into layers, and then we proposed a scheduling algorithm on the basis of the aggregation tree to determine the transmission time slots for all nodes in the network with collision avoiding. We have proved that the upper bound for data aggregation with our proposed scheme is bounded by(15R+Δ-15)for wireless sensor networks in two-dimensional space. Extensive simulation results have demonstrated that the proposed scheme has better practical performance compared with related works.


Sign in / Sign up

Export Citation Format

Share Document