Physical concerns for cross-layer prototyping and wireless network experimentation
Proceedings of the second ACM international workshop on Wireless network testbeds, experimental evaluation and characterization
Zigzag decoding: combating hidden terminals in wireless networks
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Opportunistic cooperation by dynamic resource allocation
IEEE Transactions on Wireless Communications
Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks
IEEE Transactions on Wireless Communications
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Delay-Tolerant Distributed-TAST Codes for Cooperative Diversity
IEEE Transactions on Information Theory
Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial Reuse
IEEE Transactions on Information Theory
The Capacity of a Relay Channel, Both With and Without Delay
IEEE Transactions on Information Theory
Throughput Optimal Control of Cooperative Relay Networks
IEEE Transactions on Information Theory
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Energy aware power allocation strategies for multihop-cooperative transmission schemes
IEEE Journal on Selected Areas in Communications
Joint optimization of relay strategies and resource allocations in cooperative cellular networks
IEEE Journal on Selected Areas in Communications
Outage Probability of Regenerative Protocols for Two-Source Two-Destination Networks
Wireless Personal Communications: An International Journal
Energy-efficient tree-based cooperative data aggregation for wireless sensor networks
International Journal of Sensor Networks
| Hi-index | 0.00 |
Recently, cooperative communications, in the form of having each node equipped with a single antenna and exploit spatial diversity via some relay node's antenna, is shown to be a promising approach to increase data rates in wireless networks. Under this communication paradigm, the choice of a relay node (among a set of available relay nodes) is critical in the overall network performance. In this paper, we study the relay node assignment problem in a cooperative ad hoc network environment, where multiple source-destination pairs compete for the same pool of relay nodes in the network. Our objective is to assign the available relay nodes to different source-destination pairs so as to maximize the minimum data rate among all pairs. The main contribution of this paper is the development of an optimal polynomial time algorithm, called ORA, that achieves this objective. A novel idea in this algorithm is a "linear marking" mechanism, which maintains linear complexity of each iteration. We give a formal proof of optimality for ORA and use numerical results to demonstrate its capability.