A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays

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.

Handling Neighbor Discovery and Rendezvous Consistency with Weighted Quorum-Based Approach

“…Thus, nodes can discover one another within a bounded time and delay [ 9 ]. In [ 10 ], the authors consider the characteristics of sensor network environment, and proposed the mechanism to create exchange keys on the derivation of a one-time password in a two-dimensional quorum system.…”