首页> 外文期刊>Communications, IET >Self-organising multiuser matching in cellular networks: a score-based mutually beneficial approach
【24h】

Self-organising multiuser matching in cellular networks: a score-based mutually beneficial approach

机译:蜂窝网络中的自组织多用户匹配:基于分数的互利方法

获取原文
获取原文并翻译 | 示例
           

摘要

In this study, the authors study the self-organising user assignment problem for the multi-user cooperation network. In the cellular network with user cooperation, idle users near the base station are seen as potential relay nodes, which can assist cell edge users to transmit data. Practically, the selfish nature of users is considered in the authors' model. They design a score-based system, where the strategies of relay assignment are affected by the historical behaviours of users. That means not only the transmission performance, but also the accumulative contributions of users are considered. The proposed score-based system sufficiently encourages idle users to assist active users. Furthermore, the multi-user assignment problem is formulated as a one-to-one matching game, in which idle users and active users rank one another individually based on their own preference. To address the issue, they propose a self-organising mutually beneficial matching algorithm, which is proven to converge to a stable matching. Simulation results show that the proposed distributed algorithm yields well matching performance between source users and relay users, which is close to the optimal centralised results.
机译:在这项研究中,作者研究了多用户协作网络的自组织用户分配问题。在与用户合作的蜂窝网络中,基站附近的空闲用户被视为潜在的中继节点,可以帮助小区边缘用户传输数据。实际上,在作者的模型中考虑了用户的自私性质。他们设计了一个基于分数的系统,其中中继分配策略受用户的历史行为影响。这意味着不仅要考虑传输性能,还要考虑用户的累积贡献。所提出的基于分数的系统充分鼓励空闲用户来协助活跃用户。此外,将多用户分配问题表述为一对一的匹配游戏,其中空闲用户和活动用户根据自己的偏好分别进行排名。为了解决这个问题,他们提出了一种自组织互惠的匹配算法,该算法被证明可以收敛到稳定的匹配。仿真结果表明,所提出的分布式算法在源用户和中继用户之间具有良好的匹配性能,接近最优的集中结果。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号