Abstract
The energy and connectivity on the mobile devices in mobile peer-to-peer (MP2P) networks are limited. Since different mobile peers may store copies of shared information, the data synchronization on MP2P becomes crucial and challenging due to node mobility and limited resources. We propose effective approaches to solve the mentioned problem with a dynamic tree-like index structure and group-key agreement mechanism. The proposed approaches can effectively synchronize the data items and perform well in terms of the coverage of successfully synchronized nodes and the number of redundant messages. Last, we validate the proposed approaches through extensive simulation experiments and present our findings.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Smith, K., Seligman, L., Swarup, V.: Everybody share: The challenge of data-sharing systems. Computer 41(9), 54–61 (2008)
Shen, H., Joseph, M., Kumar, M., Das, S.: Precinct: A scheme for cooperative caching in mobile peer-to-peer systems. In: Proceedings of 19th IEEE International on Parallel and Distributed Processing Symposium, p. 57a (April 2005)
Xe, G., Li, Z., Chen, J., Wei, Y., Issarny, V., Conte, A.: Dtcs: A dynamic tree-based consistency scheme of cooperative caching in mobile ad hoc networks. In: Proceedings of the 3rd IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, pp. 48–56 (2007)
Chand, N., Joshi, R., Misra, M.: Cooperative caching strategy in mobile ad hoc networks based on clusters. Wireless Personal Communications 43, 41–63 (2007), doi:10.1007/s11277-006-9238-z
Chauhan, N., Awasthi, L.K., Chand, N., Joshi, R.C., Mishra, M.: A cooperative caching strategy in mobile ad hoc networks based on clusters. In: Proceedings of the 2011 International Conference on Communication, Computing & Security, ICCCS 2011, pp. 17–20. ACM, New York (2011)
Lu, H., Denko, M.: Replica update strategies in mobile ad hoc networks. In: Proceedings of the 2nd IFIP International Conference on Wireless and Optical Communications Networks, pp. 302–306 (2005)
Nawaf, M.M., Torbey, Z.: Replica update strategy in mobile ad hoc networks. In: Proceedings of the International Conference on Management of Emergent Digital EcoSystems, pp. 474–476 (2009)
Coatta, T., Hutchinson, N., Warfield, A., Won, J.: A data synchronization service for ad hoc groups. In: Proceedings of the 2004 IEEE Wireless Communications and Networking Conference, pp. 483–488 (2004)
Jeong, I.R., Lee, D.H.: Key agreement for key hypergraph. Computers & Security 26(7-8), 452–458 (2007)
Perkins, C., Royer, E.: Ad-hoc on-demand distance vector routing. In: Proceedings of Second IEEE Workshop on Mobile Computing Systems and Applications, WMCSA 1999, pp. 90–100 (February 1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lai, CC., Liu, CM. (2013). Approaches for Data Synchronization on Mobile Peer-to-Peer Networks. In: Pan, JS., Yang, CN., Lin, CC. (eds) Advances in Intelligent Systems and Applications - Volume 2. Smart Innovation, Systems and Technologies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35473-1_59
Download citation
DOI: https://doi.org/10.1007/978-3-642-35473-1_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-35472-4
Online ISBN: 978-3-642-35473-1
eBook Packages: EngineeringEngineering (R0)