Open AccessSelf‐organising multiuser matching in cellular networks: a score‐based mutually beneficial approach
Author(s) -
Liu Dianxiong,
Xu Yitao,
Shen Liang,
Xu Yuhua
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0129
Subject(s) - computer science , relay , matching (statistics) , idle , base station , computer network , enhanced data rates for gsm evolution , transmission (telecommunications) , distributed computing , artificial intelligence , telecommunications , statistics , mathematics , power (physics) , physics , quantum mechanics , operating system
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.