A Study on group key agreement in sensor network environments using two-dimensional arrays

3Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

These days, with the emergence of the concept of ubiquitous computing, sensor networks that collect, analyze and process all the information through the sensors have become of huge interest. However, sensor network technology fundamentally has wireless communication infrastructure as its foundation and thus has security weakness and limitations such as low computing capacity, power supply limitations and price. In this paper, and considering the characteristics of the sensor network environment, we propose a group key agreement method using a keyset pre-distribution of two-dimension arrays that should minimize the exposure of key and personal information. The key collision problems are resolved by utilizing a polygonal shape's center of gravity. The method shows that calculating a polygonal shape's center of gravity only requires a very small amount of calculations from the users. The simple calculation not only increases the group key generation efficiency, but also enhances the sense of security by protecting information between nodes. © 2011 by the authors; licensee MDPI, Basel, Switzerland.

Cite

CITATION STYLE

APA

Jang, S. J., Lee, Y. G., Lee, K. H., Kim, T. H., & Jun, M. S. (2011). A Study on group key agreement in sensor network environments using two-dimensional arrays. Sensors, 11(9), 8227–8240. https://doi.org/10.3390/s110908227

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free