Game-Theoretic Mode Scheduling for Dynamic TDD in 5G Systems
Dynamic time-division duplexing (TDD) enables independent uplink/downlink mode scheduling at each cell, based on the local traffic. However, this creates cross-interference among cells. Thus, the joint power allocation and scheduling problem becomes mixed-integer non-convex and turns out to be NP-hard. We propose a low-complexity and decentralized solution, where power allocation and scheduling are decoupled. First, power is allocated in a decentralized fashion, and then modes are scheduled by a non-cooperative game to achieve the mixed-strategy Nash equilibrium. We consider two possible approaches to compute the payoffs in the game, according to the cross-interference power model and the entailed communication overhead among cells. Simulation results are presented for an outdoor dense small-cell scenario, showing that our approaches outperform static TDD significantly.
Code (0)
등록된 구현이 없습니다.
Tasks
SchedulingSimilar Papers 제목 키워드 기반
A Jointly Optimal Design of Control and Scheduling in Networked Systems under Denial-of-Service Attacks
We consider the joint design of control and scheduling under stochastic Denial-of-Service (DoS) attacks in the context of networked control systems. A sensor takes measurements of the system output and forwards its dynam…
Q-LearningSchedulingInterdependent Scheduling Games
We propose a model of interdependent scheduling games in which each player controls a set of services that they schedule independently. A player is free to schedule his own services at any time; however, each of these se…
SchedulingCyGATE: Game-Theoretic Cyber Attack-Defense Engine for Patch Strategy Optimization
Modern cyber attacks unfold through multiple stages, requiring defenders to dynamically prioritize mitigations under uncertainty. While game-theoretic models capture attacker-defender interactions, existing approaches of…
Joint Optimization of Scheduling and Routing in Multicast Wireless Ad-Hoc Network Using Soft Graph Coloring and Non-linear Cubic Games
In this paper we present matrix game-theoretic models for joint routing, network coding, and scheduling problem. First routing and network coding are modeled by using a new approach based on compressed topology matrix th…
graph partitioningSchedulingBackpressure-based Mean-field Type Game for Scheduling in Multi-Hop Wireless Sensor Networks
We propose a Mean-Field Type Game (MFTG) framework for effective scheduling in multi-hop wireless sensor networks (WSNs) using backpressure as a performance criterion. Traditional backpressure algorithms leverage queue d…
Scheduling