Back close

Optimal Cache Allocation in a Mobility Based Heterogeneous Network Using Bayesian Games

Publication Type : Conference Paper

Publisher : IEEE

Source : Proceedings in CALCON 2017

Url : https://ieeexplore.ieee.org/document/8280768

Campus : Amritapuri

School : School of Computing

Verified : No

Year : 2017

Abstract : Content-caching is a key technology in the future wireless communication and so, optimal placement of cache is critical for maintaining better user throughput in heterogenous network. Considering the fixed memory space of the router, cache should be carefully placed in the routers, to get the optimum throughput of all users. This paper provides a novel game-theoretic algorithm for optimal cache storage in routers, considering the mobility of the users in the cell area. We consider a global game which is a type of mixed strategy Bayesian Game among the routers in order to store the cache of an user depending on its cell sojourn time i.e. the time for which the user remains in the cell before moving out, assuming that his mobility is modelled by random waypoint process.

Cite this Research Publication : B. Chakraborty, B. Banerjee, A. Mukherjee and M. K. Naskar, “Optimal Cache Allocation in a Mobility Based Heterogeneous Network Using Bayesian Games”, Proceedings in CALCON 2017

Admissions Apply Now