2,412 research outputs found
Energy-Efficient Power Control for Multiple-Relay Cooperative Networks Using Q-Learning
In this paper, we investigate the power control problem in a cooperative network with multiple wireless transmitters, multiple amplify-and-forward relays, and one destination. The relay communication can be either full duplex or half-duplex, and all source nodes interfere with each other at every intermediate relay node, and all active nodes (transmitters and relay nodes) interfere with each other at the base station. A game-theory-based power control algorithm is devised to allocate the powers among all active nodes. The source nodes aim at maximizing their energy efficiency (in bits per Joule per Hertz), whereas the relays aim at maximizing the network sum rate. We show that the proposed game admits multiple pure/mixed-strategy Nash equilibrium points. A Q-learning-based algorithm is then formulated to let the active players converge to the best Nash equilibrium point that combines good performance in terms of both energy efficiency and overall data rate. Numerical results show that the full-duplex scheme outperforms half-duplex configuration, Nash bargaining solution, the max-min fairness, and the max-rate optimization schemes in terms of energy efficiency, and outperforms the half-duplex mode, Nash bargaining system, and the max-min fairness scheme in terms of network sum rate
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
Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey
This paper provides a comprehensive review of the domain of physical layer
security in multiuser wireless networks. The essential premise of
physical-layer security is to enable the exchange of confidential messages over
a wireless medium in the presence of unauthorized eavesdroppers without relying
on higher-layer encryption. This can be achieved primarily in two ways: without
the need for a secret key by intelligently designing transmit coding
strategies, or by exploiting the wireless communication medium to develop
secret keys over public channels. The survey begins with an overview of the
foundations dating back to the pioneering work of Shannon and Wyner on
information-theoretic security. We then describe the evolution of secure
transmission strategies from point-to-point channels to multiple-antenna
systems, followed by generalizations to multiuser broadcast, multiple-access,
interference, and relay networks. Secret-key generation and establishment
protocols based on physical layer mechanisms are subsequently covered.
Approaches for secrecy based on channel coding design are then examined, along
with a description of inter-disciplinary approaches based on game theory and
stochastic geometry. The associated problem of physical-layer message
authentication is also introduced briefly. The survey concludes with
observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with
arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials,
201
The Game Theory: Applications in the Wireless Networks
Recent years have witnessed a lot of applications in the computer science, especially in the area of the wireless networks. The applications can be divided into the following two main categories: applications in the network performance and those in the energy efficiency. The game theory is widely used to regulate the behavior of the users; therefore, the cooperation among the nodes can be achieved and the network performance can be improved when the game theory is utilized. On the other hand, the game theory is also adopted to control the media access control protocol or routing protocol; therefore, the energy exhaust owing to the data collision and long route can be reduced and the energy efficiency can be improved greatly. In this chapter, the applications in the network performance and the energy efficiency are reviewed. The state of the art in the applications of the game theory in wireless networks is pointed out. Finally, the future research direction of the game theory in the energy harvesting wireless sensor network is presented
Architecture design for disaster resilient management network using D2D technology
Huge damages from natural disasters, such as earthquakes, floods, landslide, tsunamis, have been reported in recent years, claiming many lives, rendering millions homeless and causing huge financial losses worldwide. The lack of effective communication between the public rescue/safety agencies, rescue teams, first responders and trapped survivors/victims makes the situation even worse. Factors like dysfunctional communication networks, limited communications capacity, limited resources/services, data transformation and effective evaluation, energy, and power deficiency cause unnecessary hindrance in rescue and recovery services during a disaster. The new wireless communication technologies are needed to enhance life-saving capabilities and rescue services. In general, in order to improve societal resilience towards natural catastrophes and develop effective communication infrastructure, innovative approaches need to be initiated to provide improved quality, better connectivity in the events of natural and human disasters.
In this thesis, a disaster resilient network architecture is proposed and analysed using multi-hop communications, clustering, energy harvesting, throughput optimization, reliability enhancement, adaptive selection, and low latency communications. It also examines the importance of mode selection, power management, frequency and time resource allocation to realize the promises of Long-term Evolution (LTE) Device to Device (D2D) communication. In particular, to support resilient and energy efficient communication in disaster-affected areas.
This research is examined by thorough and vigorous simulations and validated through mathematical modelling. Overall, the impact of this research is twofold: i) it provides new technologies for effective inter- and intra-agency coordination system during a disaster event by establishing a stronger and resilient communication; and ii) It offers a potential solution for stakeholders such as governments, rescue teams, and general public with new informed information on how to establish effective policies to cope with challenges before, during and after the disaster events
Joint relay selection and bandwidth allocation for cooperative relay network
Cooperative communication that exploits multiple relay links offers significant performance improvement in terms of coverage and capacity for mobile data subscribers in hierarchical cellular network. Since cooperative communication utilizes multiple relay links, complexity of the network is increased due to the needs for efficient resource allocation. Besides, usage of multiple relay links leads to Inter- Cell Interference (ICI). The main objective of this thesis is to develop efficient resource allocation scheme minimizes the effect of ICI in cooperative relay network. The work proposed a joint relay selection and bandwidth allocation in cooperative relay network that ensures high achievable data rate with high user satisfaction and low outage percentage. Two types of network models are considered: single cell network and multicell network. Joint Relay Selection and Bandwidth Allocation with Spatial Reuse (JReSBA_SR) and Optimized JReSBA_SR (O_JReSBA_SR) are developed for single cell network. JReSBA_SR considers link quality and user demand for resource allocation, and is equipped with spatial reuse to support higher network load. O_JReSBA_SR is an enhancement of JReSBA_SR with decision strategy based on Markov optimization. In multicell network, JReSBA with Interference Mitigation (JReSBA_IM) and Optimized JReSBA_IM (O_JReSBA_IM) are developed. JReSBA_IM deploys sectored-Fractional Frequency Reuse (sectored- FFR) partitioning concept in order to minimize the effect of ICI between adjacent cells. The performance is evaluated in terms of cell achievable rate, Outage Percentage (OP) and Satisfaction Index (SI). The result for single cell network shows that JReSBA_SR has notably improved the cell achievable rate by 35.0%, with reduced OP by 17.7% compared to non-joint scheme at the expense of slight increase in complexity at Relay Node (RN). O_JReSBA_SR has further improved the cell achievable rate by 13.9% while maintaining the outage performance with reduced complexity compared to JReSBA_SR due to the effect of optimization. The result for multicell network shows that JReSBA_IM enhances the cell achievable rate up to 65.1% and reduces OP by 35.0% as compared to benchmark scheme. Similarly, O_JReSBA_IM has significantly reduced the RN complexity of JReSBA_IM scheme, improved the cell achievable rate up to 9.3% and reduced OP by 1.3%. The proposed joint resource allocation has significantly enhanced the network performance through spatial frequency reuse, efficient, fair and optimized resource allocation. The proposed resource allocation is adaptable to variation of network load and can be used in any multihop cellular network such as Long Term Evolution-Advanced (LTE-A) network
Distributed Cooperative Transmission with Unreliable and Untrustworthy Relay Channels
Cooperative transmission is an emerging wireless communication technique that improves wireless channel capacity through multiuser cooperation in the physical layer. It is expected to have a profound impact on network performance and design. However, cooperative transmission can be vulnerable to selfish behaviors and malicious attacks, especially in its current design. In this paper, we investigate two fundamental questions Does cooperative transmission provide new opportunities to malicious parties to undermine the network performance? Are there new ways to defend wireless networks through physical layer cooperation? Particularly, we study the security vulnerabilities of the traditional cooperative transmission schemes and show the performance degradation resulting from the misbehaviors of relay nodes. Then, we design a trust-assisted cooperative scheme that can detect attacks and has self-healing capability. The proposed scheme performs much better than the traditional schemes when there are malicious/selfish nodes or severe channel estimation errors. Finally, we investigate the advantage of cooperative transmission in terms of defending against jamming attacks. A reduction in link outage probability is achieved
Cooperative Algorithms for MIMO Amplify-and-Forward Relay Networks
Interference alignment is a signaling technique that provides high
multiplexing gain in the interference channel. It can be extended to multi-hop
interference channels, where relays aid transmission between sources and
destinations. In addition to coverage extension and capacity enhancement,
relays increase the multiplexing gain in the interference channel. In this
paper, three cooperative algorithms are proposed for a multiple-antenna
amplify-and-forward (AF) relay interference channel. The algorithms design the
transmitters and relays so that interference at the receivers can be aligned
and canceled. The first algorithm minimizes the sum power of enhanced noise
from the relays and interference at the receivers. The second and third
algorithms rely on a connection between mean square error and mutual
information to solve the end-to-end sum-rate maximization problem with either
equality or inequality power constraints via matrix-weighted sum mean square
error minimization. The resulting iterative algorithms converge to stationary
points of the corresponding optimization problems. Simulations show that the
proposed algorithms achieve higher end-to-end sum-rates and multiplexing gains
that existing strategies for AF relays, decode-and-forward relays, and direct
transmission. The first algorithm outperforms the other algorithms at high
signal-to-noise ratio (SNR) but performs worse than them at low SNR. Thanks to
power control, the third algorithm outperforms the second algorithm at the cost
of overhead.Comment: submitted to IEEE Transactions on Signal Processing in December 2011,
revised in April 2012 and in September 201
- …