Abstract

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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.