This paper considers distributed protocol design for resource allocation (RA) problems. We propose a fully decentralized RA scheme based on the min-sum message passing (MP) approach in which each message is the solution of small distributed allocation problems. Due to the presence of cycles in the network graph, the MP routine may not converge to a fixed point. To this end, we introduce a reweighted MP (ReMP) algorithm that perturbs the ordinary min-sum algorithm by suitably re-weighting messages. ReMP distributes the computational effort of achieving an optimal RA among nodes. Such feature makes ReMP particularly attractive in wireless networks allowing the convergence to a fixed and provably optimum point without employing any central controller. Numerical results show that ReMP outperforms conventional MP-based algorithms for RA problems in terms of computation time.
Abrardo, A., Belleschi, M., Detti, P., Moretti, M. (2011). A min-sum approach for resource allocation in communication systems. In 2011 IEEE International Conference on Communications (ICC) (pp.1-6). New York : IEEE [10.1109/icc.2011.5962573].
A min-sum approach for resource allocation in communication systems
ABRARDO, ANDREA;DETTI, PAOLO;
2011-01-01
Abstract
This paper considers distributed protocol design for resource allocation (RA) problems. We propose a fully decentralized RA scheme based on the min-sum message passing (MP) approach in which each message is the solution of small distributed allocation problems. Due to the presence of cycles in the network graph, the MP routine may not converge to a fixed point. To this end, we introduce a reweighted MP (ReMP) algorithm that perturbs the ordinary min-sum algorithm by suitably re-weighting messages. ReMP distributes the computational effort of achieving an optimal RA among nodes. Such feature makes ReMP particularly attractive in wireless networks allowing the convergence to a fixed and provably optimum point without employing any central controller. Numerical results show that ReMP outperforms conventional MP-based algorithms for RA problems in terms of computation time.File | Dimensione | Formato | |
---|---|---|---|
ICC2011Minsum.pdf
non disponibili
Tipologia:
PDF editoriale
Licenza:
NON PUBBLICO - Accesso privato/ristretto
Dimensione
217.72 kB
Formato
Adobe PDF
|
217.72 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/30482