2,297 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
Spatial Coordination Strategies in Future Ultra-Dense Wireless Networks
Ultra network densification is considered a major trend in the evolution of
cellular networks, due to its ability to bring the network closer to the user
side and reuse resources to the maximum extent. In this paper we explore
spatial resources coordination as a key empowering technology for next
generation (5G) ultra-dense networks. We propose an optimization framework for
flexibly associating system users with a densely deployed network of access
nodes, opting for the exploitation of densification and the control of overhead
signaling. Combined with spatial precoding processing strategies, we design
network resources management strategies reflecting various features, namely
local vs global channel state information knowledge exploitation, centralized
vs distributed implementation, and non-cooperative vs joint multi-node data
processing. We apply these strategies to future UDN setups, and explore the
impact of critical network parameters, that is, the densification levels of
users and access nodes as well as the power budget constraints, to users
performance. We demonstrate that spatial resources coordination is a key factor
for capitalizing on the gains of ultra dense network deployments.Comment: An extended version of a paper submitted to ISWCS'14, Special Session
on Empowering Technologies of 5G Wireless Communication
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
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
Partner selection in indoor-to-outdoor cooperative networks: an experimental study
In this paper, we develop a partner selection protocol for enhancing the
network lifetime in cooperative wireless networks. The case-study is the
cooperative relayed transmission from fixed indoor nodes to a common outdoor
access point. A stochastic bivariate model for the spatial distribution of the
fading parameters that govern the link performance, namely the Rician K-factor
and the path-loss, is proposed and validated by means of real channel
measurements. The partner selection protocol is based on the real-time
estimation of a function of these fading parameters, i.e., the coding gain. To
reduce the complexity of the link quality assessment, a Bayesian approach is
proposed that uses the site-specific bivariate model as a-priori information
for the coding gain estimation. This link quality estimator allows network
lifetime gains almost as if all K-factor values were known. Furthermore, it
suits IEEE 802.15.4 compliant networks as it efficiently exploits the
information acquired from the receiver signal strength indicator. Extensive
numerical results highlight the trade-off between complexity, robustness to
model mismatches and network lifetime performance. We show for instance that
infrequent updates of the site-specific model through K-factor estimation over
a subset of links are sufficient to at least double the network lifetime with
respect to existing algorithms based on path loss information only.Comment: This work has been submitted to IEEE Journal on Selected Areas in
Communications in August 201
- …