A Dynamic Clustering Algorithm for Multi-Point Transmissions in Mission-Critical Communications

Daher, Alaa; Coupechoux, Marceau; Godlewski, Philippe; Ngouat, Pierre; Minot, Pierre

doi:10.1109/twc.2020.2988382

Cited by 12 publications

(8 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The main aim of this study is to maximize the minimum rate among all users and limit the cooperating cluster size without hurting the achievable common rate. In [34], a dynamic CoMP clustering algorithm is presented, aiming to maximize the group average SINR under the constraint of maximum target cell blocking probabilities for group communications in Mission-Critical Communications. The authors consider a dynamic traffic model and analyze the trade-off between high SINR and network capacity.…”

Section: Related Work and Contribution A Related Studiesmentioning

confidence: 99%

Coalition Formation Games for Improved Cell-Edge User Service in Downlink NOMA and MU-MIMO Small Cell Systems

et al. 2021

View full text Add to dashboard Cite

In today's wireless communication systems, the exponentially growing needs of mobile users require the combination of new and existing techniques to meet the demands for reliable and high-quality service provision. This may not always be possible, as the resources in wireless telecommunication systems are limited and a significant number of users, usually located at the cell edges, can suffer from severe interference. For this purpose, a new Joint Transmission Coordinated Multipoint (JT-CoMP) scheme, in which the transmission points' clustering is based on a coalition formation game, is deployed alongside with Non-Orthogonal Multiple Access (NOMA) in a Cloud Radio Access Network (C-RAN) consisting of small cells. To further enhance the network's performance, Multiuser Multiple-Input Multiple-Output (MU-MIMO) with Zero-Forcing (ZF) beamforming is applied. The proposed scheme's performance, in terms of user throughput, is then compared to that of a scheme where JT-CoMP with static clustering is selected, a JT-CoMP scheme with clustering based on a greedy algorithm and a scenario where JT-CoMP is not deployed. Simulation results confirm that the proposed scheme reliably improves the throughput of users with poor wireless channels while guaranteeing that the performance of the rest is not severely undermined.

show abstract

Section: Related Work and Contribution A Related Studiesmentioning

confidence: 99%

Coalition Formation Games for Improved Cell-Edge User Service in Downlink NOMA and MU-MIMO Small Cell Systems

et al. 2021

View full text Add to dashboard Cite

show abstract

“…However, realistic channel parameters and possible resource scarcity for the UEs are not considered. In [24], a dynamic CoMP clustering algorithm is presented, aiming to maximize group average SINR under the constraint of maximum target cell blocking probabilities for group communications in Mission-Critical Communications. The authors consider a dynamic traffic model and analyze the trade-off between high SINR and network capacity.…”

Section: Background and Contribution A Related Studiesmentioning

confidence: 99%

Coalition Formation Games for Coordinated Service in Realistic Small Cell Propagation Topologies

et al. 2020

View full text Add to dashboard Cite

The densification of modern wireless networks into a dense ecosystem of small cells imposes challenges for the reliable service and high quality of experience of its users as it can result into severe intercell interference, especially for users scattered on the cell edges. Joint Transmission Coordinated Multipont (JT-CoMP) is a technique that can be deployed to form cooperating clusters of transmission points, enabling them to jointly transmit data to significantly mitigate this type of interference for these users. However, JT-CoMP stresses the backhaul links and radio resources are limited, meaning that, with incautious clustering, the data rates for cell edge users may not improve, while the data rates for the non-cell edge users may severely decrease. To tackle these drawbacks, a dynamic coalition formation algorithm is proposed to form the appropriate transmission point clusters to implement JT-CoMP. Furthermore, to ensure reliable service for all the network's users, the case where JT-CoMP is enhanced with the capability to serve users based on their selected application is examined. The proposed scheme's adaptability and capability to increase cell edge user throughput is then tested and compared to the non JT-CoMP case, a JT-CoMP scheme with static clustering and a JT-CoMP scheme with greedy clustering for a user mobility scenario. To obtain more reliable and accurate results of the JT-CoMP deployment, physical layer parameters retrieved from a fully deterministic physical layer radio planning tool (TruNET wireless) are imported for our simulations.

show abstract

“…This reference neither include the security issue nor the norm-bounded error model. The system level performance evaluation is based on the work of [8], but this reference, which proposes a clustering algorithm for MCC, does not implement any MIMO transceiver design.…”

Section: A Related Workmentioning

confidence: 99%

“…On the contrary, when BSs transmit independently, we have a Single-Cell Point-to-Multipoint (SC-PTM) transmission [6]. Dynamic clustering, offering a good trade-off between MBSFN and SC-PTM is gaining popularity in the literature [7], [8]. This motivates our scenario of a multicast transmission from multiple BSs towards a group of users and provides us with a framework for system level evaluations.…”

mentioning

confidence: 99%

Secure and Robust MIMO Transceiver for Multicast Mission Critical Communications

Jagyasi¹,

Coupechoux²

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Mission-critical communications (MCC) involve all communications between people in charge of the safety of the civil society. MCC have unique requirements that include improved reliability, security and group communication support. In this paper, we propose a secure and robust Multiple-Input-Multiple-Output (MIMO) transceiver, designed for multiple Base Stations supporting multicast MCC in presence of multiple eavesdroppers. We formulate minimization problems with the Sum-Mean-Square-Error (SMSE) at legitimate users as an objective function, and a lower bound for the MSE at eavesdroppers as a constraint. Security is achieved thanks to physical layer security mechanisms, namely MIMO beamforming and Artificial Noise (AN). Reliability is achieved by designing a system which is robust to Channel State Information errors. They can be of known distribution or norm-bounded. In the former case, a coordinate descent algorithm is proposed to solve the problem. In the latter case, we propose an worst-case based iterative algorithm. Numerical results at physical layer and system level reveal the crucial role of robust designs for reliable MCC. We show the interest of both robust design and AN to improve the security gap. We show that full BS cooperation in preferred for highly secured and reliable MCC but dynamic clustering allows to trade-off security and reliability against capacity.

show abstract

A Dynamic Clustering Algorithm for Multi-Point Transmissions in Mission-Critical Communications

Cited by 12 publications

References 25 publications

Coalition Formation Games for Improved Cell-Edge User Service in Downlink NOMA and MU-MIMO Small Cell Systems

Coalition Formation Games for Improved Cell-Edge User Service in Downlink NOMA and MU-MIMO Small Cell Systems

Coalition Formation Games for Coordinated Service in Realistic Small Cell Propagation Topologies

Secure and Robust MIMO Transceiver for Multicast Mission Critical Communications

Contact Info

Product

Resources

About