5,813 research outputs found
Stability Region of a Slotted Aloha Network with K-Exponential Backoff
Stability region of random access wireless networks is known for only simple
network scenarios. The main problem in this respect is due to interaction among
queues. When transmission probabilities during successive transmissions change,
e.g., when exponential backoff mechanism is exploited, the interactions in the
network are stimulated. In this paper, we derive the stability region of a
buffered slotted Aloha network with K-exponential backoff mechanism,
approximately, when a finite number of nodes exist. To this end, we propose a
new approach in modeling the interaction among wireless nodes. In this
approach, we model the network with inter-related quasi-birth-death (QBD)
processes such that at each QBD corresponding to each node, a finite number of
phases consider the status of the other nodes. Then, by exploiting the
available theorems on stability of QBDs, we find the stability region. We show
that exponential backoff mechanism is able to increase the area of the
stability region of a simple slotted Aloha network with two nodes, more than
40\%. We also show that a slotted Aloha network with exponential backoff may
perform very near to ideal scheduling. The accuracy of our modeling approach is
verified by simulation in different conditions.Comment: 30 pages, 6 figure
On Orthogonal Band Allocation for Multi-User Multi-Band Cognitive Radio Networks: Stability Analysis
In this work, we study the problem of band allocation of buffered
secondary users (SUs) to primary bands licensed to (owned by)
buffered primary users (PUs). The bands are assigned to SUs in an orthogonal
(one-to-one) fashion such that neither band sharing nor multi-band allocations
are permitted. In order to study the stability region of the secondary network,
the optimization problem used to obtain the stability region's envelope
(closure) is established and is shown to be a linear program which can be
solved efficiently and reliably. We compare our orthogonal allocation system
with two typical low-complexity and intuitive band allocation systems. In one
system, each cognitive user chooses a band randomly in each time slot with some
assignment probability designed such that the system maintained stable, while
in the other system fixed (deterministic) band assignment is adopted throughout
the lifetime of the network. We derive the stability regions of these two
systems. We prove mathematically, as well as through numerical results, the
advantages of our proposed orthogonal system over the other two systems.Comment: Conditional Acceptance in IEEE Transactions on Communication
Cognitive Access Policies under a Primary ARQ process via Forward-Backward Interference Cancellation
This paper introduces a novel technique for access by a cognitive Secondary
User (SU) using best-effort transmission to a spectrum with an incumbent
Primary User (PU), which uses Type-I Hybrid ARQ. The technique leverages the
primary ARQ protocol to perform Interference Cancellation (IC) at the SU
receiver (SUrx). Two IC mechanisms that work in concert are introduced: Forward
IC, where SUrx, after decoding the PU message, cancels its interference in the
(possible) following PU retransmissions of the same message, to improve the SU
throughput; Backward IC, where SUrx performs IC on previous SU transmissions,
whose decoding failed due to severe PU interference. Secondary access policies
are designed that determine the secondary access probability in each state of
the network so as to maximize the average long-term SU throughput by
opportunistically leveraging IC, while causing bounded average long-term PU
throughput degradation and SU power expenditure. It is proved that the optimal
policy prescribes that the SU prioritizes its access in the states where SUrx
knows the PU message, thus enabling IC. An algorithm is provided to optimally
allocate additional secondary access opportunities in the states where the PU
message is unknown. Numerical results are shown to assess the throughput gain
provided by the proposed techniques.Comment: 16 pages, 11 figures, 2 table
Network Coding in a Multicast Switch
We consider the problem of serving multicast flows in a crossbar switch. We
show that linear network coding across packets of a flow can sustain traffic
patterns that cannot be served if network coding were not allowed. Thus,
network coding leads to a larger rate region in a multicast crossbar switch. We
demonstrate a traffic pattern which requires a switch speedup if coding is not
allowed, whereas, with coding the speedup requirement is eliminated completely.
In addition to throughput benefits, coding simplifies the characterization of
the rate region. We give a graph-theoretic characterization of the rate region
with fanout splitting and intra-flow coding, in terms of the stable set
polytope of the 'enhanced conflict graph' of the traffic pattern. Such a
formulation is not known in the case of fanout splitting without coding. We
show that computing the offline schedule (i.e. using prior knowledge of the
flow arrival rates) can be reduced to certain graph coloring problems. Finally,
we propose online algorithms (i.e. using only the current queue occupancy
information) for multicast scheduling based on our graph-theoretic formulation.
In particular, we show that a maximum weighted stable set algorithm stabilizes
the queues for all rates within the rate region.Comment: 9 pages, submitted to IEEE INFOCOM 200
On the Stability of Random Multiple Access with Stochastic Energy Harvesting
In this paper, we consider the random access of nodes having energy
harvesting capability and a battery to store the harvested energy. Each node
attempts to transmit the head-of-line packet in the queue if its battery is
nonempty. The packet and energy arrivals into the queue and the battery are all
modeled as a discrete-time stochastic process. The main contribution of this
paper is the exact characterization of the stability region of the packet
queues given the energy harvesting rates when a pair of nodes are randomly
accessing a common channel having multipacket reception (MPR) capability. The
channel with MPR capability is a generalized form of the wireless channel
modeling which allows probabilistic receptions of the simultaneously
transmitted packets. The results obtained in this paper are fairly general as
the cases with unlimited energy for transmissions both with the collision
channel and the channel with MPR capability can be derived from ours as special
cases. Furthermore, we study the impact of the finiteness of the batteries on
the achievable stability region.Comment: The material in this paper was presented in part at the IEEE
International Symposium on Information Theory, Saint Petersburg, Russia, Aug.
201
- …