Fast-Refreshing Tree-Based Group Key Agreement for Mobile Ad Hoc Networks

ASIAIR > College of Computer Science > Department of Computer Science and Information Engineering > Journal Artical > Item 310904400/18778

Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/18778

Title:	Fast-Refreshing Tree-Based Group Key Agreement for Mobile Ad Hoc Networks
Authors:	陳興忠;Chen, Hsing-Chung
Contributors:	資訊工程學系
Date:	2012-08
Issue Date:	2012-11-26 05:58:26 (UTC+0)
Abstract:	With the proliferation of group-oriented applications in mobile ad hoc networks (MANETs), users need suitable group key agreements to secure communication between group members. Because of users' mobility, group members join their group or leave frequently in MANETs. Due to each MANET has a unique, specific purpose, there typically is no central management mechanism. The utilization of resource, such as bandwidth, is limited. Furthermore, a user's wireless device is usually equipped only with limited battery power. Consequently, power consumption also affects the life period of a MANET. Due to these challenges, MANETs require a group key agreement which can generate and refresh a group key quickly and efficiently. In this paper, we propose a Fast-reacting Tree-based Group key agreement for MANETs, FTG-M, which supports efficient message transmission and low communication overhead in order to refresh group keys quickly. In addition, we utilize a new idea, a virtual tree, to reduce communication overhead. We compare the performance of FTG-M with other schemes, so as to show the reduction of communication and computation overhead.
Relation:	The 7th Asia Joint Conference on Information Security (AsiaJCIS 2012)
Appears in Collections:	[資訊工程學系] 期刊論文

Files in This Item:

File	Description	Size	Format
index.html		0Kb	HTML	309	View/Open