Bibliografias temáticas / Wireless caching

Índice

Artigos de revistas
Teses / dissertações
Livros
Capítulos de livros
Trabalhos de conferências

Literatura científica selecionada sobre o tema "Wireless caching"

Autor: Grafiati

Publicado: 4 de junho de 2021

Última modificação: 3 de fevereiro de 2022

Crie uma referência precisa em APA, MLA, Chicago, Harvard, e outros estilos

Selecione um tipo de fonte:

Consulte a lista de atuais artigos, livros, teses, anais de congressos e outras fontes científicas relevantes para o tema "Wireless caching".

Ao lado de cada fonte na lista de referências, há um botão "Adicionar à bibliografia". Clique e geraremos automaticamente a citação bibliográfica do trabalho escolhido no estilo de citação de que você precisa: APA, MLA, Harvard, Chicago, Vancouver, etc.

Você também pode baixar o texto completo da publicação científica em formato .pdf e ler o resumo do trabalho online se estiver presente nos metadados.

Artigos de revistas sobre o assunto "Wireless caching"

Zhou, Mo, Bo Ji, Kun Peng Han e Hong Sheng Xi. "A Cooperative Hybrid Caching Strategy for P2P Mobile Network". Applied Mechanics and Materials 347-350 (agosto de 2013): 1992–96. http://dx.doi.org/10.4028/www.scientific.net/amm.347-350.1992.

Texto completo da fonte

Resumo:

Recently mobile network technologies develop quickly. To meet the increasing demand of wireless users, many multimedia proxies have been deployed over wireless networks. The caching nodes constitute a wireless caching system with an architecture of P2P and provide better service to mobile users. In this paper, we formulate the caching system to optimize the consumption of network bandwidth and guarantee the response time of mobile users. Two strategies: single greedy caching strategy and cooperative hybrid caching strategy are proposed to achieve this goal. Single greedy caching aims to reduce bandwidth consumption from the standpoint of each caching node, while cooperative hybrid caching allows sharing and coordination of multiple nodes, taking both bandwidth consumption and popularity into account. Simulation results show that cooperative hybrid caching outperforms single greedy caching in both bandwidth consumption and delay time.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Niesen, Urs, Devavrat Shah e Gregory W. Wornell. "Caching in Wireless Networks". IEEE Transactions on Information Theory 58, n.º 10 (outubro de 2012): 6524–40. http://dx.doi.org/10.1109/tit.2012.2205733.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Wang, James Z., Zhidian Du e Pradip K. Srimani. "Cooperative Proxy Caching for Wireless Base Stations". Mobile Information Systems 3, n.º 1 (2007): 1–18. http://dx.doi.org/10.1155/2007/371572.

Texto completo da fonte

Resumo:

This paper proposes a mobile cache model to facilitate the cooperative proxy caching in wireless base stations. This mobile cache model uses a network cache line to record the caching state information about a web document for effective data search and cache space management. Based on the proposed mobile cache model, a P2P cooperative proxy caching scheme is proposed to use a self-configured and self-managed virtual proxy graph (VPG), independent of the underlying wireless network structure and adaptive to the network and geographic environment changes, to achieve efficient data search, data cache and date replication. Based on demand, the aggregate effect of data caching, searching and replicating actions by individual proxy servers automatically migrates the cached web documents closer to the interested clients. In addition, a cache line migration (CLM) strategy is proposed to flow and replicate the heads of network cache lines of web documents associated with a moving mobile host to the new base station during the mobile host handoff. These replicated cache line heads provide direct links to the cached web documents accessed by the moving mobile hosts in the previous base station, thus improving the mobile web caching performance. Performance studies have shown that the proposed P2P cooperative proxy caching schemes significantly outperform existing caching schemes.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Li, Feng, Kwok-Yan Lam, Li Wang, Zhenyu Na, Xin Liu e Qing Pan. "Caching Efficiency Enhancement at Wireless Edges with Concerns on User’s Quality of Experience". Wireless Communications and Mobile Computing 2018 (2018): 1–10. http://dx.doi.org/10.1155/2018/1680641.

Texto completo da fonte

Resumo:

Content caching is a promising approach to enhancing bandwidth utilization and minimizing delivery delay for new-generation Internet applications. The design of content caching is based on the principles that popular contents are cached at appropriate network edges in order to reduce transmission delay and avoid backhaul bottleneck. In this paper, we propose a cooperative caching replacement and efficiency optimization scheme for IP-based wireless networks. Wireless edges are designed to establish a one-hop scope of caching information table for caching replacement in cases when there is not enough cache resource available within its own space. During the course, after receiving the caching request, every caching node should determine the weight of the required contents and provide a response according to the availability of its own caching space. Furthermore, to increase the caching efficiency from a practical perspective, we introduce the concept of quality of user experience (QoE) and try to properly allocate the cache resource of the whole networks to better satisfy user demands. Different caching allocation strategies are devised to be adopted to enhance user QoE in various circumstances. Numerical results are further provided to justify the performance improvement of our proposal from various aspects.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Zhao, Nan, Jun Li, Tao Han, Zheng Chang e Lisheng Fan. "Wireless Caching Aided 5G Networks". Wireless Communications and Mobile Computing 2018 (6 de junho de 2018): 1. http://dx.doi.org/10.1155/2018/8764289.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Chae, Seong Ho, e Wan Choi. "Caching Placement in Stochastic Wireless Caching Helper Networks: Channel Selection Diversity via Caching". IEEE Transactions on Wireless Communications 15, n.º 10 (outubro de 2016): 6626–37. http://dx.doi.org/10.1109/twc.2016.2586841.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Hao, Yixue, Min Chen, Donggang Cao, Wenlai Zhao, Ivan Petrov, Vitaly Antonenko e Ruslan Smeliansky. "Cognitive-Caching: Cognitive Wireless Mobile Caching by Learning Fine-Grained Caching-Aware Indicators". IEEE Wireless Communications 27, n.º 1 (fevereiro de 2020): 100–106. http://dx.doi.org/10.1109/mwc.001.1900273.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Li, Yi, Chen Zhong, M. Cenk Gursoy e Senem Velipasalar. "Learning-Based Delay-Aware Caching in Wireless D2D Caching Networks". IEEE Access 6 (2018): 77250–64. http://dx.doi.org/10.1109/access.2018.2881038.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Chen, Wei, e H. Vincent Poor. "Wireless Caching: Making Radio Access Networks More than Bit-Pipelines". Network 1, n.º 2 (16 de agosto de 2021): 146–64. http://dx.doi.org/10.3390/network1020010.

Texto completo da fonte

Resumo:

Caching has attracted much attention recently because it holds the promise of scaling the service capability of radio access networks (RANs). We envision that caching will ultimately make next-generation RANs more than bit-pipelines and emerge as a multi-disciplinary area via the union with communications, pricing, recommendation, compression, and computation units. By summarizing cutting-edge caching policies, we trace a common root of their gains to the prolonged transmission time, which is then traded for higher spectral or energy efficiency. To realize caching, the physical layer and higher layers have to function together, with the aid of prediction and memory units, which substantially broadens the concept of cross-layer design to a multi-unit collaboration methodology. We revisit caching from a generalized cross-layer perspective, with a focus on its emerging opportunities, challenges, and theoretical performance limits. To motivate the application and evolution of caching, we conceive a hierarchical pricing infrastructure that provides incentives to network operators and users. To make RANs even more proactive, we design caching and recommendation jointly, showing a user what it might be interested in and what has been done for it. Furthermore, the user-specific demand prediction motivates edge compression and proactive MEC as new applications. The beyond-bit-pipeline RAN is a paradigm shift that brings with it many cross-disciplinary research opportunities.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Poularakis, Konstantinos, e Leandros Tassiulas. "Cooperation and information replication in wireless networks". Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 374, n.º 2062 (6 de março de 2016): 20150123. http://dx.doi.org/10.1098/rsta.2015.0123.

Texto completo da fonte

Resumo:

A significant portion of today's network traffic is due to recurring downloads of a few popular contents. It has been observed that replicating the latter in caches installed at network edges—close to users—can drastically reduce network bandwidth usage and improve content access delay. Such caching architectures are gaining increasing interest in recent years as a way of dealing with the explosive traffic growth, fuelled further by the downward slope in storage space price. In this work, we provide an overview of caching with a particular emphasis on emerging network architectures that enable caching at the radio access network. In this context, novel challenges arise due to the broadcast nature of the wireless medium, which allows simultaneously serving multiple users tuned into a multicast stream, and the mobility of the users who may be frequently handed off from one cell tower to another. Existing results indicate that caching at the wireless edge has a great potential in removing bottlenecks on the wired backbone networks. Taking into consideration the schedule of multicast service and mobility profiles is crucial to extract maximum benefit in network performance.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Teses / dissertações sobre o assunto "Wireless caching"

Chupisanyarote, Sanpetch. "Content Caching in Opportunistic Wireless Networks". Thesis, KTH, Kommunikationsnät, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-91875.

Texto completo da fonte

Resumo:

Wireless networks have become popular in the last two decades and their use is since growing significantly. There is a concern that the existing resource of centralized networks may not sufficiently serve the enormous demand of customers. This thesis proposes one solution that has a potential to improve the network. We introduce decentralized networks particularly wireless ad-hoc networks, where users communicate and exchange information only with their neighbors. Thus, our main focus is to enhance the performance of data dissemination in wireless ad-hoc networks. In this thesis, we first examine a content distribution concept, in which nodes only focus on downloading and sharing the contents that are of their own interest. We call it private content and it is stored in a private cache. Then, we design and implement a relay-request caching strategy, where a node will generously help to fetch contents that another node asks for, although the contents are not of its interest. The node is not interested in these contents but fetches them on behalf of others; they are considered public contents. Thesepublic contents are stored in a public cache. We also propose three public caching options for optimizing network resources: relay request on demand, hop-limit, and greedy relay request. The proposed strategies are implemented in the OMNeT++ simulator and evaluated on mobility traces from Legion Studio. We also campare our novel caching strategy with an optimal channel choice strategy. The results are analyzed and they show that the use of public cache in the relay request strategy can enhance the performance marginally while overhead increases significantly.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Xu, Ji. "Data caching in wireless mobile networks /". View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?COMP%202004%20XU.

Texto completo da fonte

Resumo:

Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004.
Includes bibliographical references (leaves 57-60). Also available in electronic version. Access restricted to campus users.

Estilos ABNT, Harvard, Vancouver, APA, etc.

AlHassoun, Yousef. "TOWARDS EFFICIENT CODED CACHING FOR WIRELESS NETWORKS". The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1575632062797432.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Wang, Jerry Chun-Ping Computer Science &amp Engineering Faculty of Engineering UNSW. "Wireless network caching scheme for a cost saving wireless data access". Awarded by:University of New South Wales. School of Computer Science & Engineering, 2006. http://handle.unsw.edu.au/1959.4/25521.

Texto completo da fonte

Resumo:

Recent widespread use of computer and wireless communication technologies has increased the demand of data services via wireless channels. However, providing high data rate in wireless system is expensive due to many technical and physical limitations. Unlike voice service, data service can tolerate delays and allow burst transfer of information, thus, an alternative approach had to be formulated. This approach is known as ???Infostation.??? Infostation is an inexpensive, high speed wireless disseminator that features discontinuous coverage and high radio transmission rate by using many short-distance high bandwidth local wireless stations in a large terrain. As opposed to ubiquitous networks, each infostation provides independent wireless connectivity at relative shorter distance compare to traditional cellular network. However, due to the discontinuous nature of infostation network, there is no data service available between stations, and the clients become completely disconnected from the outside world. During, the disconnected period, the clients have to access information locally. Thus, the need for a good wireless network caching scheme has arisen. In this dissertation, we explore the use of the infostation model for disseminating and caching of data. Our initial approach focuses on large datasets that exhibit hierarchical structure. In order to facilitate information delivery, we exploit the hierarchical nature of the file structure, then propose generic content scheduling and cache management strategies for infostations. We examine the performance of our proposed strategies with the network simulator Qualnet. Our simulation results demonstrate the improvement in increasing the rate of successful data access, thus alleviating excessive waiting overheads during disconnected periods. Moreover, our technique allows infostations to be combined with traditional cellular networks and avoid accessing data via scarce and expensive wireless channel for the purpose of cost reduction.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Hui, Chui Ying. "Broadcast algorithms and caching strategies for mobile transaction processing". HKBU Institutional Repository, 2007. http://repository.hkbu.edu.hk/etd_ra/781.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Sengupta, Avik. "Fundamentals of Cache Aided Wireless Networks". Diss., Virginia Tech, 2016. http://hdl.handle.net/10919/73583.

Texto completo da fonte

Resumo:

Caching at the network edge has emerged as a viable solution for alleviating the severe capacity crunch in content-centric next generation 5G wireless networks by leveraging localized content storage and delivery. Caching generally works in two phases namely (i) storage phase where parts of popular content is pre-fetched and stored in caches at the network edge during time of low network load and (ii) delivery phase where content is distributed to users at times of high network load by leveraging the locally stored content. Cache-aided networks therefore have the potential to leverage storage at the network edge to increase bandwidth efficiency. In this dissertation we ask the following question - What are the theoretical and practical guarantees offered by cache aided networks for reliable content distribution while minimizing transmission rates and increasing network efficiency? We furnish an answer to this question by identifying fundamental Shannon-type limits for cache aided systems. To this end, we first consider a cache-aided network where the cache storage phase is assisted by a central server and users can demand multiple files at each transmission interval. To service these demands, we consider two delivery models - (i) centralized content delivery where demands are serviced by the central server; and (ii) device-to-device-assisted distributed delivery where demands are satisfied by leveraging the collective content of user caches. For such cache aided networks, we develop a new technique for characterizing information theoretic lower bounds on the fundamental storage-rate trade-off. Furthermore, using the new lower bounds, we establish the optimal storage-rate trade-off to within a constant multiplicative gap and show that, for the case of multiple demands per user, treating each set of demands independently is order-optimal. To address the concerns of privacy in multicast content delivery over such cache-aided networks, we introduce the problem of caching with secure delivery. We propose schemes which achieve information theoretic security in cache-aided networks and show that the achievable rate is within a constant multiplicative factor of the information theoretic optimal secure rate. We then extend our theoretical analysis to the wireless domain by studying a cloud and cache-aided wireless network from a perspective of low-latency content distribution. To this end, we define a new performance metric namely normalized delivery time, or NDT, which captures the worst-case delivery latency. We propose achievable schemes with an aim to minimize the NDT and derive information theoretic lower bounds which show that the proposed schemes achieve optimality to within a constant multiplicative factor of 2 for all values of problem parameters. Finally, we consider the problem of caching and content distribution in a multi-small-cell heterogeneous network from a reinforcement learning perspective for the case when the popularity of content is unknown. We propose a novel topology-aware learning-aided collaborative caching algorithm and show that collaboration among multiple small cells for cache-aided content delivery outperforms local caching in most network topologies of practical interest. The results presented in this dissertation show definitively that cache-aided systems help in appreciable increase of network efficiency and are a viable solution for the ever evolving capacity demands in the wireless communications landscape.
Ph. D.

Estilos ABNT, Harvard, Vancouver, APA, etc.

Hosny, Sameh Shawky Ibrahim. "MOBILITY AND CONTENT TRADING IN DEVICE-TO-DEVICE CACHING NETWORKS". The Ohio State University, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=osu1480629254438794.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Ghorbel, Asma. "Limites Fondamentales De Stockage Dans Les Réseaux Sans Fil". Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC031/document.

Texto completo da fonte

Resumo:

Le stockage de contenu populaire dans des caches disponibles aux utilisateurs, est une technique émergente qui permet de réduire le trafic dans les réseaux sans fil. En particulier, le coded caching proposée par Maddah-Ali et Niesen a été considéré comme une approche prometteuse pour atteindre un temps de livraison constant au fur et à mesure que la dimension augmente. Toutefois, plusieurs limitations empêchent ses applications. Nous avons adressé les limitations de coded caching dans les réseaux sans fil et avons proposé des schémas de livraison qui exploitent le gain de coded caching. Dans la première partie de la thèse, nous étudions la région de capacité pour un canal à effacement avec cache et retour d'information. Nous proposons un schéma et prouvons son optimalité pour des cas particuliers. Ces résultats sontgénéralisés pour le canal à diffusion avec desantennes multiples et retour d'information. Dans la deuxième partie, nous étudions la livraison de contenu sur un canal d'atténuation asymétrique, où la qualité du canal varie à travers les utilisateurs et le temps. En supposant que les demandes des utilisateurs arrivent de manière dynamique, nous concevons un schéma basé sur une structure de queues et nous prouvons qu’il maximise la fonction d'utilité par rapport à tous les schémas limités au cache décentralisé. Dans la dernière partie, nous étudions la planification opportuniste pour un canal d'atténuation asymétrique, en assurant une métrique de justice entre des utilisateurs. Nous proposons une politique de planification simple à base de seuil avec une complexité linéaire et qui exige seulement un bit de retour de chaque utilisateur
Caching, i.e. storing popular contents at caches available at end users, has received a significant interest as a technique to reduce the peak traffic in wireless networks. In particular, coded caching proposed by Maddah-Ali and Niesen has been considered as a promising approach to achieve a constant delivery time as the dimension grows. However, several limitations prevent its applications in practical wireless systems. Throughout the thesis, we address the limitations of classical coded caching in various wireless channels. Then, we propose novel delivery schemes that exploit opportunistically the underlying wireless channels while preserving partly the promising gain of coded caching. In the first part of the thesis, we study the achievable rate region of the erasure broadcast channel with cache and state feedback. We propose an achievable schemeand prove its optimality for special cases of interest. These results are generalized to the multi-antenna broadcast channel with state feedback. In the second part, we study the content delivery over asymmetric block-fading broadcast channels, where the channel quality varies across users and time. Assuming that user requests arrive dynamically, we design an online scheme based on queuing structure and prove that it maximizes the alpha-fair utility among all schemes restricted to decentralized placement. In the last part, we study opportunistic scheduling over the asymmetric fading broadcast channel and aim to design a scalable delivery scheme while ensuring fairness among users. We propose a simple threshold-based scheduling policy of linear complexity that requires only a one-bit feedback from each user

Estilos ABNT, Harvard, Vancouver, APA, etc.

Bayat, Mozhgan [Verfasser], Giuseppe [Akademischer Betreuer] Caire, Giuseppe [Gutachter] Caire, Olav [Gutachter] Tirkkonen e Mari [Gutachter] Kobayashi. "Coded caching over realistic and scalable wireless networks / Mozhgan Bayat ; Gutachter: Giuseppe Caire, Olav Tirkkonen, Mari Kobayashi ; Betreuer: Giuseppe Caire". Berlin : Technische Universität Berlin, 2020. http://d-nb.info/1223981703/34.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

ElAzzouni, Sherif. "Algorithm Design for Low Latency Communication in Wireless Networks". The Ohio State University, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=osu1587049831134061.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Mais fontes

Livros sobre o assunto "Wireless caching"

Vu, Thang X., Ejder Baştuğ, Symeon Chatzinotas e Tony Q. S. Quek, eds. Wireless Edge Caching. Cambridge University Press, 2020. http://dx.doi.org/10.1017/9781108691277.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Chatzinotas, Symeon, Tony Q. S. Quek, Thang X. Vu e Ejder Baştuğ. Wireless Edge Caching: Modeling, Analysis, and Optimization. Cambridge University Press, 2020.

Encontre o texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Capítulos de livros sobre o assunto "Wireless caching"

Hu, Zhiwen, Zijie Zheng e Lingyang Song. "Wireless Edge Caching". In Encyclopedia of Wireless Networks, 1481–83. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-78262-1_53.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Hu, Zhiwen, Zijie Zheng e Lingyang Song. "Wireless Edge Caching". In Encyclopedia of Wireless Networks, 1–4. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-32903-1_53-1.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Su, Zhou, Yilong Hui, Tom H. Luan, Qiaorong Liu e Rui Xing. "Contract Based Edge Caching in Vehicular Networks". In Wireless Networks, 49–67. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-56827-6_3.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Peng, Mugen, Zhongyuan Zhao e Yaohua Sun. "Content Caching in Fog Radio Access Networks". In Wireless Networks, 133–52. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-50735-0_7.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Li, Xiuhua, Xiaofei Wang e Victor C. M. Leung. "Mobile Edge Caching in HetNets". In Encyclopedia of Wireless Networks, 868–73. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-78262-1_46.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Li, Xiuhua, Xiaofei Wang e Victor C. M. Leung. "Mobile Edge Caching in HetNets". In Encyclopedia of Wireless Networks, 1–5. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-32903-1_46-1.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Chen, Min, Yiming Miao e Iztok Humar. "Simulation of Wireless Network Caching". In OPNET IoT Simulation, 631–74. Singapore: Springer Singapore, 2019. http://dx.doi.org/10.1007/978-981-32-9170-6_11.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Wang, Chenmeng, e Richard Fei Yu. "Integrated System of Networking, Caching, and Computing". In Encyclopedia of Wireless Networks, 625–29. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-319-78262-1_124.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Wang, Chenmeng, e F. Richard Yu. "Integrated System of Networking, Caching, and Computing". In Encyclopedia of Wireless Networks, 1–5. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-32903-1_124-1.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Han, Zhu, Yunan Gu e Walid Saad. "College Admissions Model for Facebook Content Caching". In Matching Theory for Wireless Networks, 51–62. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-56252-0_5.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Trabalhos de conferências sobre o assunto "Wireless caching"

Chae, Seong Ho, e Wan Choi. "Optimal probabilistic caching with wireless caching helpers". In 2016 IEEE 17th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC). IEEE, 2016. http://dx.doi.org/10.1109/spawc.2016.7536891.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Khoshkholgh, M. G., Keivan Navaie, Kang G. Shin, V. C. M. Leung e Halim Yanikomeroglu. "Caching or No Caching in Dense HetNets?" In 2019 IEEE Wireless Communications and Networking Conference (WCNC). IEEE, 2019. http://dx.doi.org/10.1109/wcnc.2019.8885724.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Niesen, Urs, Devavrat Shah e Gregory Wornell. "Caching in wireless networks". In 2009 IEEE International Symposium on Information Theory - ISIT. IEEE, 2009. http://dx.doi.org/10.1109/isit.2009.5205255.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Karmoose, Mohammed, Martina Cardone e Christina Fragouli. "Simplifying wireless social caching". In 2016 IEEE International Symposium on Information Theory (ISIT). IEEE, 2016. http://dx.doi.org/10.1109/isit.2016.7541331.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Gu, Chaoyu, Jian Xiong, Haonan Xie e Peng Cheng. "Wireless Cooperative Caching System". In 2019 IEEE Visual Communications and Image Processing (VCIP). IEEE, 2019. http://dx.doi.org/10.1109/vcip47243.2019.8965684.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Rao, Jun, Hao Feng, Chenchen Yang, Zhiyong Chen e Bin Xia. "Optimal caching placement for D2D assisted wireless caching networks". In ICC 2016 - 2016 IEEE International Conference on Communications. IEEE, 2016. http://dx.doi.org/10.1109/icc.2016.7511410.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Shi, Long, Kui Cai, Tao Yang e Taotao Wang. "Linear Network Coded Wireless Caching". In 2018 IEEE International Conference on Communications Workshops (ICC Workshops). IEEE, 2018. http://dx.doi.org/10.1109/iccw.2018.8403706.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Le, Franck, Mudhakar Srivatsa e Arun K. Iyengar. "Byte Caching in Wireless Networks". In 2012 IEEE 32nd International Conference on Distributed Computing Systems (ICDCS). IEEE, 2012. http://dx.doi.org/10.1109/icdcs.2012.39.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Xiaoning Huang, Guodong Zhao e Zhi Chen. "Segment-based random caching in device-to-device (D2D) caching networks". In 2015 International Symposium on Wireless Communication Systems. IEEE, 2015. http://dx.doi.org/10.1109/iswcs.2015.7454446.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Li, Yi, M. Cenk Gursoy e Senem Velipasalar. "A delay-aware caching algorithm for wireless D2D caching networks". In 2017 IEEE Conference on Computer Communications: Workshops (INFOCOM WKSHPS). IEEE, 2017. http://dx.doi.org/10.1109/infcomw.2017.8116419.

Texto completo da fonte

Estilos ABNT, Harvard, Vancouver, APA, etc.

Oferecemos descontos em todos os planos premium para autores cujas obras estão incluídas em seleções literárias temáticas. Contate-nos para obter um código promocional único!