【摘 要】
：
Caching popular files in small-cell base stations (SBSs) is considered as a promising technique to meet the demand of ever growing mobile data traffic in ultra dense networks (UDNs).Considering the limited cache capacity and dense deployment of SBSs,how t
【机 构】
：
Key Laboratory of Universal Wireless Communications, Beijing University of Posts and Telecommunicati
论文部分内容阅读
Caching popular files in small-cell base stations (SBSs) is considered as a promising technique to meet the demand of ever growing mobile data traffic in ultra dense networks (UDNs).Considering the limited cache capacity and dense deployment of SBSs,how to support uninterrupted and successful caching downloading for moving users is still a challenging problem.In this paper,a graph-coloring-based caching (GCC) algorithm in UDN for moving user under limited SBS storage capacities is proposed.Firstly,considering there may be downloading interruption or even failure due to the random moving of users and small coverage of SBSs,graph coloring algorithm (GCA) is employed for grouping the SBS to cache fragments of several files.Then,the problem of how to conduct caching placement on SBSs is formulated aiming to maximize the amount of data downloaded from SBSs.Finally,an efficient heuristic solution is proposed to get an optimal result.Simulation results show that the algorithm performs better than other caching strategies in prior work,in terms of reducing both backhaul traffic and user download delay.
其他文献
In this paper,a power allocation to maximize tradeoff between spectrum efficiency (SE) and energy efficiency (EE) is considered for the downlink non-orthogonal multiple access (NOMA) system with arbitrarily clusters and arbitrarily users,where the subcarr
In case of machine learning,the problem of class imbalance is always troubling,i.e.one class of the samples has a larger magnitude than the other classes.This problem brings a preference of the classifier to the majority class,which leads to worse perform
Traditional methods for removing ocular artifacts (OAs) from electroencephalography (EEG) signals often involve a large number of EEG electrodes or require electrooculogram (EOG) as the reference,these constraints make subjects uncomfortable during the ac
A novel adaptively iterative list decoding (ILD) approach using for Reed-Solomon (RS) codes was investigated.The proposed scheme is exploited to reduce the complexity of RS Chase algorithm (CA) via an iterative decoding attempt mode.In each decoding attem
A new semi-serial fusion method of multiple feature based on learning using privileged information (LUPI) model was put forward.The exploitation of LUPI paradigm permits the improvement of the learning accuracy and its stability,by additional information
In the post quantum era,public key cryptographic scheme based on lattice is considered to be the most promising cryptosystem that can resist quantum computer attacks.However,there are still few efficient key agreement protocols based on lattice up to now.
Modeling and matching texts is a critical issue in natural language processing (NLP) tasks.In order to improve the accuracy of text matching,multi-granularities capture matching features (MG-CMF) model was proposed.The proposed model used convolution oper
A low-than character feature embedding called radical embedding is proposed,and applied on a long-short term memory (LSTM) model for sentence segmentation of pre-modern Chinese texts.The dataset includes over 150 classical Chinese books from 3 different d
In order to detect and cancel the self-interference (SI) signal from desired binary phase-shift keying (BPSK) signal,the polarization-based optimal detection (POD) scheme for cancellation of digital SI in a full-duplex (FD) system is proposed.The POD sche
The energy-efficiency (EE) optimization problem was studied for resource allocation in an uplink single-cell network,in which multiple mobile users with different quality of service (QoS) requirements operate under a non-orthogonal multiple access (NOMA)