913 research outputs found
Opportunistic Relaying in Wireless Networks
Relay networks having source-to-destination pairs and half-duplex
relays, all operating in the same frequency band in the presence of block
fading, are analyzed. This setup has attracted significant attention and
several relaying protocols have been reported in the literature. However, most
of the proposed solutions require either centrally coordinated scheduling or
detailed channel state information (CSI) at the transmitter side. Here, an
opportunistic relaying scheme is proposed, which alleviates these limitations.
The scheme entails a two-hop communication protocol, in which sources
communicate with destinations only through half-duplex relays. The key idea is
to schedule at each hop only a subset of nodes that can benefit from
\emph{multiuser diversity}. To select the source and destination nodes for each
hop, it requires only CSI at receivers (relays for the first hop, and
destination nodes for the second hop) and an integer-value CSI feedback to the
transmitters. For the case when is large and is fixed, it is shown that
the proposed scheme achieves a system throughput of bits/s/Hz. In
contrast, the information-theoretic upper bound of bits/s/Hz
is achievable only with more demanding CSI assumptions and cooperation between
the relays. Furthermore, it is shown that, under the condition that the product
of block duration and system bandwidth scales faster than , the
achievable throughput of the proposed scheme scales as .
Notably, this is proven to be the optimal throughput scaling even if
centralized scheduling is allowed, thus proving the optimality of the proposed
scheme in the scaling law sense.Comment: 17 pages, 8 figures, To appear in IEEE Transactions on Information
Theor
Spatial Interference Cancelation for Mobile Ad Hoc Networks: Perfect CSI
Interference between nodes directly limits the capacity of mobile ad hoc
networks. This paper focuses on spatial interference cancelation with perfect
channel state information (CSI), and analyzes the corresponding network
capacity. Specifically, by using multiple antennas, zero-forcing beamforming is
applied at each receiver for canceling the strongest interferers. Given spatial
interference cancelation, the network transmission capacity is analyzed in this
paper, which is defined as the maximum transmitting node density under
constraints on outage and the signal-to-interference-noise ratio. Assuming the
Poisson distribution for the locations of network nodes and spatially i.i.d.
Rayleigh fading channels, mathematical tools from stochastic geometry are
applied for deriving scaling laws for transmission capacity. Specifically, for
small target outage probability, transmission capacity is proved to increase
following a power law, where the exponent is the inverse of the size of antenna
array or larger depending on the pass loss exponent. As shown by simulations,
spatial interference cancelation increases transmission capacity by an order of
magnitude or more even if only one extra antenna is added to each node.Comment: 6 pages; submitted to IEEE Globecom 200
Information-theoretic Capacity of Clustered Random Networks
We analyze the capacity scaling laws of clustered ad hoc networks in which
nodes are distributed according to a doubly stochastic shot-noise Cox process.
We identify five different operational regimes, and for each regime we devise a
communication strategy that allows to achieve a throughput to within a
poly-logarithmic factor (in the number of nodes) of the maximum theoretical
capacity.Comment: 6 pages, in Proceedings of ISIT 201
How MIMO cross-layer design enables QoS while detecting non-cooperative nodes in wireless multi-hop networks
In Journal of Network and Computer Applications (JNCA). DOI: 10.1016/j.jnca.2014.07.011International audienceWireless Multi-hop Networks (WMNs) are based on the cooperation between nodes. The non-cooperative (selfish) nodes can affect the quality of services (QoS) delivered by the network. The solutions proposed in literature are based on the monitoring mechanism to detect non-cooperative nodes. However, the monitoring mechanism has to tackle a significant false alarm rate. The origin of these issues is mainly related to the interferences and the costs of the monitoring mechanism. In WMNs based on Single-Input Single-Output (SISO) technology, the interferences at the monitor (detector) node can affect the assessment and the accuracy of the monitor node's observation. In this paper, we use Multi-Input and Multi-Output (MIMO) technology to tackle these drawbacks and to perform the monitoring mechanism without affecting the QoS. We propose a new MAC protocol based on the well-known SPACE-MAC protocol, named MIMODog. The collision at the monitor node can be avoided by tuning the antennas' weights. Therefore, the signal coming from other nodes than the monitored one can be nullified. Thus, this solution allows an important improvement of the accuracy of the monitor node's observation. Moreover, we propose a monitoring capacity analysis using graph theory particularly Conflict Graph (CG), and asymptotic study. We illustrate that the capacity consumed in the case of MIMODog is costly compared to SPACE-MAC, but the accuracy of the observation is better. We demonstrate that the number of monitor nodes is for a MIMO network with randomly located nodes n, each equipped with M antennas. Indeed, numerical results nlnn illustrate that by using MIMODog, the network can have a constant improvement M on an asymptotic number of monitor nodes compared to SISO 802.11 DCF MAC
- …