Name
Abstract | ||
|---|---|---|
In remote mobile social networks, caching is a very promising technique to alleviate the burden of space cloudlet (e.g., cache-enabled satellite user terminal) and to improve subscribers' user experience in terms of content retrieval latency. In this paper, we proposed a social relationship aware caching placement approach for remote mobile social networks. Social relationships between users are used to designate a set of helpers with caching capability, which can cache popular files proactively when the cloudlet is idle. Furthermore, the caching placement problem is formulated as an optimization problem to minimize the average content retrieval latency. Then, we reformulate the problem into a monotone submodular optimization problem with a partition matroid constraint; moreover, an efficient greedy algorithm with 1 - 1/e approximation ratio is proposed to solve it. Simulation results show that the proposed social aware greedy caching placement approach significantly outperforms the traditional approaches in terms of content retrieval latency and hit ratio. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1109/PIMRC.2018.8580978 | 2018 IEEE 29TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR AND MOBILE RADIO COMMUNICATIONS (PIMRC) |
Field | DocType | Citations |
User experience design,Cloudlet,Social network,Computer science,Latency (engineering),Cache,Computer network,Submodular set function,Greedy algorithm,Optimization problem | Conference | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guiting Zhong | 1 | 0 | 0.68 |
| jian yan | 2 | 1 | 2.05 |
| Chunxiao Jiang | 3 | 2064 | 161.92 |
| Linling Kuang | 4 | 193 | 31.60 |
| Abderrahim Benslimane | 5 | 591 | 76.05 |