576 research outputs found
Two-Way Relaying Cooperative Wireless Networks: Resource Allocation and Performance Analysis
Relay-based cooperative wireless networks have been widely considered one of the cost-effective solutions to meet the demands in future wireless networks. In order to maximize the overall sum-rate while maintaining proportional fairness among users, we investigate different resource allocation algorithms in two-way relay networks with analog network coding (ANC) protocol and time division broadcast (TDBC) protocol. The algorithms investigated are different from traditional proportional fairness schemes in terms of fairness and computational complexity as we have applied Access Proportional Fairness (APF) and Minimum Rate Proportional Fairness (MRPF) along with load balancing at the relays. A MATLAB simulation has been performed and simulation results show the effectiveness of these algorithms
Enhancing Physical Layer Security in AF Relay Assisted Multi-Carrier Wireless Transmission
In this paper, we study the physical layer security (PLS) problem in the dual
hop orthogonal frequency division multiplexing (OFDM) based wireless
communication system. First, we consider a single user single relay system and
study a joint power optimization problem at the source and relay subject to
individual power constraint at the two nodes. The aim is to maximize the end to
end secrecy rate with optimal power allocation over different sub-carriers.
Later, we consider a more general multi-user multi-relay scenario. Under high
SNR approximation for end to end secrecy rate, an optimization problem is
formulated to jointly optimize power allocation at the BS, the relay selection,
sub-carrier assignment to users and the power loading at each of the relaying
node. The target is to maximize the overall security of the system subject to
independent power budget limits at each transmitting node and the OFDMA based
exclusive sub-carrier allocation constraints. A joint optimization solution is
obtained through duality theory. Dual decomposition allows to exploit convex
optimization techniques to find the power loading at the source and relay
nodes. Further, an optimization for power loading at relaying nodes along with
relay selection and sub carrier assignment for the fixed power allocation at
the BS is also studied. Lastly, a sub-optimal scheme that explores joint power
allocation at all transmitting nodes for the fixed subcarrier allocation and
relay assignment is investigated. Finally, simulation results are presented to
validate the performance of the proposed schemes.Comment: 10 pages, 7 figures, accepted in Transactions on Emerging
Telecommunications Technologies (ETT), formerly known as European
Transactions on Telecommunications (ETT
Low Complexity Joint Sub-Carrier Pairing, Allocation and Relay Selection in Cooperative Wireless Networks
Multi-carrier cooperative relay-based wireless communication is of particular interest in future wireless networks. In this paper we present resource allocation algorithm in which sub-carrier pairing is of particular interest along with fairness constraint in multi-user networks. An optimization of sub-carrier pair selection is formulated through capacity maximization problem. Sub-carrier pairing is applied in both two-hop Amplify & Forward (AF) and Decode & Forward (DF) cooperative multi-user networks. We develop a less complex centralized scheme for joint Sub-carrier pairing and allocation along with relay selection. The computational complexity of the proposed algorithms has been analyzed and performance is compared with Exhaustive Search Algorithm
Dynamic Time-domain Duplexing for Self-backhauled Millimeter Wave Cellular Networks
Millimeter wave (mmW) bands between 30 and 300 GHz have attracted
considerable attention for next-generation cellular networks due to vast
quantities of available spectrum and the possibility of very high-dimensional
antenna ar-rays. However, a key issue in these systems is range: mmW signals
are extremely vulnerable to shadowing and poor high-frequency propagation.
Multi-hop relaying is therefore a natural technology for such systems to
improve cell range and cell edge rates without the addition of wired access
points. This paper studies the problem of scheduling for a simple
infrastructure cellular relay system where communication between wired base
stations and User Equipment follow a hierarchical tree structure through fixed
relay nodes. Such a systems builds naturally on existing cellular mmW backhaul
by adding mmW in the access links. A key feature of the proposed system is that
TDD duplexing selections can be made on a link-by-link basis due to directional
isolation from other links. We devise an efficient, greedy algorithm for
centralized scheduling that maximizes network utility by jointly optimizing the
duplexing schedule and resources allocation for dense, relay-enhanced OFDMA/TDD
mmW networks. The proposed algorithm can dynamically adapt to loading, channel
conditions and traffic demands. Significant throughput gains and improved
resource utilization offered by our algorithm over the static,
globally-synchronized TDD patterns are demonstrated through simulations based
on empirically-derived channel models at 28 GHz.Comment: IEEE Workshop on Next Generation Backhaul/Fronthaul Networks -
BackNets 201
Resource Allocation for Outdoor-to-Indoor Multicarrier Transmission with Shared UE-side Distributed Antenna Systems
In this paper, we study the resource allocation algorithm design for downlink
multicarrier transmission with a shared user equipment (UE)-side distributed
antenna system (SUDAS) which utilizes both licensed and unlicensed frequency
bands for improving the system throughput. The joint UE selection and
transceiver processing matrix design is formulated as a non-convex optimization
problem for the maximization of the end-to-end system throughput (bits/s). In
order to obtain a tractable resource allocation algorithm, we first show that
the optimal transmitter precoding and receiver post-processing matrices jointly
diagonalize the end-to-end communication channel. Subsequently, the
optimization problem is converted to a scalar optimization problem for multiple
parallel channels, which is solved by using an asymptotically optimal iterative
algorithm. Simulation results illustrate that the proposed resource allocation
algorithm for the SUDAS achieves an excellent system performance and provides a
spatial multiplexing gain for single-antenna UEs.Comment: accepted for publication at the IEEE Vehicular Technology Conference
(VTC) Spring, Glasgow, Scotland, UK, May 201
- …