DocumentCode :
3176105
Title :
A New Key Management Scheme in Clustering Wireless Sensor Networks
Author :
Yao Nianmin ; Ma Baoying ; Fan Shuping
Author_Institution :
Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China
fYear :
2009
fDate :
21-22 Dec. 2009
Firstpage :
227
Lastpage :
230
Abstract :
Extension of life cycle has been one of the hot spots in Wireless Sensor Networks. Owing to limited capacity nodes fail as soon as energy is consumed, which tends to shorten survival time of entire wireless sensor network. Therefore, a clustering key management scheme based on hierarchical tree is proposed, furthermore dynamic update of networks is realized in the paper. In the hierarchical tree, child keys can be calculated according to their parent key, and nodes of different importance can be protected distinctively. The results show that it can not only ensure security of networks but also reduce the communication traffic, lower network overhead, and prolong life cycle of networks.
Keywords :
pattern clustering; telecommunication security; trees (mathematics); wireless sensor networks; child keys; clustering key management scheme; dynamic network update; hierarchical tree; network security; parent key; wireless sensor networks; Base stations; Computer network management; Computer networks; Computer science; Costs; Educational institutions; Energy management; Protection; Sensor phenomena and characterization; Wireless sensor networks; clustering Wireless Sensor Networks; hierarchical tree; key generation; key management;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Internet Computing for Science and Engineering (ICICSE), 2009 Fourth International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4244-6754-9
Type :
conf
DOI :
10.1109/ICICSE.2009.58
Filename :
5521598
Link To Document :
بازگشت