Grouping and partner selection in cooperative wireless networks
Aria Nosratinia,T.E. Hunter +1 more
TL;DR: This work points out a simple, static selection strategy that guarantees diversity n+1 for all transmissions, and considers centralized control strategies and study the additional gains that arise from a central control, under various amounts of information being available to the central controller.
read more
Abstract: Various results to date have demonstrated the advantages of one or several relay nodes assisting transmissions in a wireless network. In many practical scenarios, not all nodes in the network are simultaneously involved in every transmission; therefore, protocols are needed to form groups or subsets of nodes for the purposes of cooperation. We consider this problem in the context of regenerative nodes and non-altruistic cooperation (all nodes have data of their own to transmit). For a network-wide diversity advantage, the protocol must provide each transmitting node with enough "partners" that can decode its message with high-enough probability. Assuming that the nodes cannot communicate their control decisions (distributed scenario), and that each node chooses to help n other nodes, we point out a simple, static selection strategy that guarantees diversity n+1 for all transmissions. We then consider centralized control strategies and study the additional gains that arise from a central control, under various amounts of information being available to the central controller.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
An Improved Resource Allocation Method Based on Convex Optimization in Centralized Wireless Network
Junhui Zhao,Ximei Chen,Junyou Luo,Dongming Wang +3 more
- 24 Sep 2009
TL;DR: Simulation results show that the proposed method achieves better accuracy and less iteration time than genetic algorithm.
2
•Posted Content
Cooperation in Carrier Sense Based Wireless Ad Hoc Networks - Part II: Proactive Schemes
TL;DR: This work shows by means of both analysis and simulation that the performance of reactive cooperation is reduced by the intrinsic nature of the considered medium access policy, which biases the distribution of the available relays, locating them in unfavorable positions for rate optimization.
Cooperative Communications With Unreliable Relays
TL;DR: This paper considers the situation in which the relays cannot reliably decode the message due to a low signal strength or high interference, and proposes a new cooperative relaying strategy that utilizes the information provided by unreliable relays to improve the reliability of decoding at the destination.
2
Scheduling relay nodes for reliable wireless real-time communications
Elisabeth Uhlemann,Thomas Nolte +1 more
- 22 Sep 2009
TL;DR: This work considers wireless relay networks for use in industrial applications with strict requirements on both timely and reliable communications to increase the data reliability in industrial wireless networks, while respecting real-time deadlines.
A Modified Node Selection Scheme for Cooperative Wireless Networks
TL;DR: The simulation result shows that the proposed node selection scheme will results in better selection of nodes for cooperative wireless networks, and optimized link state routing is implemented in this paper.
References
•Book
Elements of information theory
Thomas M. Cover,Joy A. Thomas +1 more
- 01 Jan 1991
TL;DR: The author examines the role of entropy, inequality, and randomness in the design of codes and the construction of codes in the rapidly changing environment.
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
TL;DR: Using distributed antennas, this work develops and analyzes low-complexity cooperative diversity protocols that combat fading induced by multipath propagation in wireless networks and develops performance characterizations in terms of outage events and associated outage probabilities, which measure robustness of the transmissions to fading.
13.5K
User cooperation diversity. Part I. System description
TL;DR: Results show that, even though the interuser channel is noisy, cooperation leads not only to an increase in capacity for both users but also to a more robust system, where users' achievable rates are less susceptible to channel variations.
6.8K
Capacity theorems for the relay channel
Thomas M. Cover,Abbas El Gamal +1 more
TL;DR: In this article, the capacity of the Gaussian relay channel was investigated, and a lower bound of the capacity was established for the general relay channel, where the dependence of the received symbols upon the inputs is given by p(y,y) to both x and y. In particular, the authors proved that if y is a degraded form of y, then C \: = \: \max \!p(x,y,x,2})} \min \,{I(X,y), I(X,Y,Y,X,Y
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
J.N. Laneman,Gregory W. Wornell +1 more
TL;DR: This work develops and analyzes space-time coded cooperative diversity protocols for combating multipath fading across multiple protocol layers in a wireless network and demonstrates that these protocols achieve full spatial diversity in the number of cooperating terminals, not just theNumber of decoding relays, and can be used effectively for higher spectral efficiencies than repetition-based schemes.