1,463 research outputs found
Joint Cooperative Spectrum Sensing and MAC Protocol Design for Multi-channel Cognitive Radio Networks
In this paper, we propose a semi-distributed cooperative spectrum sen sing
(SDCSS) and channel access framework for multi-channel cognitive radio networks
(CRNs). In particular, we c onsider a SDCSS scheme where secondary users (SUs)
perform sensing and exchange sensing outcomes with ea ch other to locate
spectrum holes. In addition, we devise the p -persistent CSMA-based cognitive
MAC protocol integrating the SDCSS to enable efficient spectrum sharing among
SUs. We then perform throughput analysis and develop an algorithm to determine
the spectrum sensing and access parameters to maximize the throughput for a
given allocation of channel sensing sets. Moreover, we consider the spectrum
sensing set optimization problem for SUs to maxim ize the overall system
throughput. We present both exhaustive search and low-complexity greedy
algorithms to determine the sensing sets for SUs and analyze their complexity.
We also show how our design and analysis can be extended to consider reporting
errors. Finally, extensive numerical results are presented to demonstrate the
sig nificant performance gain of our optimized design framework with respect to
non-optimized designs as well as the imp acts of different protocol parameters
on the throughput performance.Comment: accepted for publication EURASIP Journal on Wireless Communications
and Networking, 201
An Approximate Inner Bound to the QoS Aware Throughput Region of a Tree Network under IEEE 802.15.4 CSMA/CA and Application to Wireless Sensor Network Design
We consider a tree network spanning a set of source nodes that generate
measurement packets, a set of additional relay nodes that only forward packets
from the sources, and a data sink. We assume that the paths from the sources to
the sink have bounded hop count. We assume that the nodes use the IEEE 802.15.4
CSMA/CA for medium access control, and that there are no hidden terminals. In
this setting, starting with a set of simple fixed point equations, we derive
sufficient conditions for the tree network to approximately satisfy certain
given QoS targets such as end-to-end delivery probability and delay under a
given rate of generation of measurement packets at the sources (arrival rates
vector). The structures of our sufficient conditions provide insight on the
dependence of the network performance on the arrival rate vector, and the
topological properties of the network. Furthermore, for the special case of
equal arrival rates, default backoff parameters, and for a range of values of
target QoS, we show that among all path-length-bounded trees (spanning a given
set of sources and BS) that meet the sufficient conditions, a shortest path
tree achieves the maximum throughput
Spatial CSMA: A Distributed Scheduling Algorithm for the SIR Model with Time-varying Channels
Recent work has shown that adaptive CSMA algorithms can achieve throughput
optimality. However, these adaptive CSMA algorithms assume a rather simplistic
model for the wireless medium. Specifically, the interference is typically
modelled by a conflict graph, and the channels are assumed to be static. In
this work, we propose a distributed and adaptive CSMA algorithm under a more
realistic signal-to-interference ratio (SIR) based interference model, with
time-varying channels. We prove that our algorithm is throughput optimal under
this generalized model. Further, we augment our proposed algorithm by using a
parallel update technique. Numerical results show that our algorithm
outperforms the conflict graph based algorithms, in terms of supportable
throughput and the rate of convergence to steady-state.Comment: This work has been presented at National Conference on Communication,
2015, held at IIT Bombay, Mumbai, Indi
An Analytical Model for Wireless Mesh Networks with Collision-Free TDMA and Finite Queues
Wireless mesh networks are a promising technology for connecting sensors and
actuators with high flexibility and low investment costs. In industrial
applications, however, reliability is essential. Therefore, two time-slotted
medium access methods, DSME and TSCH, were added to the IEEE 802.15.4 standard.
They allow collision-free communication in multi-hop networks and provide
channel hopping for mitigating external interferences. The slot schedule used
in these networks is of high importance for the network performance. This paper
supports the development of efficient schedules by providing an analytical
model for the assessment of such schedules, focused on TSCH. A Markov chain
model for the finite queue on every node is introduced that takes the slot
distribution into account. The models of all nodes are interconnected to
calculate network metrics such as packet delivery ratio, end-to-end delay and
throughput. An evaluation compares the model with a simulation of the Orchestra
schedule. The model is applied to Orchestra as well as to two simple
distributed scheduling algorithms to demonstrate the importance of
traffic-awareness for achieving high throughput.Comment: 17 pages, 14 figure
Delay performance in random-access grid networks
We examine the impact of torpid mixing and meta-stability issues on the delay
performance in wireless random-access networks. Focusing on regular meshes as
prototypical scenarios, we show that the mean delays in an toric
grid with normalized load are of the order . This
superlinear delay scaling is to be contrasted with the usual linear growth of
the order in conventional queueing networks. The intuitive
explanation for the poor delay characteristics is that (i) high load requires a
high activity factor, (ii) a high activity factor implies extremely slow
transitions between dominant activity states, and (iii) slow transitions cause
starvation and hence excessively long queues and delays. Our proof method
combines both renewal and conductance arguments. A critical ingredient in
quantifying the long transition times is the derivation of the communication
height of the uniformized Markov chain associated with the activity process. We
also discuss connections with Glauber dynamics, conductance and mixing times.
Our proof framework can be applied to other topologies as well, and is also
relevant for the hard-core model in statistical physics and the sampling from
independent sets using single-site update Markov chains
Temporal starvation in multi-channel CSMA networks: an analytical framework
In this paper we consider a stochastic model for a frequency-agile CSMA
protocol for wireless networks where multiple orthogonal frequency channels are
available. Even when the possible interference on the different channels is
described by different conflict graphs, we show that the network dynamics can
be equivalently described as that of a single-channel CSMA algorithm on an
appropriate virtual network. Our focus is on the asymptotic regime in which the
network nodes try to activate aggressively in order to achieve maximum
throughput. Of particular interest is the scenario where the number of
available channels is not sufficient for all nodes of the network to be
simultaneously active and the well-studied temporal starvation issues of the
single-channel CSMA dynamics persist. For most networks we expect that a larger
number of available channels should alleviate these temporal starvation issues.
However, we prove that the aggregate throughput is a non-increasing function of
the number of available channels. To investigate this trade-off that emerges
between aggregate throughput and temporal starvation phenomena, we propose an
analytical framework to study the transient dynamics of multi-channel CSMA
networks by means of first hitting times. Our analysis further reveals that the
mixing time of the activity process does not always correctly characterize the
temporal starvation in the multi-channel scenario and often leads to
pessimistic performance estimates.Comment: 15 pages, 4 figures. Accepted for publication at IFIP Performance
Conference 201
- …