Radoslaw Kotaba
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Radoslaw Kotaba has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Petar Popovski
Department of Electronic Systems, Aalborg University, Aalborg, Denmark
8 shared publications - Victor Croisfelt
Department of Electronic Systems, Connectivity Section, Aalborg Universitet, Aalborg, Denmark
3 shared publications - Anders Ellersgaard Kalor
Department of Information and Computer Science, Keio University, Yokohama, Japan
2 shared publications - Carles Navarro Manchon
Department of Electronic Systems, Aalborg University, Aalborg, Denmark
2 shared publications - Fabio Saggese
University of Pisa
2 shared publications - Israel Leyva-Mayorga
Connectivity Section Aalborg University Aalborg Denmark
2 shared publications
Latest Publications
- Open Access
- 27 May 2025
- Published by Aalborg University
Radio Access for Ultra-Reliable Communication in 5G Systems and Beyond
- 27 May 2025
- Published by Aalborg University
Open AccessRadio Access for Ultra-Reliable Communication in 5G Systems and Beyond
- 19 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (3) , 1741-1755
Deterministic Patterns for Multiple Access With Latency and Reliability Guarantees
We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by utilizing multiple transmissions ( K -repetition coding). This allows them to achieve diversity and improve the reliability within a certain latency constraint. We focus on two access methods: one where devices choose K slots at random and another one where the access patterns are deterministic and follow a specific code design, namely the Steiner System. We analyze the problem under two signal models that involve different complexity for the receiver. First , collision model is considered, where only interference-free transmissions can be used and combined. Second , a model treating interference as noise is analyzed, where the receiver is capable of utilizing all K replicas, applying maximum ratio combining (MRC). For both signal models, we investigate receivers with and without successive interference cancellation (SIC). We develop approximations and bounds for the outage probabilities that very closely match simulation results. Overall, we show that deterministic access patterns have the potential to significantly outperform random selection in terms of reliability. Furthermore, deterministic access patterns offer a simplified system design.
- 19 September 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 73 (3) , 1741-1755
Deterministic Patterns for Multiple Access With Latency and Reliability Guarantees
We study a scenario in which multiple uncoordinated devices aim to achieve reliable transmissions within a given time frame. The devices are intermittently active and access a shared pool of channel resources in a grant-free manner by utilizing multiple transmissions ( K -repetition coding). This allows them to achieve diversity and improve the reliability within a certain latency constraint. We focus on two access methods: one where devices choose K slots at random and another one where the access patterns are deterministic and follow a specific code design, namely the Steiner System. We analyze the problem under two signal models that involve different complexity for the receiver. First , collision model is considered, where only interference-free transmissions can be used and combined. Second , a model treating interference as noise is analyzed, where the receiver is capable of utilizing all K replicas, applying maximum ratio combining (MRC). For both signal models, we investigate receivers with and without successive interference cancellation (SIC). We develop approximations and bounds for the outage probabilities that very closely match simulation results. Overall, we show that deterministic access patterns have the potential to significantly outperform random selection in terms of reliability. Furthermore, deterministic access patterns offer a simplified system design.
- Open Access
- 17 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 4383-4399
On the Impact of Control Signaling in RIS-Empowered Wireless Communications
The research on Reconfigurable Intelligent Surfaces (RISs) has dominantly been focused on physical-layer aspects and analyses of the achievable adaptation of the wireless propagation environment. Compared to that, questions related to system-level integration of RISs have received less attention. We address this research gap by analyzing the control signaling operations needed to integrate the RIS as a new wireless infrastructure element. As the main contribution of the paper, we build a systematic procedure for evaluating the impact of control operations on communication performance along two dimensions: i) the rate selection for the data channel (multiplexing or diversity), and ii) the allocated bandwidth of the control channels (in-band and out-of-band). Specifically, the first dimension results in two generic transmission paradigms: one focuses on optimizing RIS setting according to the propagation environment, labeled as optimization based on channel estimation (OPT-CE); the other is based on sweeping through predefined RIS phase configurations, labeled as codebook-based beam sweeping (CB-BSW). We analyze the communication performance in multiple setups built along these two dimensions. While necessarily simplified, our analysis reveals the basic trade-offs in RIS-assisted communications and the associated control operations: CB-BSW is better suited for high mobility scenarios since its operation is not conditional on performing channel estimation within the coherence time; OPT-CE performs significantly better when the channel coherence time is sufficiently long, but it requires exchanging more control data, necessitating higher control reliability and profiting more from out-of-band control channel design. Our systematic procedure can be easily adapted to include more complex systems and transmission modes.
- 17 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Open Journal of the Communications Society
- Vol. 5, 4383-4399
Open AccessOn the Impact of Control Signaling in RIS-Empowered Wireless Communications
The research on Reconfigurable Intelligent Surfaces (RISs) has dominantly been focused on physical-layer aspects and analyses of the achievable adaptation of the wireless propagation environment. Compared to that, questions related to system-level integration of RISs have received less attention. We address this research gap by analyzing the control signaling operations needed to integrate the RIS as a new wireless infrastructure element. As the main contribution of the paper, we build a systematic procedure for evaluating the impact of control operations on communication performance along two dimensions: i) the rate selection for the data channel (multiplexing or diversity), and ii) the allocated bandwidth of the control channels (in-band and out-of-band). Specifically, the first dimension results in two generic transmission paradigms: one focuses on optimizing RIS setting according to the propagation environment, labeled as optimization based on channel estimation (OPT-CE); the other is based on sweeping through predefined RIS phase configurations, labeled as codebook-based beam sweeping (CB-BSW). We analyze the communication performance in multiple setups built along these two dimensions. While necessarily simplified, our analysis reveals the basic trade-offs in RIS-assisted communications and the associated control operations: CB-BSW is better suited for high mobility scenarios since its operation is not conditional on performing channel estimation within the coherence time; OPT-CE performs significantly better when the channel coherence time is sufficiently long, but it requires exchanging more control data, necessitating higher control reliability and profiting more from out-of-band control channel design. Our systematic procedure can be easily adapted to include more complex systems and transmission modes.
- 11 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (9) , 2206-2210
Uplink Multiplexing of eMBB/URLLC Services Assisted by Reconfigurable Intelligent Surfaces
This letter proposes a scheme assisted by a reconfigurable intelligent surface (RIS) for efficient uplink traffic multiplexing between enhanced mobile broadband (eMBB) and ultra-reliable-low-latency communication (URLLC). The scheme determines two RIS configurations based only on the eMBB channel state information (CSI) available at the base station (BS). The first optimizes eMBB quality of service, while the second reduces eMBB interference in URLLC traffic by temporarily silencing the eMBB traffic. Numerical results demonstrate that this approach, relying solely on eMBB CSI and without BS coordination, can outperform the state-of-the-art preemptive puncturing by 4.9 times in terms of URLLC outage probability.
- 11 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 28 (9) , 2206-2210
Uplink Multiplexing of eMBB/URLLC Services Assisted by Reconfigurable Intelligent Surfaces
This letter proposes a scheme assisted by a reconfigurable intelligent surface (RIS) for efficient uplink traffic multiplexing between enhanced mobile broadband (eMBB) and ultra-reliable-low-latency communication (URLLC). The scheme determines two RIS configurations based only on the eMBB channel state information (CSI) available at the base station (BS). The first optimizes eMBB quality of service, while the second reduces eMBB interference in URLLC traffic by temporarily silencing the eMBB traffic. Numerical results demonstrate that this approach, relying solely on eMBB CSI and without BS coordination, can outperform the state-of-the-art preemptive puncturing by 4.9 times in terms of URLLC outage probability.
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (12) , 9157-9171
Random Access Protocol With Channel Oracle Enabled by a Reconfigurable Intelligent Surface
The widespread adoption of Reconfigurable Intelligent Surfaces (RISs) in future practical wireless systems is critically dependent on the integration of the RIS into higher-layer protocols beyond the physical (PHY) one, an issue that has received minimal attention in the research literature. In light of this, we consider a classical random access (RA) problem, where uncoordinated users’ equipment (UEs) transmit sporadically to an access point (AP). Differently from previous works, we ponder how a RIS can be integrated into the design of new medium access control (MAC) layer protocols to solve such a problem. We consider that the AP is able to control a RIS to change how its reflective elements are configured, namely, the RIS configurations. Thus, the RIS can be opportunistically controlled to favor the transmission of some of the UEs without the need to explicitly perform channel estimation (CHEST). We embrace this observation and propose a RIS-assisted RA protocol comprised of two modules: Channel Oracle and Access. During channel oracle, the UEs learn how the RIS configurations affect their channel conditions. During the access, the UEs tailor their access policies using the channel oracle knowledge. Our proposed RIS-assisted protocol is able to increase the expected throughput by approximately 60% in comparison to the slotted ALOHA (S-ALOHA) protocol.
- 26 April 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 22 (12) , 9157-9171
Random Access Protocol With Channel Oracle Enabled by a Reconfigurable Intelligent Surface
The widespread adoption of Reconfigurable Intelligent Surfaces (RISs) in future practical wireless systems is critically dependent on the integration of the RIS into higher-layer protocols beyond the physical (PHY) one, an issue that has received minimal attention in the research literature. In light of this, we consider a classical random access (RA) problem, where uncoordinated users’ equipment (UEs) transmit sporadically to an access point (AP). Differently from previous works, we ponder how a RIS can be integrated into the design of new medium access control (MAC) layer protocols to solve such a problem. We consider that the AP is able to control a RIS to change how its reflective elements are configured, namely, the RIS configurations. Thus, the RIS can be opportunistically controlled to favor the transmission of some of the UEs without the need to explicitly perform channel estimation (CHEST). We embrace this observation and propose a RIS-assisted RA protocol comprised of two modules: Channel Oracle and Access. During channel oracle, the UEs learn how the RIS configurations affect their channel conditions. During the access, the UEs tailor their access policies using the channel oracle knowledge. Our proposed RIS-assisted protocol is able to increase the expected throughput by approximately 60% in comparison to the slotted ALOHA (S-ALOHA) protocol.
- 13 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (8) , 5258-5270
Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access
Massive random access plays a central role in supporting the Internet of Things (IoT), where a subset of a large population of users simultaneously transmit small packets to a central base station. While there has been much research on the design of protocols for massive access in the uplink, the problem of providing message acknowledgments back to the users has been somewhat neglected. Reliable communication needs to rely on two-way communication for acknowledgement and retransmission. Nevertheless, because of the many possible subsets of active users, providing acknowledgments requires a significant amount of bits. Motivated by this, we define the problem of massive ARQ (Automatic Retransmission reQuest) protocol and introduce efficient methods for joint encoding of multiple acknowledgements in the downlink. The key idea towards reducing the number of bits used for massive acknowledgments is to allow for a small fraction of false positive acknowledgments. We analyze the implications of this approach and the impact of acknowledgment errors in scenarios with massive random access. Finally, we show that these savings can lead to a significant increase in the reliability when retransmissions are allowed since it allows the acknowledgment message to be transmitted more reliably using a much lower rate.
- 13 June 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 70 (8) , 5258-5270
Common Message Acknowledgments: Massive ARQ Protocols for Wireless Access
Massive random access plays a central role in supporting the Internet of Things (IoT), where a subset of a large population of users simultaneously transmit small packets to a central base station. While there has been much research on the design of protocols for massive access in the uplink, the problem of providing message acknowledgments back to the users has been somewhat neglected. Reliable communication needs to rely on two-way communication for acknowledgement and retransmission. Nevertheless, because of the many possible subsets of active users, providing acknowledgments requires a significant amount of bits. Motivated by this, we define the problem of massive ARQ (Automatic Retransmission reQuest) protocol and introduce efficient methods for joint encoding of multiple acknowledgements in the downlink. The key idea towards reducing the number of bits used for massive acknowledgments is to allow for a small fraction of false positive acknowledgments. We analyze the implications of this approach and the impact of acknowledgment errors in scenarios with massive random access. Finally, we show that these savings can lead to a significant increase in the reliability when retransmissions are allowed since it allows the acknowledgment message to be transmitted more reliably using a much lower rate.
- 8 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (12) , 3795-3799
How to Identify and Authenticate Users in Massive Unsourced Random Access
Identification and authentication are two essential features for traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is massive and relatively small packets are transmitted, the overhead of including such field becomes restrictive. In unsourced random access (U-RA), the packets do not include any address field for the user, which maximizes the number of useful bits that are transmitted. However, by definition an U-RA protocol does not provide user identification. This paper presents a scheme that builds upon an underlying U-RA protocol and solves the problem of user identification and authentication. In our scheme, the users generate a message authentication code (MAC) that provides these functionalities without violating the main principle of unsourced random access: the selection of codewords from a common codebook is i.i.d. among all users.
- 8 October 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 25 (12) , 3795-3799
How to Identify and Authenticate Users in Massive Unsourced Random Access
Identification and authentication are two essential features for traditional random access protocols. In ALOHA-based random access, the packets usually include a field with a unique user address. However, when the number of users is massive and relatively small packets are transmitted, the overhead of including such field becomes restrictive. In unsourced random access (U-RA), the packets do not include any address field for the user, which maximizes the number of useful bits that are transmitted. However, by definition an U-RA protocol does not provide user identification. This paper presents a scheme that builds upon an underlying U-RA protocol and solves the problem of user identification and authentication. In our scheme, the users generate a message authentication code (MAC) that provides these functionalities without violating the main principle of unsourced random access: the selection of codewords from a common codebook is i.i.d. among all users.
- 10 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (3) , 1684-1699
How URLLC Can Benefit From NOMA-Based Retransmissions
Among the new types of connectivity unleashed by the emerging 5G wireless systems, Ultra-Reliable Low Latency Communication (URLLC) is perhaps the most innovative, yet challenging one. Ultra-reliability requires high levels of diversity, however, the reactive approach based on packet retransmission in HARQ protocols should be applied carefully to conform to the stringent latency constraints. The main premise of this paper is that the NOMA principle can be used to achieve highly efficient retransmissions by allowing concurrent use of wireless resources in the uplink. We introduce a comprehensive solution that accommodates multiple intermittently active users, each with its own HARQ process. The performance is investigated under two different assumptions about the Channel State Information (CSI) availability: statistical and instantaneous. The results show that NOMA can indeed lead to highly efficient system operation compared to the case in which all HARQ processes are run orthogonally.
- 10 November 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 20 (3) , 1684-1699
How URLLC Can Benefit From NOMA-Based Retransmissions
Among the new types of connectivity unleashed by the emerging 5G wireless systems, Ultra-Reliable Low Latency Communication (URLLC) is perhaps the most innovative, yet challenging one. Ultra-reliability requires high levels of diversity, however, the reactive approach based on packet retransmission in HARQ protocols should be applied carefully to conform to the stringent latency constraints. The main premise of this paper is that the NOMA principle can be used to achieve highly efficient retransmissions by allowing concurrent use of wireless resources in the uplink. We introduce a comprehensive solution that accommodates multiple intermittently active users, each with its own HARQ process. The performance is investigated under two different assumptions about the Channel State Information (CSI) availability: statistical and instantaneous. The results show that NOMA can indeed lead to highly efficient system operation compared to the case in which all HARQ processes are run orthogonally.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Improving Spectral Efficiency in URLLC via NOMA-Based Retransmissions
The requirement to accommodate ultra-reliable low latency communication (URLLC) is one of the most attractive, yet challenging, new features of upcoming 5G systems. A common way to achieve reliability is retransmission; however, the applicability of this mechanism is hindered by the strict latency requirements. Furthermore, the bandwidth is often limited and shared by multiple connections, which may put the packet into a retransmission queue, leading to even larger latency. We address this problem in an uplink setting by introducing the concept of non-orthogonal multiple access hybrid automatic repeat request (NOMA-HARQ). In essence, NOMA-HARQ allows newly incoming packets to share non-orthogonally the same resource with retransmitted packets. The reliability guarantees are preserved by designing a power optimization procedure that takes into account past transmission attempts as well as the time remaining until the deadline.
- 1 May 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Improving Spectral Efficiency in URLLC via NOMA-Based Retransmissions
The requirement to accommodate ultra-reliable low latency communication (URLLC) is one of the most attractive, yet challenging, new features of upcoming 5G systems. A common way to achieve reliability is retransmission; however, the applicability of this mechanism is hindered by the strict latency requirements. Furthermore, the bandwidth is often limited and shared by multiple connections, which may put the packet into a retransmission queue, leading to even larger latency. We address this problem in an uplink setting by introducing the concept of non-orthogonal multiple access hybrid automatic repeat request (NOMA-HARQ). In essence, NOMA-HARQ allows newly incoming packets to share non-orthogonally the same resource with retransmitted packets. The reliability guarantees are preserved by designing a power optimization procedure that takes into account past transmission attempts as well as the time remaining until the deadline.