Social-Aware Incentivized Caching for D2D Communications
Social-Aware Incentivized Caching for D2D Communications
复制标题
DOI：
10.1109/access.2016.2618940
复制
发表时间：
2016-10
期刊：
影响因子：
3.9
通讯作者：
Konglin Zhu;Wenting Zhi;Lin Zhang;Xu Chen;Xiaoming Fu
中科院分区：
文献类型：
--
作者：
Konglin Zhu;Wenting Zhi;Lin Zhang;Xu Chen;Xiaoming Fu
设备到设备（D2D）信道允许在两个设备靠近时进行内容共享，这有助于提高资源利用率和网络容量。在D2D网络中引入数据缓存是为了在移动网络中实现快速数据访问。由于用户的自私本性，他们希望在机会性连接中获得尽可能多的副本，试图使自身利益最大化。然而，为其他节点缓存数据可能会给作为缓存的节点带来额外成本，该成本由缓存节点的缓存放置和其他节点的访问成本引起。在本文中，我们提出一种社交感知缓存博弈来激励节点为其他节点缓存数据。在该博弈中，我们将社会关系和物理距离作为制定缓存成本的因素。我们得到了博弈的纳什均衡，并提出一种社交感知算法，以最小化网络中获取对象数据的总成本。大量的仿真结果表明我们的算法获得了显著的缓存效益。
The device-to-device (D2D) channels allow content sharing when two devices are in close proximity, which can help improve resource utilization and network capacity. The data caching is introduced in D2D networks to enable the quick data access in mobile networks. Due to the selfish nature of users, they wish to get as much replication as possible in the opportunistic connections, seeking to maximize their own profits. However, caching data for other nodes may result in additional cost to the node serving as cache, where the cost is invoked by the cache placement of cache nodes and accessing cost of other nodes. In this paper, we propose a social-aware caching game to incentivize nodes to cache data for others. In the game, we consider the social ties and physical distance as the factors to formulate the caching cost. We obtain the Nash equilibrium of the game and propose a social-aware algorithm to minimize the total cost of getting object data in the network. The extensive simulation results show that our algorithm gains significant cache benefit.