| 000 | 03306nlm1a2200481 4500 | ||
|---|---|---|---|
| 001 | 665873 | ||
| 005 | 20231030042018.0 | ||
| 035 | _a(RuTPU)RU\TPU\network\37077 | ||
| 035 | _aRU\TPU\network\37075 | ||
| 090 | _a665873 | ||
| 100 | _a20211119a2017 k y0engy50 ba | ||
| 101 | 0 | _aeng | |
| 102 | _aUS | ||
| 135 | _adrcn ---uucaa | ||
| 181 | 0 | _ai | |
| 182 | 0 | _ab | |
| 200 | 1 |
_aOn Social-Aware Content Caching for D2D-Enabled Cellular Networks with Matching Theory _fLi Jun, Liu Miao, Lu Jinhui [et al.] |
|
| 203 |
_aText _celectronic |
||
| 300 | _aTitle screen | ||
| 320 | _a[References: 33 tit.] | ||
| 330 | _aIn this paper, the problem of content caching in 5G cellular networks relying on social-aware device-to-device communications (DTD) is investigated. Our focus is on how to efficiently select important users (IUs) and how to allocate content files to the storage of these selected IUs to form a distributed caching system. We aim at proposing a novel approach for minimizing the downloading latency and maximizing the social welfare simultaneously. In particular, we first model the problem of maximizing the social welfare as a many-to-one matching game based on the social property of mobile users. We study this game by exploiting users' social properties to generate the utility functions of the two-side players, i.e., content providers (CPs) and IUs. Then we model the problem of minimizing the downloading latency as a many-to-many matching problem. For solving these games, we design a many-to-one IU selection (MOIS) matching algorithm and a many-to-many file allocation (MMFA) matching algorithm, respectively. Simulation and analytical results show that the proposed mechanisms are stable, and are capable of offering a better performance than other benchmarks in terms of social welfare and network downloading latency. | ||
| 333 | _aРежим доступа: по договору с организацией-держателем ресурса | ||
| 461 | _t IEEE Internet of Things Journal | ||
| 463 |
_tVol. 6, iss. 1 _v[P. 297-310] _d2017 |
||
| 610 | 1 | _aтруды учёных ТПУ | |
| 610 | 1 | _aэлектронный ресурс | |
| 610 | 1 | _aсоциальные сети | |
| 610 | 1 | _aкэширование | |
| 610 | 1 | _aмобильные пользователи | |
| 610 | 1 | _aалгоритмы | |
| 610 | 1 | _aсотовая связь | |
| 610 | 1 | _a5G | |
| 701 | 0 | _aLi Jun | |
| 701 | 0 | _aLiu Miao | |
| 701 | 0 | _aLu Jinhui | |
| 701 | 0 | _aShu Feng | |
| 701 | 0 | _aZhang Yi | |
| 701 | 0 | _aBayat Siavash | |
| 701 | 1 |
_aDzhayakodi Arachshiladzh _bD. N. K. _cspecialist in the field of electronics _cProfessor of Tomsk Polytechnic University _f1983- _gDushanta Nalin Kumara _2stltpush _3(RuTPU)RU\TPU\pers\37962 |
|
| 712 | 0 | 2 |
_aНациональный исследовательский Томский политехнический университет _bИнженерная школа информационных технологий и робототехники _bНаучно-образовательный центр "Автоматизация и информационные технологии" _h8422 _2stltpush _3(RuTPU)RU\TPU\col\27515 |
| 801 | 2 |
_aRU _b63413507 _c20211119 _gRCR |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1109/JIOT.2017.2749320 |
| 942 | _cCF | ||