{'fraction_non_alphanumeric': 0.026402640264026403, 'fraction_numerical': 0.0019801980198019802, 'mean_word_length': 5.369747899159663, '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}}
ITLinQ: A New Approach for Spectrum Sharing in Device-to-Device Communication Systems

We consider the problem of spectrum sharing in device-to-device communication systems. Inspired by the recent optimality condition for treating interference as noise, we define a new concept of information-theoretic independent sets (ITISs), which indicates the sets of links for which simultaneous communication and treating the interference from each other as noise is information-theoretically optimal (to within a constant gap). Based on this concept, we develop a new spectrum sharing mechanism, called information-theoretic link scheduling (ITLinQ), which at each time schedules those links that form an ITIS. We first provide a performance guarantee for ITLinQ by characterizing the fraction of the capacity region that it can achieve in a network with sources and destinations randomly located within a fixed area. Furthermore, we demonstrate how ITLinQ can be implemented in a distributed manner, using an initial two-phase signaling mechanism that provides the required channel state information at all the links. Through numerical analysis, we show that distributed ITLinQ can outperform similar state-of-the-art spectrum sharing mechanisms, such as FlashLinQ, by more than 100% of sum-rate gain, while keeping the complexity at the same level. Finally, we discuss a variation of the distributed ITLinQ scheme, which can also guarantee fairness among the links in the network and numerically evaluate its performance.