Name
Title | ||
|---|---|---|
On the Convergence and Optimality of Reweighted Message Passing for Channel Assignment Problems |
Abstract | ||
|---|---|---|
Many assignment problems, and channel allocation in OFDMA networks is a typical example, can be formulated as bipartite weighted b-matching (BWBM) problems. In this letter we provide a proof of the convergence and the optimality of the reweighted message passing (ReMP) algorithm when applied to solve BWBM problems in a distributed fashion. To this aim, we first show that the ReMP rule is a contraction mapping under a maximum mapping norm. Then, we show that the fixed convergence point is an optimal solution for the original assignment problem. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/LSP.2014.2337951 | IEEE Signal Process. Lett. |
Keywords | Field | DocType |
contraction mapping,bipartite weighted b-matching problem,reweighted message passing,ofdm modulation,bwbm problem,resource allocation,channel allocation,ofdma networks,frequency division multiple access,remp algorithm,maximum mapping norm,fixed convergence point,message passing,distributed optimization,reweighted message passing algorithm,channel assignment problem | Convergence (routing),Computer science,Communication channel,Theoretical computer science,Message passing | Journal |
Volume | Issue | ISSN |
21 | 11 | 1070-9908 |
Citations | PageRank | References |
1 | 0.37 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marco Moretti | 1 | 138 | 16.56 |
| Andrea Abrardo | 2 | 376 | 47.39 |
| Marco Belleschi | 3 | 120 | 12.39 |