Decentralized Learning-Based Relay Assignment for Cooperative Communications

Chen, Zanyu; Lin, Tsung-Nan; Wu, Chun-Lin

doi:10.1109/tvt.2015.2399653

Cited by 43 publications

(29 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More related works on relay assignment in cooperative communication can be find in [7,9]. The concept of CC can be traced back to the threeterminal relay channel in [10].…”

Section: Related Workmentioning

confidence: 99%

“…Both models in [17,18,20] are applied into the scenario with one source-destination pair and multiple relay nodes. Learning-based relay selection was used to maximize transmission efficiency [21] and network capacity [7]. The objective of [7] is same as ours and the proposed solution is distributed.…”

Section: Related Workmentioning

confidence: 99%

“…Learning-based relay selection was used to maximize transmission efficiency [21] and network capacity [7]. The objective of [7] is same as ours and the proposed solution is distributed. The main differences between our work and [7] are follows: (1) we formulate the relay selection problem as a congestion game and analyze its properties; (2) we propose a fully distributed solution which is simpler than [7] to obtain the stable solution.…”

Section: Related Workmentioning

confidence: 99%

“…However, these centralized methods will make the optimization problem become complicated, especially in a large-scale network. Therefore, some decentralized algorithms such as [7,8] were proposed, and they still had disadvantages. Specifically, source nodes needed to get the information of other selections in [7].…”

Section: Introductionmentioning

confidence: 99%

“…Therefore, some decentralized algorithms such as [7,8] were proposed, and they still had disadvantages. Specifically, source nodes needed to get the information of other selections in [7]. In [8], the final decision on the relay node selection among multiple feasible ones is still made in a centralized manner.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A game theoretic learning solution for distributed relay selection on throughput optimization

et al. 2016

View full text Add to dashboard Cite

In this paper, we study the problem of distributed relay selection in wireless networks using a game theoretic approach. Specifically, we consider a system model where one relay node can be shared by multiple source-destination pairs. Our objective is to find the relay selections of source nodes to optimize the total capacity. The relay selection problem is formulated as a congestion game with player-specific payoff functions and the existence of Nash equilibrium (NE) is demonstrated. Then we propose a stochastic learning automata (SLA) based distributed relay selection approach to obtain the NE without information exchange among source nodes. Simulation results show that the proposed distributed relay selection approach achieves satisfactory performance, when compared with other solutions.

show abstract

“…More related works on relay assignment in cooperative communication can be find in [7,9]. The concept of CC can be traced back to the threeterminal relay channel in [10].…”

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A game theoretic learning solution for distributed relay selection on throughput optimization

et al. 2016

View full text Add to dashboard Cite

show abstract

Distributed satisfaction‐aware relay assignment: a novel matching‐game approach

Liu

et al. 2016

Trans. Emerging Tel. Tech.

View full text Add to dashboard Cite

Based 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.

show abstract

Learning-based multi-relay selection for cooperative networks based on compressed sensing

Chang

2019

Wireless Netw

View full text Add to dashboard Cite

Decentralized Learning-Based Relay Assignment for Cooperative Communications

Cited by 43 publications

References 41 publications

A game theoretic learning solution for distributed relay selection on throughput optimization

A game theoretic learning solution for distributed relay selection on throughput optimization

Distributed satisfaction‐aware relay assignment: a novel matching‐game approach

Learning-based multi-relay selection for cooperative networks based on compressed sensing

Contact Info

Product

Resources

About