38,179 research outputs found
Multihop Diversity in Wideband OFDM Systems: The Impact of Spatial Reuse and Frequency Selectivity
The goal of this paper is to establish which practical routing schemes for
wireless networks are most suitable for wideband systems in the power-limited
regime, which is, for example, a practically relevant mode of operation for the
analysis of ultrawideband (UWB) mesh networks. For this purpose, we study the
tradeoff between energy efficiency and spectral efficiency (known as the
power-bandwidth tradeoff) in a wideband linear multihop network in which
transmissions employ orthogonal frequency-division multiplexing (OFDM)
modulation and are affected by quasi-static, frequency-selective fading.
Considering open-loop (fixed-rate) and closed-loop (rate-adaptive) multihop
relaying techniques, we characterize the impact of routing with spatial reuse
on the statistical properties of the end-to-end conditional mutual information
(conditioned on the specific values of the channel fading parameters and
therefore treated as a random variable) and on the energy and spectral
efficiency measures of the wideband regime. Our analysis particularly deals
with the convergence of these end-to-end performance measures in the case of
large number of hops, i.e., the phenomenon first observed in \cite{Oyman06b}
and named as ``multihop diversity''. Our results demonstrate the realizability
of the multihop diversity advantages in the case of routing with spatial reuse
for wideband OFDM systems under wireless channel effects such as path-loss and
quasi-static frequency-selective multipath fading.Comment: 6 pages, to be published in Proc. 2008 IEEE International Symposium
on Spread Spectrum Techniques and Applications (IEEE ISSSTA'08), Bologna,
Ital
Optimal Save-Then-Transmit Protocol for Energy Harvesting Wireless Transmitters
In this paper, the design of a wireless communication device relying
exclusively on energy harvesting is considered. Due to the inability of
rechargeable energy sources to charge and discharge at the same time, a
constraint we term the energy half-duplex constraint, two rechargeable energy
storage devices (ESDs) are assumed so that at any given time, there is always
one ESD being recharged. The energy harvesting rate is assumed to be a random
variable that is constant over the time interval of interest. A
save-then-transmit (ST) protocol is introduced, in which a fraction of time
{\rho} (dubbed the save-ratio) is devoted exclusively to energy harvesting,
with the remaining fraction 1 - {\rho} used for data transmission. The ratio of
the energy obtainable from an ESD to the energy harvested is termed the energy
storage efficiency, {\eta}. We address the practical case of the secondary ESD
being a battery with {\eta} < 1, and the main ESD being a super-capacitor with
{\eta} = 1. The optimal save-ratio that minimizes outage probability is
derived, from which some useful design guidelines are drawn. In addition, we
compare the outage performance of random power supply to that of constant power
supply over the Rayleigh fading channel. The diversity order with random power
is shown to be the same as that of constant power, but the performance gap can
be large. Furthermore, we extend the proposed ST protocol to wireless networks
with multiple transmitters. It is shown that the system-level outage
performance is critically dependent on the relationship between the number of
transmitters and the optimal save-ratio for single-channel outage minimization.
Numerical results are provided to validate our proposed study.Comment: This is the longer version of a paper to appear in IEEE Transactions
on Wireless Communication
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
Caching Gain in Wireless Networks with Fading: A Multi-User Diversity Perspective
We consider the effect of caching in wireless networks where fading is the
dominant channel effect. First, we propose a one-hop transmission strategy for
cache-enabled wireless networks, which is based on exploiting multi-user
diversity gain. Then, we derive a closed-form result for throughput scaling of
the proposed scheme in large networks, which reveals the inherent trade-off
between cache memory size and network throughput. Our results show that
substantial throughput improvements are achievable in networks with sources
equipped with large cache size. We also verify our analytical result through
simulations.Comment: 6 pages, 4 figures, conferenc
Distributed space-time coding for two-way wireless relay networks
In this paper, we consider distributed space-time coding for two-way wireless relay networks, where communication between two terminals is assisted by relay nodes. Relaying protocols using two, three, and four time slots are proposed. The protocols using four time slots are the traditional amplify-and-forward (AF) and decode-and-forward (DF) protocols, which do not consider the property of the two-way traffic. A new class of relaying protocols, termed as partial decode-and-forward (PDF), is developed for the two time slots transmission, where each relay first removes part of the noise before sending the signal to the two terminals. Protocols using three time slots are proposed to compensate the fact that the two time slots protocols cannot make use of direct transmission between the two terminals. For all protocols, after processing their received signals, the relays encode the resulting signals using a distributed linear dispersion (LD) code. The proposed AF protocols are shown to achieve the diversity order of min{N,K}(1- (log log P/log P)), where N is the number of relays, P is the total power of the network, and K is the number of symbols transmitted during each time slot. When random unitary matrix is used for LD code, the proposed PDF protocols resemble random linear network coding, where the former operates on the unitary group and the latter works on the finite field. Moreover, PDF achieves the diversity order of min{N,K} but the conventional DF can only achieve the diversity order of 1. Finally, we find that two time slots protocols also have advantages over four-time-slot protocols in media access control (MAC) layer
Cyclic Distributed Space–Time Codes for Wireless Relay Networks With No Channel Information
In this paper, we present a coding strategy for half duplex wireless relay networks, where we assume no channel knowledge at any of the transmitter, receiver, or relays. The coding scheme uses distributed space–time coding, that is, the relay nodes cooperate to encode the transmitted signal so that the receiver senses a space–time codeword. It is inspired by noncoherent differential techniques. The proposed strategy is available for any number of relays nodes. It is analyzed, and shown to yield a diversity linear in the number of relays. We also study the resistance of the scheme to relay node failures, and show that a network with R relay nodes and d of them down behaves, as far as diversity is concerned, as a network with R-d nodes. Finally, our construction can be easily generalized to the case where the transmitter and receiver nodes have several antennas
- …