Open Access Open Access  Restricted Access Subscription or Fee Access

Group Communication in Wireless Sensor Networks Using Matrix Decomposition

D. Prabhu, T.P. Rani

Abstract


Wireless sensor networks (WSN) have attracted significant interests from the research community in a wide range of applications such as target tracking, environment monitoring, military sensing, distributed measurement of seismic activity, and soon. To achieve secure communication between sensor nodes in wireless sensor networks (WSNs), A matrix-based key pre- distribution scheme for WSN is presented, as shown in the following process. First, matrix- based method is employed to decompose the polynomial pool, which substitutes for the key pool to establish the shared keys. Second, the shared key is computed by the shared polynomial. Third, it can always compute the common polynomial with mutual authentication. The analysis in this paper indicates that the existing schemes require a large number of keys in each sensor node to display a comparable connectivity as the proposed scheme which allows almost 100% connectivity regardless of the number of keys, and it develops an efficient encoding mechanism to optimize the network-wide storage usage. On the other hand, compared with existing schemes, our scheme has better performance in network resilience.

Keywords


Lower Triangular Matrix, Upper Triangular Matrix, Shared Key, Trusted Key Server, Group Communication.

Full Text:

PDF

References


H. W. Chan, A. Perrig, and D. Song, “Key distribution techniques for sensor networks,” in

Wireless Sensor Networks. Norwell, MA: Kluwer,2004, pp. 277–303.

H. W. Chan, A. Perrig, and D. Song, “Random key predistribution schemes for sensor networks,” in Proc. IEEE Symp. Res. Secur. Privacy, 2003, pp. 197–213.

W. Du, J. Deng, Y. S. Han, P. K. Varshney, J. Katz, and A. Khalili, “A pairwise key predistribution scheme for wireless sensor networks,” ACM Trans. Inf. Syst. Secur., vol. 8, no. 2, pp. 228–258, 2005.

R. Blom, “An optimal class of symmetric key generation systems,” in Proc. EURORYPT 84 Workshop Adv. Cryptol.: Theory Appl. Cryptographic Tech., 1985, pp. 335–338.

D. G. Liu, P. Ning, and R. F. Li, “Establishing pair wise keys in distributedsensor networks,” ACM Trans. Inf. Syst. Secur., vol. 8, no. 1, pp. 41–77, 2005.

C. Blundo, A. DeSantis, and A. Herzberg et al., “Perfectly-secure key distribution for dynamic conference,” Inf. Comput., vol. 146, no. 1, pp. 1–23, 1998.

S. A. Camtepe and B. Yener, “Combinatorial design of key distribution mechanisms for wireless sensor network,” in Proc. Comput. Security - ESORICS, 2004, pp. 293–308.

D. Sanchez and H. Baldus, “A deterministic pair wise key pre-distribution scheme for mobile sensor networks,” in Proc. 1st Int. Conf. Secur. Privacy Emerg. Areas Communication Networks 2005, pp. 277–288.

D. Chakrabarti, S. Maitra, and B. Roy, “A key pre-distribution scheme for wireless sensor networks: Merging blocks in combinatorial design,” in Proc. Lect. Notes Comput. Sci., 2005, pp. 89–103.

J. Lee and D. R. Stinson, “Deterministic key pre- distribution schemes for distributed sensor networks,” in Proc. 11thInt.Workshop,2005,pp.293–309

Subhas K. Ghosh, Ranjeet K. Patro, Manik Raina, Chandrasekhara Thejaswi, Viswanath Ganapathy “Secure Group Communication in WirelessSensor Networks” in Honeywell technology

Hangyang Dai and Hongbing Xu “Key pre-distribution in wireless sensor networks using LU matrix” pulished in IEEE sensor Journal Vol 10,No 8,August 2010


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.