2,650 research outputs found
A Survey on Delay-Aware Resource Control for Wireless Systems --- Large Deviation Theory, Stochastic Lyapunov Drift and Distributed Stochastic Learning
In this tutorial paper, a comprehensive survey is given on several major
systematic approaches in dealing with delay-aware control problems, namely the
equivalent rate constraint approach, the Lyapunov stability drift approach and
the approximate Markov Decision Process (MDP) approach using stochastic
learning. These approaches essentially embrace most of the existing literature
regarding delay-aware resource control in wireless systems. They have their
relative pros and cons in terms of performance, complexity and implementation
issues. For each of the approaches, the problem setup, the general solution and
the design methodology are discussed. Applications of these approaches to
delay-aware resource allocation are illustrated with examples in single-hop
wireless networks. Furthermore, recent results regarding delay-aware multi-hop
routing designs in general multi-hop networks are elaborated. Finally, the
delay performance of the various approaches are compared through simulations
using an example of the uplink OFDMA systems.Comment: 58 pages, 8 figures; IEEE Transactions on Information Theory, 201
End-to-End Delay Distribution Analysis for Stochastic Admission Control in Multi-hop Wireless Networks
published_or_final_versio
Modeling, Simulation and Analysis of Video Streaming Errors in Wireless Wideband Access Networks
Analysis of simulated models has become a veritable tool for
investigating network behavioral patterns vis-Ă -vis transmitted content. The
streaming video research domain employs modeling extensively due to availability
of relevant tools. A vast majority of which are presented on the FOSS platform.
The transmission of audio and video streaming services over different media is
becoming ever more popular. This widespread increase is accompanied by the
difficult task of maintaining the QoS of streaming video. The use of very accurate
coding techniques for transmissions over wireless networks alone cannot guarantee
a complete eradication of distortions characteristic of the video signal. A software-
hardware composite system has been developed for investigating the effect of
single bit error and bit packet errors in wideband wireless access systems on the
quality of H.264/AVC standard video streams. Numerical results of the modeling
and analysis of the effect of interference robustness on quality of video streaming
are presented and discussed. Analytic results also suggest that the Markov model
of packetization of error obtained from a real network for streaming video can be
used in the simulations of transmission of video across networks in the hardware-
software complex developed by the authors in a previous work
Permutation Trellis Coded Multi-level FSK Signaling to Mitigate Primary User Interference in Cognitive Radio Networks
We employ Permutation Trellis Code (PTC) based multi-level Frequency Shift
Keying signaling to mitigate the impact of Primary Users (PUs) on the
performance of Secondary Users (SUs) in Cognitive Radio Networks (CRNs). The
PUs are assumed to be dynamic in that they appear intermittently and stay
active for an unknown duration. Our approach is based on the use of PTC
combined with multi-level FSK modulation so that an SU can improve its data
rate by increasing its transmission bandwidth while operating at low power and
not creating destructive interference for PUs. We evaluate system performance
by obtaining an approximation for the actual Bit Error Rate (BER) using
properties of the Viterbi decoder and carry out a thorough performance analysis
in terms of BER and throughput. The results show that the proposed coded system
achieves i) robustness by ensuring that SUs have stable throughput in the
presence of heavy PU interference and ii) improved resiliency of SU links to
interference in the presence of multiple dynamic PUs.Comment: 30 pages, 12 figure
Cross-layer design of multi-hop wireless networks
MULTI -hop wireless networks are usually defined as a collection of nodes
equipped with radio transmitters, which not only have the capability to
communicate each other in a multi-hop fashion, but also to route each others’ data
packets. The distributed nature of such networks makes them suitable for a variety of
applications where there are no assumed reliable central entities, or controllers, and
may significantly improve the scalability issues of conventional single-hop wireless
networks.
This Ph.D. dissertation mainly investigates two aspects of the research issues
related to the efficient multi-hop wireless networks design, namely: (a) network
protocols and (b) network management, both in cross-layer design paradigms to
ensure the notion of service quality, such as quality of service (QoS) in wireless mesh
networks (WMNs) for backhaul applications and quality of information (QoI) in
wireless sensor networks (WSNs) for sensing tasks. Throughout the presentation of
this Ph.D. dissertation, different network settings are used as illustrative examples,
however the proposed algorithms, methodologies, protocols, and models are not
restricted in the considered networks, but rather have wide applicability.
First, this dissertation proposes a cross-layer design framework integrating
a distributed proportional-fair scheduler and a QoS routing algorithm, while using
WMNs as an illustrative example. The proposed approach has significant performance
gain compared with other network protocols. Second, this dissertation proposes
a generic admission control methodology for any packet network, wired and
wireless, by modeling the network as a black box, and using a generic mathematical
0. Abstract 3
function and Taylor expansion to capture the admission impact. Third, this dissertation
further enhances the previous designs by proposing a negotiation process,
to bridge the applications’ service quality demands and the resource management,
while using WSNs as an illustrative example. This approach allows the negotiation
among different service classes and WSN resource allocations to reach the optimal
operational status. Finally, the guarantees of the service quality are extended to
the environment of multiple, disconnected, mobile subnetworks, where the question
of how to maintain communications using dynamically controlled, unmanned data
ferries is investigated
Delay Constrained Throughput Analysis of a Correlated MIMO Wireless Channel
The maximum traffic arrival rate at the network for a given delay guarantee
(delay constrained throughput) has been well studied for wired channels.
However, few results are available for wireless channels, especially when
multiple antennas are employed at the transmitter and receiver. In this work,
we analyze the network delay constrained throughput of a multiple input
multiple output (MIMO) wireless channel with time-varying spatial correlation.
The MIMO channel is modeled via its virtual representation, where the
individual spatial paths between the antenna pairs are Gilbert-Elliot channels.
The whole system is then described by a K-State Markov chain, where K depends
upon the degree of freedom (DOF) of the channel. We prove that the DOF based
modeling is indeed accurate. Furthermore, we study the impact of the delay
requirements at the network layer, violation probability and the number of
antennas on the throughput under different fading speeds and signal strength.Comment: Submitted to ICCCN 2011, 8 pages, 5 figure
A Queueing Characterization of Information Transmission over Block Fading Rayleigh Channels in the Low SNR
Unlike the AWGN (additive white gaussian noise) channel, fading channels
suffer from random channel gains besides the additive Gaussian noise. As a
result, the instantaneous channel capacity varies randomly along time, which
makes it insufficient to characterize the transmission capability of a fading
channel using data rate only. In this paper, the transmission capability of a
buffer-aided block Rayleigh fading channel is examined by a constant rate input
data stream, and reflected by several parameters such as the average queue
length, stationary queue length distribution, packet delay and overflow
probability. Both infinite-buffer model and finite-buffer model are considered.
Taking advantage of the memoryless property of the service provided by the
channel in each block in the the low SNR (signal-to-noise ratio) regime, the
information transmission over the channel is formulated as a \textit{discrete
time discrete state} queueing problem. The obtained results show that
block fading channels are unable to support a data rate close to their ergodic
capacity, no matter how long the buffer is, even seen from the application
layer. For the finite-buffer model, the overflow probability is derived with
explicit expression, and is shown to decrease exponentially when buffer size is
increased, even when the buffer size is very small.Comment: 29 pages, 11 figures. More details on the proof of Theorem 1 and
proposition 1 can be found in "Queueing analysis for block fading Rayleigh
channels in the low SNR regime ", IEEE WCSP 2013.It has been published by
IEEE Trans. on Veh. Technol. in Feb. 201
- …