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

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...

Full description

Bibliographic Details
Main Authors: Moon-Seog Jun, Tai-Hoon Kim, Kwang-Hyung Lee, Young-Gu Lee, Seung-Jae Jang
Format: Article
Language:English
Published: MDPI AG 2011-08-01
Series:Sensors
Subjects:
Online Access:http://www.mdpi.com/1424-8220/11/9/8227/
id doaj-217a928d15844c91918582d2d14466a6
record_format Article
spelling doaj-217a928d15844c91918582d2d14466a62020-11-24T21:24:43ZengMDPI AGSensors1424-82202011-08-011198227824010.3390/s110908227A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional ArraysMoon-Seog JunTai-Hoon KimKwang-Hyung LeeYoung-Gu LeeSeung-Jae JangThese 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.http://www.mdpi.com/1424-8220/11/9/8227/sensor networkgroup key agreementtwo-dimensional arraykey pre-distributionquorum system
collection DOAJ
language English
format Article
sources DOAJ
author Moon-Seog Jun
Tai-Hoon Kim
Kwang-Hyung Lee
Young-Gu Lee
Seung-Jae Jang
spellingShingle Moon-Seog Jun
Tai-Hoon Kim
Kwang-Hyung Lee
Young-Gu Lee
Seung-Jae Jang
A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays
Sensors
sensor network
group key agreement
two-dimensional array
key pre-distribution
quorum system
author_facet Moon-Seog Jun
Tai-Hoon Kim
Kwang-Hyung Lee
Young-Gu Lee
Seung-Jae Jang
author_sort Moon-Seog Jun
title A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays
title_short A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays
title_full A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays
title_fullStr A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays
title_full_unstemmed A Study on Group Key Agreement in Sensor Network Environments Using Two-Dimensional Arrays
title_sort study on group key agreement in sensor network environments using two-dimensional arrays
publisher MDPI AG
series Sensors
issn 1424-8220
publishDate 2011-08-01
description 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.
topic sensor network
group key agreement
two-dimensional array
key pre-distribution
quorum system
url http://www.mdpi.com/1424-8220/11/9/8227/
work_keys_str_mv AT moonseogjun astudyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT taihoonkim astudyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT kwanghyunglee astudyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT younggulee astudyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT seungjaejang astudyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT moonseogjun studyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT taihoonkim studyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT kwanghyunglee studyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT younggulee studyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
AT seungjaejang studyongroupkeyagreementinsensornetworkenvironmentsusingtwodimensionalarrays
_version_ 1725986454143762432