ACM Home Page
Please provide us with feedback. Feedback
A lightweight key renewal scheme for clustered sensor networks
Full text PdfPdf (629 KB)
Source Conference On Ubiquitous Information Management And Communication archive
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication table of contents
Suwon, Korea
SESSION: Sensor networks table of contents
Pages 557-565  
Year of Publication: 2009
ISBN:978-1-60558-405-8
Authors
Gicheol Wang  Chonnam University, Gwangju, Korea
Deokjai Choi  Chonnam University, Gwangju, Korea
Daewook Kang  Chonnam University, Gwangju, Korea
Sponsor
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 102,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1516241.1516339
What is a DOI?

ABSTRACT

In sensor networks, sensors are prone to be captured by attackers because they are usually deployed in unattended surroundings. If an adversarial compromises a sensor, he/she uses the keys from the compromised sensor to uncover the keys of others sensors. Therefore, it is very important to renew the keys of sensors in a periodic or reactive manner. Even though many group key renewal schemes for distributed key renewals have been proposed, they expose some flaws. First, they employ a single group key in a cluster so that the compromise of one sensor discloses the group key. Second, they evict the compromised nodes by updating the compromised keys with non-compromised keys. This eviction scheme is useless when the non-compromised keys are exhausted due to the increase of compromised nodes. In this paper, we propose a lightweight key renewal scheme, which evicts the compromised nodes clearly by reforming clusters without compromised nodes. Besides, in a cluster, each member employs a pairwise key for communication with its CH (Cluster Head) so that our scheme is tolerable against sensor compromise. Our simulation results prove that the proposed scheme is more tolerable against the compromise of sensors and it is more energy-saving than the group key renewal schemes.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
 
4
 
5
 
6
Du., W., Deng, J., Han, Y. S, Chen, S., and Varshney, P. 2004. A Key Management Scheme for Wireless Sensor Networks Using Deployment Knowledge. In Proceedings of IEEE Infocom '04, 586--597.
7
 
8
Traynor, P., Choi, H., Cao, G., Zhu, S., and Porta, T. L. 2006. Establishing Pair-wise Keys in Heterogeneous Sensor Networks. In Proceedings of IEEE Infocom '06.
9
 
10
Eltoweissy, M., Moharrum, M., and Mukkamala, R. 2006. Dynamic Key Management in Sensor Networks. IEEE Communications Magazine. 44, 4, 122--130.
 
11
 
12
 
13
Eltoweissy, M., Wadda, A., Olariu, S., and Wilson, L. 2004. Group Key Management Scheme for Large-Scale Sensor Networks. Ad Hoc Networks. 3, 5, 668--688.
 
14
 
15
 
16
Wang, G. and Cho, G. Pairwise Key Establishments without Key Pre-distribution for Mobile Ad hoc Network Environment. IEE Proceedings Communications. 153, 6, 822--827.
 
17
Heinzelman, W., Chandrakasan, A. P., and Balakrishnan, H. 2002. An Application-Specific Protocol Architecture for Wireless Microsensor Networks. IEEE Trans. on Wireless Communications. 1, 4, 660--670.
 
18
Karlof, C. and Wagner, D. Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures. In Proceedings of the 1st IEEE Workshop on Sensor Network Protocols and Applications, May. 2003, pp. 113--127

Collaborative Colleagues:
Gicheol Wang: colleagues
Deokjai Choi: colleagues
Daewook Kang: colleagues