A Dynamic and Incentive Policy for Selecting D2D Mobile Relays
Rita Ibrahim, Mohamad Assaad, Berna Sayrac

TL;DR
This paper introduces a dynamic relay selection policy for D2D-enabled cellular networks, modeling relay mobility with CPOMDPs, and proposes scalable solutions to optimize network performance under cost constraints.
Contribution
It develops a CPOMDP-based framework for relay selection, proves submodularity for greedy solutions, and introduces a distributed approach for multi-user scenarios.
Findings
The proposed policy improves throughput under energy constraints.
The greedy solution is scalable and effective.
Distributed approach reduces complexity and overhead.
Abstract
User-to-network relaying enabled via Device-to-Device communications (D2D) is a promising technique for improving the performance of cellular networks. Since in practice relays are in mobility, a dynamic relay selection scheme is unavoidable. In this paper, we propose a dynamic relay selection policy that maximizes the performance of cellular networks (e.g. throughput, reliability, coverage) under cost constraints (e.g. transmission power, power budget). We represent the relays' dynamics as a Markov Decision Process (MDP) and assume that only the locations of the selected relays are observable. Therefore, the dynamic relay selection process is modeled as a Constrained Partially Observed Markov Decision Process (CPOMDP). Since the exact solution of such framework is intractable to find, we develop a point-based value iteration solution and evaluate its performance. In addition, we prove…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Advanced MIMO Systems Optimization · Wireless Communication Security Techniques
