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

ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 > Item 310904400/18778

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/18778

題名:	Fast-Refreshing Tree-Based Group Key Agreement for Mobile Ad Hoc Networks
作者:	陳興忠;Chen, Hsing-Chung
貢獻者:	資訊工程學系
日期:	2012-08
上傳時間:	2012-11-26 05:58:26 (UTC+0)
摘要:	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.
關聯:	The 7th Asia Joint Conference on Information Security (AsiaJCIS 2012)
顯示於類別:	[資訊工程學系] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	315	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.