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.
Marco, M., Abrardo, A., Marco, B. (2014). On the Convergence and Optimality of Reweighted Message Passing for Channel Assignment Problems. IEEE SIGNAL PROCESSING LETTERS, 21, 1428-1432 [10.1109/LSP.2014.2337951].
On the Convergence and Optimality of Reweighted Message Passing for Channel Assignment Problems
ABRARDO, ANDREA;
2014-01-01
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.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/923042
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo