Pith. sign in

REVIEW

A Non-cooperative Game-based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2012.11168 v3 pith:BA4OF3UO submitted 2020-12-21 cs.IT math.IT

A Non-cooperative Game-based Distributed Beam Scheduling Framework for 5G Millimeter-Wave Cellular Networks

classification cs.IT math.IT
keywords problemdistributedschedulingoptimizationbeamframeworknon-cooperativeutility
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

This paper studies the problem of distributed beam scheduling for 5G millimeter-Wave (mm-Wave) cellular networks where base stations (BSs) belonging to different operators share the same spectrum without centralized coordination among them. Our goal is to design efficient distributed scheduling algorithms to maximize the network utility, which is a function of the achieved throughput by the user equipment (UEs), subject to the average and instantaneous power consumption constraints of the BSs. We propose a Media Access Control (MAC) and a power allocation/adaptation mechanism utilizing the Lyapunov stochastic optimization framework and non-cooperative games. In particular, we first decompose the original utility maximization problem into two sub-optimization problems for each time frame, which are a convex optimization problem and a non-convex optimization problem, respectively. By formulating the distributed scheduling problem as a non-cooperative game where each BS is a player attempting to optimize its own utility, we provide a distributed solution to the non-convex sub-optimization problem via finding the Nash Equilibrium (NE) of the game whose weights are determined optimally by the Lyapunov optimization framework. Finally, we conduct simulation under various network settings to show the effectiveness of the proposed game-based beam scheduling algorithm in comparison to that of several reference schemes.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.