Skip to main content
SpringerLink
Log in

Joint relay assignment and power allocation for cooperative communications

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In the recent years, cooperative communication is shown to be a promising technology to improve the spatial diversity without additional equipments or antennas. With this communication paradigm, energy can be saved by effective relay assignment and power allocation while achieving the required bandwidth for each transmission pair. Thus, this paper studies the joint relay node assignment and power allocation problem which aims to minimize the total power consumption of the network while providing the efficient bandwidth service. We first analyze the minimum power consumption under the bandwidth requirement for different communication modes. Based on the analytical results, we present a polynomial-time algorithm JRPA to optimally solve this problem. The algorithm first constructs a weighted bipartite graph G based on the given transmission pairs and relay nodes. Then, we adopt the KM method to find out a saturated matching M, and assign the relay nodes to the transmission pairs based on the matching. The optimality of the algorithm is also proved. The simulation results show that JRPA algorithm can save about 34.2% and 18.9% power consumptions compared with the direct transmission and ORA schemes in many situations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11

Similar content being viewed by others

References

  1. Shi, Y., Sharma, S., Hou, Y. T., & Kompella, S. (2008). Optimal relay assignment for cooperative communications. In MobiHoc’08.

  2. Laneman, J. N., Tse, D. N. C., & Wornell, G. W. (2004). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Information Theory, 50(12), 3062–3080.

    Article  MathSciNet  Google Scholar 

  3. Sendonaris, A., Erkip, E., & Aazhang, B. (2003). User cooperation diversity—part I: System description. IEEE Transactions on Communications, 51(11), 1927–1938.

    Article  Google Scholar 

  4. Bletsas, A., Khisti, A., Reed, D., & Lippman, A. (2006). A simple cooperative diversity method based on network path selection. IEEE Journal on Selected Areas in Communications, 24(3), 659–672.

    Article  Google Scholar 

  5. Cai, J., Shen, S., Mark, J. W., & Alfa, A. S. (2008). Semi-distributed user relaying algorithm for amplify-and-forward wireless relay networks. IEEE Transactions on Wireless Communications, 7(4), 1348–1357.

    Article  Google Scholar 

  6. Zhao, Y., Adve, R. S., & Lim, T. J. (2006). Improving amplify-and-forward relay networks: Optimal power allocation versus selection. In Proceedings of IEEE international Symposium on information theory (pp. 1234–1238), Seattle, July 9–14.

  7. Adeane, J., Miguel, R. D, & Wassell, I. J. (2005). Optimum power allocation in cooperative networks. In 12th International conference on telecommunications (ICT 2005), 3–6 May 2005, Cape Town, South Africa.

  8. Badr, M., Strinati, E. C., & Belfiore, J.-C. (2008). Optimal power allocation for hybrid amplify-and-forward cooperative networks. In IEEE vehicular technology conference, 2008. VTC Spring 2008.

  9. van der Meulen, E. C. (1971). Three terminal communication channels. Advances in Applied Probability, 3, 120–154.

    Article  MATH  MathSciNet  Google Scholar 

  10. Cover, T. M., & EL Gamal, A. (1979). Capacity theorems for the relay channel. IEEE Transactions on Information Theory, 25(5), 572–584.

    Article  MATH  MathSciNet  Google Scholar 

  11. Ng, T. C.-Y., & Yu, W. (2007). Joint optimization of relay strategies and resource allocations in cooperative cellular networks. IEEE Journal on Selected Areas in Communications, 25(2), 328–339.

    Article  Google Scholar 

  12. Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of the Society for Industrial and Applied Mathematics, 5, 32–38.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

This paper is supported by the National Grand Fundamental Research 973 Program of China under Grant No. 2006CB303-006, the National Science Foundation of China under Grant No. 60803116, Special Grade of the Financial Support from China Postdoctoral Science Foundation under Grant No. 200902298, China Postdoctoral Science Foundation funded project under Grant No. 20080430103, the Dean Fund of the Chinese Academy of Science, and the Fundamental Research Funds for the Central Universities.

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, University of Science and Technology of China, Hefei, 230027, Anhui, People’s Republic of China

    Hongli Xu, Liusheng Huang, Gang Wang, Tao Xu & Gang Liu

  2. Suzhou Institute for Advanced Study, University of Science and Technology of China, Suzhou, 215123, Jiangsu, People’s Republic of China

    Hongli Xu, Liusheng Huang, Gang Wang, Tao Xu & Gang Liu

Authors
  1. Hongli Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Liusheng Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tao Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Gang Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hongli Xu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, H., Huang, L., Wang, G. et al. Joint relay assignment and power allocation for cooperative communications. Wireless Netw 16, 2209–2219 (2010). https://doi.org/10.1007/s11276-010-0254-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-010-0254-2

Keywords

Search

Navigation