Skip to main content
SpringerLink
Log in

Shared relay assignment in cooperative communications for bandwidth maximization

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Previous research mostly focused on mutually assigning one relay node for a source node to explore the transmission gains of cooperative communications. However, sharing a relay among multiple source nodes can improve the utilization of the relay node. This paper first defines the shared relay assignment for max–min bandwidth (SRA-MMB) problem and max–total bandwidth (SRA-MTB) problem, and formalizes them using integer programs. For the SRA-MMB problem, we propose a heuristic shared relay assignment algorithm (called RRA-MB) using binary search and rounding methods to maximize the minimum bandwidth of all the sources. The theoretical analysis proves that, in the worst case, the proposed algorithm can reach the approximate performance of \(2 + \varepsilon\), where \(\varepsilon\) is an arbitrarily small positive number. For the SRA-MTB problem, we propose a 2-approximation algorithm based on the rounding method to maximize the total bandwidth when each source has a relay usage time limit. Moreover, an optimal algorithm is designed to solve the special instance of SRA-MTB, in which all the source nodes have the same (i.e., uniform) limit on its relay usage time. Our simulations show that the proposed algorithms can achieve about 18 and 27 % improvements over the existing approaches in terms of minimum and total bandwidths respectively.

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
Fig. 12

Similar content being viewed by others

References

  1. Cui, S., Goldsmith, A. J., & Bahai, A. (2004). Energy-efficiency of MIMO and cooperative MIMO techniques in sensor networks. IEEE JSAC, 22(6), 1089–1098.

    Google Scholar 

  2. Sharma, S., Shi, Y., Hou, Y. T., & Kompella, S. (2011). An optimal algorithm for relay node assignment in cooperative ad hoc networks. IEEE/ACM Transactions on Networking, 19, 879–892.

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  4. 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 

  5. Bletsas, A., Khisti, A., Reed, D., & Lippman, A. (2006). A simple cooperative diversity method based on network path selection. IEEE JSAC, 24(3), 659–672.

    Google Scholar 

  6. Cai, J., Shen, X. M., 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 

  7. Zhao, Y., Adve, R. S., & Lim, T. J. (2006). Improving amplify-and-forward relay networks: Optimal power allocation versus selection. In Proceedings of IEEE ISIT, Seattle (pp. 1234–1238).

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

    Article  MathSciNet  MATH  Google Scholar 

  9. Caner, N., Javad, B. E., Ayfer, O., & Christina, F. (2011). Network simplification: The Gaussian diamond network with multiple antennas. In IEEE ISIT, Jul 31–Aug 5, 2011 (pp. 79–83).

  10. Ibrahim, A. S., Sadek, A. K., Su, W., & Liu, K. J. R. (2005). Cooperative communications with partial channel state information: When to cooperate? In IEEE Globecom (Vol. 5, pp. 3068–3072).

  11. Ibrahim, A. S., Sadek, A. K., Su, W., & Liu, K. J. (2008). Cooperative communications with relay-selection: When to cooperate and whom to cooperate with? IEEE Transaction on Wireless Communications, 7(7), 2814–2827.

    Article  Google Scholar 

  12. Zhang, P., Xu, Z. G., Wang, F. R., Xie, X., & Tu, L. (2009). A relay assignment algorithm with interference mitigation for cooperative communication. In Proceedings of WCNC 2009 (pp.1286–1291).

  13. Xu, H., Huang, L., Liu, G., Zhang, Y., & Huang, H. (2012). Optimal relay assignment for fairness in wireless cooperative networks. International Journal of Ad-Hoc and Ubiquitous Computing, 9(1), 42–53.

    Article  Google Scholar 

  14. Yang, D. J., Fang, X., & Xue, G. L. (2011). OPRA: Optimal relay assignment for capacity maximization in cooperative networks. In IEEE ICC 2011.

  15. Xu, H. L., Huang, L. S., Gang, W., Xu, T., & Liu, G. (2010). Joint relay assignment and power allocation for cooperative communications. Wireless Networks,. doi:10.1007/s11276-010-0254-2.

    Google Scholar 

  16. Jing, T., Zhu, S., Li, H., Cheng, X., & Huo, Y. (2013). Cooperative relay selection in cognitive radio networks. In InfoCom13, 2013.

  17. Vazirani, V. V. (2001). Approximation algorithms. Berlin: Springer Verlag.

    MATH  Google Scholar 

  18. Shmoys, D. B., & Tardos, E. (1993). An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62(3), 461–474.

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  20. Xu, H., Huang, L., Deng, H., Qiao, C., & Liu, Y. (2014). Fairness-aware shared relay assignment for cooperative communications. In ICC 2014, Jun 10–15, 2014, Austria.

Download references

Acknowledgments

This paper is supported by NSFC under Grant Nos. U1301256, 61170058, 61272133, and 51274202, Special Project on IoT of China NDRC (2012-2766), China Postdoctoral Science Foundation under Grant No. 2012T50547, Research Fund for the Doctoral Program of Higher Education of China No. 20123402110019, the NSF of Anhui Province No. 1408085MKL08.

Author information

Authors and Affiliations

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

    Hongli Xu, Hou Deng, Nan Lin & Liusheng Huang

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

    Hongli Xu, Hou Deng & Liusheng Huang

  3. Computer Science and Engineering, State University of NY, Buffalo, NY, 14260-2000, USA

    Chunming Qiao

Authors
  1. Hongli Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chunming Qiao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hou Deng
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Nan Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Liusheng Huang
    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

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Xu, H., Qiao, C., Deng, H. et al. Shared relay assignment in cooperative communications for bandwidth maximization. Wireless Netw 23, 553–566 (2017). https://doi.org/10.1007/s11276-015-1153-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-015-1153-3

Keywords

Search

Navigation