C114门户论坛百科APPEN| 举报 切换到宽版

亚星游戏官网

 找回密码
 注册

只需一步,快速开始

短信验证,便捷登录

搜索
查看: 1777|回复: 0

[技术讨论] 5G通信定位联合资源分配 [复制链接]

军衔等级:

亚星游戏官网-yaxin222  新兵

注册:2020-12-21
发表于 2021-9-18 13:00:23 |显示全部楼层

Resource allocation schemes were designed with many different optimization principles to maximize the system throughput, while the positioning requirement were usually neglected. Correspondingly, according to the user’s data to be transmitted and channel quality indicator, effective resource scheduling algorithm can be designed to maximize some objective function such as proportional fair scheduling.

In 5G era, advanced accurate localization techniques will boost a surge of positioning-based service in many applications. To achieve accurate positioning, more frequency or power-domain resources are required. However, the resource available for positioning is limited in many application scenarios since the primary objective is the communication service. Therefore, resource allocation will be the key issue taking the positioning requirement into consideration.

Some research directions are stated as follows:
l  With limited time-frequency resource available for positioning service, one might minimize resource used while satisfying the positioning accuracy requirements. In multiuser positioning occasions, an effective time-frequency scheduling pattern is necessary to balance the positioning capability and user fairness.
l  Among the resource scheduling schemes for multiuser positioning, differentiated service should be considered to improve the energy efficiency further. In some industrial cases, for instances, with highly accurate and time-sensitive positioning operation executed, more time-frequency resource should be scheduled with high priority.
l  Joint resource allocation to communication and positioning will be a novel research trend, since 5G NR supports more flexible resource scheduling schemes. However, there is more complicated nonconvex optimization problem to be tackled in joint resource allocation. Further, due to computational complexity issue the scheduling schemes prefer closed-form solution. Thus how to deal with the nonconvex optimization problem and deduce effectively approximate solution will be another research issue.


举报本楼

您需要登录后才可以回帖 登录 | 注册 |

手机版|C114 ( 沪ICP备12002291号-1 )|联系大家 |网站地图  

GMT+8, 2024-11-18 07:39 , Processed in 0.105445 second(s), 15 queries , Gzip On.

Copyright © 1999-2023 C114 All Rights Reserved

Discuz Licensed

回顶部
XML 地图 | Sitemap 地图