604 research outputs found
Guest Editorial: Nonlinear Optimization of Communication Systems
Linear programming and other classical optimization techniques have found important applications in communication systems for many decades. Recently, there has been a surge in research activities that utilize the latest developments in nonlinear optimization to tackle a much wider scope of work in the analysis and design of communication systems. These activities involve every “layer” of the protocol stack and the principles of layered network architecture itself, and have made intellectual and practical impacts significantly beyond the established frameworks of optimization of communication systems in the early 1990s. These recent results are driven by new demands in the areas of communications and networking, as well as new tools emerging from optimization theory. Such tools include the powerful theories and highly efficient computational algorithms for nonlinear convex optimization, together with global solution methods and relaxation techniques for nonconvex optimization
Resource allocation and optimization techniques in wireless relay networks
Relay techniques have the potential to enhance capacity and coverage of a wireless network. Due to rapidly increasing number of smart phone subscribers and high demand for data intensive multimedia applications, the
useful radio spectrum is becoming a scarce resource. For this reason, two way relay network and cognitive radio technologies are required for better utilization of radio spectrum. Compared to the conventional one way relay
network, both the uplink and the downlink can be served simultaneously using a two way relay network. Hence the effective bandwidth efficiency is considered to be one time slot per transmission. Cognitive networks are wireless networks that consist of different types of users, a primary user (PU, the primary license holder of a spectrum band) and secondary users (SU, cognitive radios that opportunistically access the PU spectrum). The
secondary users can access the spectrum of the licensed user provided they do not harmfully affect to the primary user. In this thesis, various resource
allocation and optimization techniques have been investigated for wireless relay and cognitive radio networks
Dynamic Resource Allocation in Cognitive Radio Networks: A Convex Optimization Perspective
This article provides an overview of the state-of-art results on
communication resource allocation over space, time, and frequency for emerging
cognitive radio (CR) wireless networks. Focusing on the
interference-power/interference-temperature (IT) constraint approach for CRs to
protect primary radio transmissions, many new and challenging problems
regarding the design of CR systems are formulated, and some of the
corresponding solutions are shown to be obtainable by restructuring some
classic results known for traditional (non-CR) wireless networks. It is
demonstrated that convex optimization plays an essential role in solving these
problems, in a both rigorous and efficient way. Promising research directions
on interference management for CR and other related multiuser communication
systems are discussed.Comment: to appear in IEEE Signal Processing Magazine, special issue on convex
optimization for signal processin
Throughput maximization in linear multiuser MIMO-OFDM downlink systems
In this paper, we study the problem of maximizing the throughput of a multiuser multiple-input-multiple-output orthogonal frequency-division multiplexing (MIMO-OFDM) system in the downlink with a total power constraint using a beamforming approach. An iterative algorithm that takes turns to optimize, jointly among users, the power allocation in the downlink, the transmit and the receive beamforming antenna vectors, and the power allocation in the virtual uplink is proposed. The algorithm is proved to converge, and the throughput increases from one iteration to the next. In addition to the total power constraint, the proposed algorithm is also capable of handling individual users' rate constraints. To reduce complexity, a geometric-programming-based power control in the high signal-to-interference-plus-noise ratio (SINR) region and an orthogonal frequency-division multiple-access scheme in the low SINR region are proposed. Numerical results illustrate that the proposed algorithm significantly outperforms the generalized zero-forcing (GZF) approach. © 2008 IEEE.published_or_final_versio
Sub-channel Assignment, Power Allocation and User Scheduling for Non-Orthogonal Multiple Access Networks
In this paper, we study the resource allocation and user scheduling problem
for a downlink nonorthogonal multiple access network where the base station
allocates spectrum and power resources to a set of users. We aim to jointly
optimize the sub-channel assignment and power allocation to maximize the
weighted total sum-rate while taking into account user fairness. We formulate
the sub-channel allocation problem as equivalent to a many-to-many two-sided
user-subchannel matching game in which the set of users and sub-channels are
considered as two sets of players pursuing their own interests. We then propose
a matching algorithm which converges to a two-side exchange stable matching
after a limited number of iterations. A joint solution is thus provided to
solve the sub-channel assignment and power allocation problems iteratively.
Simulation results show that the proposed algorithm greatly outperforms the
orthogonal multiple access scheme and a previous non-orthogonal multiple access
scheme.Comment: Accepted as a regular paper by IEEE Transactions on Wireless
Communication
- …