Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
Performance Evaluation - Special issue: Distributed systems performance
Exact symbol error probability of a Cooperative network in a Rayleigh-fading environment
IEEE Transactions on Wireless Communications
Queuing with adaptive modulation and coding over wireless links: cross-Layer analysis and design
IEEE Transactions on Wireless Communications
Symbol error probabilities for general Cooperative links
IEEE Transactions on Wireless Communications
Cross-Layer Energy and Delay Optimization in Small-Scale Sensor Networks
IEEE Transactions on Wireless Communications
IEEE Transactions on Multimedia
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
Relay-based deployment concepts for wireless and mobile broadband radio
IEEE Communications Magazine
Cooperative communication in wireless networks
IEEE Communications Magazine
From theory to practice: an overview of MIMO space-time coded wireless systems
IEEE Journal on Selected Areas in Communications
Fountain codes based partial cooperation in cooperative communications
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Connectivity based cognitive wireless network for disaster information network
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Computers and Electrical Engineering
Wireless Personal Communications: An International Journal
Performance analysis of selective decode and forward protocol with partner selection
International Journal of Mobile Communications
| Hi-index | 0.00 |
This paper models and analyzes the performance of an amplify-and-forward cooperative diversity wireless network. We propose a Markov-based model, which encompasses the following aspects: 1) the transmission using amplify-and-forward cooperative diversity at the physical layer; 2) a flow control pro-tocol, finite and infinite transmitting buffers, and an ARQ-based error recovery mechanism at the radio link layer; and 3) a bursty traffic pattern at the application layer. We derive expressions for packet delivery probability and distribution of packet delivery delay. We numerically quantify improvement in terms of packet delivery probability and packet delivery delay for increasing SNR and/or cooperative nodes. For an additional cooperative node, we quantify the amount of SNR which can be reduced (i.e., SNR saving) without degrading the system performance. Also, the minimum SNR and cooperative nodes which satisfy a probabilistic delay bound are computed. We then derive a sufficient condition that ensures an increase in packet delivery probability. Unlike numerical evaluation of the model, this sufficient condition does not require computation of stationary distribution of the Markov chain. It only involves parameter adjustment at physical, radio link, and application layers, hence substantially reducing the com-putation effort. Based on the developed model, we design a power allocation algorithm, which computes the minimum transmission power under a packet delivery probability constraint. We then use the derived sufficient condition to reduce complexity of the power allocation algorithm.