37,744 research outputs found
Analysis of a Cooperative Strategy for a Large Decentralized Wireless Network
This paper investigates the benefits of cooperation and proposes a relay
activation strategy for a large wireless network with multiple transmitters. In
this framework, some nodes cooperate with a nearby node that acts as a relay,
using the decode-and-forward protocol, and others use direct transmission. The
network is modeled as an independently marked Poisson point process and the
source nodes may choose their relays from the set of inactive nodes. Although
cooperation can potentially lead to significant improvements in the performance
of a communication pair, relaying causes additional interference in the
network, increasing the average noise that other nodes see. We investigate how
source nodes should balance cooperation vs. interference to obtain reliable
transmissions, and for this purpose we study and optimize a relay activation
strategy with respect to the outage probability. Surprisingly, in the high
reliability regime, the optimized strategy consists on the activation of all
the relays or none at all, depending on network parameters. We provide a simple
closed-form expression that indicates when the relays should be active, and we
introduce closed form expressions that quantify the performance gains of this
scheme with respect to a network that only uses direct transmission.Comment: Updated version. To appear in IEEE Transactions on Networkin
Compute-and-Forward on a Multi-User Multi-Relay Channel
In this paper, we consider a system in which multiple users communicate with
a destination with the help of multiple half-duplex relays. Based on the
compute-and-forward scheme, each relay, instead of decoding the users'
messages, decodes an integer-valued linear combination that relates the
transmitted messages. Then, it forwards the linear combination towards the
destination. Given these linear combinations, the destination may or may not
recover the transmitted messages since the linear combinations are not always
full rank. Therefore, we propose an algorithm where we optimize the precoding
factor at the users such that the probability that the equations are full rank
is increased and that the transmission rate is maximized. We show, through some
numerical examples, the effectiveness of our algorithm and the advantage of
performing precoding allocation at the users. Also, we show that this scheme
can outperform standard relaying techniques in certain regimes
Network Formation Games Among Relay Stations in Next Generation Wireless Networks
The introduction of relay station (RS) nodes is a key feature in next
generation wireless networks such as 3GPP's long term evolution advanced
(LTE-Advanced), or the forthcoming IEEE 802.16j WiMAX standard. This paper
presents, using game theory, a novel approach for the formation of the tree
architecture that connects the RSs and their serving base station in the
\emph{uplink} of the next generation wireless multi-hop systems. Unlike
existing literature which mainly focused on performance analysis, we propose a
distributed algorithm for studying the \emph{structure} and \emph{dynamics} of
the network. We formulate a network formation game among the RSs whereby each
RS aims to maximize a cross-layer utility function that takes into account the
benefit from cooperative transmission, in terms of reduced bit error rate, and
the costs in terms of the delay due to multi-hop transmission. For forming the
tree structure, a distributed myopic algorithm is devised. Using the proposed
algorithm, each RS can individually select the path that connects it to the BS
through other RSs while optimizing its utility. We show the convergence of the
algorithm into a Nash tree network, and we study how the RSs can adapt the
network's topology to environmental changes such as mobility or the deployment
of new mobile stations. Simulation results show that the proposed algorithm
presents significant gains in terms of average utility per mobile station which
is at least 17.1% better relatively to the case with no RSs and reaches up to
40.3% improvement compared to a nearest neighbor algorithm (for a network with
10 RSs). The results also show that the average number of hops does not exceed
3 even for a network with up to 25 RSs.Comment: IEEE Transactions on Communications, vol. 59, no. 9, pp. 2528-2542,
September 201
Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective
We consider a general multiple antenna network with multiple sources,
multiple destinations and multiple relays in terms of the
diversity-multiplexing tradeoff (DMT). We examine several subcases of this most
general problem taking into account the processing capability of the relays
(half-duplex or full-duplex), and the network geometry (clustered or
non-clustered). We first study the multiple antenna relay channel with a
full-duplex relay to understand the effect of increased degrees of freedom in
the direct link. We find DMT upper bounds and investigate the achievable
performance of decode-and-forward (DF), and compress-and-forward (CF)
protocols. Our results suggest that while DF is DMT optimal when all terminals
have one antenna each, it may not maintain its good performance when the
degrees of freedom in the direct link is increased, whereas CF continues to
perform optimally. We also study the multiple antenna relay channel with a
half-duplex relay. We show that the half-duplex DMT behavior can significantly
be different from the full-duplex case. We find that CF is DMT optimal for
half-duplex relaying as well, and is the first protocol known to achieve the
half-duplex relay DMT. We next study the multiple-access relay channel (MARC)
DMT. Finally, we investigate a system with a single source-destination pair and
multiple relays, each node with a single antenna, and show that even under the
idealistic assumption of full-duplex relays and a clustered network, this
virtual multi-input multi-output (MIMO) system can never fully mimic a real
MIMO DMT. For cooperative systems with multiple sources and multiple
destinations the same limitation remains to be in effect.Comment: version 1: 58 pages, 15 figures, Submitted to IEEE Transactions on
Information Theory, version 2: Final version, to appear IEEE IT, title
changed, extra figures adde
Applications of Repeated Games in Wireless Networks: A Survey
A repeated game is an effective tool to model interactions and conflicts for
players aiming to achieve their objectives in a long-term basis. Contrary to
static noncooperative games that model an interaction among players in only one
period, in repeated games, interactions of players repeat for multiple periods;
and thus the players become aware of other players' past behaviors and their
future benefits, and will adapt their behavior accordingly. In wireless
networks, conflicts among wireless nodes can lead to selfish behaviors,
resulting in poor network performances and detrimental individual payoffs. In
this paper, we survey the applications of repeated games in different wireless
networks. The main goal is to demonstrate the use of repeated games to
encourage wireless nodes to cooperate, thereby improving network performances
and avoiding network disruption due to selfish behaviors. Furthermore, various
problems in wireless networks and variations of repeated game models together
with the corresponding solutions are discussed in this survey. Finally, we
outline some open issues and future research directions.Comment: 32 pages, 15 figures, 5 tables, 168 reference
- …