Abstract
Cooperative caching is an efficient technique to reduce data access cost in ad hoc networks. Although quite a lot of work has been done on cooperative caching, how to place and discover cache copies efficiently is still a challenging task. Motivated by the fast development of social networks, we propose to improve the efficiency of cooperative caching by considering the social attributes of network nodes. We include friendship, interest similarity and centrality in the design of cache placement metric and cache discovery metric. Cache placement metric is used to evaluate the significance of candidate data items while cache discovery metric is used to choose target nodes of cache query. Correspondingly, with the novel social attribute based metrics, cache copies can be placed more accurately and discovered more easily. To validate the performance of our design, we conduct extensive simulations via ns-3. The algorithm without consideration of social network is also simulated for comparison purpose. Simulation results show that social attribute based cooperative caching can significantly reduce data access time, while keeping the message cost similar.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Fan, X., Cao, J., Wu, W.: Contention-aware data caching in wireless multi-hop ad hoc networks. J Para. Distrib. Comput. 71(4), 603–614 (2011)
Nuggehalli, P., Srinivasan, V., Chiasserini, C.-F.: Energy-efficient caching strategies in ad hoc wireless networks. In: Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), New York, NY, USA, pp. 25–34 (2003)
Sailhan, F., Issarny, V.: Cooperative caching in Ad Hoc networks. In: Chen, M.-S., Chrysanthis, P.K., Sloman, M., Zaslavsky, A. (eds.) MDM 2003. LNCS, vol. 2574, pp. 13–28. Springer, Heidelberg (2003)
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, pp. 17–20 (2011)
Huang, Y., Cao, J., Wang, Z., Jin, B., Feng, Y.: Achieving flexible cache consistency for pervasive internet access. In: The Fifth Annual IEEE International Conference on Pervasive Computing and Communications 2007, PerCom 2007, pp. 239–250 (2007)
Hara, T.: Effective replica allocation in ad hoc networks for improving data accessibility. In: Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 3, pp. 1568–1576 (2001)
Tang, B., Gupta, H., Das, S.R.: Benefit-based data caching in Ad Hoc networks. IEEE Trans. Mob. Comput. 7(3), 289–304 (2008)
Yin, L., Cao, G.: Supporting cooperative caching in ad hoc networks. Presented at the INFOCOM 2004, Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 4, pp. 2537–2547 (2004)
Chiu, G.-M., Young, C.-R.: Exploiting in-zone broadcasts for cache sharing in mobile ad hoc networks. IEEE Trans. Mob. Comput. 8(3), 384–397 (2009)
Du, Y., Gupta, S.K., Varsamopoulos, G.: Improving on-demand data access efficiency in MANETs with cooperative caching. Ad Hoc Netw. 7(3), 579–598 (2009)
Katsaros, D., Dimokas, N., Tassiulas, L.: Social network analysis concepts in the design of wireless ad hoc network protocols. IEEE Netw. 24(6), 23–29 (2010)
Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing (Mobihoc 2007), New York, NY, USA, pp. 32–40 (2007)
Stanford large network dataset collection. http://snap.stanford.edu/data/. Accessed July 2014
Hara, T.: Cooperative caching by mobile clients in push-based information systems. In: Proceedings of the Eleventh International Conference on Information and Knowledge Management, pp. 186–193 (2002)
Tang, B., Gupta, H., Das, S.: Benefit-based data caching in Ad Hoc networks. In: The Proceedings of the 14th IEEE International Conference on Network Protocols (ICNP 2006), pp. 208–217 (2006)
Jianliang, X., Li, B., Lee, D.L.: Placement problems for transparent data replication proxy services. IEEE J. Sel. Areas Commun. 20(7), 1383–1398 (2002)
Zhuo, X., Li, Q., Cao, G., Dai, Y., Szymanski, B., La Porta, T.: Social-based cooperative caching in DTNs: a contact duration aware approach. In: 2011 IEEE 8th International Conference on Mobile Adhoc and Sensor Systems (MASS), pp. 92–101 (2011)
Liu, L., Antonopoulos, N., Mackin, S.: Social peer-to-peer for resource discovery. In: 15th EUROMICRO International Conference on Parallel, Distributed and Network-Based Processing (PDP 2007), pp. 459–466 (2007)
Hui, P., Yoneki, E., Chan, S.Y., Crowcroft, J.: Distributed community detection in delay tolerant networks. In: Proceedings of 2nd ACM/IEEE International Workshop on Mobility in the Evolving Internet Architecture, New York, NY, USA, pp. 7:1–7:8 (2007)
Pan, D., Chen, W., Ruan, Z., Lu, K.: A transmission scheme for opportunistic networks with social selfish nodes. In: Proceedings of the 4th International Conference on Internet Multimedia Computing and Service, New York, NY, USA, pp. 15–19 (2012)
Acknowledgments
This research is partially supported by National Natural Science Foundation of China (No. 61379157).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Yang, Z., Wu, W., Zhu, Z. (2015). Social Attributes Based Cooperative Caching in Ad Hoc Networks. In: Wang, G., Zomaya, A., Martinez, G., Li, K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2015. Lecture Notes in Computer Science(), vol 9528. Springer, Cham. https://doi.org/10.1007/978-3-319-27119-4_43
Download citation
DOI: https://doi.org/10.1007/978-3-319-27119-4_43
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27118-7
Online ISBN: 978-3-319-27119-4
eBook Packages: Computer ScienceComputer Science (R0)