Optimal relay station placement in IEEE 802.16j networks
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Optimal relay assignment for cooperative communications
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Isolation band based frequency reuse scheme for IEEE 802.16j wireless relay networks
Proceedings of the 5th International ICST Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness
Distributed routing schemes for multi-hop fixed relay networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
A relay assignment algorithm with interference mitigation for cooperative communication
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
IEEE Transactions on Wireless Communications
A relay selection scheme for the downlink of cellular networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Phase compensation for uplink distributed space-time cooperative protocol
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Distributed optimal relay selection for QoS provisioning in wireless multi-hop cooperative networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
INFOCOM'10 Proceedings of the 29th conference on Information communications
Resource allocation in multi-cell OFDMA-based relay networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Distributed routing schemes with accessibility consideration in multi-hop wireless networks
IEEE Transactions on Wireless Communications
An optimal algorithm for relay node assignment in cooperative ad hoc networks
IEEE/ACM Transactions on Networking (TON)
Resource Allocation in Multi-channel Multi-user Relay System with Fairness Constraints
Wireless Personal Communications: An International Journal
Joint authentication and quality of service provisioning in cooperative communication networks
Computer Communications
Optimal relay assignment for fairness in wireless cooperative networks
International Journal of Ad Hoc and Ubiquitous Computing
Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol
Computer Standards & Interfaces
Cooperative relay assignment for static energy-constrained networks
International Journal of Sensor Networks
A new adaptive model for throughput enhancement and optimal relay selection in IEEE 802.16j networks
WSEAS TRANSACTIONS on COMMUNICATIONS
Journal of Network and Computer Applications
Distributed Matching Schemes for Multi-source and Multi-relay Cooperative Wireless Networks
Wireless Personal Communications: An International Journal
Wireless Personal Communications: An International Journal
Joint optimal AF relay assignment and power allocation in wireless cooperative networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.01 |
In this paper, designing an effective user relaying algorithm, in terms of relay node selection and power allocation, is discussed for amplify-and-forward wireless relay networks. The objective is to simplify the application of user relaying in practical wireless communication networks so that the system capacity can be improved with low computational complexity and system overhead. Beginning with the derivation of a tight threshold-based sufficient condition on the feasibility of a relay node, i.e., ensuring that user relaying via the node can achieve a larger channel capacity than direct transmission, a semi-distributed user relaying algorithm is proposed. In the proposed algorithm, each relay node can make decision on its feasibility individually, and the ultimate decision on the relay node selection among multiple feasible ones is made in a centralized manner. Since there is no need on exchanging channel state information among different network nodes, the proposed algorithm is simple for implementation and suitable for practical applications, which have stringent constraints on system overhead. By comparing with the centralized user relaying algorithm, which requires global channel state information of the whole network, the proposed semi-distributed algorithm can provide comparable system capacity, but has significantly reduced computational complexity.