Open AccessDistributed caching in information‐centric cellular networks with full duplex communication
Author(s) -
Liu Ming,
Mao Yuming,
Leng Supeng
Publication year - 2019
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2018.5130
Subject(s) - computer science , cache , computer network , information centric networking , radio access network , enhanced data rates for gsm evolution , cellular network , spectral efficiency , wireless , latency (audio) , duplex (building) , wireless network , distributed computing , base station , mobile station , telecommunications , dna , channel (broadcasting) , biology , genetics
Current approaches to information‐centric network (ICN) implementation employ the edge storage of network infrastructures to minimise the latency of information retrieval. However, the edge storage of infrastructures is finite. Distributed content caching assisted by mobile devices becomes a potential solution to content publishing services. Nevertheless, under the conventional half‐duplex‐based ICN, extra memory is occupied and the delay is increased. Fortunately, full duplex (FD) communications can improve the spectrum efficiency of wireless networks, and reduce the access delay by more flexible content caching. In this study, the authors propose a novel FD‐based ICN (FD‐ICN) framework, where content caching is not only implemented in network infrastructures but also in mobile devices. Content cached by mobile devices can be delivered in a FD amplify and forward way without extra BS memory occupation and delay. To maximise the network utility of the FD‐ICN, they formulate the caching strategy and FD radio resource allocation as a joint optimisation problem. A joint caching strategy and FD radio resource allocation algorithm are proposed. Simulation results show their FD‐ICN framework can achieve superior system utility compared to the conventional ICN. Moreover, the proposed algorithm exhibits higher utility with similar converge rate compared to the heuristic algorithm.