Exploring group mobility for replica data allocation in a mobile environment

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.

[1]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[2]  John B. Willett,et al.  SIM: A C++ Library for Discrete Event Simulation , 1995 .

[3]  Jorng-Tzong Horng,et al.  Personal paging area design based on mobile's moving behaviors , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Mario Gerla,et al.  Multicluster, mobile, multimedia radio network , 1995, Wirel. Networks.

[5]  Baochun Li,et al.  Group mobility and partition prediction in wireless ad-hoc networks , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[6]  Baochun Li,et al.  Efficient and guaranteed service coverage in partitionable mobile ad-hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[7]  Naphtali Rishe,et al.  Cost Based Data Dissemination in Satellite Networks , 2002, Mob. Networks Appl..

[8]  Bo Xu,et al.  Cost Based Data Dissemination in Broadcast Networks with Disconnection , 2001, ICDT.

[9]  Xiaoyan Hong,et al.  LANMAR: landmark routing for large scale wireless ad hoc networks with group mobility , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).

[10]  Takahiro Hara,et al.  Cooperative caching by mobile clients in push-based information systems , 2002, CIKM '02.

[11]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Baochun Li.  On Increasing Service Accessibility and Efficiency in Wireless Ad-Hoc Networks with Group Mobility , 2002, Wirel. Pers. Commun..

[13]  Xiaoyan Hong,et al.  A group mobility model for ad hoc wireless networks , 1999, MSWiM '99.

[14]  Takahiro Hara,et al.  Replica allocation in ad hoc networks with periodic data update , 2002, Proceedings Third International Conference on Mobile Data Management MDM 2002.

[15]  Yuval Shavitt,et al.  Constrained mirror placement on the Internet , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[16]  Takahiro Hara,et al.  Effective replica allocation in ad hoc networks for improving data accessibility , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[17]  Xiaoyan Hong,et al.  A wireless hierarchical routing protocol with group mobility , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[18]  Ming-Syan Chen,et al.  Developing Data Allocation Schemes by Incremental Mining of User Moving Patterns in a Mobile Computing System , 2003, IEEE Trans. Knowl. Data Eng..