skip to main content
10.1145/1023756.1023760acmconferencesArticle/Chapter ViewAbstractPublication PagesmswimConference Proceedingsconference-collections
Article

Data replication effectiveness in mobile ad-hoc networks

Published:04 October 2004Publication History

ABSTRACT

In this paper the behavior of a MANET when, for several reasons, the node density varies in such a way to cause subnet disconnections, is considered. Data replication is usually employed to avoid data loss in case of unwanted disconnection of a node, increasing its availability. Considering a time-scale connectivity and node mobility, replicas can be distributed over the net, in order to make data available even during disconnection periods.A formula can be derived, which allows to evaluate the replica availability in different scenarios, using the probability density functions describing the partitioning of a network obtained by a simulator. Applying this formula to different kind of networks, it is possible to tune the degree of replication desired for different scenarios, looking for a trade-off between space occupancy and availability gain.

References

  1. C. Bettstetter. On the minimum node degree and connectivity of a wireless multihop network. In MOBIHOC Conference Proceedings. ACM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. Bettstetter and O. Krause. On border effects in modeling and simulation of wireless ad hoc networks. In Mobile and Wireless Comm. Netw. (MWCN)Conference Proceedings, August 2001.Google ScholarGoogle Scholar
  3. S. Chessa and P. Maestrini. Dependable and secure data storage and retrieval in mobile, wireless networks. In Dependable Systems and Networks (DSN'03)Conference Proceedings, 2003.Google ScholarGoogle Scholar
  4. O. Dousse, P. Thiran and M. Hasler. Connectivity in ad hoc and hybrid networks. In INFOCOM Conference Proceedings. IEEE, 2002.Google ScholarGoogle ScholarCross RefCross Ref
  5. T. Hara. Effective replica allocation in ad hoc networks for improving data accessibility. In INFOCOM Conference Proceedings, pages 1568--1576. IEEE, 2001.Google ScholarGoogle ScholarCross RefCross Ref
  6. M. Mamei and F. Zambonelli. Programming pervasive and mobile computing applications with the tota middleware. In Pervasive Computing and Communications (PerCom 2004) Conference Proceedings. IEEE, March 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Meester and R. Roy. Continuum Percolation. Cambridge University Press, 1996.Google ScholarGoogle ScholarCross RefCross Ref
  8. S. Olafsson. Modelling capacity and local connectivity in ad hoc networks. http://research.btexact.com/teralab/sverrirolafsson.html. Complexity Research Group.Google ScholarGoogle Scholar
  9. T.K. Philips, S.S. Panwar and A.N. Tantawi. Connectivity properties of a packet radio network model. IEEE Trans. Inf. Theory, 35(5):1044--1047, 1989.Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M.O. Rabin. Efficient dispersal of information for security, load balancing and fault tolerance. ACM Journal, 36(2):335--348, April 1989. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. E.M. Royer, P.M. Melliar-Smith and L. Moser. An analysis of the optimum node density for ad hoc mobile networks. In Int. Conference on Communications Proceedings. IEEE, March 2001.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Data replication effectiveness in mobile ad-hoc networks

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                PE-WASUN '04: Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
                October 2004
                136 pages
                ISBN:1581139594
                DOI:10.1145/1023756

                Copyright © 2004 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 4 October 2004

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • Article

                Acceptance Rates

                Overall Acceptance Rate70of240submissions,29%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader