272 research outputs found
Combining queueing theory with information theory for multiaccess
Caption title.Includes bibliographical references (leaf [7]).Supported by the U.S. Army Research Office. DAAL03-86-K-0171Ä°. Emre Telatar and Robert G. Gallager
Scheduling for Stable and Reliable Communication over Multiaccess Channels and Degraded Broadcast Channels
Information-theoretic arguments focus on modeling the reliability of
information transmission, assuming availability of infinite data at sources,
thus ignoring randomness in message generation times at the respective sources.
However, in information transport networks, not only is reliable transmission
important, but also stability, i.e., finiteness of mean delay incurred by
messages from the time of generation to the time of successful reception.
Usually, delay analysis is done separately using queueing-theoretic arguments,
whereas reliable information transmission is studied using information theory.
In this thesis, we investigate these two important aspects of data
communication jointly by suitably combining models from these two fields. In
particular, we model scheduled communication of messages, that arrive in a
random process, (i) over multiaccess channels, with either independent decoding
or joint decoding, and (ii) over degraded broadcast channels. The scheduling
policies proposed permit up to a certain maximum number of messages for
simultaneous transmission.
In the first part of the thesis, we develop a multi-class discrete-time
processor-sharing queueing model, and then investigate the stability of this
queue. In particular, we model the queue by a discrete-time Markov chain
defined on a countable state space, and then establish (i) a sufficient
condition for -regularity of the chain, and hence positive recurrence and
finiteness of stationary mean of the function of the state, and (ii) a
sufficient condition for transience of the chain. These stability results form
the basis for the conclusions drawn in the thesis.Comment: Ph.D. Thesis submitted to Department of Electrical Communication
Engineering at Indian Institute of Science, Bangalore, Indi
Age-Optimal Updates of Multiple Information Flows
In this paper, we study an age of information minimization problem, where
multiple flows of update packets are sent over multiple servers to their
destinations. Two online scheduling policies are proposed. When the packet
generation and arrival times are synchronized across the flows, the proposed
policies are shown to be (near) optimal for minimizing any time-dependent,
symmetric, and non-decreasing penalty function of the ages of the flows over
time in a stochastic ordering sense
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
Status Updates Over Unreliable Multiaccess Channels
Applications like environmental sensing, and health and activity sensing, are
supported by networks of devices (nodes) that send periodic packet
transmissions over the wireless channel to a sink node. We look at simple
abstractions that capture the following commonalities of such networks (a) the
nodes send periodically sensed information that is temporal and must be
delivered in a timely manner, (b) they share a multiple access channel and (c)
channels between the nodes and the sink are unreliable (packets may be received
in error) and differ in quality.
We consider scheduled access and slotted ALOHA-like random access. Under
scheduled access, nodes take turns and get feedback on whether a transmitted
packet was received successfully by the sink. During its turn, a node may
transmit more than once to counter channel uncertainty. For slotted ALOHA-like
access, each node attempts transmission in every slot with a certain
probability. For these access mechanisms we derive the age of information
(AoI), which is a timeliness metric, and arrive at conditions that optimize AoI
at the sink. We also analyze the case of symmetric updating, in which updates
from different nodes must have the same AoI. We show that ALOHA-like access,
while simple, leads to AoI that is worse by a factor of about 2e, in comparison
to scheduled access
- …