Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Stability Analysis of Device-to-Device Relay-Assisted Cellular Networks

Soubhik Deb, Prasanna Chaporkar, Abhay Karandikar

TL;DR

This work evaluates the system stability region, formulates a policy for joint resource allocation and power control under a more realistic mobility scenario of generalized reflected random walk, and investigates the throughput optimality of this policy.

Abstract

Motivated by increasing popularity of delay sensitive applications, we investigate the queue stability in device-to-device (D2D) relay-assisted cellular networks. In contrast to prior works on D2D relay-assisted cellular networks, we incorporate practical properties of these networks such as bursty packet arrivals, user mobility and relays generating their own traffic. Assuming network topology evolving in IID fashion, we first evaluate the system stability region to quantify its delay performance. Subsequently, we formulate a policy for joint resource allocation and power control under a more realistic mobility scenario of generalized reflected random walk. Also, the throughput optimality of this policy is investigated. Simulation results are provided to give better understanding of queue stability in the network.

Stability Analysis of Device-to-Device Relay-Assisted Cellular Networks

TL;DR

This work evaluates the system stability region, formulates a policy for joint resource allocation and power control under a more realistic mobility scenario of generalized reflected random walk, and investigates the throughput optimality of this policy.

Abstract

Motivated by increasing popularity of delay sensitive applications, we investigate the queue stability in device-to-device (D2D) relay-assisted cellular networks. In contrast to prior works on D2D relay-assisted cellular networks, we incorporate practical properties of these networks such as bursty packet arrivals, user mobility and relays generating their own traffic. Assuming network topology evolving in IID fashion, we first evaluate the system stability region to quantify its delay performance. Subsequently, we formulate a policy for joint resource allocation and power control under a more realistic mobility scenario of generalized reflected random walk. Also, the throughput optimality of this policy is investigated. Simulation results are provided to give better understanding of queue stability in the network.

Paper Structure

This paper contains 8 sections, 5 theorems, 61 equations.

Table of Contents

  1. Fluid Limits
  2. Proof of Theorem 1
  3. Case 1
  4. Case 2
  5. Case 3
  6. Proof of Lemma 1
  7. Proof of Lemma 2
  8. Proof of Theorem 2

Key Result

Lemma 1

Every fluid limit satisfies, $\widetilde{{\mathscr{A}}}_{i}(t)=\lambda_{i}t$$w.p.$ 1 for every MS $i$ and $t\geq0$.

Theorems & Definitions (6)

  • Definition 1
  • Lemma 1
  • Lemma 2
  • Lemma 3
  • Lemma 4
  • Lemma 5