The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Fundamental Limits of Caching in Wireless D2D Networks
Open accessAbstract
We consider a wireless device-to-device (D2D) network where communication is restricted to be single-hop. Users make arbitrary requests from a finite library of files and have pre-cached information on their devices, subject to a per-node storage capacity constraint. A similar problem has already been considered in an infrastructure setting, where all users receive a common multicast (coded) message from a single omniscient server (e.g., a base station having all the files in the library) through a shared bottleneck link. In this paper, we consider a D2D infrastructureless version of the problem. We propose a caching strategy based on deterministic assignment of subpackets of the library files, and a coded delivery strategy where the users send linearly coded messages to each other in order to collectively satisfy their demands. We also consider a random caching strategy, which is more suitable to a fully decentralized implementation. Under certain conditions, both approaches can achieve the information theoretic outer bound within a constant multiplicative factor. In our previous work, we showed that a caching D2D wireless network with one-hop communication, random caching, and uncoded delivery (direct file transmissions) achieves the same throughput scaling law of the infrastructure-based coded multicasting scheme, in the regime of large number of users and files in the library. This shows that the spatial reuse gain of the D2D network is order-equivalent to the coded multicasting gain of single base station transmission. It is, therefore, natural to ask whether these two gains are cumulative, i.e., if a D2D network with both local communication (spatial reuse) and coded multicasting can provide an improved scaling law. Somewhat counterintuitively, we show that these gains do not cumulate (in terms of throughput scaling law). This fact can be explained by noticing that the coded delivery scheme creates messages that are useful to multiple nodes, such that it benefits from broadcasting to as many nodes as possible, while spatial reuse capitalizes on the fact that the communication is local, such that the same time slot can be reused in space across the network. Unfortunately, these two issues are in contrast with each other.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The capacity of wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.825799 · Cited by 8,292
A Random Linear Network Coding Approach to Multicast
Ho, T., Medard, M., Koetter, R., Karger, D. R., Effros, M., Shi, J., & Leong, B. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881746 · Cited by 2,553
Millimeter Wave Channel Modeling and Cellular Capacity Evaluation
Akdeniz, M. R., Liu, Y., Samimi, M. K., Sun, S., Rangan, S., Rappaport, T. S., & Erkip, E. (2014) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2014.2328154 · Cited by 2,476
Millimeter-Wave Cellular Wireless Networks: Potentials and Challenges
Rangan, S., Rappaport, T. S., & Erkip, E. (2014) · Proceedings of the IEEE · doi:10.1109/jproc.2014.2299397 · Cited by 2,428
Shokrollahi, A. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.874390 · Cited by 2,154
Device-to-device communication as an underlay to LTE-advanced networks
Doppler, K., Rinne, M., Wijting, C., Ribeiro, C., & Hugl, K. (2009) · IEEE Communications Magazine · doi:10.1109/mcom.2009.5350367 · Cited by 1,903
Concentration Inequalities: A Nonasymptotic Theory of Independence
Boucheron, S., Lugosi, G., & Massart, P. (2013) · doi:10.1093/acprof:oso/9780199535255.001.0001 · Cited by 1,768
Maddah-Ali, M. A., & Niesen, U. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2306938 · Cited by 1,726 · cited 8×
“Before proceeding in the presentation of our results, we would like to make a few remarks to clarify obvious questions and anticipate possible concerns that this line of work (see for example [2], [3], [5]–[8], [10], [21]–[32]) may raise.”
BackgroundMethodInfluentialCostello, D. J., & Shu, L. (2004) · Cited by 1,564
Shokrollahi, A. (2007) · Cited by 1,256
FemtoCaching: Wireless Content Delivery Through Distributed Caching Helpers
Shanmugam, K., Golrezaei, N., Dimakis, A. G., Molisch, A. F., & Caire, G. (2013) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2281606 · Cited by 1,246
Self-citationWireless Communications: Is the Future Playing Out as Predicted?
Webb, W. (2011) · Interdisciplinary and Multidimensional Perspectives in Telecommunications and Networking · doi:10.4018/978-1-60960-505-6.ch002 · Cited by 931
Rappaport, T. S., Gutierrez, F., Ben-Dor, E., Murdock, J. N., Qiao, Y., & Tamir, J. I. (2013) · IEEE Transactions on Antennas and Propagation · doi:10.1109/tap.2012.2235056 · Cited by 828
The Akamai network: a platform for high-performance internet applications
Nygren, E., Sitaraman, R. K., & Sun, J. (2010) · ACM SIGOPS Operating Systems Review · doi:10.1145/1842733.1842736 · Cited by 726
FemtoCaching: Wireless video content delivery through distributed caching helpers
Golrezaei, N., Shanmugam, K., Dimakis, A. G., Molisch, A. F., & Caire, G. (2012) · 2012 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2012.6195469 · Cited by 711
Self-citationInformation Theory and Network Coding
Yeung, R. W., Wolf, J. K., & Gallager, R. G. (2008) · Springer eBooks · doi:10.1007/978-0-387-79234-7 · Cited by 708
Femtocaching and device-to-device collaboration: A new architecture for wireless video distribution
Golrezaei, N., Molisch, A. F., Dimakis, A. G., & Caire, G. (2013) · IEEE Communications Magazine · doi:10.1109/mcom.2013.6495773 · Cited by 686
Self-citationDistributed Caching Algorithms for Content Distribution Networks
Borst, S., Gupta, V., & Walid, A. (2010) · 2010 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2010.5461964 · Cited by 681
Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff
Maddah-Ali, M. A., & Niesen, U. (2015) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2014.2317316 · Cited by 626
Index Coding With Side Information
Bar-Yossef, Z., Birk, Y., Jayram, T. S., & Kol, T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2103753 · Cited by 498
Comparative Models of the File Assignment Problem
Dowdy, L. W., & Foster, D. V. (1982) · ACM Computing Surveys · doi:10.1145/356876.356883 · Cited by 472
Device-to-device communications with Wi-Fi Direct: overview and experimentation
Camps-Mur, D., Garcia-Saavedra, A., & Serrano, P. (2013) · IEEE Wireless Communications · doi:10.1109/mwc.2013.6549288 · Cited by 471
Wireless Device-to-Device Caching Networks: Basic Principles and System Performance
Ji, M., Caire, G., & Molisch, A. F. (2016) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2015.2452672 · Cited by 444
Self-citationCoded caching with nonuniform demands
Niesen, U., & Maddah-Ali, M. A. (2014) · 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) · doi:10.1109/infcomw.2014.6849235 · Cited by 415
Dynamic batching policies for an on-demand video server
Dan, A., Sitaram, D., & Shahabuddin, P. (1996) · Multimedia Systems · doi:10.1007/s005300050016 · Cited by 400
FlashLinQ: A Synchronous Distributed Scheduler for Peer-to-Peer Ad Hoc Networks
Wu, X., Tavildar, S., Shakkottai, S., Richardson, T., Li, J., Laroia, R., & Jovicic, A. (2013) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2013.2264633 · Cited by 338
The use of multicast delivery to provide a scalable and interactive video-on-demand service
Almeroth, K. C., & Ammar, M. H. (1996) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.508282 · Cited by 336
Topological Interference Management Through Index Coding
Jafar, S. A. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2013.2285151 · Cited by 305
On the Index Coding Problem and Its Relation to Network Coding and Matroid Theory
El Rouayheb, S., Sprintson, A., & Georghiades, C. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2048502 · Cited by 293
Order-Optimal Rate of Caching and Coded Multicasting With Random Demands
Ji, M., Tulino, A. M., Llorca, J., & Caire, G. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2695611 · Cited by 233
Self-citationApproximation Algorithms for Data Placement Problems
Baev, I., Rajaraman, R., & Swamy, C. (2008) · SIAM Journal on Computing · doi:10.1137/080715421 · Cited by 215
Placement Algorithms for Hierarchical Cooperative Caching
Korupolu, M. R., Plaxton, C. G., & Rajaraman, R. (2001) · Journal of Algorithms · doi:10.1006/jagm.2000.1129 · Cited by 175
Finite-Length Analysis of Caching-Aided Coded Multicasting
Shanmugam, K., Ji, M., Tulino, A. M., Llorca, J., & Dimakis., A. G. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2599110 · Cited by 170
Self-citationThe Throughput-Outage Tradeoff of Wireless One-Hop Caching Networks
Ji, M., Caire, G., & Molisch, A. F. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2490226 · Cited by 168
Self-citationFlashLinQ: A synchronous distributed scheduler for peer-to-peer ad hoc networks
Wu, X., Tavildar, S., Shakkottai, S., Richardson, T., Li, J., Laroia, R., & Jovicic, A. (2010) · 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton) · doi:10.1109/allerton.2010.5706950 · Cited by 163
Fundamental Limits of Caching With Secure Delivery
Sengupta, A., Tandon, R., & Clancy, T. C. (2014) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2014.2375553 · Cited by 157
1Asymptotic Laws for Joint Content Replication and Delivery in Wireless NetworksPreprint
Gitzenis, S., Paschos, G. S., & Tassiulas, L. (2016) · Cited by 110
de la Fuente, Y. S., Schierl, T., Hellge, C., Wiegand, T., Hong, D., Vleeschauwer, D. D., Leekwijck, W. V., & Louédec, Y. L. (2011) · ACM Multimedia Systems Conference (MMSys) · doi:10.1145/1943552.1943586 · Cited by 102
Asymptotic Laws for Joint Content Replication and Delivery in Wireless Networks
Gitzenis, S., Paschos, G. S., & Tassiulas, L. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2235905 · Cited by 98
Fundamental limits of distributed caching in D2D wireless networks
Ji, M., Caire, G., & Molisch, A. F. (2013) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2013.6691247 · Cited by 92
Self-citationOn the average performance of caching and coded multicasting with random demands
Ji, M., Tulino, A. M., Llorca, J., & Caire, G. (2014) · International Symposium on Wireless Communication Systems · doi:10.1109/iswcs.2014.6933485 · Cited by 90
Self-citationHachem, J., Karamchandani, N., & Diggavi, S. N. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6874794 · Cited by 81
Optimal throughput-outage trade-off in wireless one-hop caching networks
Ji, M., Caire, G., & Molisch, A. F. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620469 · Cited by 80
Self-citationCaching and coded multicasting: Multiple groupcast index coding
Ji, M., Tulino, A. M., Llorca, J., & Caire, G. (2014) · IEEE Global Conference on Signal and Information Processing · doi:10.1109/globalsip.2014.7032246 · Cited by 80
Self-citationKaramchandani, N., Niesen, U., Maddah-Ali, M. A., & Diggavi, S. N. (2014) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2014.6875212 · Cited by 79
DRESS codes for the storage cloud: Simple randomized constructions
Pawar, S., Noorshams, N., Rouayheb, S. E., & Ramchandran, K. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6033980 · Cited by 74
FlexCast: graceful wireless video streaming
Aditya, S., & Katti, S. (2011) · ACM Annual International Conference on Mobile Computing and Networking (MobiCom) · doi:10.1145/2030613.2030645 · Cited by 71
Caching Eliminates the Wireless Bottleneck in Video Aware Wireless Networks
Molisch, A. F., Caire, G., Ott, D. E., Foerster, J. R., Bethanabhotla, D., & Ji, M. (2014) · Advances in Electrical Engineering · doi:10.1155/2014/261390 · Cited by 59
Self-citationAn efficient multiple-groupcast coded multicasting scheme for finite fractional caching
Ji, M., Shanmugam, K., Vettigli, G., Llorca, J., Tulino, A. M., & Caire, G. (2015) · International Conference on Communications · doi:10.1109/icc.2015.7248916 · Cited by 43
Self-citationWeb caching using access statistics
Meyerson, A., Munagala, K., & Plotkin, S. A. (2001) · doi:10.5555/365411.365479 · Cited by 42
Caching in wireless multihop device-to-device networks
Jeon, S.-W., Hong, S.-N., Ji, M., & Caire, G. (2015) · International Conference on Communications · doi:10.1109/icc.2015.7249398 · Cited by 38
Self-citationExploiting network awareness to enhance DASH over wireless
Bronzino, F., Stojadinovic, D., Westphal, C., & Raychaudhuri, D. (2016) · IEEE Consumer Communications and Networking Conference · doi:10.1109/ccnc.2016.7444942 · Cited by 14
Online Coded CachingPreprint
Pedarsani, R., Maddah-Ali, M. A., & Niesen, U. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1311.3646 · Cited by 12
On the capacity of multihop device-to-device caching networks
Jeon, S.-W., Hong, S.-N., Ji, M., & Caire, G. (2015) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw.2015.7133093 · Cited by 8
Self-citation
Cited by
Ultra-Dense Networks: A Survey
Kamel, M., Hamouda, W., & Youssef, A. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2571730 · Cited by 919
A Survey on Low Latency Towards 5G: RAN, Core Network and Caching Solutions
Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A. I., & Dai, H. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2018.2841349 · Cited by 883
Mobile Edge Intelligence and Computing for the Internet of Vehicles
Zhang, J., & Letaief, K. B. (2020) · Proceedings of the IEEE · doi:10.1109/jproc.2019.2947490 · Cited by 537
A Fundamental Tradeoff Between Computation and Communication in Distributed Computing
Li, S., Maddah-Ali, M. A., Yu, Q., & Avestimehr, A. S. (2018) · IEEE Transactions on Information Theory · doi:10.1109/tit.2017.2756959 · Cited by 451
Mobility-Aware Edge Caching and Computing in Vehicle Networks: A Deep Reinforcement Learning
Tan, L. T., & Hu, R. Q. (2018) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2018.2867191 · Cited by 356
Metadata
- Authors
- Ji, M., Caire, G., & Molisch, A. F.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-02
- Volume
- 62
- Issue
- 2
- Pages
- 849-869
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W1606035500
- Cited by
- 596
- References
- 54
- FWCI
- 89.41
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.