335 research outputs found
Power Allocation in Wireless Relay Networks
This thesis is mainly concerned with power allocation issues in wireless relay networks where a single or multiple relays assist transmission from a single or multiple sources to a destination.
First, a network model with a single source and multiple relays is considered, in which both cases of orthogonal and non--orthogonal relaying are investigated. For the case of orthogonal relaying, two power allocation schemes corresponding to two partial channel state information (CSI) assumptions are proposed. Given the lack of full and perfect CSI, appropriate signal processing at the relays and/or destination is also developed. The performance behavior of the system with power allocation between the source and the relays is also analyzed. For the case of non-orthogonal relaying, it is demonstrated that optimal power allocation is not sufficiently effective. Instead, a relay beamforming scheme is proposed. A comprehensive comparison between the orthogonal relaying with power allocation scheme and the non-orthogonal relaying with beamforming scheme is then carried out, which reveals several interesting conclusions with respect to both error performance and system throughput.
In the second part of the thesis, a network model with multiple sources and a single relay is considered. The transmission model is applicable for uplink channels in cellular mobile systems in which multiple mobile terminals communicate with the base station with the help of a single relay station. Single-carrier frequency division multiple access (SC-FDMA) technique with frequency domain equalization is adopted in order to avoid the amplification of the multiple access interference at the relay. Minimizing the transmit power at the relay and optimizing the fairness among the sources in terms of throughput are the two objectives considered in implementing power allocation schemes. The problems are visualized as water-filling and water-discharging models and two optimal power allocation schemes are proposed, accordingly.
Finally, the last part of the thesis is extended to a network model with multiple sources and multiple relays. The orthogonal multiple access technique is employed in order to avoid multiple access interference. Proposed is a joint optimal beamforming and power allocation scheme in which an alternative optimization technique is applied to deal with the non-convexity of the power allocation problem. Furthermore, recognizing the high complexity and large overhead information exchange when the number of sources and relays increases, a relay selection scheme is proposed. Since each source is supported by at most one relay, the feedback information from the destination to each relay can be significantly reduced. Using an equal power allocation scheme, relay selection is still an NP-hard combinatorial optimization problem. Nevertheless, the proposed sub-optimal scheme yields a comparable performance with a much lower computational complexity and can be well suited for practical systems
Physical Layer Service Integration in 5G: Potentials and Challenges
High transmission rate and secure communication have been identified as the
key targets that need to be effectively addressed by fifth generation (5G)
wireless systems. In this context, the concept of physical-layer security
becomes attractive, as it can establish perfect security using only the
characteristics of wireless medium. Nonetheless, to further increase the
spectral efficiency, an emerging concept, termed physical-layer service
integration (PHY-SI), has been recognized as an effective means. Its basic idea
is to combine multiple coexisting services, i.e., multicast/broadcast service
and confidential service, into one integral service for one-time transmission
at the transmitter side. This article first provides a tutorial on typical
PHY-SI models. Furthermore, we propose some state-of-the-art solutions to
improve the overall performance of PHY-SI in certain important communication
scenarios. In particular, we highlight the extension of several concepts
borrowed from conventional single-service communications, such as artificial
noise (AN), eigenmode transmission etc., to the scenario of PHY-SI. These
techniques are shown to be effective in the design of reliable and robust
PHY-SI schemes. Finally, several potential research directions are identified
for future work.Comment: 12 pages, 7 figure
A Comprehensive Survey of Potential Game Approaches to Wireless Networks
Potential games form a class of non-cooperative games where unilateral
improvement dynamics are guaranteed to converge in many practical cases. The
potential game approach has been applied to a wide range of wireless network
problems, particularly to a variety of channel assignment problems. In this
paper, the properties of potential games are introduced, and games in wireless
networks that have been proven to be potential games are comprehensively
discussed.Comment: 44 pages, 6 figures, to appear in IEICE Transactions on
Communications, vol. E98-B, no. 9, Sept. 201
RESOURCE ALLOCATION FOR WIRELESS RELAY NETWORKS
In this thesis, we propose several resource allocation strategies for relay networks in the context of joint power and bandwidth allocation and relay selection, and joint power allocation and subchannel assignment for orthogonal frequency division multiplexing (OFDM) and orthogonal frequency division multiple access (OFDMA) systems. Sharing the two best ordered relays with equal power between the two users over Rayleigh flat fading channels is proposed to establish full diversity order for both users. Closed form expressions for the outage probability, and bit error probability (BEP) performance measures for both amplify and forward (AF) and decode and forward (DF) cooperative communication schemes are developed for different scenarios. To utilize the full potentials of relay-assisted transmission in multi user systems, we propose a mixed strategy of AF relaying and direct transmission, where the user transmits part of the data using the relay, and the other part is transmitted using the direct link. The resource allocation problem is formulated to maximize the sum rate. A recursive algorithm alternating between power allocation and bandwidth allocation steps is proposed to solve the formulated resource allocation problem. Due to the conflict between limited wireless resources and the fast growing wireless demands, Stackelberg game is proposed to allocate the relay resources (power and bandwidth) between competing users, aiming to maximize the relay benefits from selling its resources. We prove the uniqueness of Stackelberg Nash Equilibrium (SNE) for the proposed game. We develop a distributed algorithm to reach SNE, and investigate the conditions for the stability of the proposed algorithm. We propose low complexity algorithms for AF-OFDMA and DF-OFDMA systems to assign the subcarriers to the users based on high SNR approximation aiming to maximize the weighted sum rate. Auction framework is proposed to devise competition based solutions for the resource allocation of AF-OFDMA aiming tomaximize either vi the sum rate or the fairness index. Two auction algorithms are proposed; sequential and one-shot auctions. In sequential auction, the users evaluate the subcarrier based on the rate marginal contribution. In the one-shot auction, the users evaluate the subcarriers based on an estimate of the Shapley value and bids on all subcarriers at once
Analysis and Optimization of Cooperative Wireless Networks
Recently, cooperative communication between users in wireless networks has attracted a considerable amount of attention. A significant amount of research has been conducted to optimize the performance of different cooperative communication schemes, subject to some resource constraints such as power, bandwidth, and time. However, in previous research, each optimization problem has been investigated separately, and the optimal solution for one problem is usually not optimal for the other problems.
This dissertation focuses on joint optimization or cross-layer optimization in wireless cooperative networks. One important obstacle is the non-convexity of the joint optimization problem, which makes the problem difficult to solve efficiently. The first contribution of this dissertation is the proposal of a method to efficiently solve a joint optimization problem of power allocation, time scheduling and relay selection strategy in Decode-and-Forward cooperative networks. To overcome the non-convexity obstacle, the dual optimization method for non-convex problems \cite{Yu:2006}, is applied by exploiting the time-sharing properties of wireless OFDM systems when the number of subcarriers approaches infinity.
The second contribution of this dissertation is the design of practical algorithms to implement the aforementioned method for optimizing the cooperative network. The difficulty of this work is caused by the randomness of the data, specifically, the randomness of the channel condition, and the real-time requirements of computing. The proposed algorithms were analyzed rigorously and the convergence of the algorithms is shown.\\
Furthermore, a joint optimization problem of power allocation and computational functions for the advanced cooperation scheme, Compute-and-Forward, is also analyzed, and an iterative algorithm to solve this problem is also introduced
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
- …