1,323 research outputs found
A goal programming methodology for multiobjective optimization of distributed energy hubs operation
This paper addresses the problem of optimal energy flow management in multicarrier energy networks
in the presence of interconnected energy hubs. The overall problem is here formalized by a nonlinear
constrained multiobjective optimization problem and solved by a goal attainment based methodology.
The application of this solution approach allows the analyst to identify the optimal operation state of the
distributed energy hubs which ensures an effective and reliable operation of the multicarrier energy
network in spite of large variations of load demands and energy prices. Simulation results obtained on
the 30 bus IEEE test network are presented and discussed in order to demonstrate the significance and
the validity of the proposed method
Low Complexity WMMSE Power Allocation In NOMA-FD Systems
In this paper we study the problem of power and channel allocation with the
objective of maximizing the system sum-rate for multicarrier non-orthogonal
multiple access (NOMA) full duplex (FD) systems. Such an allocation problem is
non-convex and, thus, with the goal of designing a low complexity solution, we
propose a scheme based on the minimization of the weighted mean square error,
which achieves performance reasonably close to the optimum and allows to
clearly outperforms a conventional orthogonal multiple access approach.
Numerical results assess the effectiveness of our algorithm.Comment: 5 pages conference paper, 3 figures. Submitted on ICASSP 202
Distributive Power Control Algorithm for Multicarrier Interference Network over Time-Varying Fading Channels - Tracking Performance Analysis and Optimization
Distributed power control over interference limited network has received an
increasing intensity of interest over the past few years. Distributed solutions
(like the iterative water-filling, gradient projection, etc.) have been
intensively investigated under \emph{quasi-static} channels. However, as such
distributed solutions involve iterative updating and explicit message passing,
it is unrealistic to assume that the wireless channel remains unchanged during
the iterations. Unfortunately, the behavior of those distributed solutions
under \emph{time-varying} channels is in general unknown. In this paper, we
shall investigate the distributed scaled gradient projection algorithm (DSGPA)
in a pairs multicarrier interference network under a finite-state Markov
channel (FSMC) model. We shall analyze the \emph{convergence property} as well
as \emph{tracking performance} of the proposed DSGPA. Our analysis shows that
the proposed DSGPA converges to a limit region rather than a single point under
the FSMC model. We also show that the order of growth of the tracking errors is
given by \mathcal{O}\(1 \big/ \bar{N}\), where is the \emph{average
sojourn time} of the FSMC. Based on the analysis, we shall derive the
\emph{tracking error optimal scaling matrices} via Markov decision process
modeling. We shall show that the tracking error optimal scaling matrices can be
implemented distributively at each transmitter. The numerical results show the
superior performance of the proposed DSGPA over three baseline schemes, such as
the gradient projection algorithm with a constant stepsize.Comment: To Appear on the IEEE Transaction on Signal Processin
Novel Optimization to Reduce Power Drainage in Mobile Devices for Multicarrier-based Communication
With increasing adoption of multicarrier-based communications e.g. 3G and 4G, the users are significantly benefited with impressive data rate but at the cost of battery life of their mobile devices. We reviewed the existing techniques to find an open research gap in this regard. This paper presents a novel framework where an optimization is carried out with the objective function to maintain higher level of equilibrium between maximized data delivery and minimized transmit power. An analytical model considering multiple radio antennae in the mobile device is presented with constraint formulations of data quality and threshold power factor. The model outcome is evaluated with respect to amount of power being conserved as performance factor. The study was found to offer maximum energy conservation and the framework also suits well with existing communication system of mobile networks
Weighted Sum Rate Maximization for Downlink OFDMA with Subcarrier-pair based Opportunistic DF Relaying
This paper addresses a weighted sum rate (WSR) maximization problem for
downlink OFDMA aided by a decode-and-forward (DF) relay under a total power
constraint. A novel subcarrier-pair based opportunistic DF relaying protocol is
proposed. Specifically, user message bits are transmitted in two time slots. A
subcarrier in the first slot can be paired with a subcarrier in the second slot
for the DF relay-aided transmission to a user. In particular, the source and
the relay can transmit simultaneously to implement beamforming at the
subcarrier in the second slot. Each unpaired subcarrier in either the first or
second slot is used for the source's direct transmission to a user. A benchmark
protocol, same as the proposed one except that the transmit beamforming is not
used for the relay-aided transmission, is also considered. For each protocol, a
polynomial-complexity algorithm is developed to find at least an approximately
optimum resource allocation (RA), by using continuous relaxation, the dual
method, and Hungarian algorithm. Instrumental to the algorithm design is an
elegant definition of optimization variables, motivated by the idea of
regarding the unpaired subcarriers as virtual subcarrier pairs in the direct
transmission mode. The effectiveness of the RA algorithm and the impact of
relay position and total power on the protocols' performance are illustrated by
numerical experiments. The proposed protocol always leads to a maximum WSR
equal to or greater than that for the benchmark one, and the performance gain
of using the proposed one is significant especially when the relay is in close
proximity to the source and the total power is low. Theoretical analysis is
presented to interpret these observations.Comment: 8 figures, accepted and to be published in IEEE Transactions on
Signal Processing. arXiv admin note: text overlap with arXiv:1301.293
Energy-Aware Competitive Power Allocation for Heterogeneous Networks Under QoS Constraints
This work proposes a distributed power allocation scheme for maximizing
energy efficiency in the uplink of orthogonal frequency-division multiple
access (OFDMA)-based heterogeneous networks (HetNets). The user equipment (UEs)
in the network are modeled as rational agents that engage in a non-cooperative
game where each UE allocates its available transmit power over the set of
assigned subcarriers so as to maximize its individual utility (defined as the
user's throughput per Watt of transmit power) subject to minimum-rate
constraints. In this framework, the relevant solution concept is that of Debreu
equilibrium, a generalization of Nash equilibrium which accounts for the case
where an agent's set of possible actions depends on the actions of its
opponents. Since the problem at hand might not be feasible, Debreu equilibria
do not always exist. However, using techniques from fractional programming, we
provide a characterization of equilibrial power allocation profiles when they
do exist. In particular, Debreu equilibria are found to be the fixed points of
a water-filling best response operator whose water level is a function of
minimum rate constraints and circuit power. Moreover, we also describe a set of
sufficient conditions for the existence and uniqueness of Debreu equilibria
exploiting the contraction properties of the best response operator. This
analysis provides the necessary tools to derive a power allocation scheme that
steers the network to equilibrium in an iterative and distributed manner
without the need for any centralized processing. Numerical simulations are then
used to validate the analysis and assess the performance of the proposed
algorithm as a function of the system parameters.Comment: 37 pages, 12 figures, to appear IEEE Trans. Wireless Commu
- …