1,233 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
Recommended from our members
Receiver Design and Security for Low Power Wireless Communications Systems
This dissertation focuses on two important areas in wireless communications: receiver design and security. In the first part of this dissertation we consider low data rate receiver design for ultra-wideband (UWB), a wideband radio technology that promises to help solve the frequency allocation problem that often inhibits narrowband systems. Reference-based receivers are promising candidates in the UWB regime, because the conventional rake receiver designs suffers from complexity limitations and inaccuracies in channel estimation. Many reference-based systems have arisen as viable solutions for receivers. We unify these systems as well as other systems into the general framework for performance analysis to suggest the optimal system for varying constraints. We improve the performance of frequency-shifted reference (FSR-UWB) for an average power constraint by halving the frequency offset and employing a sample-and-hold approach across the frame period. Also, we introduce a novel peak mitigation technique; tone reservation, for the multi-differential (MD) version of FSR-UWB, to reduce the high peak-to-average power ratio observed as the data carriers increase. The next part of this dissertation is about wireless security which is ubiquitous in modern news. Cryptography is widely use for security but it assumes limited computational abilities of an eavesdropper, is based on the unproven hardness of the underlying primitives, and allows for the message to be recorded and decrypted later. In this dissertation we consider an information-theoretic security approach to guaranteeing everlasting secrecy. We contribute a new secrecy rate pair outage formulation, where an outage event is based on the instantaneous rates of the destination and the eavesdropper being below and above desired thresholds, respectively. In our new secrecy rate pair outage formulation, two new unaccounted outage events emerge: secrecy breach, where the eavesdropper is above the targeted threshold; unreliable, where the destination is unable to successfully decode the message. The former case must be carefully avoided, while for the latter case we can exploit automatic retransmissions (ARQ) while maintaining the eavesdropper intercept probability below the target threshold. We look at both ``simple\u27\u27 receivers and also complex receivers that use a buffer to store previous messages to maximally combine signal-to-noise ratio (SNR). Then we extend these results to the two-hop case where we maximize the end-to-end secure throughput by optimizing the intercept probability at each eavesdropper given a total end-to-end intercept constraint. Lastly, we consider the difficult case in information-theoretic security: the near eavesdropper case, where we contribute an optimal power allocation algorithm that leverages nearby chatter nodes to generate noise to reduce the probability of intercept by the eavesdropper while minimally impeding the source-to-destination communication. As shown in both one-hop and two-hop cases, allowing a slight outage at the destination for cases of when the eavesdropper is above a specific threshold greatly improves secrecy performance
Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks
Recent years have witnessed a significant growth in wireless communication and networking due to the exponential growth in mobile applications and smart devices, fueling unprecedented increase in both mobile data traffic and energy demand. Among such data traffic, real-time data transmissions in wireless systems require certain quality of service (QoS) constraints e.g., in terms of delay, buffer overflow or packet drop/loss probabilities, so that acceptable performance levels can be guaranteed for the end-users, especially in delay sensitive scenarios, such as live video transmission, interactive video (e.g., teleconferencing), and mobile online gaming. With this motivation, statistical queuing constraints are considered in this thesis, imposed as limitations on the decay rate of buffer overflow probabilities. In particular, the throughput and energy efficiency of different types of wireless network models are analyzed under QoS constraints, and optimal resource allocation algorithms are proposed to maximize the throughput or minimize the delay.
In the first part of the thesis, the throughput and energy efficiency analysis for hybrid automatic repeat request (HARQ) protocols are conducted under QoS constraints. Approximations are employed for small QoS exponent values in order to obtain closed-form expressions for the throughput and energy efficiency metrics. Also, the impact of random arrivals, deadline constraints, outage probability and QoS constraints are studied. For the same system setting, the throughput of HARQ system is also analyzed using a recurrence approach, which provides more accurate results for any value of the QoS exponent. Similarly, random arrival models and deadline constraints are considered, and these results are further extended to the finite-blocklength coding regime.
Next, cooperative relay networks are considered under QoS constraints. Specifically, the throughput performance in the two-hop relay channel, two-way relay channel, and multi-source multi-destination relay networks is analyzed. Finite-blocklength codes are considered for the two-hop relay channel, and optimization over the error probabilities is investigated. For the multi-source multi-destination relay network model, the throughput for both cases of with and without CSI at the transmitter sides is studied. When there is perfect CSI at the transmitter, transmission rates can be varied according to instantaneous channel conditions. When CSI is not available at the transmitter side, transmissions are performed at fixed rates, and decoding failures lead to retransmission requests via an ARQ protocol.
Following the analysis of cooperative networks, the performance of both half-duplex and full-duplex operations is studied for the two-way multiple input multiple output (MIMO) system under QoS constraints. In full-duplex mode, the self-interference inflicted on the reception of a user due to simultaneous transmissions from the same user is taken into account. In this setting, the system throughput
is formulated by considering the sum of the effective capacities of the users in both half-duplex and full-duplex modes. The low signal to noise ratio (SNR) regime is considered and the optimal transmission/power-allocation strategies are characterized by identifying the optimal input covariance matrices.
Next, mode selection and resource allocation for device-to-device (D2D) cellular networks are studied. As the starting point, ransmission mode selection and resource allocation are analyzed for a time-division multiplexed (TDM) cellular network with one cellular user, one base station, and a pair of D2D users under rate and QoS constraints. For a more complicated setting with multiple cellular and D2D users, two joint mode selection and resource allocation algorithms are proposed. In the first algorithm, the channel allocation problem is formulated as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. In the second algorithm, the problem is divided into three subproblems, namely user partition, power allocation and channel assignment, and a novel three-step method is proposed by combining the algorithms designed for the three subproblems.
In the final part of the thesis, resource allocation algorithms are investigated for content delivery over wireless networks. Three different systems are considered. Initially, a caching algorithm is designed, which minimizes the average delay of a single-cell network. The proposed algorithm is applicable in settings with very general popularity models, with no assumptions on how file popularity varies among different users, and this algorithm is further extended to a more general setting, in which the system parameters and the distributions of channel fading change over time. Next, for D2D cellular networks operating under deadline constraints, a scheduling algorithm is designed, which manages mode selection, channel allocation and power maximization with acceptable complexity. This proposed scheduling algorithm is designed based on the convex delay cost method for a D2D cellular network with deadline constraints in an OFDMA setting. Power optimization algorithms are proposed for all possible modes, based on our utility definition. Finally, a two-step intercell interference (ICI)-aware scheduling algorithm is proposed for cloud radio access networks (C-RANs), which performs user grouping and resource allocation with the goal of minimizing delay violation probability. A novel user grouping algorithm is developed for the user grouping step, which controls the interference among the users in the same group, and the channel assignment problem is formulated as a maximum-weight matching problem in the second step, which can be solved using standard algorithms in graph theory
Generalized Area Spectral Efficiency: An Effective Performance Metric for Green Wireless Communications
Area spectral efficiency (ASE) was introduced as a metric to quantify the
spectral utilization efficiency of cellular systems. Unlike other performance
metrics, ASE takes into account the spatial property of cellular systems. In
this paper, we generalize the concept of ASE to study arbitrary wireless
transmissions. Specifically, we introduce the notion of affected area to
characterize the spatial property of arbitrary wireless transmissions. Based on
the definition of affected area, we define the performance metric, generalized
area spectral efficiency (GASE), to quantify the spatial spectral utilization
efficiency as well as the greenness of wireless transmissions. After
illustrating its evaluation for point-to-point transmission, we analyze the
GASE performance of several different transmission scenarios, including
dual-hop relay transmission, three-node cooperative relay transmission and
underlay cognitive radio transmission. We derive closed-form expressions for
the GASE metric of each transmission scenario under Rayleigh fading environment
whenever possible. Through mathematical analysis and numerical examples, we
show that the GASE metric provides a new perspective on the design and
optimization of wireless transmissions, especially on the transmitting power
selection. We also show that introducing relay nodes can greatly improve the
spatial utilization efficiency of wireless systems. We illustrate that the GASE
metric can help optimize the deployment of underlay cognitive radio systems.Comment: 11 pages, 8 figures, accepted by TCo
End-to-End Joint Antenna Selection Strategy and Distributed Compress and Forward Strategy for Relay Channels
Multi-hop relay channels use multiple relay stages, each with multiple relay
nodes, to facilitate communication between a source and destination.
Previously, distributed space-time codes were proposed to maximize the
achievable diversity-multiplexing tradeoff, however, they fail to achieve all
the points of the optimal diversity-multiplexing tradeoff. In the presence of a
low-rate feedback link from the destination to each relay stage and the source,
this paper proposes an end-to-end antenna selection (EEAS) strategy as an
alternative to distributed space-time codes. The EEAS strategy uses a subset of
antennas of each relay stage for transmission of the source signal to the
destination with amplify and forwarding at each relay stage. The subsets are
chosen such that they maximize the end-to-end mutual information at the
destination. The EEAS strategy achieves the corner points of the optimal
diversity-multiplexing tradeoff (corresponding to maximum diversity gain and
maximum multiplexing gain) and achieves better diversity gain at intermediate
values of multiplexing gain, versus the best known distributed space-time
coding strategies. A distributed compress and forward (CF) strategy is also
proposed to achieve all points of the optimal diversity-multiplexing tradeoff
for a two-hop relay channel with multiple relay nodes.Comment: Accepted for publication in the special issue on cooperative
communication in the Eurasip Journal on Wireless Communication and Networkin
- …