Optimal centralized dynamic-TDD scheduling scheme for a general network of half-duplex nodes

Mohsen Mohammadkhani Razlighi, Nikola Zlatanov, Petar Popovski

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearch

2 Citations (Scopus)


In this paper, we propose optimal centralized dynamic-time-division-duplex (D-TDD) scheme for a general network comprised of K half-duplex (HD) nodes. Specifically, for this network, we propose optimal adaptive scheduling of the reception, transmission, and silence at every node in each time slot such that the average sum signal-to-interference-plus-noise-ratio (SINR) of the network is maximized. The numerical results show that the proposed optimal centralized D-TDD scheme achieves significant SINR gains over existing centralized D-TDD schemes, especially in small crowded areas. The proposed scheme can act as an upper bound to distributed D-TDD schemes, but it can also be applicable in small crowded areas where gathering of the channel gains of all links may be practical.
Original languageEnglish
Title of host publication2019 IEEE Wireless Communications and Networking Conference (WCNC)
EditorsMuriel Medard, Nelson Fonseca, Ross Murch
Place of PublicationPiscataway NJ USA
PublisherIEEE, Institute of Electrical and Electronics Engineers
Number of pages6
ISBN (Electronic)9781538676462
ISBN (Print)9781538676479
Publication statusPublished - 2019
EventIEEE Wireless Communications and Networking Conference 2019 - Marrakech, Morocco
Duration: 15 Apr 201919 Apr 2019
https://ieeexplore.ieee.org/xpl/conhome/8870904/proceeding (Proceedings)


ConferenceIEEE Wireless Communications and Networking Conference 2019
Abbreviated titleWCNC 2019
Internet address

Cite this