2020 IEEE International Symposium
on Information Theory
21-26 June 2020 • Los Angeles, California, USA
| Paper ID | E.5.2 | ||
| Paper Title | Sequential Hypothesis Criterion Based Optimal Caching Schemes in Wireless Networks | ||
| Authors | Xi Zhang, Qixuan Zhu, Texas A&M University, United States; H. Vincent Poor, Princeton University, United States | ||
| Session | E.5: Hypothesis Testing I | ||
| Presentation | Lecture | ||
| Track | Detection and Estimation | ||
| Manuscript | Click here to download the manuscript | ||
| Virtual Presentation | Click here to watch in the Virtual Symposium | ||
| Abstract | The sequential hypothesis testing has been broadly applied in a large number of engineering applications because it gives a specific rule at any stage of the experiment for making a decision of accepting one of hypotheses. The optimal caching scheme design problem in 5G and beyond wireless networks is one of the important applications of sequential hypothesis testing by wireless networks observing the data contents requested by mobile users as a experiment and making a decision for what type of the requested data-content’s distribution is. By making this decision, cache stations in wireless network are able to estimate the popularity of requested data contents in the future and proactively cache the popular data contents near by mobile users for reducing the transmission delay when downloading time-sensitive data contents. In this paper we formulate the optimal caching scheme problem as future data popularity estimation through developing the optimal stopping and decision rules for the Zipf sequential hypothesis testing. We first prove that our developed Zipf sequential hypothesis testing is exponentially bounded and derive the lower bound of the stopping time. Then, we give the solution of optimal stopping and decision rules for Zipf sequential hypothesis testing. | ||
Plan Ahead
2021 IEEE International Symposium on Information Theory
11-16 July 2021 | Melbourne, Victoria, Australia
