Data Dissemination Methods for Time-Constraint Applications in Mobile Ad Hoc Networks

In mobile ad hoc networks (MANETs), data replication is essential for improving data availability. In our previous work, we proposed a few updated data dissemination methods to refresh old replicas efficiently in MANETs. These methods disseminate updated data items every time when owners of original data items update the items or every time two mobile hosts are newly connected with each other and this causes heavy traffic in the entire network. In this paper, we assume applications that periodically execute read operations with strict deadlines to data items and propose several alternative updated data dissemination methods. These methods reduce the traffic for data dissemination while keeping a high success ratio for read operations.

[1]  Takahiro Hara,et al.  Updated data dissemination methods for updating old replicas in ad hoc networks , 2004, Personal and Ubiquitous Computing.

[2]  David B. Johnson,et al.  Routing in Ad Hoc Networks of Mobile Hosts , 1994, 1994 First Workshop on Mobile Computing Systems and Applications.

[3]  Takahiro Hara,et al.  On Updated Data Dissemination Exploiting an Epidemic Model in Ad Hoc Networks , 2006, BioADIT.

[4]  Takahiro Hara,et al.  Replica Allocation Methods in Ad Hoc Networks with Data Update , 2003, Mob. Networks Appl..

[5]  Takahiro Hara,et al.  Replica Allocation Considering Data Update Intervals in Ad Hoc Networks , 2004, MWCN.

[6]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[7]  Ravi Prakash,et al.  Information dissemination in partitionable mobile ad hoc networks , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.

[8]  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.

[9]  Karl Aberer,et al.  Autonomous Gossiping: A Self-Organizing Epidemic Algorithm for Selective Information Dissemination in Wireless Mobile Ad-Hoc Networks , 2004, ICSNW.

[10]  Takahiro Hara,et al.  Replica allocation for correlated data items in ad hoc sensor networks , 2004, SGMD.

[11]  Le Gruenwald,et al.  Research issues for data communication in mobile ad-hoc network database systems , 2003, SGMD.

[12]  Jörg Hähner,et al.  A protocol for data dissemination in frequently partitioned mobile ad hoc networks , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[13]  Oliver P. Waldhorst,et al.  Consistency mechanisms for a distributed lookup service supporting mobile applications , 2003, MobiDe '03.

[14]  Richard W. Conway,et al.  Some Tactical Problems in Digital Simulation , 1963 .

[15]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[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]  Deborah Estrin,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Fine-grained Network Time Synchronization Using Reference Broadcasts , 2022 .

[18]  Christian Becker,et al.  An epidemic model for information diffusion in MANETs , 2002, MSWiM '02.

[19]  Kevin C. Almeroth,et al.  Coupons: A Multilevel Incentive Scheme for Information Dissemination in Mobile Networks , 2008, IEEE Transactions on Mobile Computing.