Abstract
AbstractBased on matching game theory, this paper puts forward a novel‐distributed relay‐assignment approach to optimise the throughput satisfaction of source nodes, which is scarcely investigated in former works. The assignment problem is modelled as a matching market, where source nodes apply to relay nodes according to their throughput requirements, in the meantime, relay nodes obtain pay offs by assisting source nodes to transmit data. The proposed game appears in the category of matching games with both peer effects and dynamic quotas. The choice of each source node is related to not only the quality of channel gain but also the results of other source nodes choices. Dynamic quotas of matching game are considered because of the limited resource of relay nodes and dynamic requirements of source nodes, which adds difficulty of relay assignment. To address this issue, a novel self‐organising matching approach is proposed. Then, the proposed algorithm is proved to converge to a two‐sided stable matching between source nodes and relay nodes. Shown in the simulation results, the proposed distributed matching algorithm outperforms the existing schemes in terms of both global satisfaction and fairness within a reasonable convergence time. Copyright © 2016 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Transactions on Emerging Telecommunications Technologies
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.