1,694 research outputs found
Optimization Framework and Graph-Based Approach for Relay-Assisted Bidirectional OFDMA Cellular Networks
This paper considers a relay-assisted bidirectional cellular network where
the base station (BS) communicates with each mobile station (MS) using OFDMA
for both uplink and downlink. The goal is to improve the overall system
performance by exploring the full potential of the network in various
dimensions including user, subcarrier, relay, and bidirectional traffic. In
this work, we first introduce a novel three-time-slot time-division duplexing
(TDD) transmission protocol. This protocol unifies direct transmission, one-way
relaying and network-coded two-way relaying between the BS and each MS. Using
the proposed three-time-slot TDD protocol, we then propose an optimization
framework for resource allocation to achieve the following gains: cooperative
diversity (via relay selection), network coding gain (via bidirectional
transmission mode selection), and multiuser diversity (via subcarrier
assignment). We formulate the problem as a combinatorial optimization problem,
which is NP-complete. To make it more tractable, we adopt a graph-based
approach. We first establish the equivalence between the original problem and a
maximum weighted clique problem in graph theory. A metaheuristic algorithm
based on any colony optimization (ACO) is then employed to find the solution in
polynomial time. Simulation results demonstrate that the proposed protocol
together with the ACO algorithm significantly enhances the system total
throughput.Comment: 27 pages, 8 figures, 2 table
Multi-hop Cooperative Relaying for Energy Efficient In Vivo Communications
This paper investigates cooperative relaying to support energy efficient in vivo communications. In such a network, the in vivo source nodes transmit their sensing information to an on-body destination node either via direct communications or by employing on-body cooperative relay nodes in order to promote energy efficiency. Two relay modes are investigated, namely single-hop and multi-hop (two-hop) relaying. In this context, the paper objective is to select the optimal transmission mode (direct, single-hop, or two-hop relaying) and relay assignment (if cooperative relaying is adopted) for each source node that results in the minimum per bit average energy consumption for the in vivo network. The problem is formulated as a binary program that can be efficiently solved using commercial optimization solvers. Numerical results demonstrate the significant improvement in energy consumption and quality-of-service (QoS) support when multi-hop communication is adopted
Jointly Optimal Channel Pairing and Power Allocation for Multichannel Multihop Relaying
We study the problem of channel pairing and power allocation in a
multichannel multihop relay network to enhance the end-to-end data rate. Both
amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies are
considered. Given fixed power allocation to the channels, we show that channel
pairing over multiple hops can be decomposed into independent pairing problems
at each relay, and a sorted-SNR channel pairing strategy is sum-rate optimal,
where each relay pairs its incoming and outgoing channels by their SNR order.
For the joint optimization of channel pairing and power allocation under both
total and individual power constraints, we show that the problem can be
decoupled into two subproblems solved separately. This separation principle is
established by observing the equivalence between sorting SNRs and sorting
channel gains in the jointly optimal solution. It significantly reduces the
computational complexity in finding the jointly optimal solution. It follows
that the channel pairing problem in joint optimization can be again decomposed
into independent pairing problems at each relay based on sorted channel gains.
The solution for optimizing power allocation for DF relaying is also provided,
as well as an asymptotically optimal solution for AF relaying. Numerical
results are provided to demonstrate substantial performance gain of the jointly
optimal solution over some suboptimal alternatives. It is also observed that
more gain is obtained from optimal channel pairing than optimal power
allocation through judiciously exploiting the variation among multiple
channels. Impact of the variation of channel gain, the number of channels, and
the number of hops on the performance gain is also studied through numerical
examples.Comment: 15 pages. IEEE Transactions on Signal Processin
Jointly Optimal Channel Pairing and Power Allocation for Multichannel Multihop Relaying
We study the problem of channel pairing and power allocation in a
multichannel multihop relay network to enhance the end-to-end data rate. Both
amplify-and-forward (AF) and decode-and-forward (DF) relaying strategies are
considered. Given fixed power allocation to the channels, we show that channel
pairing over multiple hops can be decomposed into independent pairing problems
at each relay, and a sorted-SNR channel pairing strategy is sum-rate optimal,
where each relay pairs its incoming and outgoing channels by their SNR order.
For the joint optimization of channel pairing and power allocation under both
total and individual power constraints, we show that the problem can be
decoupled into two subproblems solved separately. This separation principle is
established by observing the equivalence between sorting SNRs and sorting
channel gains in the jointly optimal solution. It significantly reduces the
computational complexity in finding the jointly optimal solution. It follows
that the channel pairing problem in joint optimization can be again decomposed
into independent pairing problems at each relay based on sorted channel gains.
The solution for optimizing power allocation for DF relaying is also provided,
as well as an asymptotically optimal solution for AF relaying. Numerical
results are provided to demonstrate substantial performance gain of the jointly
optimal solution over some suboptimal alternatives. It is also observed that
more gain is obtained from optimal channel pairing than optimal power
allocation through judiciously exploiting the variation among multiple
channels. Impact of the variation of channel gain, the number of channels, and
the number of hops on the performance gain is also studied through numerical
examples.Comment: 15 pages. IEEE Transactions on Signal Processin
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
Jointly Optimal Channel and Power Assignment for Dual-Hop Multi-channel Multi-user Relaying
We consider the problem of jointly optimizing channel pairing, channel-user
assignment, and power allocation, to maximize the weighted sum-rate, in a
single-relay cooperative system with multiple channels and multiple users.
Common relaying strategies are considered, and transmission power constraints
are imposed on both individual transmitters and the aggregate over all
transmitters. The joint optimization problem naturally leads to a mixed-integer
program. Despite the general expectation that such problems are intractable, we
construct an efficient algorithm to find an optimal solution, which incurs
computational complexity that is polynomial in the number of channels and the
number of users. We further demonstrate through numerical experiments that the
jointly optimal solution can significantly improve system performance over its
suboptimal alternatives.Comment: This is the full version of a paper to appear in the IEEE Journal on
Selected Areas in Communications, Special Issue on Cooperative Networking -
Challenges and Applications (Part II), October 201
Outage analysis of superposition modulation aided network coded cooperation in the presence of network coding noise
We consider a network, where multiple sourcedestination pairs communicate with the aid of a half-duplex relay node (RN), which adopts decode-forward (DF) relaying and superposition-modulation (SPM) for combining the signals transmitted by the source nodes (SNs) and then forwards the composite signal to all the destination nodes (DNs). Each DN extracts the signals transmitted by its own SN from the composite signal by subtracting the signals overheard from the unwanted SNs. We derive tight lower-bounds for the outage probability for transmission over Rayleigh fading channels and invoke diversity combining at the DNs, which is validated by simulation for both the symmetric and the asymmetric network configurations. For the high signal-to-noise ratio regime, we derive both an upperbound as well as a lower-bound for the outage performance and analyse the achievable diversity gain. It is revealed that a diversity order of 2 is achieved, regardless of the number of SN-DN pairs in the network. We also highlight the fact that the outage performance is dominated by the quality of the worst overheated link, because it contributes most substantially to the network coding noise. Finally, we use the lower bound for designing a relay selection scheme for the proposed SPM based network coded cooperative communication (SPM-NC-CC) system.<br/
- âŠ