Proceedings of the 2004 International Symposium on Low Power Electronics and Design 2004
DOI: 10.1145/1013235.1013320
|View full text |Cite
|
Sign up to set email alerts
|

Reducing radio energy consumption of key management protocols for wireless sensor networks

Abstract: The security of sensor networks is a challenging area. Key management is one of the crucial parts in constructing the security among sensor nodes. However, key management protocols require a great deal of energy consumption, particularly in the transmission of initial key negotiation messages. In this paper, we examine three previously published sensor network security schemes: SPINS and C&R for master-key-based schemes, and Eschenhaur-Gligor (EG) for distributed-key-based schemes. We then present two new low-… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
50
0

Year Published

2005
2005
2019
2019

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 54 publications
(50 citation statements)
references
References 8 publications
0
50
0
Order By: Relevance
“…There are numerous schemes that provide authentication in WSNs [5,[10][11][12][13][14][15][16][17]; the most relevant of them are discussed in detail here.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…There are numerous schemes that provide authentication in WSNs [5,[10][11][12][13][14][15][16][17]; the most relevant of them are discussed in detail here.…”
Section: Related Workmentioning
confidence: 99%
“…In this protocol, no trusted party or server is used just like SPIN and it consumes less energy as compared to SPIN. Each node directly constructs a session key with its neighboring node by sending a key negotiation message [14]. This protocol uses a single master key in each sensor node for the entire WSN, and a message authentication code (MAC) is used to provide authentication.…”
Section: Broadcast Session Key Protocol (Brosk)mentioning
confidence: 99%
“…We make an assumption that a class 1 sensor only can set up safe connection with those class 1 sensors which are the closest to it in different groups. For instance, in Fig.1, the class 1 sensor in 0 C only can set up safe connection with all class 1 nodes in 1 C , 2 C , 3 C , 4 C , 5 C and 6 C . The probability, ( ) p β , that two class 1 nodes in different groups share β sub key-strings is calculated as follows…”
Section: The Function Of Heterogeneous Nodes In Network Connectivitymentioning
confidence: 99%
“…Lai D et al [5] gave the Overlap-Key-Sharing protocol. The strategy generates a bit-string as the WSNs key-string-pool (KP), and randomly allocates its a subset as the key-string.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation