Use este identificador para citar ou linkar para este item: http://repositorio.ufc.br/handle/riufc/70643
Tipo: Artigo de Periódico
Título: A semi-distributed approach for uplink max-min energy efficiency optimization with minimum user satisfaction and adjacency constraints
Autor(es): Braga Júnior, Iran Mesquita
Lima, Francisco Rafael Marques
Maciel, Tarcísio Ferreira
Monteiro, Victor Farias
Palavras-chave: Energy efficiency;SC-FDMA;QoS
Data do documento: 2021
Instituição/Editor/Publicador: Journal of Communication and Information Systems
Citação: MACIEL, T. F. et al. A semi-distributed approach for uplink max-min energy efficiency optimization with minimum user satisfaction and adjacency constraints. Journal of Communication and Information Systems, [s.l.], v. 36, n. 1, p. 85-89, 2021. DOI: https://doi.org/10.14209/jcis.2021.9
Abstract: Maximizing energy efficiency is one of the pillars of modern networks. In this context, we consider in this letter a nonlinear max-min energy efficiency problem in the uplink of wireless networks. Due to the problem nonlinearity we resort to epigraph form so as to obtain an integer linear problem and to propose a centralized optimal solution for it using a branch-and-bound algorithm. Also because distributed solutions are useful to deal with high computational processing and scalability problems, we propose a low-complexity semi-distributed solution for the problem using a specific signaling scheme. Simulations show that the proposed semi-distributed solution performs closely to the centralized optimal scheme and outperforms state-of-the-art algorithms in terms of energy efficiency and outage rate.
URI: http://www.repositorio.ufc.br/handle/riufc/70643
ISSN: 1980-6604
Aparece nas coleções:DETE - Artigos publicados em revista científica

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
2021_art_tfmaciel.pdf216,15 kBAdobe PDFVisualizar/Abrir


Os itens no repositório estão protegidos por copyright, com todos os direitos reservados, salvo quando é indicado o contrário.