In this paper we consider coordinated resource allocation over multiple cells in a cellular downlink.We formulate two important coordinated resource allocation problems, both of which account for practical constraints that will be ubiquitous in the emerging fourth generation cellular networks. Observing the formulated problems to be NP hard, we propose low complexity approximation algorithms that yield performance guarantees. These algorithms exploit the fact that either the original problems or some of their sub-problems can be recast as the maximization of a monotonic sub-modular function under a matroid constraint.

Resource Allocation in MIMO Multi-Cellular Networks via Submodular Optimization

VENTURINO, Luca;
2011

Abstract

In this paper we consider coordinated resource allocation over multiple cells in a cellular downlink.We formulate two important coordinated resource allocation problems, both of which account for practical constraints that will be ubiquitous in the emerging fourth generation cellular networks. Observing the formulated problems to be NP hard, we propose low complexity approximation algorithms that yield performance guarantees. These algorithms exploit the fact that either the original problems or some of their sub-problems can be recast as the maximization of a monotonic sub-modular function under a matroid constraint.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11580/20088
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
social impact