[1]
|
L. Eeschnaure and V. D. Gligor, “A key-management scheme for distributed sensor networks,” in proceedings of the 9th ACM Conference on Computer and Commu-nication Security, pp. 41-47, 2002.
|
[2]
|
H. Chan, A. Oerrig, and D. Song, “Random key predis-tribution schemes for sensor networks,” in IEEE Sypo-sium on Research in Security and Privacy, pp. 197-213, 2003.
|
[3]
|
D. G. Liu, P. Ning, and R. F. Li, “Establishing pairwise keys in distributed sensor networks,” ACM Journal Name, Vol. 20, pp. 1-35, 2004.
|
[4]
|
C. Blundo, A. Desantis, S. Kutten, et al., “Perfectly secure key distribution for dynamic conferences,” in Advances in Cryptology-CRYPTO’92, LNCS, 740, pp. 471-486, 1993.
|
[5]
|
L. Wang and Y. P. Lin, “Maximum safety-path matrices based fault-tolerant routing for hypercube multi-com-puters,” Journal of Software, Vol. 15, No. 7, pp. 994-1004, 2004.
|
[6]
|
L. Wang and Y. P. Lin, “A fault-tolerant routing strategy based on maximum safety-path vectors for hypercube multi-computers,” Journal of China Institute of Commu-nications, Vol. 16, No. 4, pp. 130-137, 2004.
|