返回
Green content sharing mode: D2D Coordination Multiple Points Transmission
DOI:10.1016/j.future.2018.09.045.png)
摘要
En 中文
In next-generation 5G cellular networks, device-to-device (D2D) communication has emerged as an effective solution to support the growing popularity of multimedia contents for local service. Conventionally, the D2D content sharing mode is one-to-one matching, i.e, one demander will select one provider to request files from it. Under this mode, it is hard to cope with the growing demand for multimedia services for mobile users due to limited battery capacity for mobile devices. In this work, we propose an energy-efficient content sharing system via a novel D2D Coordination Multiple Points Transmission (D2D-CoMP), which shares content among multiple users to reduce the power consumption per user device. The highlights of this work lie in three parts. Firstly, the strategy for matching providers to demanders subject to self-interference constraints is formulated as a classical maximum weighted matching problem, in which the optimal solution can be derived when network-wide information is known, and also an effective distributed algorithm. Secondly, we design an optimal packet split algorithm for D2D-COMP under comprehensive consideration of two aspects of communication efficiency and energy consumption to solve the problem how many data packets each provider transfers. Thirdly, we model the file reconstruction problem of collaboration demanders as the shortest Hamiltonian path problem and illustrate the file reconstruction process. Moreover, we develop a best-effort distributed greedy algorithm framework to find the shortest file reconstruction path. Importantly, numerical results demonstrate that the proposed mechanism can greatly reduce the energy consumption of each device with little or no increase in transmission delay. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Device-to-device communication
Content sharing
Green communication
D2D Coordination Multiple Points
Transmission
Maximum weight matching
Hamiltonian path
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
F
IF:
6.1
论文数:
6.9K
被引数:
2.3W
机构
暂无机构信息

