Data sharing over mobile ad hoc networks
Article No.: 44, Pages 1 - 6
Abstract
Mobile ad hoc networks offer new challenges for distributed applications designers, such as mobile and lightweight terminals, or the lack of a reliable network infrastructure. In this article we focus on the problem of data sharing in MANETs and we propose a peer to peer distributed shared memory for mobile ad hoc network. It uses data replication to prevent the users needs and the potential loss of data a terminal disparition could cause.These data are editable and we offer a mechanism to maintain consistency between the replicas in an efficient way.
References
[1]
M. Benchaïba, A. Bouabdallah, N. Badache, and M. Ahmed-Nacer. Distributed mutual exclusion algorithms in mobile ad hoc networks: an overview. SIGOPS Oper. Syst. Rev., 38(1):74--89, 2004.
[2]
M. Boulkenafed and V. Issarny. Adhocfs: sharing files in wlans. Network Computing and Applications, 2003. NCA 2003. Second IEEE International Symposium on, pages 156--163, 16--18 April 2003.
[3]
T. Clausen and P. Jacquet. Optimized link state routing protocol (olsr), 2003.
[4]
S. Corson and J. Macker. Mobile ad hoc networking (manet): Routing protocol performance issues and evaluation considerations, 1999.
[5]
H. D. Ha Duong, C. Melchiorre, E. M. Meyer, I. Nieto, M. Arrufat, P. Pelliccione, and F. Tastet-Chere. Popeye: a simple and reliable collaborative working environment over mobile ad-hoc networks., 2007.
[6]
P. Keleher, A. L. Cox, and W. Zwaenepoel. Lazy release consistency for software distributed shared memory. Computer Architecture, 1992. Proceedings., The 19th Annual International Symposium on, pages 13--21, 1992.
[7]
Qusay H. Mahmoud, editor. John Wiley & Sons, July 2004.
[8]
C. Mascolo, L. Capra, S. Zachariadis, and W. Emmerich. Xmiddle: A data-sharing middleware for mobile computing.
[9]
David Mosberger. Memory consistency models. SIGOPS Oper. Syst. Rev., 27(1):18--26, 1993.
[10]
C. Perkins, E. Belding-Royer, E. Belding-Royer, and S. Das. Ad hoc on-demand distance vector (aodv) routing, 2003.
[11]
Jelica Protic, Milo Tomasevic, and Veljko Milutinovic. Distributed shared memory: Concepts and systems. IEEE Parallel and Distributed Technology, 04(2):63--79, 1996.
[12]
Kerry Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Trans. Comput. Syst., 7(1):61--77, 1989.
Index Terms
- Data sharing over mobile ad hoc networks
Recommendations
Routing with adaptive path and limited flooding for mobile ad hoc networks
In MANET, each mobile host can freely move around and the network topology is dynamically changing. To send a datagram, a source host broadcasts a route discovery packet to the network. All neighboring nodes receiving this packet will rebroadcast this ...
Reputation based selfishness prevention techniques for mobile ad-hoc networks
Mobile ad-hoc networks require nodes to cooperate in the relaying of data from source to destination. However, due to their limited resources, selfish nodes may be unwilling to forward packets, which can deteriorate the multi-hop connectivity. Different ...
Consistency Management Strategies for Data Replication in Mobile Ad Hoc Networks
In a mobile ad hoc network, data replication drastically improves data availability. However, since mobile hosts' mobility causes frequent network partitioning, consistency management of data operations on replicas becomes a crucial issue. In such an ...
Comments
Information & Contributors
Information
Published In
June 2008
399 pages
Copyright © 2008 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]
Sponsors
- Lyon 1 University
- SIGAPP: ACM Special Interest Group on Applied Computing
- Mairie de Villeurbanne
- Conseil Général du Rhône
- INSA Lyon: Institut National des Sciences Appliquées de Lyon
- Conseil Régional Rhône-Alpes
- Mutuelle d'assurance MAIF
- I.U.T.A LYON 1: Institute of Technology Lyon 1
- Ministère de l'Enseignement Supérieur et de la Recherche
- Lyon 2 University
- ISTASE: High-Level Engineering School in Telecommunication
- France Telecom
- LIRIS: Lyon Research Center for Images and Intelligent Information Systems
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 23 June 2008
Check for updates
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 264Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Mar 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in