{'fraction_non_alphanumeric': 0.02714535901926445, 'fraction_numerical': 0.0, 'mean_word_length': 5.0476190476190474, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal Centralized Dynamic-Time-Division-Duplex

The study of optimal properties of centralized dynamic-time-division-duplex (D-TDD) employed at a wireless network consisting of multiple nodes is a highly challenging and partially understood problem in the literature. In this paper, we develop an optimal centralized D-TDD scheme for a wireless network comprised of K full-duplex nodes impaired by self-interference and additive white Gaussian noise. As a special case, we also propose the optimal centralized D-TDD scheme when part or all nodes in the wireless network are half-duplex. Thereby, we derive the optimal adaptive scheduling of the reception, transmission, simultaneous reception and transmission, and silence at every node in the network in each time slot such that the rate region of the network is maximized. The performance of the optimal centralized D-TDD can serve as an upper-bound to any other TDD scheme, which is useful in qualifying the relative performance of TDD schemes. The numerical results show that the proposed centralized D-TDD scheme achieves significant rate gains over existing centralized D-TDD schemes.