Exploring group mobility for replica data allocation in a mobile environment

Jiun-Long Huang*, Ming Syan Chen, Wen-Chih Peng

*此作品的通信作者

研究成果: Paper同行評審

44 引文 斯高帕斯(Scopus)

摘要

The growth in wireless communication technologies attracts a considerable amount of attention in mobile ad-hoc networks. Since mobile hosts in an ad-hoc network usually move freely, the topology of the network changes dynamically and disconnection occurs frequently. These characteristics make a mobile ad-hoc network be likely to be separated into several disconnected partitions, and the data accessibility is hence reduced. Several schemes are proposed to alleviate the reduction of data accessibility by replicating data items. However, little research effort was elaborated upon exploiting the group mobility where the group mobility refers to the phenomenon that several mobile nodes tend to move together. In this paper, we address the problem of replica allocation in a mobile ad-hoc network by exploring group mobility. We first analyze the group mobility model and derive several theoretical results. In light of these results, we propose a replica allocation scheme to improve the data accessibility. Several experiments are conducted to evaluate the performance of the proposed scheme. The experimental results show that the proposed scheme is able to not only obtain higher data accessibility but also produce lower network traffic than prior schemes.

原文English
頁面161-168
頁數8
DOIs
出版狀態Published - 2003
事件CIKM 2003: Proceedings of the Twelfth ACM International Conference on Information and Knowledge Management - New Orleans, LA, United States
持續時間: 3 11月 20038 11月 2003

Conference

ConferenceCIKM 2003: Proceedings of the Twelfth ACM International Conference on Information and Knowledge Management
國家/地區United States
城市New Orleans, LA
期間3/11/038/11/03

指紋

深入研究「Exploring group mobility for replica data allocation in a mobile environment」主題。共同形成了獨特的指紋。

引用此