Caching in mobile HetNets: A throughput-delay trade-off perspective

Trung Anh Do, Sang Woon Jeon, Won-Yong Shin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

We analyze the optimal throughput-delay trade-off in content-centric mobile heterogeneous networks (HetNets), where each node moves according to the random walk mobility model and requests a content object from the library independently at random, according to a Zipf popularity distribution. Instead of allowing access to all content objects at base stations (BSs) via costly backhaul, we consider a more practical scenario where mobile nodes and BSs, each having a finite-size cache space, are able to cache a subset of content objects so that each request is served by other mobile nodes or BSs via multihop transmissions. Under the protocol model, we characterize a fundamental throughput-delay trade-off in terms of scaling laws by introducing our content delivery routing protocol and the corresponding optimal caching allocation strategy.

Original languageEnglish
Title of host publicationProceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1247-1251
Number of pages5
ISBN (Electronic)9781509018062
DOIs
Publication statusPublished - 2016 Aug 10
Event2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, Spain
Duration: 2016 Jul 102016 Jul 15

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2016-August
ISSN (Print)2157-8095

Other

Other2016 IEEE International Symposium on Information Theory, ISIT 2016
CountrySpain
CityBarcelona
Period16/7/1016/7/15

Fingerprint

Heterogeneous networks
Heterogeneous Networks
Caching
Mobile Networks
Base stations
Wireless networks
Throughput
Trade-offs
Cache
Vertex of a graph
Scaling laws
Routing protocols
Mobility Model
Multi-hop
Scaling Laws
Routing Protocol
Network protocols
Random walk
Scenarios
Subset

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this

Do, T. A., Jeon, S. W., & Shin, W-Y. (2016). Caching in mobile HetNets: A throughput-delay trade-off perspective. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory (pp. 1247-1251). [7541498] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2016.7541498
Do, Trung Anh ; Jeon, Sang Woon ; Shin, Won-Yong. / Caching in mobile HetNets : A throughput-delay trade-off perspective. Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1247-1251 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{1cb915fe814c4df19a245bcdfe1f9124,
title = "Caching in mobile HetNets: A throughput-delay trade-off perspective",
abstract = "We analyze the optimal throughput-delay trade-off in content-centric mobile heterogeneous networks (HetNets), where each node moves according to the random walk mobility model and requests a content object from the library independently at random, according to a Zipf popularity distribution. Instead of allowing access to all content objects at base stations (BSs) via costly backhaul, we consider a more practical scenario where mobile nodes and BSs, each having a finite-size cache space, are able to cache a subset of content objects so that each request is served by other mobile nodes or BSs via multihop transmissions. Under the protocol model, we characterize a fundamental throughput-delay trade-off in terms of scaling laws by introducing our content delivery routing protocol and the corresponding optimal caching allocation strategy.",
author = "Do, {Trung Anh} and Jeon, {Sang Woon} and Won-Yong Shin",
year = "2016",
month = "8",
day = "10",
doi = "10.1109/ISIT.2016.7541498",
language = "English",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "1247--1251",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
address = "United States",

}

Do, TA, Jeon, SW & Shin, W-Y 2016, Caching in mobile HetNets: A throughput-delay trade-off perspective. in Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory., 7541498, IEEE International Symposium on Information Theory - Proceedings, vol. 2016-August, Institute of Electrical and Electronics Engineers Inc., pp. 1247-1251, 2016 IEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, 16/7/10. https://doi.org/10.1109/ISIT.2016.7541498

Caching in mobile HetNets : A throughput-delay trade-off perspective. / Do, Trung Anh; Jeon, Sang Woon; Shin, Won-Yong.

Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1247-1251 7541498 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2016-August).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Caching in mobile HetNets

T2 - A throughput-delay trade-off perspective

AU - Do, Trung Anh

AU - Jeon, Sang Woon

AU - Shin, Won-Yong

PY - 2016/8/10

Y1 - 2016/8/10

N2 - We analyze the optimal throughput-delay trade-off in content-centric mobile heterogeneous networks (HetNets), where each node moves according to the random walk mobility model and requests a content object from the library independently at random, according to a Zipf popularity distribution. Instead of allowing access to all content objects at base stations (BSs) via costly backhaul, we consider a more practical scenario where mobile nodes and BSs, each having a finite-size cache space, are able to cache a subset of content objects so that each request is served by other mobile nodes or BSs via multihop transmissions. Under the protocol model, we characterize a fundamental throughput-delay trade-off in terms of scaling laws by introducing our content delivery routing protocol and the corresponding optimal caching allocation strategy.

AB - We analyze the optimal throughput-delay trade-off in content-centric mobile heterogeneous networks (HetNets), where each node moves according to the random walk mobility model and requests a content object from the library independently at random, according to a Zipf popularity distribution. Instead of allowing access to all content objects at base stations (BSs) via costly backhaul, we consider a more practical scenario where mobile nodes and BSs, each having a finite-size cache space, are able to cache a subset of content objects so that each request is served by other mobile nodes or BSs via multihop transmissions. Under the protocol model, we characterize a fundamental throughput-delay trade-off in terms of scaling laws by introducing our content delivery routing protocol and the corresponding optimal caching allocation strategy.

UR - http://www.scopus.com/inward/record.url?scp=84985986809&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84985986809&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2016.7541498

DO - 10.1109/ISIT.2016.7541498

M3 - Conference contribution

AN - SCOPUS:84985986809

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1247

EP - 1251

BT - Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Do TA, Jeon SW, Shin W-Y. Caching in mobile HetNets: A throughput-delay trade-off perspective. In Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1247-1251. 7541498. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2016.7541498