39,304 research outputs found
Outage Performance of Two-Hop OFDM Systems with Spatially Random Decode-and-Forward Relays
In this paper, we analyze the outage performance of different multicarrier
relay selection schemes for two-hop orthogonal frequency-division multiplexing
(OFDM) systems in a Poisson field of relays. In particular, special emphasis is
placed on decode-and-forward (DF) relay systems, equipped with bulk and
per-subcarrier selection schemes, respectively. The exact expressions for
outage probability are derived in integrals for general cases. In addition,
asymptotic expressions for outage probability in the high signal-to-noise ratio
(SNR) region in the finite circle relay distribution region are determined in
closed forms for both relay selection schemes. Also, the outage probabilities
for free space in the infinite relay distribution region are derived in closed
forms. Meanwhile, a series of important properties related to cooperative
systems in random networks are investigated, including diversity, outage
probability ratio of two selection schemes and optimization of the number of
subcarriers in terms of system throughput. All analysis is numerically verified
by simulations. Finally, a framework for analyzing the outage performance of
OFDM systems with spatially random relays is constructed, which can be easily
modified to analyze other similar cases with different forwarding protocols,
location distributions and/or channel conditions
Cooperative Caching and Transmission Design in Cluster-Centric Small Cell Networks
Wireless content caching in small cell networks (SCNs) has recently been
considered as an efficient way to reduce the traffic and the energy consumption
of the backhaul in emerging heterogeneous cellular networks (HetNets). In this
paper, we consider a cluster-centric SCN with combined design of cooperative
caching and transmission policy. Small base stations (SBSs) are grouped into
disjoint clusters, in which in-cluster cache space is utilized as an entity. We
propose a combined caching scheme where part of the available cache space is
reserved for caching the most popular content in every SBS, while the remaining
is used for cooperatively caching different partitions of the less popular
content in different SBSs, as a means to increase local content diversity.
Depending on the availability and placement of the requested content,
coordinated multipoint (CoMP) technique with either joint transmission (JT) or
parallel transmission (PT) is used to deliver content to the served user. Using
Poisson point process (PPP) for the SBS location distribution and a hexagonal
grid model for the clusters, we provide analytical results on the successful
content delivery probability of both transmission schemes for a user located at
the cluster center. Our analysis shows an inherent tradeoff between
transmission diversity and content diversity in our combined
caching-transmission design. We also study optimal cache space assignment for
two objective functions: maximization of the cache service performance and the
energy efficiency. Simulation results show that the proposed scheme achieves
performance gain by leveraging cache-level and signal-level cooperation and
adapting to the network environment and user QoS requirements.Comment: 13 pages, 10 figures, submitted for possible journal publicatio
A Simple Cooperative Diversity Method Based on Network Path Selection
Cooperative diversity has been recently proposed as a way to form virtual
antenna arrays that provide dramatic gains in slow fading wireless
environments. However most of the proposed solutions require distributed
space-time coding algorithms, the careful design of which is left for future
investigation if there is more than one cooperative relay. We propose a novel
scheme, that alleviates these problems and provides diversity gains on the
order of the number of relays in the network. Our scheme first selects the best
relay from a set of M available relays and then uses this best relay for
cooperation between the source and the destination. We develop and analyze a
distributed method to select the best relay that requires no topology
information and is based on local measurements of the instantaneous channel
conditions. This method also requires no explicit communication among the
relays. The success (or failure) to select the best available path depends on
the statistics of the wireless channel, and a methodology to evaluate
performance for any kind of wireless channel statistics, is provided.
Information theoretic analysis of outage probability shows that our scheme
achieves the same diversity-multiplexing tradeoff as achieved by more complex
protocols, where coordination and distributed space-time coding for M nodes is
required, such as those proposed in [7]. The simplicity of the technique,
allows for immediate implementation in existing radio hardware and its adoption
could provide for improved flexibility, reliability and efficiency in future 4G
wireless systems.Comment: To appear, IEEE JSAC, special issue on 4
Outage Probability of Wireless Ad Hoc Networks with Cooperative Relaying
In this paper, we analyze the performance of cooperative transmissions in
wireless ad hoc networks with random node locations. According to a contention
probability for message transmission, each source node can either transmits its
own message signal or acts as a potential relay for others. Hence, each
destination node can potentially receive two copies of the message signal, one
from the direct link and the other from the relay link. Taking the random node
locations and interference into account, we derive closed-form expressions for
the outage probability with different combining schemes at the destination
nodes. In particular, the outage performance of optimal combining, maximum
ratio combining, and selection combining strategies are studied and quantified.Comment: 7 pages; IEEE Globecom 201
- …