1,505 research outputs found
A Fast-CSMA Algorithm for Deadline-Constrained Scheduling over Wireless Fading Channels
Recently, low-complexity and distributed Carrier Sense Multiple Access
(CSMA)-based scheduling algorithms have attracted extensive interest due to
their throughput-optimal characteristics in general network topologies.
However, these algorithms are not well-suited for serving real-time traffic
under time-varying channel conditions for two reasons: (1) the mixing time of
the underlying CSMA Markov Chain grows with the size of the network, which, for
large networks, generates unacceptable delay for deadline-constrained traffic;
(2) since the dynamic CSMA parameters are influenced by the arrival and channel
state processes, the underlying CSMA Markov Chain may not converge to a
steady-state under strict deadline constraints and fading channel conditions.
In this paper, we attack the problem of distributed scheduling for serving
real-time traffic over time-varying channels. Specifically, we consider
fully-connected topologies with independently fading channels (which can model
cellular networks) in which flows with short-term deadline constraints and
long-term drop rate requirements are served. To that end, we first characterize
the maximal set of satisfiable arrival processes for this system and, then,
propose a Fast-CSMA (FCSMA) policy that is shown to be optimal in supporting
any real-time traffic that is within the maximal satisfiable set. These
theoretical results are further validated through simulations to demonstrate
the relative efficiency of the FCSMA policy compared to some of the existing
CSMA-based algorithms.Comment: This work appears in workshop on Resource Allocation and Cooperation
in Wireless Networks (RAWNET), Princeton, NJ, May, 201
Performance Analysis of Cognitive Radio Systems under QoS Constraints and Channel Uncertainty
In this paper, performance of cognitive transmission over time-selective flat
fading channels is studied under quality of service (QoS) constraints and
channel uncertainty. Cognitive secondary users (SUs) are assumed to initially
perform channel sensing to detect the activities of the primary users, and then
attempt to estimate the channel fading coefficients through training. Energy
detection is employed for channel sensing, and different minimum
mean-square-error (MMSE) estimation methods are considered for channel
estimation. In both channel sensing and estimation, erroneous decisions can be
made, and hence, channel uncertainty is not completely eliminated. In this
setting, performance is studied and interactions between channel sensing and
estimation are investigated.
Following the channel sensing and estimation tasks, SUs engage in data
transmission. Transmitter, being unaware of the channel fading coefficients, is
assumed to send the data at fixed power and rate levels that depend on the
channel sensing results. Under these assumptions, a state-transition model is
constructed by considering the reliability of the transmissions, channel
sensing decisions and their correctness, and the evolution of primary user
activity which is modeled as a two-state Markov process. In the data
transmission phase, an average power constraint on the secondary users is
considered to limit the interference to the primary users, and statistical
limitations on the buffer lengths are imposed to take into account the QoS
constraints of the secondary traffic. The maximum throughput under these
statistical QoS constraints is identified by finding the effective capacity of
the cognitive radio channel. Numerical results are provided for the power and
rate policies
- …