C. X. ZHANG ET AL.
187
operations n2 times, do additive operator n(n-1) times;
updating the dynamic key requires n times Hash matrix
to calculate and N2 times operation on checking table.
Therefore, minimizing the order of the matrix under the
premise that security is guaranteed is of great signify-
cance in improving the op eration speed of this agreement,
reducing the computation time and lowering energy
consumption.
Convert the information into a relatively short cipher-
text so that the co mmunication load is reduced while the
safety is ensured.
Each node only needs to maintain the communication
key of the adjacent neighbor in this protocol. Comparing
with the key pre-distribution scheme which need to store
a lot of key information, under the circumstances of
lower key storage cost, this Protocol can maintain the
full connectivity of sensor network in the range of com-
munication.
5. Conclusions
This article proposes a kind of dynamic key management
protocol based on password matrix in wireless sensor
network. It uses the update mechanism about dynamic
password matrix. Each transmission of information u sing
the different encrypted and unencrypted keys, effectively
prevents physical capture, eavesdropping and other at-
tacks and enhances the security of the system; the con-
nectivity of network nodes is good and radio range is
wide between adjacent nodes connected; as the agree-
ment only need to establish key matrix between the
nodes in the neighborhood, it can effectively reduce
space where the node store key; information delivery
process and key update communication cost are at the
same time so that it can reduce the overhead in the
transmission of session keys between nodes and save
energy consumption. Meanwhile, putting forward the
joining system about the new nodes makes the network
have better scalability, and when the new sensor node is
added to the network, the network key which has been
leaked will not affect the new join intrant sensor nodes.
6. References
[1] B. C. Neuman and Ts’o T. Kerberos, “An Authentication
Service for Computer Networks,” IEEE Communications,
Vol. 32, No. 9, 1994, pp. 33-38.
doi:10.1109/35.312841
[2] S. Slijepcevic, V. Tsiasis and S. Zimbeck, “On Commu-
nication Security In Wireless Ad-Hoc Sensor Networks,”
Proceedings of the 11th IEEE International Workshops
on Enabling Technologies: Infrastructure for Collabora-
tive Enterprises, Pittsburgh, 2002, pp. 139-144.
[3] D. Huang, M. Mehta, A. V. D. Liefvoort, et al., “Model-
ing Pairwise Key Establishment for Random Key Predis-
tribution in Large-Scale Sensor Networks,” IEEE/ACM
Transactions on Networking, Vol. 15, No. 5, 2007, pp.
1204-1215. doi:10.1109/TNET.2007.896259
[4] Y. W. Law, L. H. Yen, R. D. Pietro, et al., “Secure
K-Connectivity Properties of Wireless Sensor Networks,”
Proceedings of the 4th IEEE International Conference on
Mobile Ad-Hoc and Sensor Systems, Pisa, 8-11 October
2007, pp. 1-6.
[5] S. A. Camtepe and B. Yener, “Combinatorial Design of
Key Distribution Mechanisms for Wireless Sensor Net-
works,” IEEE/ACM Transactions on Networking, Vol. 15,
No. 2, 2007, pp. 346-358.
doi:10.1109/TNET.2007.892879
[6] F. Delgosha, E. Ayday and F. Fekri, “MKPS: A Multi-
variate Polynomial Scheme for Symmetric Key-Estab-
lishment in Distributed Sensor Networks,” Proceedings
of the ACM International Wireless Communications and
Mobile Computing Conference, Honolulu, 12-16 August
2007, pp. 236-241.
[7] J. Wu and D. R. Stinson, “Minimum Node Degree and
K-Connectivity for Key Predistribution Schemes and
Distributed Sensor Networks.” Proceedings of the 1st
ACM Conference on Wireless Network Security, Alexan-
dria, 31 March-April 2008, pp. 119-124.
[8] H. Chan and A. Perrig, “PIKE: Peer Intermediaries for
Key Establishment in Sensor Networks,” Proceedings of
the IEEE Computer and Communications Societies, Mi-
ami, 2005, pp. 524 -535.
doi:10.1109/INFCOM.2005.1497920
[9] S. A. Camtepe and B. Yener, “Combinatorial Design of
Key Distributions for Wireless Sensor Networks,” Pro-
ceedings of the European Symposium on Research Com-
puter Security, Sophia Antipolis, 2004, pp. 293-308.
[10] D. Liu, P. Ning and W. Du, “Group-Based Key Predis-
tribution for Wireless Sensor Networks,” ACM Transac-
tions on Sensor Networks, Vol. 4, No. 2, 2008, pp. 1-30.
doi:10.1145/1340771.1340777
[11] N. T. Canh, P. T. H. Truc, T. H. Hai, et al. “Enhanced
Group-Based Key Management Scheme for Wireless
Sensor Networks Using Deployment Knowledge,” Pro-
ceedings of the 6th Annual IEEE Consumer Communica-
tions and Networking Conference, Las Vegas, 10-13
January 2009, pp. 1-5.
[12] R. Anderson, H. Chan and A. Perrig, “Key Infection:
Smart Trust for Smart Dust,” Proceedings of the 12th
IEEE International Conference on Network Protocols,
Berlin, 2004, pp. 206-215.
doi:10.1109/ICNP.2004.1348111
[13] C. Bekara and M. Laurent-Maknavicius, “A New Proto-
col for Securing Wireless Sensor Networks against Nodes
Replication Attacks,” Proceedings of the 3rd IEEE In-
ternational Conference on Wireless and Mobile Comput-
ing, Networking and Communications, New York, 2007.
http://doi.ieeecomputersociety.org/10.1109/WIMOB.200
7.11
Copyright © 2011 SciRes. WSN