Contact duration aware cache refreshing for mobile opportunistic networks-Reference-Cited by-同舟云学术

Contact duration aware cache refreshing for mobile opportunistic networks

Published:2016-07 Issue:4 Volume:5 Page:93-103
ISSN:2047-4954
Container-title:IET Networks
language:en
Short-container-title:IET Networks

Author:

Wang Fang¹,Wang Zhaocheng¹,Yang Zhixing¹,Chen Sheng²³

Affiliation:

1. Department of Electronic Engineering, Tsinghua National Laboratory for Information Science and TechnologyTsinghua UniversityBeijing100084People's Republic of China

2. Electronics and Computer ScienceUniversity of SouthamptonSouthamptonSO17 1BJUK

3. Faculty of EngineeringKing Abdulaziz UniversityJeddah21589Saudi Arabia

Publisher

Institution of Engineering and Technology (IET)

Subject

Control and Optimization,Management Science and Operations Research,Computer Networks and Communications

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1049/iet-net.2015.0086

Reference33 articles.

1. Evaluating the Impact of Social Selfishness on the Epidemic Routing in Delay Tolerant Networks

2. Gao W. Cao G.: ‘User‐centric data dissemination in disruption tolerant networks’.Proc. 2011 IEEE INFOCOM Shanghai China April2011 pp.3119–3127

3. Energy-Efficient Optimal Opportunistic Forwarding for Delay-Tolerant Networks

4. Yoneki E. Hui P. Chan S.et al: ‘A socio‐aware overlay for publish/subscribe communication in delay tolerant networks’.Proc. 10th MSWIM Chania Crete Island Greece October2007 pp.225–234

5. Li F. Wu J.: ‘MOPS: Providing content‐based service in disruption‐tolerant networks’.Proc. 29th IEEE ICDCS Montreal Quebec Canada June2009 pp.526–533

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mobility-Aware Edge Caching for Minimizing Latency in Vehicular Networks;IEEE Open Journal of Vehicular Technology;2022

2. Delay‐aware and cost‐efficient probabilistic transmission for opportunistic networks;IET Networks;2020-11

3. A Comprehensive Survey on Mobility-Aware D2D Communications: Principles, Practice and Challenges;IEEE Communications Surveys & Tutorials;2020

4. Polynomial-Time Algorithms for Path Movement Problems on Trees and Unicyclic Graphs;J INTERNET TECHNOL;2019

5. Disjoint Multipath Based Secure Routing in Opportunistic Networks;J INTERNET TECHNOL;2019