A scalable key management and clustering scheme for wireless ad hoc and sensor networks

被引:20
作者
Li, Jason H. [1 ]
Bhattacharjee, Bobby [2 ]
Yu, Miao [3 ]
Levy, Renato [1 ]
机构
[1] Intelligent Automat Inc, Rockville, MD 20855 USA
[2] Univ Maryland, Dept Comp Sci, College Pk, MD 20742 USA
[3] Univ Maryland, Dept Mech Engn, College Pk, MD 20742 USA
来源
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE | 2008年 / 24卷 / 08期
关键词
key management; clustering; group communications; ad hoc networks; sensor networks;
D O I
10.1016/j.future.2008.03.007
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each Subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The distributed, efficient clustering approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust. (c) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:860 / 869
页数:10
相关论文
共 26 条
[1]   Wireless sensor networks: a survey [J].
Akyildiz, IF ;
Su, W ;
Sankarasubramaniam, Y ;
Cayirci, E .
COMPUTER NETWORKS, 2002, 38 (04) :393-422
[2]  
[Anonymous], P 1999 INT S PAR ARC
[3]  
[Anonymous], IEEE T PARALLEL DIST
[4]  
BALLADIE A, 1996, 1949 RFC
[5]  
BANERJEE S, 2002, JSAC
[6]  
BASAGNI S, P ICC 2001, P1539
[7]   UNIT DISK GRAPHS [J].
CLARK, BN ;
COLBOURN, CJ ;
JOHNSON, DS .
DISCRETE MATHEMATICS, 1990, 86 (1-3) :165-177
[8]  
ELSON L, 2002, ACM SIGOPS OPERATING, V36, P147
[9]  
Harney H., 1997, 2094 IETF RFC
[10]  
Heinzelman W., 2000, P 33 ANN HAW INT C S, DOI DOI 10.1109/HICSS.2000.926982