Relevant bibliographies by topics / Delay-tolerant networks caching

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Conference papers

Academic literature on the topic 'Delay-tolerant networks caching'

Author: Grafiati
Published: 10 September 2021
Last updated: 17 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Delay-tolerant networks caching.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Delay-tolerant networks caching"

1

Ma, Zhenjie, Haoran Wang, Ke Shi, and Xinda Wang. "Learning Automata Based Caching for Efficient Data Access in Delay Tolerant Networks." Wireless Communications and Mobile Computing 2018 (2018): 1–19. http://dx.doi.org/10.1155/2018/3806907.

Full text
Abstract:
Effective data access is one of the major challenges in Delay Tolerant Networks (DTNs) that are characterized by intermittent network connectivity and unpredictable node mobility. Currently, different data caching schemes have been proposed to improve the performance of data access in DTNs. However, most existing data caching schemes perform poorly due to the lack of global network state information and the changing network topology in DTNs. In this paper, we propose a novel data caching scheme based on cooperative caching in DTNs, aiming at improving the successful rate of data access and reducing the data access delay. In the proposed scheme, learning automata are utilized to select a set of caching nodes as Caching Node Set (CNS) in DTNs. Unlike the existing caching schemes failing to address the challenging characteristics of DTNs, our scheme is designed to automatically self-adjust to the changing network topology through the well-designed voting and updating processes. The proposed scheme improves the overall performance of data access in DTNs compared with the former caching schemes. The simulations verify the feasibility of our scheme and the improvements in performance.
APA, Harvard, Vancouver, ISO, and other styles
2

Ye, Hui, Zhi Gang Chen, and Xiao Jian Shen. "A Data Cooperative Caching Policy Using Human Mobile Patterns for Delay Tolerant Networks." Advanced Materials Research 171-172 (December 2010): 561–64. http://dx.doi.org/10.4028/www.scientific.net/amr.171-172.561.

Full text
Abstract:
Recently, many researchers focus on delay tolerant networks (DTN). In DTN, the mobile characteristic of nodes is used to help transfer data. Therefore, how to use the cooperative relations and cache resource of nodes effectively to avoid network congestion and improve network performance is an important issue. In this paper, we proposed a cooperative caching policy based on human mobile patterns, which referred as HMP-Cache. The node movement characteristics are discussed in detail in HMP-Cache. HMP-Cache uses the standard of target address matching to choose cooperative caching nodes. In addition, the sharing caching information is done by synchronization of caching table in local region. Therefore, the impact of useless data dissemination of multiple hops is reduced. And the shortcoming of limited caching resources is compensated. The simulation results show that our policy can control the network cost effectively. Also, the remote data latency is reduced.
APA, Harvard, Vancouver, ISO, and other styles
3

Josephin, J. S. Femilda, U. V. Arivazhagu, and U. V. Anbazhagu. "Social Network Routing with Caching in Delay Tolerant Wireless Sensor Networks." Journal of Computational and Theoretical Nanoscience 15, no. 6 (2018): 2046–49. http://dx.doi.org/10.1166/jctn.2018.7404.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Silva, Bruno M. C., Vasco N. G. J. Soares, and Joel J. P. C. Rodrigues. "Towards Intelligent Caching and Retrieval Mechanisms for Upcoming Proposals on Vehicular Delay-Tolerant Networks." Journal of Communications Software and Systems 7, no. 1 (2011): 1. http://dx.doi.org/10.24138/jcomss.v7i1.181.

Full text
Abstract:
Vehicular delay-tolerant networks (VDTNs) are opportunistic networks that enable connectivity in challenged scenarios with unstable links where end-to-end communications may not exist. VDTN architecture handles non-real timeapplications using vehicles to relay messages between network nodes. To address the problem of intermittent connectivity, network nodes store messages on their buffers, carrying them through the network while waiting for transfer opportunities. The storage capacity of the nodes affects directly the network performance. Therefore, it is important to incorporate suitable network protocols using self-contained messages to improve communication that supports store-carry-and-forward operation procedures. Clearly, such procedures motivate content cachingand retrieval. This paper surveys the state-of-the art on intelligent caching and retrieval mechanisms focusing on ad-hoc and delay tolerant networks (DTN). These approaches can offer important insights for upcoming proposals on intelligent caching and retrieval mechanisms for VDTNs.
APA, Harvard, Vancouver, ISO, and other styles
5

Ezzahidi, Sidi Ahmed, Essaid Sabir, Sara Koulali, and El-Houssine Bouyakhf. "Robust fully distributed file caching for delay-tolerant networks: A reward-based incentive mechanism." International Journal of Distributed Sensor Networks 13, no. 4 (2017): 155014771770014. http://dx.doi.org/10.1177/1550147717700149.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Guomin, Lihua Song, Haitao Wang, Chao Hu, and Na Wang. "Location-assistant content distribution scheme for emergency rescue." International Journal of Distributed Sensor Networks 14, no. 9 (2018): 155014771880046. http://dx.doi.org/10.1177/1550147718800464.

Full text
Abstract:
In order to optimize the timeliness and pertinence of message delivery in emergency rescue scenarios and improve the service performance of emergency communications network, we propose a location-assistant content distribution scheme based on delay tolerant network. First of all, considering that the movement patterns of rescue teams tend to follow a predetermined course of action, we design a location-based group mobility model. Due to the intermittent network connectivity and variety of emergency service, a content-classification-based publish/subscribe architecture and a GenericSpray routing algorithm based on the prediction of overlap opportunity in spatio-temporal positions are proposed. Furthermore, we also give a cache management strategy based on the content significance. Since location-assistant content distribution scheme can predict the overlap of activity between rescue teams through the course of action, not only can the number of copy forwarding and message delivery delays be significantly reduced but also the priority delivery of important messages can be ensured by message classification. Simulation experiments show that compared with the traditional delay tolerant network routing algorithm and the classic first-in-first-out caching strategy, location-assistant content distribution scheme improves the performance of message delivery rate, transmission delay, and control overhead significantly.
APA, Harvard, Vancouver, ISO, and other styles
7

D, Bhuvana Suganthi, R. Manjunath, A. Punitha, and Raghupathi.S. "Improved Caching and Trust based Reliable Mobile Communication in Distributed Environment." International Journal of Engineering and Advanced Technology (IJEAT) 9, no. 3 (2020): 612–19. https://doi.org/10.35940/ijeat.C5318.029320.

Full text
Abstract:
This work is to overcome the data confidentiality issue and lack of security due to possibility of unstable connections, inflexibility in transmission rate in a distributed environment. This work is carried in three stages. Firstly, the secure path is identified based on energy, link quality, and delay towards the destination node. The quality of the link is considered due to the node mobility in the mobile network. Secondly, in the identified secured path, the next algorithm called Distributed Caching and Fault-tolerant Communication (DCFC) protocol is employed to monitor the failure occurring on routing tree and initiates failure recovery technique which is suitable for increasing the data transmission rate with very less failure Thirdly, Trusted Security Policy based Routing Algorithm (TSPRA) is implemented to overcome the packet drops and increased overhead due to lack of security which proves that data are well secured due to specific access control policies and increasing the high secured data size. Henceforth the level of security is increased with respect to reliability, recovery, confidentiality, and integrity. Reliability is proved based on the linking of all the possible positive factors of the distributed mobile communication in a single system. This performance leads to enhancement of productivity, personal safety and ability to protect their way to public service in terms of communication through wireless networks in a distributed environment
APA, Harvard, Vancouver, ISO, and other styles
8

Magaia, Naercio, Zhengguo Sheng, Paulo Rogerio Pereira, and Miguel Correia. "REPSYS: A Robust and Distributed Incentive Scheme for Collaborative Caching and Dissemination in Content-Centric Cellular-Based Vehicular Delay-Tolerant Networks." IEEE Wireless Communications 25, no. 3 (2018): 65–71. http://dx.doi.org/10.1109/mwc.2018.1700284.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

"Improved Caching and Trust based Reliable Mobile Communication in Distributed Environment." International Journal of Engineering and Advanced Technology 9, no. 3 (2020): 612–19. http://dx.doi.org/10.35940/ijeat.c5318.029320.

Full text
Abstract:
This work is to overcome the data confidentiality issue and lack of security due to possibility of unstable connections, inflexibility in transmission rate in a distributed environment. This work is carried in three stages. Firstly, the secure path is identified based on energy, link quality, and delay towards the destination node. The quality of the link is considered due to the node mobility in the mobile network. Secondly, in the identified secured path, the next algorithm called Distributed Caching and Fault-tolerant Communication (DCFC) protocol is employed to monitor the failure occurring on routing tree and initiates failure recovery technique which is suitable for increasing the data transmission rate with very less failure Thirdly, Trusted Security Policy based Routing Algorithm (TSPRA) is implemented to overcome the packet drops and increased overhead due to lack of security which proves that data are well secured due to specific access control policies and increasing the high secured data size. Henceforth the level of security is increased with respect to reliability, recovery, confidentiality, and integrity. Reliability is proved based on the linking of all the possible positive factors of the distributed mobile communication in a single system. This performance leads to enhancement of productivity, personal safety and ability to protect their way to public service in terms of communication through wireless networks in a distributed environment
APA, Harvard, Vancouver, ISO, and other styles
10

A., Detti, Tassetto D., Blefari-Melazzi N., and Fedi F. "Exploiting content centric networking to develop topic-based, publish–subscribe MANET systems." August 22, 2014. https://doi.org/10.1016/j.adhoc.2014.07.020.

Full text
Abstract:
Mobile Ad-hoc NETworks (MANETs) connect mobile wireless devices without an underlying communication infrastructure. Communications occur in a multi-hop fashion, using mobile devices as routers. Several MANET distributed applications require to exchange data (GPS position, messages, pictures, etc.) by using a topic-based publish–subscribe interaction. Participants of these applications can publish information items on a given topic (identified by a name) and can subscribe to a topic to receive the related published information. An efficient dissemination of publish–subscribe data in MANET environments demands for robust systems, able to face radio resource scarcity, network partitioning, frequent topology changes. Many MANET publish–subscribe systems have been proposed so far in the literature assuming an underlying TCP/IP network. In this paper, we discuss the benefits of building a MANET publish–subscribe system exploiting Content Centric Networking (CCN) technology, rather than TCP/IP. We show how CCN functionality, such as in-network caching and multicasting can be used to achieve an efficient and reliable data dissemination in MANET environments, including the support of delay tolerant delivery. We present different design approaches, describe our topic-based publish–subscribe CCN system, and report the results of a performance evaluation study carried out with real software in an emulated environment. The emulation environment is based on Linux virtual machines. The performance evaluation required also a CCN MANET routing engine, which we developed as a plug-in of the OLSR Linux daemon.
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Delay-tolerant networks caching"

1

Silva, Bruno Miguel Correia. "Content storage and retrieval mechanisms for vehicular delay-tolerant networks." Master's thesis, 2010. http://hdl.handle.net/10400.6/3725.

Full text
Abstract:
Vehicular delay-tolerant networks (VDTNs) were proposed as a novel disruptive network concept based on the delay tolerant networking (DTN) paradigm. VDTN architecture uses vehicles to relay messages, enabling network connectivity in challenging scenarios. Due to intermittent connectivity, network nodes carry messages in their buffers, relaying them only when a proper contact opportunity occurs. Thus, the storage capacity and message retrieving of intermediate nodes directly affects the network performance. Therefore, efficient and robust caching and forwarding mechanisms are needed. This dissertation proposes a content storage and retrieval (CSR) solution for VDTN networks. This solution consists on storage and retrieval control labels, attached to every data bundle of aggregated network traffic. These labels define cacheable contents, and apply cachecontrol and forwarding restrictions on data bundles. The presented mechanisms gathered several contributions from cache based technologies such as Web cache schemes, ad-hoc and DTN networks. This solution is fully automated, providing a fast, safe, and reliable data transfer and storage management, while improves the applicability and performance of VDTN networks significantly. This work presents the performance evaluation and validation of CSR mechanisms through a VDTN testbed. Furthermore it presents several network performance evaluations and results using the well-known DTN routing protocols, Epidemic and Spray and Wait (including its binary variant). The comparison of the network behavior and performance on both protocols, with and without CSR mechanisms, proves that CSR mechanisms improve significantly the overall network performance.
APA, Harvard, Vancouver, ISO, and other styles
2

Ciao-LingLou and 羅巧伶. "Cluster-based Roadside Unit Caching for Content Distribution in Vehicular Delay-Tolerant Networks." Thesis, 2018. http://ndltd.ncl.edu.tw/handle/zdbun4.

Full text
Abstract:
碩士<br>國立成功大學<br>電腦與通信工程研究所<br>106<br>As vehicular ad-hoc networks (VANETs) have become more popular and attracted recently, a large number of vehicles thirst for utilizing the information efficiently in the networks. Due to this, vehicles receive data from available Roadside Units(RSUs) across the road. Since RSUs act as routers to connect with the world outside, they have high-capacity storage where popular data is stored. If the storage keep the target data of these vehicles, they are allowed to download it, when they move across the service area. However, RSUs have limited communication range and the vehicles usually move at a high speed across the coverage of RSUs. Consequently, RSUs have limited time to send the data to vehicles. To optimize the situation, RSUs have to distribute data to maximize the amount of downloaded data to vehicles. There are many algorithms proposed in the past to distribute data to RSUs. In this thesis, we propose two methods of clustering RSUs to allocate the popular data. The first is based on vehicle travel time, and the second is according to whether the probability of vehicles passing through the next RSU is beyond the certain threshold or not. These two methods solve content delivery problems effectively in VANETs by caching popular data in RSUs. The main purpose is to maximize the total amount of downloaded data, and minimize the cost of downloading the remaining data whose deadline is about to expire from the cellular transaction. This scheme has performed better in dense network and fitted in urban scenario.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Delay-tolerant networks caching"

1

Mardham, Dileep, Sanjay Madria, James Milligan, and Mark Linderman. "Opportunistic distributed caching for mission-oriented delay-tolerant networks." In 2018 14th Annual Conference on Wireless On-demand Network Systems and Services (WONS). IEEE, 2018. http://dx.doi.org/10.23919/wons.2018.8311656.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Henriksson, Dan, Tarek F. Abdelzaher, and Raghu K. Ganti. "A Caching-Based Approach to Routing in Delay-Tolerant Networks." In 2007 16th International Conference on Computer Communications and Networks. IEEE, 2007. http://dx.doi.org/10.1109/icccn.2007.4317799.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

El Ouadrhiri, Ahmed, Khalid Rahhali, Mohamed El Kamili, and Mohammed Abbad. "Optimal content caching for epidemic routing in Delay Tolerant Networks." In 2016 International Conference on Wireless Networks and Mobile Communications (WINCOM). IEEE, 2016. http://dx.doi.org/10.1109/wincom.2016.7777217.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rahmouni, Imane, Sidi Ahmed Ezzahidi, Ahmed El Ouadrhiri, Mohamed El Kamili, and Essaid Sabir. "A hierarchical caching game for message relaying in delay tolerant networks." In 2016 9th IFIP Wireless and Mobile Networking Conference (WMNC). IEEE, 2016. http://dx.doi.org/10.1109/wmnc.2016.7543978.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Silva, Bruno M., Farid Farahmand, and Joel J. P. C. Rodrigues. "Performance Assessment of Caching and Forwarding Algorithms for Vehicular Delay Tolerant Networks." In GLOBECOM 2010 - 2010 IEEE Global Communications Conference. IEEE, 2010. http://dx.doi.org/10.1109/glocom.2010.5683857.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Ezzahidi, Sidi Ahmed, Essaid Sabir, and El-Houssine Bouyakhf. "A reward-based incentive mechanism for file caching in delay tolerant networks." In NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium. IEEE, 2016. http://dx.doi.org/10.1109/noms.2016.7502916.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Oualhaj, Omar Ait, Essaid Sabir, Abdellatif Kobbane, Jalel Ben-Othman, and Mohammed El Koutbi. "A college admissions game for content caching in heterogeneous delay tolerant networks." In 2016 23rd International Conference on Telecommunications (ICT). IEEE, 2016. http://dx.doi.org/10.1109/ict.2016.7500348.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Li, Meng, F. Richard Yu, Pengbo Si, Haipeng Yao, and Yanhua Zhang. "Software-Defined Vehicular Networks with Caching and Computing for Delay-Tolerant Data Traffic." In 2018 IEEE International Conference on Communications (ICC 2018). IEEE, 2018. http://dx.doi.org/10.1109/icc.2018.8422823.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Ezzahidi, Sidi Ahmed, Essaid Sabir, Mohamed El Kamili, and El-Houssine Bouyakhf. "A non-cooperative file caching for delay tolerant networks: A reward-based incentive mechanism." In 2016 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2016. http://dx.doi.org/10.1109/wcnc.2016.7565161.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ait Oualhaj, Omar, Abdellatif Kobbane, Mouna Elmachkour, Essaid Sabir, and Jalel Ben-Othman. "A coalitional-game-based incentive mechanism for content caching in heterogeneous Delay Tolerant Networks." In 2015 International Wireless Communications and Mobile Computing Conference (IWCMC). IEEE, 2015. http://dx.doi.org/10.1109/iwcmc.2015.7289217.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography