Papers
Topics
Authors
Recent
Search
2000 character limit reached

Distributed vs. Centralized Scheduling in D2D-enabled Cellular Networks

Published 6 Jun 2018 in cs.IT and math.IT | (1806.02081v6)

Abstract: Employing channel adaptive resource allocation can yield to a large enhancement in almost any performance metric of Device-to-Device (D2D) communications. We observe that D2D users are able to estimate their local Channel State Information (CSI), however the base station needs some signaling exchange to acquire this information. Based on the D2D users' knowledge of their local CSI, we provide a scheduling framework that shows how distributed approach outperforms centralized one. We start by proposing a centralized scheduling that requires the knowledge of D2D links' CSI at the base station level. This CSI reporting suffers from the limited number of resources available for feedback transmission. Therefore, we benefit from the users' knowledge of their local CSI to develop a distributed algorithm for D2D resource allocation. In distributed approach, collisions may occur between the different CSI reporting; thus a collision reduction algorithm is proposed. We give a description on how both centralized and distributed algorithms can be implemented in practice. Furthermore, numerical results are presented to corroborate our claims and demonstrate the gain that the proposed scheduling algorithms bring to cellular networks.

Citations (10)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.