Time efficient k-shot broadcasting in known topology radio networks

The paper considers broadcasting protocols in radio networks with known topology that are efficient in both time and energy. The radio network is modelled as an undirected graph G = (V, E) where |V| = n. It is assumed that during execution of the communication task every node in V is allowed to transmit at most once. Under this assumption it is shown that any radio broadcast protocol requires transmission rounds, where D is the diameter of G. This lower bound is complemented with an efficient construction of a deterministic protocol that accomplishes broadcasting in rounds. Moreover, if we allow each node to transmit at most k times, the lower bound on the number of transmission rounds holds. We also provide a randomised protocol that accomplishes broadcasting in rounds. The paper concludes with a number of open problems in the area. The research of L. Gąsieniec, D.R. Kowalski and C. Su supported in part by the Royal Society grant Algorithmic and Combinatorial Aspects of Radio Communication, IJP - 2006/R2. The research of E. Kantor and D. Peleg supported in part by grants from the Minerva Foundation and the Israel Ministry of Science.     

Physical layer enhancements in 5G-NR for direct access via satellite systems

Among the several features and capabilities introduced by every new 3GPP release on 5G cellular systems, the latest Release 17 will be remembered as the first that specifies a set of enhancements and adaptations to support mobile broadband services via satellite direct access. Specifically focused on the necessary physical layer mechanism and procedure modifications, this paper will present in detail the 3GPP work about the inclusion of satellite systems in 5G networks.     

On the performance of BICM with mapping diversity in hybrid ARQ

Hybrid ARQ with packet combining for high‐order modulations (such as 16‐QAM) may be significantly enhanced if the bits‐to‐symbols mappings are appropriately changed throughout the transmissions. In this paper, we analyze the relationship between such mapping diversity and channel coding. We calculate the capacity of the popular bit‐interleaved‐coded modulation (BICM) to draw qualitative and approximate quantitative conclusions that are valid for strong codes approaching the capacity limits. We conclude that the choice/design of the appropriate mapping depends on the targeted spectral efficiency and we demonstrate that certain forms of mapping diversity may be counterproductive. We also show that iterative demapping may be successfully applied to significantly reduce (by more than 1 dB) the gap between the BICM and coded modulations (CM) capacities. The analysis is illustrated with results obtained when the mapping diversity is combined with practical turbo codes. Copyright © 2007 John Wiley & Sons, Ltd.