Fast Water-Filling Method for Sum-Power Minimization in OFDMA Networks

Taskou, Shiva Kazemi; Rasti, Mehdi

doi:10.1109/lsp.2017.2706970

Cited by 9 publications

(5 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The water-filling method is an optimal solution to power control problems in OFDMA-based cellular networks (Taskou and Rasti, 2017). For battery-constrained Internet of Things (IoT) devices, a critical performance metric for these devices is a measure of the consumption of resource power.…”

Section: Related Workmentioning

confidence: 99%

Power Minimization in Dual-Hop Underlay Cooperative Cognitive Radio Relay Networks for Optimal Resource Allocation

Obayiuwana¹,

Periola²,

Fisusi³

2022

FUOYEJET

View full text Add to dashboard Cite

In this paper, we investigate a multi-user one-way dual-hop multi-relay cognitive radio underlay spectrum sharing network. .The joint optimal resource allocation of the bandwidth and power allocation in underlay Cooperative Cognitive Radio Relay Network (CCRRN) was studied and a convex optimization analytical framework is presented. A combined optimal power and bandwidth allocation (COPBA) scheme for the minimization of the total network power and blocking probability of the call admission control stage of the CCRRN is investigated. Our goal is to jointly optimize the bandwidth and power allocation such that the total transmission power in the CCRRN is minimized without compromising the Quality of Service (QoS) demands of the secondary users (SUs) and the interference constraint thresholds of the primary users (PUs) in the primary networks. The mathematical model and convex optimization problem with the aim of minimizing the total transmission power of the CCRRN was formulated. The resulting optimization problem was solved in the standard computer based numerical optimization solver package CONOPT in MATLAB/TOMLAB environment. Simulation results obtained is compared the equal-bandwidth optimal power allocation scheme. Keywords—Radio resource allocations; Cognitive radio Networks; Convex optimization; Cooperative relay networks, Transmit power minimization

show abstract

Section: Related Workmentioning

confidence: 99%

Power Minimization in Dual-Hop Underlay Cooperative Cognitive Radio Relay Networks for Optimal Resource Allocation

Obayiuwana¹,

Periola²,

Fisusi³

2022

FUOYEJET

View full text Add to dashboard Cite

show abstract

“…The water injection algorithm based on equilibrium Nash game theory (NBF) can well solve the interference collision problem in communication spectrum sharing with different priorities in sparse scenarios 10,11 . In the NBF algorithm, the main user does not participate in the competition of spectrum resources.…”

Section: Analysis Based On Game Theorymentioning

confidence: 99%

A V2V spectral resource allocation scheme in congestion scenarios based on game theory

Wang¹,

Ren²

2022

International Conference on Computer Application and Information Security (ICCAIS 2021)

View full text Add to dashboard Cite

With the increasing number of vehicles and the shortage of spectrum resources, the development of the Internet of vehicles is severely limited. Based on game theory, this paper proposes a dynamic allocation scheme of spectrum resources in the congestion scenario. Different from the traditional spectrum resource allocation scheme, the scheme gives users cognitive ability to realize dynamic and intelligent efficient utilization of spectrum resources without relying on the central node and the mutual transmission of channel information between users. In a dense scenario where the number of wireless resources is less than the number of users, the scheme can automatically screen out the users with more advantageous communication conditions to enhance the overall communication capacity of the system. Simulation results show that the algorithm can automatically filter out the channels with relatively better conditions, and can effectively avoid the interference between different users, which is highly efficient.

show abstract

“…means that the allocated bits Λ b D are quantized with granularities Λ β and is not necessarily integer. It is also important to mention that additional constraints related to hardware limitations, QoS, as well as goals of a specific application can be added to the optimization problems described by (16) and (17). We, however, focus on the aforementioned basic constraints in order to provide understanding of a generic resource allocation procedure for PLC systems.…”

Section: A Bit Loading Algorithmmentioning

confidence: 99%

“…Such algorithm is then responsible for allocating bits and transmission power to the subcarriers given an optimal or suboptimal criterion, satisfying the constraints of the MA or RA problem. Among the most adopted bit loading algorithms in the literature are the water filling (WF) algorithm [16]- [19], Chow's algorithm [20], [21] and the Levin-Campello algorithm [22]- [27]. The WF algorithm provides an optimal allocation in the sense of nonquantized number of bits, whereas the Chow's algorithm and the greedy Levin-Campello algorithm offer allocations in the sense of quantized number of bits [28].…”

Section: Introductionmentioning

confidence: 99%

“…Once that happens, the greedy algorithm interrupts its execution and the number of bits b D,q , as well as the transmission power P D,q are obtained for the N + 1 elements of D i . The procedure performed by this algorithm, i.e., the implementation of the f R A (•) function and therefore the solution for the optimization problem from (16), is represented in Algorithm # 1.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Resource Allocation in HS-OFDM-based PLC Systems: A Tutorial

Oliveira

Colen

Vinck

et al. 2018

JCIS

View full text Add to dashboard Cite

This work organizes and discusses important information on resource allocation in power line communication (PLC) systems based on the Hermitian symmetric orthogonal frequency-division multiplexing scheme. In the context of this work, the term resource refers to bits and transmission power, which can be optimally or sub-optimally allocated to subcarriers on the basis of the knowledge of the normalized signal-tonoise ratio (nSNR) of power line subchannels. In this sense, we thoroughly discuss the formulation of the resource allocation for PLC systems and accordingly derive expressions for the nSNR as well as bit and transmission power allocation in all subchannels. Additionally, we precisely detail greedy algorithms to assist practitioners and researchers in the implementation of the resource allocation procedure. Considering a frequency-selective PLC channel corrupted by additive colored Gaussian noise as well as M-ary pulse amplitude modulation and quadrature amplitude modulation as modulation schemes, the influence of the gap from the Shannon capacity curve on symbol error rate probability is discussed. On top of the carried out discussion, numerical results are presented in order to emphasize the usefulness of a proper comprehension of this subject.

show abstract

Fast Water-Filling Method for Sum-Power Minimization in OFDMA Networks

Cited by 9 publications

References 7 publications

Power Minimization in Dual-Hop Underlay Cooperative Cognitive Radio Relay Networks for Optimal Resource Allocation

Power Minimization in Dual-Hop Underlay Cooperative Cognitive Radio Relay Networks for Optimal Resource Allocation

A V2V spectral resource allocation scheme in congestion scenarios based on game theory

Resource Allocation in HS-OFDM-based PLC Systems: A Tutorial

Contact Info

Product

Resources

About