Joint Transmission (JT) is the dynamic coordination of transmission and/or reception at multiple geographically separated sites to improve end-user service quality. When user equipment receives signals from multiple sites, downstream performance improves. An optimization problem arises in selecting the best user subset for JT within a multiple-input–multiple-output (MIMO) system. Unfortunately, a pure brute-force approach is not feasible due to exponential time growth with user combinations, unsuitable for real-time selection in mobile networks with users continuously changing in time. This article proposes quantum-compliant heuristics using quadratic unconstrained binary optimization (QUBO) for JT user scheduling. QUBO handles initial user selection, followed by brute-force exploration for the solution. Numerical results indicate that quantum-compliant methods decrease solution time without substantial accuracy loss compared to brute-force methods.
Quantum-compliant users scheduling optimization in joint transmission mobile access networks / Volpe, Deborah; Cirillo, Giovanni Amedeo; Fantini, Roberto; Boella, Andrea; Mondo, Giovanni; Graziano, Mariagrazia; Turvani, Giovanna. - In: QUANTUM INFORMATION PROCESSING. - ISSN 1570-0755. - ELETTRONICO. - 23:7(2024). [10.1007/s11128-024-04471-1]
Quantum-compliant users scheduling optimization in joint transmission mobile access networks
Volpe, Deborah;Cirillo, Giovanni Amedeo;Graziano, Mariagrazia;Turvani, Giovanna
2024
Abstract
Joint Transmission (JT) is the dynamic coordination of transmission and/or reception at multiple geographically separated sites to improve end-user service quality. When user equipment receives signals from multiple sites, downstream performance improves. An optimization problem arises in selecting the best user subset for JT within a multiple-input–multiple-output (MIMO) system. Unfortunately, a pure brute-force approach is not feasible due to exponential time growth with user combinations, unsuitable for real-time selection in mobile networks with users continuously changing in time. This article proposes quantum-compliant heuristics using quadratic unconstrained binary optimization (QUBO) for JT user scheduling. QUBO handles initial user selection, followed by brute-force exploration for the solution. Numerical results indicate that quantum-compliant methods decrease solution time without substantial accuracy loss compared to brute-force methods.File | Dimensione | Formato | |
---|---|---|---|
s11128-024-04471-1.pdf
accesso aperto
Descrizione: pubblicato
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Creative commons
Dimensione
2.04 MB
Formato
Adobe PDF
|
2.04 MB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/2990740