Abstract
In traditional opportunistic networks, data items are stored on local storage of ordinary nodes and replicas are generated passively in the process of data forwarding, which results data sharing is inefficient. In this paper, we propose a new Active Distributed Storage (ADS) to increase the efficiency of data sharing in hybrid clustered opportunistic networks. ADS is achieved by dynamically increasing and deleting replicas of hot files in order to ensure availability of data and balance load of hot files. Then the corresponding local retrieval strategy is exerted on the network. The simulation result shows the effectiveness of the proposed strategy in data sharing under hybrid opportunistic networks.
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.
References
Pelusi, L., Passarella, A., Conti, M.: Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks. IEEE Comm. Magazine 44, 134–141 (2006)
Zhang, Y., Wang, Z., Li, J., Song, M., Teng, Y., Liu, B.: Opportunistic Networks Architecture with Fixed Infrastructure Nodes. In: Zu, Q., Hu, B., Elçi, A. (eds.) ICPCA 2012 and SWS 2012. LNCS, vol. 7719, pp. 862–868. Springer, Heidelberg (2013)
Samuel, H., Zhuang, W., Preiss, B.: DTN Based Dominating Set Routing for MANET in Heterogeneous Wireless Networking. Mobile Networks and Applications 14(2), 154–164 (2009)
Jinglong, L., Yong, Z., Yinglei, T., et al.: The Research On Distributed Storage Mechanism Used in Clustered Opportunistic Network. In: 2nd IEEE International Conference on Cloud Computing and Intelligence Systems, pp. 320–324 (2012)
Leibowitz, N., Ripeanu, M., Wierzbicki, A.: Deconstructing the Kazaa Network. In: Proceedings of 3rd IEEE Workshop on Internet Applications (WIAPP 2003), Santa Clara, CA,USA, Jun 23-24, pp. 112–120. IEEE, Piscataway (2003)
Spyropoulos, T., Psounis, K., Raghavendra, C.: Spray and Wait: An Efęcient Routing Scheme for Intermittently Connected Mobile Networks. In: Proceedings of 2005 ACM SIGCOMM Workshop on Delay-tolerant Networking, pp. 252–259 (2005)
Lindgren, A., Doria, A., Schelén, O.: Probabilistic Routing in Intermittently Connected Networks. ACM SIGMOBILE Mobile Computing and Communications Review 7(3), 19–20 (2003)
Sunho, L., Chansu, Y., Das, C.R.: Clustered Mobility Model for Scale-Free Wireless Networks. In: Proceedings 2006 31st IEEE Conference on Local Computer Networks (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Han, Y., Zhang, Y., Cheng, G., Song, M., Chen, H. (2014). An Active Distributed Storage Strategy in Hybrid Clustered Opportunistic Networks. In: Zu, Q., Vargas-Vera, M., Hu, B. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2013. Lecture Notes in Computer Science, vol 8351. Springer, Cham. https://doi.org/10.1007/978-3-319-09265-2_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-09265-2_17
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09264-5
Online ISBN: 978-3-319-09265-2
eBook Packages: Computer ScienceComputer Science (R0)