2,528 research outputs found
ARQ for Network Coding
A new coding and queue management algorithm is proposed for communication
networks that employ linear network coding. The algorithm has the feature that
the encoding process is truly online, as opposed to a block-by-block approach.
The setup assumes a packet erasure broadcast channel with stochastic arrivals
and full feedback, but the proposed scheme is potentially applicable to more
general lossy networks with link-by-link feedback. The algorithm guarantees
that the physical queue size at the sender tracks the backlog in degrees of
freedom (also called the virtual queue size). The new notion of a node "seeing"
a packet is introduced. In terms of this idea, our algorithm may be viewed as a
natural extension of ARQ schemes to coded networks. Our approach, known as the
drop-when-seen algorithm, is compared with a baseline queuing approach called
drop-when-decoded. It is shown that the expected queue size for our approach is
as opposed to for the baseline
approach, where is the load factor.Comment: Submitted to the 2008 IEEE International Symposium on Information
Theory (ISIT 2008
Optimal Random Access and Random Spectrum Sensing for an Energy Harvesting Cognitive Radio with and without Primary Feedback Leveraging
We consider a secondary user (SU) with energy harvesting capability. We
design access schemes for the SU which incorporate random spectrum sensing and
random access, and which make use of the primary automatic repeat request (ARQ)
feedback. We study two problem-formulations. In the first problem-formulation,
we characterize the stability region of the proposed schemes. The sensing and
access probabilities are obtained such that the secondary throughput is
maximized under the constraints that both the primary and secondary queues are
stable. Whereas in the second problem-formulation, the sensing and access
probabilities are obtained such that the secondary throughput is maximized
under the stability of the primary queue and that the primary queueing delay is
kept lower than a specified value needed to guarantee a certain quality of
service (QoS) for the primary user (PU). We consider spectrum sensing errors
and assume multipacket reception (MPR) capabilities. Numerical results show the
enhanced performance of our proposed systems.Comment: ACCEPTED in EAI Endorsed Transactions on Cognitive Communications.
arXiv admin note: substantial text overlap with arXiv:1208.565
Large deviations sum-queue optimality of a radial sum-rate monotone opportunistic scheduler
A centralized wireless system is considered that is serving a fixed set of
users with time varying channel capacities. An opportunistic scheduling rule in
this context selects a user (or users) to serve based on the current channel
state and user queues. Unless the user traffic is symmetric and/or the
underlying capacity region a polymatroid, little is known concerning how
performance optimal schedulers should tradeoff "maximizing current service
rate" (being opportunistic) versus "balancing unequal queues" (enhancing
user-diversity to enable future high service rate opportunities). By contrast
with currently proposed opportunistic schedulers, e.g., MaxWeight and Exp Rule,
a radial sum-rate monotone (RSM) scheduler de-emphasizes queue-balancing in
favor of greedily maximizing the system service rate as the queue-lengths are
scaled up linearly. In this paper it is shown that an RSM opportunistic
scheduler, p-Log Rule, is not only throughput-optimal, but also maximizes the
asymptotic exponential decay rate of the sum-queue distribution for a two-queue
system. The result complements existing optimality results for opportunistic
scheduling and point to RSM schedulers as a good design choice given the need
for robustness in wireless systems with both heterogeneity and high degree of
uncertainty.Comment: Revised version. Major changes include addition of
details/intermediate steps in various proofs, a summary of technical steps in
Table 1, and correction of typos
- …