Network Decoupling for Secure Communications in Wireless Sensor Networks

Wenjun Gu, Xiaole Bai, Sriram Chellappan, Dong Xuan
2006 IEEE International Workshop on Quality of Service, IWQoS  
Secure communications are highly demanded by many wireless sensor network (WSN) applications. The random key pre-distribution (¢ ¤ £ ¦ ¥ ) scheme has become well accepted to achieve secure communications in WSNs. However, due to its randomness in key distribution and strong constraint in key path construction, the ¢ ¤ £ ¦ ¥ scheme can only be applied in highly dense networks, which are not always feasible in practice. In this paper, we propose a methodology called network decoupling to solve
more » ... s problem. With this methodology, a wireless sensor network is decoupled into a logical key-sharing network and a physical neighborhood network, which significantly releases the constraint in key path construction of ¢ ¤ £ ¦ ¥ scheme. We design a secure neighbor establishment protocol (called ¢ ¤ £ ¦ ¥ - § © ) as well as a set of link and path dependency elimination rules in decoupled wireless sensor networks. Our analytical and simulation data demonstrate the performance enhancement of our solution and its applicability in non-highly dense wireless sensor networks. ' &# 4 3 . It is much smaller compared to the average physical node degree. As can be seen, the network in Fig. 1 (b) is partitioned into many connected components. Two nodes cannot communicate securely if they reside in different connected components. The based schemes when applied to non-highly dense networks have poor performance. Our Contributions: In this paper, we aim to solve the above problem. Our contributions are three-fold. 5 Network Decoupling: We propose a methodology called network decoupling for secure communications in wire-
doi:10.1109/iwqos.2006.250468 dblp:conf/iwqos/GuBCX06 fatcat:wgigdsnvpzdu5odqynbxmns7nu