Table of Contents Author Guidelines Submit a Manuscript
Wireless Communications and Mobile Computing
Volume 2018, Article ID 3806907, 19 pages
https://doi.org/10.1155/2018/3806907
Research Article

Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks

College of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan 430074, China

Correspondence should be addressed to Ke Shi; nc.ude.tsuh.liam@ihsek

Received 26 September 2017; Revised 11 January 2018; Accepted 29 January 2018; Published 5 March 2018

Academic Editor: Daniele Pinchera

Copyright © 2018 Zhenjie Ma et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. K. Fall, “A delay-tolerant network architecture for challenged internets,” in Proceedings of the the 2003 conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, pp. 27–34, ACM, 2003.
  2. K. Chen and H. Shen, “DTN-FLOW: Inter-landmark data flow for high-throughput routing in DTNs,” in Proceedings of the 27th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2013, pp. 726–737, May 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. L. Ziyi and F. Jianhua, “Delay/disruption tolerant network and its application in military communications,” in Computer Design and Applications (ICCDA), 2010 International Conference, vol. 5, pp. V5–231, 2010. View at Google Scholar
  4. W. Gao, G. Cao, A. Iyengar, and M. Srivatsa, “Supporting cooperative caching in disruption tolerant networks,” in Proceedings of the 31st International Conference on Distributed Computing Systems, ICDCS 2011, pp. 151–161, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  5. Y.-K. Ip, W.-C. Lau, and O.-C. Yue, “Forwarding and replication strategies for DTN with resource constraints,” in Proceedings of the 2007 IEEE 65th Vehicular Technology Conference - VTC2007-Spring, pp. 1260–1264, April 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. K. S. Narendra and M. A. Thathachar, “Learning automata---a survey,” The Institute of Electrical and Electronics Engineers Systems, Man, and Cybernetics Society, vol. SMC-4, pp. 323–334, 1974. View at Google Scholar · View at MathSciNet
  7. J. Akbari Torkestani and M. R. Meybodi, “Learning automata-based algorithms for finding minimum weakly connected dominating set in stochastic graphs,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 18, no. 6, pp. 721–758, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Vahdat and D. Becker et al., “Epidemic routing for partially connected ad hoc networks,” Tech. Rep. CS-200006, Duke University, 2000. View at Google Scholar
  9. A. Lindgren, A. Doria, and O. Schelèn, “Probabilistic routing in intermittently connected networks,” Mobile Computing and Communications Review, vol. 7, no. 3, pp. 19-20, 2003. View at Google Scholar
  10. A. Jaleel, H. H. Najaf-Abadi, S. Subramaniam, S. C. Steely Jr., and J. Emer, “CRUISE: Cache replacement and utility-aware scheduling,” in Proceedings of the 17th International Conference on Architectural Support for Programming Languages and Operating Systems, ASPLOS 2012, vol. 40, pp. 249–259, March 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. N. Chand, R. C. Joshi, and M. Misra, “Cooperative caching strategy in mobile ad hoc networks based on clusters,” Wireless Personal Communications, vol. 43, no. 1, pp. 41–63, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. P.-H. Guo, Y. Yang, and X.-Y. Li, “A P2P streaming service architecture with distributed caching,” Journal of Zhejiang University SCIENCE A, vol. 8, no. 4, pp. 605–614, 2007. View at Publisher · View at Google Scholar · View at Scopus
  13. W. Gao, G. Cao, A. Iyengar, and M. Srivatsa, “Cooperative caching for efficient data access in disruption tolerant networks,” IEEE Transactions on Mobile Computing, vol. 13, no. 3, pp. 611–625, 2014. View at Publisher · View at Google Scholar · View at Scopus
  14. A. Raian and R. Rashmi Ranjan, “An adaptive caching technique using learning automata in disruption tolerant networks,” in Proceedings of the Next Generation Mobile Apps, Services and Technologies (NGMAST), pp. 186–191, Eighth International Conference, 2014.
  15. J. Scott, G. Richard, J. Crowcroft, P. Hui, D. Christophe, and A. Chaintreau, “CRAWDAD data set cambridge/haggle (v. 2006-01-31),” 2006, http://crawdad.org/cambridge/haggle/.
  16. E. Nathan and S.P. Alex, “CRAWDAD data set mit/reality (v. 2005-07-01),” 2005, http://crawdad.org/mit/reality/.
  17. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, “Web caching and zipf-like distributions: Evidence and implications,” in Proceedings of the In INFOCOM99. Eighteenth Annual Joint Conference of the Computer and Communications Societies, vol. volume 1, pp. 126–134, 1999.
  18. J. Wu, S. Yang, and F. Dai, “Logarithmic store-carry-forward routing in mobile ad hoc networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 18, no. 6, pp. 735–748, 2007. View at Publisher · View at Google Scholar · View at Scopus
  19. T. Spyropoulos, K. Psounis, and C. S. Raghavendra, “Efficient routing in intermittently connected mobile networks: the single-copy case,” IEEE/ACM Transactions on Networking, vol. 16, no. 1, pp. 63–76, 2008. View at Publisher · View at Google Scholar · View at Scopus
  20. W. Gao and G. Cao, “Fine-grained mobility characterization: Steady and transient state behaviors,” in Proceedings of the 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2010, pp. 61–70, September 2010. View at Publisher · View at Google Scholar · View at Scopus
  21. A. Picu and T. Spyropoulos, “DTN-Meteo: forecasting the performance of DTN protocols under heterogeneous mobility,” IEEE/ACM Transactions on Networking, vol. 23, no. 2, pp. 587–602, 2015. View at Publisher · View at Google Scholar · View at Scopus
  22. J. Leguay, T. Friedman, and V. Conan, “DTN routing in a mobility pattern space,” in Proceedings of the ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN '05), pp. 276–283, ACM, Philadelphia, Pa, USA, August 2005. View at Publisher · View at Google Scholar · View at Scopus
  23. L. Jeremie, T. Friedman, and V. Conan, “Evaluating mobility pattern space routing for dtns,” Article ID 0511102, 2005, https://arxiv.org/abs/cs/0511102.
  24. A. Balasubramanian, B. Levine, and A. Venkataramani, “DTN routing as a resource allocation problem,” in Proceedings of the ACM SIGCOMM 2007: Conference on Computer Communications, pp. 373–384, August 2007. View at Publisher · View at Google Scholar · View at Scopus
  25. R. Johari, N. Gupta, and S. Aneja, “POSOP routing algorithm: A DTN routing scheme for information connectivity of health centres in hilly state of North India,” International Journal of Distributed Sensor Networks, vol. 2015, Article ID 376861, 2015. View at Publisher · View at Google Scholar · View at Scopus
  26. T. Le, Y. Lu, and M. Gerla, “Social caching and content retrieval in Disruption Tolerant Networks (DTNs),” in Proceedings of the 2015 International Conference on Computing, Networking and Communications, ICNC 2015, pp. 905–910, February 2015. View at Publisher · View at Google Scholar · View at Scopus
  27. S. Zhang, J. Wu, Z. Qian, and S. Lu, “MobiCache: Cellular traffic offloading leveraging cooperative caching in mobile social networks,” Computer Networks, vol. 83, pp. 184–198, 2015. View at Publisher · View at Google Scholar · View at Scopus
  28. R. O. Cunha, A. P. Silva, A. A. F. Loreiro, and L. B. Ruiz, “Simulating large wireless sensor networks using cellular automata,” in Proceedings of the 38th Annual Simulation Symposium, ANSS-38, pp. 323–330, IEEE Computer Society, April 2005. View at Publisher · View at Google Scholar · View at Scopus
  29. S. Athanassopoulos, C. Kaklamanis, P. Katsikouli, and E. Papaioannou, “Cellular automata for topology control in wireless sensor networks,” in Proceedings of the 2012 16th IEEE Mediterranean Electrotechnical Conference, MELECON 2012, pp. 212–215, March 2012. View at Publisher · View at Google Scholar · View at Scopus
  30. S. Adabi, A. K. Zadeh, A. Dana, and S. Adabi, “Cellular automata based method for energy conservation solution in wireless sensor network,” in Proceedings of the 2008 International Conference on Wireless Communications, Networking and Mobile Computing, WiCOM 2008, October 2008. View at Publisher · View at Google Scholar · View at Scopus
  31. J. A. Torkestani and M. R. Meybodi, “Approximating the minimum connected dominating set in stochastic graphs based on learning automata,” in Proceedings of the 2009 International Conference on Information Management and Engineering, ICIME 2009, pp. 672–676, April 2009. View at Publisher · View at Google Scholar · View at Scopus
  32. H. Beigy and M. R. Meybodi, “Utilizing distributed learning automata to solve stochastic shortest path problems,” International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, vol. 14, no. 5, pp. 591–615, 2006. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. Y. P. Chen and A. L. Liestman, “Approximating minimum size weakly-connected dominating sets for clustering mobile ad hoc networks,” in Proceedings of the MOBIHOC 2002: PROCEEDINGS OF The Third ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 165–172, June 2002. View at Scopus
  34. M. Esnaashari and M. R. Meybodi, “A cellular learning automata based clustering algorithm for wireless sensor networks,” Sensor Letters, vol. 6, no. 5, pp. 723–735, 2008. View at Publisher · View at Google Scholar · View at Scopus
  35. M. Jahanshahi, M. R. Meybodi, and M. Dehghan, “Cellular learning automata based scheduling method for wireless sensor networks,” in Proceedings of the 2009 14th International CSI Computer Conference, CSICC 2009, pp. 646–651, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  36. A. H. F. Navid and H. H. S. Javadi, “ICLEAR: energy aware routing protocol for wsn using irregular cellular learning automata,” in Proceedings of the 2009 IEEE Symposium on Industrial Electronics and Applications, ISIEA 2009, pp. 463–468, October 2009. View at Publisher · View at Google Scholar · View at Scopus
  37. B. Hamid and M. Meybodi, Call Admission Control in Cellular Mobile Networks: A Learning Automata Approach, Springer, Berlin, Germany, 2002.
  38. B. Hamid and M. Meybodi, “An adaptive call admission algorithm for cellular networks,” Computers and Electrical Engineering, vol. 31, no. 2, pp. 132–151, March 2005. View at Google Scholar