Power allocation in small cell networks with full-duplex self-backhauls and massive MIMO

Chen, Lei; Yu, F. Richard; Ji, Hong; Rong, Bo; Leung, Victor C. M.

doi:10.1007/s11276-016-1381-1

Cited by 7 publications

(2 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to deal with the max function in T n (h, g), we introduce an arbitrary positive variable t and equivalently reformulate problem (11) as follows:…”

Section: Delivery Time Minimizationmentioning

confidence: 99%

“…Meanwhile, full-duplex (FD) has shown great potential as the transmission technique for the next generation wireless networks [10,11]. Thanks to recent developments in the self-interference cancellation, FD can potentially double the spectral efficiency by allowing a node to transmit and receive signals at the same resource block simultaneously [12].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Cache-aided full-duplex: delivery time analysis and optimization

Trinh

Chatzinotas

et al. 2020

Wireless Netw

View full text Add to dashboard Cite

Edge caching has received much attention as a promising technique to overcome the stringent latency and data-hungry challenges in the future generation wireless networks. Meanwhile, full-duplex (FD) transmission can improve the spectral efficiency by allowing a node to receive and transmit on the same frequency band simultaneously. In this paper, we investigate the delivery time performance of a cache-aided FD system, in which an edge node, operates in FD mode, serves users via wireless channels and is equipped with a cache memory. Firstly, we derive a closed-form expression for the average delivery time by taking into account the uncertainties of both backhaul and access wireless channels. The derived analysis allows the examination of the impact of the key parameters, e.g., cache size and transmit power. Secondly, a power optimization problem is formulated to minimize the average delivery time. To deal with the non-convexity of the formulated problem, we propose an iterative optimization algorithm based on the bisection method. Finally, numerical results are presented to demonstrate the effectiveness of the pro-

show abstract

“…In order to deal with the max function in T n (h, g), we introduce an arbitrary positive variable t and equivalently reformulate problem (11) as follows:…”

Section: Delivery Time Minimizationmentioning

confidence: 99%