IEICE TRANSACTIONS on Communications
Efficient and Secure Key Agreement for Merging Clusters in Ad-Hoc Networking Environments
Summary :
In ad-hoc networks, mobile nodes are limited by a range of radio coverage and have an irregular source of power due to their battery. In ad-hoc networks, there are a lot of situations that all mobile nodes need to agree on their key not at the same time but in part and then merge themselves subsequently. This is because ad-hoc networks have specific features such as mobility and allow various conditions during configuration. In this thesis, we propose MCP (Merging Clusters Protocol), a simple key agreement scheme that can effectively deal with merging different adjacent clusters in mobile ad-hoc networks. When nodes of each cluster have already agreed on their own group keys and intend to merge themselves for further secure communications, MCP can be used in an efficient and secure way. In addition, it can be utilized for efficient group key agreement in a large ad-hoc network. We analyze the security and efficiency of MCP and discuss the experimental results according to practical implementation scenarios.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E90-B No.7 pp.1575-1583
- Publication Date
- 2007/07/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1093/ietcom/e90-b.7.1575
- Type of Manuscript
- PAPER
- Category
- Fundamental Theories for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sooyeon SHIN, Taekyoung KWON, "Efficient and Secure Key Agreement for Merging Clusters in Ad-Hoc Networking Environments" in IEICE TRANSACTIONS on Communications,
vol. E90-B, no. 7, pp. 1575-1583, July 2007, doi: 10.1093/ietcom/e90-b.7.1575.
Abstract: In ad-hoc networks, mobile nodes are limited by a range of radio coverage and have an irregular source of power due to their battery. In ad-hoc networks, there are a lot of situations that all mobile nodes need to agree on their key not at the same time but in part and then merge themselves subsequently. This is because ad-hoc networks have specific features such as mobility and allow various conditions during configuration. In this thesis, we propose MCP (Merging Clusters Protocol), a simple key agreement scheme that can effectively deal with merging different adjacent clusters in mobile ad-hoc networks. When nodes of each cluster have already agreed on their own group keys and intend to merge themselves for further secure communications, MCP can be used in an efficient and secure way. In addition, it can be utilized for efficient group key agreement in a large ad-hoc network. We analyze the security and efficiency of MCP and discuss the experimental results according to practical implementation scenarios.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e90-b.7.1575/_p
Copy
@ARTICLE{e90-b_7_1575,
author={Sooyeon SHIN, Taekyoung KWON, },
journal={IEICE TRANSACTIONS on Communications},
title={Efficient and Secure Key Agreement for Merging Clusters in Ad-Hoc Networking Environments},
year={2007},
volume={E90-B},
number={7},
pages={1575-1583},
abstract={In ad-hoc networks, mobile nodes are limited by a range of radio coverage and have an irregular source of power due to their battery. In ad-hoc networks, there are a lot of situations that all mobile nodes need to agree on their key not at the same time but in part and then merge themselves subsequently. This is because ad-hoc networks have specific features such as mobility and allow various conditions during configuration. In this thesis, we propose MCP (Merging Clusters Protocol), a simple key agreement scheme that can effectively deal with merging different adjacent clusters in mobile ad-hoc networks. When nodes of each cluster have already agreed on their own group keys and intend to merge themselves for further secure communications, MCP can be used in an efficient and secure way. In addition, it can be utilized for efficient group key agreement in a large ad-hoc network. We analyze the security and efficiency of MCP and discuss the experimental results according to practical implementation scenarios.},
keywords={},
doi={10.1093/ietcom/e90-b.7.1575},
ISSN={1745-1345},
month={July},}
Copy
TY - JOUR
TI - Efficient and Secure Key Agreement for Merging Clusters in Ad-Hoc Networking Environments
T2 - IEICE TRANSACTIONS on Communications
SP - 1575
EP - 1583
AU - Sooyeon SHIN
AU - Taekyoung KWON
PY - 2007
DO - 10.1093/ietcom/e90-b.7.1575
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E90-B
IS - 7
JA - IEICE TRANSACTIONS on Communications
Y1 - July 2007
AB - In ad-hoc networks, mobile nodes are limited by a range of radio coverage and have an irregular source of power due to their battery. In ad-hoc networks, there are a lot of situations that all mobile nodes need to agree on their key not at the same time but in part and then merge themselves subsequently. This is because ad-hoc networks have specific features such as mobility and allow various conditions during configuration. In this thesis, we propose MCP (Merging Clusters Protocol), a simple key agreement scheme that can effectively deal with merging different adjacent clusters in mobile ad-hoc networks. When nodes of each cluster have already agreed on their own group keys and intend to merge themselves for further secure communications, MCP can be used in an efficient and secure way. In addition, it can be utilized for efficient group key agreement in a large ad-hoc network. We analyze the security and efficiency of MCP and discuss the experimental results according to practical implementation scenarios.
ER -
English
