Advertisement

An Active Distributed Storage Strategy in Hybrid Clustered Opportunistic Networks

  • Ying Han
  • Yong Zhang
  • Gang Cheng
  • Mei Song
  • Hua Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8351)

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.

Keywords

Opportunistic networks Distributed storage Replicas Data retrieval 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Pelusi, L., Passarella, A., Conti, M.: Opportunistic Networking: Data Forwarding in Disconnected Mobile Ad Hoc Networks. IEEE Comm. Magazine 44, 134–141 (2006)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    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)CrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)CrossRefGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    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)CrossRefGoogle Scholar
  8. 8.
    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)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Ying Han
    • 1
  • Yong Zhang
    • 1
  • Gang Cheng
    • 1
  • Mei Song
    • 1
  • Hua Chen
    • 1
  1. 1.Beijing University of Posts and TelecommunicationBeijingChina

Personalised recommendations