English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

We consider a cooperative device-to-device (D2D) communication system, wherethe D2D transmitters (DTs) act as relays to assist cellular users (CUs) inexchange for the opportunities to use the licensed spectrum. To reduce theoverhead, we propose a novel two-timescale resource allocation scheme, in whichthe pairing between CUs and D2D pairs is decided at a long timescale and timeallocation factor for CU and D2D pair is determined at a short timescale.Specifically, to characterize the long-term payoff of each potential CU-D2Dpair, we investigate the optimal cooperation policy to decide the timeallocation factor based on the instantaneous channel state information (CSI).We prove that the optimal policy is a threshold policy. Since CUs and D2D pairsare self-interested, they are paired only when they agree to cooperatemutually. Therefore, to study the behaviors of CUs and D2D pairs, we formulatethe pairing problem as a matching game, based on the long-term payoff of eachpossible pairing. Furthermore, unlike most previous matching model in D2Dnetworks, we allow transfer between CUs and D2D pairs to improve theperformance. Besides, we propose an algorithm, which converges to anepsilon-stable matching.

Matching Based Two-Timescale Resource Allocation for Cooperative D2D Communication