904 research outputs found
Adaptive OFDM Cooperative Systems
Cooperative communication is a promising technique for wireless communication systems where wireless nodes cooperate together in transmitting their information. Such communication transmission technique, which realizes the multiple antenna arrays in a distributed manner over multiple wireless nodes, succeeds in extending the network coverage, increasing throughput, improving both link reliability and spectral efficiency.
Available channel state information at the transmitting nodes can be used to design adaptive transmission schemes for improving the overall system performance. Throughout our work, we adaptively change loaded power and/or bit to the Orthogonal Frequency Division Multiplexing (OFDM) symbol in order to minimize bit error rate or maximize the throughput.
In the first part of this dissertation, we consider single-relay OFDM system with amplify-and-forward relaying. We propose three algorithms to minimize the bit error rate under total power constraint and fixed transmission rate. These algorithms are optimal power loading, optimal bit loading and optimal bit and power loading. Through Monte Carlo simulations we study the proposed system performance and discuss the effect of relay location and channel estimation. This study shows that the proposed algorithms result in exploiting the multi-path diversity and achieving extra coding gain.
In the second part, we extend the problem to a multi-relay OFDM network but with decode-and-forward relaying. We propose an adaptive power loading algorithm to minimize the bit error rate under total power constraint based on two relay selection strategies. The proposed system leads to achieve both multi-path and cooperative spatial diversity using maximal-ratio combiner for the detection.
In the last part, we consider also multi-relay network but with amplify and forward relaying. We optimize the bit loading coefficients to maximize the throughput under target bit error rate constraint. The proposed algorithm is considered more practical since it takes into consideration the channel estimation quality. The considered adaptive system has less complexity compared with other adaptive systems through reducing the feedback amount. Furthermore, the full network channel state information is needed only at the destination
Utility greedy discrete bit loading for interference limited multi-cell OFDM system
In this contribution we present the solution of the utility greedy discrete bit loading for interference limited multicell OFDM networks. Setting the utility as the sum of consumed power proportions, the algorithm follows greedy way to achieve the maximum throughput of the system. Simulation has shown that the proposed algorithm has better performance and lower complexity than the traditional optimal algorithm. The discussion of the results is provided
Quantifying Potential Energy Efficiency Gain in Green Cellular Wireless Networks
Conventional cellular wireless networks were designed with the purpose of
providing high throughput for the user and high capacity for the service
provider, without any provisions of energy efficiency. As a result, these
networks have an enormous Carbon footprint. In this paper, we describe the
sources of the inefficiencies in such networks. First we present results of the
studies on how much Carbon footprint such networks generate. We also discuss
how much more mobile traffic is expected to increase so that this Carbon
footprint will even increase tremendously more. We then discuss specific
sources of inefficiency and potential sources of improvement at the physical
layer as well as at higher layers of the communication protocol hierarchy. In
particular, considering that most of the energy inefficiency in cellular
wireless networks is at the base stations, we discuss multi-tier networks and
point to the potential of exploiting mobility patterns in order to use base
station energy judiciously. We then investigate potential methods to reduce
this inefficiency and quantify their individual contributions. By a
consideration of the combination of all potential gains, we conclude that an
improvement in energy consumption in cellular wireless networks by two orders
of magnitude, or even more, is possible.Comment: arXiv admin note: text overlap with arXiv:1210.843
Resource allocation technique for powerline network using a modified shuffled frog-leaping algorithm
Resource allocation (RA) techniques should be made efficient and optimized in order to enhance the QoS (power & bit, capacity, scalability) of high-speed networking data applications. This research attempts to further increase the efficiency towards near-optimal performance. RA’s problem involves assignment of subcarriers, power and bit amounts for each user efficiently. Several studies conducted by the Federal Communication Commission have proven that conventional RA approaches are becoming insufficient for rapid demand in networking resulted in spectrum underutilization, low capacity and convergence, also low performance of bit error rate, delay of channel feedback, weak scalability as well as computational complexity make real-time solutions intractable. Mainly due to sophisticated, restrictive constraints, multi-objectives, unfairness, channel noise, also unrealistic when assume perfect channel state is available. The main goal of this work is to develop a conceptual framework and mathematical model for resource allocation using Shuffled Frog-Leap Algorithm (SFLA). Thus, a modified SFLA is introduced and integrated in Orthogonal Frequency Division Multiplexing (OFDM) system. Then SFLA generated random population of solutions (power, bit), the fitness of each solution is calculated and improved for each subcarrier and user. The solution is numerically validated and verified by simulation-based powerline channel. The system performance was compared to similar research works in terms of the system’s capacity, scalability, allocated rate/power, and convergence. The resources allocated are constantly optimized and the capacity obtained is constantly higher as compared to Root-finding, Linear, and Hybrid evolutionary algorithms. The proposed algorithm managed to offer fastest convergence given that the number of iterations required to get to the 0.001% error of the global optimum is 75 compared to 92 in the conventional techniques. Finally, joint allocation models for selection of optima resource values are introduced; adaptive power and bit allocators in OFDM system-based Powerline and using modified SFLA-based TLBO and PSO are propose
Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations
We investigate the transmission of a secret message from Alice to Bob in the
presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes.
Each link comprises a set of parallel channels, modeling for example an
orthogonal frequency division multiplexing transmission. We consider the impact
of discrete constellations and finite-length coding, defining an achievable
secrecy rate under a constraint on the equivocation rate at Eve. Then we
propose a power and channel allocation algorithm that maximizes the achievable
secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable
matching problem. We consider the scenarios of both full and partial channel
state information at Alice. In the latter case, we only guarantee an outage
secrecy rate, i.e., the rate of a message that remains secret with a given
probability. Numerical results are provided for Rayleigh fading channels in
terms of average outage secrecy rate, showing that practical schemes achieve a
performance quite close to that of ideal ones
Sum Rate Maximized Resource Allocation in Multiple DF Relays Aided OFDM Transmission
In relay-aided wireless transmission systems, one of the key issues is how to
decide assisting relays and manage the energy resource at the source and each
individual relay, to maximize a certain objective related to system
performance. This paper addresses the sum rate maximized resource allocation
(RA) problem in a point to point orthogonal frequency division modulation
(OFDM) transmission system assisted by multiple decode-and-forward (DF) relays,
subject to the individual sum power constraints of the source and the relays.
In particular, the transmission at each subcarrier can be in either the direct
mode without any relay assisting, or the relay-aided mode with one or several
relays assisting. We propose two RA algorithms which optimize the assignment of
transmission mode and source power for every subcarrier, as well as the
assisting relays and the power allocation to them for every {relay-aided}
subcarrier. First, it is shown that the considered RA problem has zero
Lagrangian duality gap when there is a big number of subcarriers. In this case,
a duality based algorithm that finds a globally optimum RA is developed.
Second, a coordinate-ascent based iterative algorithm, which finds a suboptimum
RA but is always applicable regardless of the duality gap of the RA problem, is
developed. The effectiveness of these algorithms has been illustrated by
numerical experiments.Comment: 13 pages in two-column format, 10 figures, to appear in IEEE Journal
on Selected Areas in Communication
- …