A unified matching framework for multi-flow decode-and-forward cooperative networks

IEEE Journal on Selected Areas in Communications

Volumn 30, Issue 2, 2012, Pages 397-406

  Bai, Bo Bob ^a   Chen, Wei ^b   Letaief, Khaled Ben ^a   Cao, Zhigang ^b  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

^b TSINGHUA UNIVERSITY   (China)

Author keywords

Decode and forward; Diversity multiplexing tradeoff; Maximum matching; Multi flow cooperative networks; Outage probability; Random hypergraph; Resource allocation

Indexed keywords

DECODE-AND-FORWARD; DIVERSITY-MULTIPLEXING TRADE-OFF; HYPERGRAPH; MAXIMUM MATCHINGS; MULTI-FLOW COOPERATIVE NETWORKS; OUTAGE PROBABILITY;

DECODING; MULTIPLEXING; RESOURCE ALLOCATION; SPACE TIME ADAPTIVE PROCESSING; WIRELESS SENSOR NETWORKS;

COMMUNICATION CHANNELS (INFORMATION THEORY);

EID: 84863075769     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2012.120219     Document Type: Article

References (17)

1. J. N. Laneman and G. W. Wornell, "Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks," IEEE Trans. Inf. Theory, vol. 49, no. 10, pp. 2415-2425, 2003.
2. A. Bletsas, A. Khisti, D. P. Reed, and A. Lippman, "A simple cooperative diversity method based on network path selection," IEEE J. Sel. Areas Commun., vol. 24, no. 3, pp. 659-672, 2006.
3. K.-S. Hwang, Y.-C. Ko, and M.-S. Alouini, "Outage probability of cooperative diversity systems with opportunistic relaying based on decode-and-forward," IEEE Trans. Wireless Commun., vol. 7, no. 12, pp. 5100-5107, 2008.
4. A. Adinoyi, Y. Fan, H. Yanikomeroglu, H. V. Poor, and F. Al-Shaalan, "Performance of selection relaying and cooperative diversity," IEEE Trans. Wireless Commun., vol. 8, no. 12, pp. 5790-5795, 2009.
5. S. Ikki and M. H. Ahmed, "Performance analysis of adaptive decodeand-forward cooperative diversity networks with best-relay selection," IEEE Trans. Commun., vol. 58, no. 1, pp. 68-72, 2010.
6. V. Shah, N. B. Mehta, and R. Yim, "Splitting algorithms for fast relay selection: generalizations, analysis, and a unified view," IEEE Trans. Wireless Commun., vol. 9, no. 4, pp. 1525-1535, 2010.
7. S. Kadloor and R. Adve, "Relay selection and power allocation in cooperative cellular networks," IEEE Trans. Wireless Commun., vol. 9, no. 5, pp. 1676-1685, 2010.
8. K. Vardhe, D. Reynolds, and B. D. Woerner, "Joint power allocation and relay selection for multiuser cooperative communication," IEEE Trans. Wireless Commun., vol. 9, no. 4, pp. 1255-1260, 2010.
9. E. Beres and R. Adve, "Selection cooperation in multi-source cooperative networks," IEEE Trans. Wireless Commun., vol. 7, no. 1, pp. 118-127, 2008.
10. C. Berge, Hypergraphs. Amsterdam, Netherlands: North-Holland, 1989.
11. B. Bollobás, Random Graphs, 2nd ed. Cambridge, UK: Cambridge University Press, 2001.
12. L. Lovász and M. D. Plummer, Matching Theory. Amsterdam, Netherlands: North-Holland, 1986.
13. W. Chen, L. Dai, K. B. Letaief, and Z. Cao, "A unified cross-layer framework for resource allocation in cooperative networks," IEEE Trans. Wireless Commun., vol. 7, no. 8, pp. 3000-3012, 2008.
14. J. N. Laneman, D. N. C. Tse, and G. W. Wornell, "Cooperative diversity in wireless networks: efficient protocols and outage behavior," IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062-3080, 2004.
15. R. Diestel, Graph Theory, 3rd ed. New York, NY: Springer, Apr. 2005, vol. 50, no. 3.
16. J. E. Hopcroft and R. M. Karp, "An n5/2 algorithm for maximum matchings in bipartite graphs," SIAM Journal on Computing, vol. 2, no. 4, pp. 225-231, 1973.
17. M. Karpinski and W. Rytter, Fast Parallel Algorithms for Graph Matching Problems. New York, NY: Oxford University Press, 1998.