Skip to main content
Log in

Price-based resource allocation for revenue maximization with cooperative communication

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

In recent years, cooperative communication becomes a promising technology to improve the spatial diversity for the future mobile network. Under this communication paradigm, both relay assignment and power allocation will greatly impact the network performance. However, since each device may be selfish, a significant challenge is to make the joint resource allocation robust to node selfishness while pursuing the maximum system revenue in the commercial network. This paper mainly studies the price-based joint relay-power allocation problem which aims to maximize the revenue (JRP-RM) while satisfying the bandwidth requirement with cooperative communication. We first analyze the power allocation under the bandwidth and selfishness constraints for different communication modes. According to the analytical results, this paper presents a polynomial-time algorithm, namely MRPA, to solve the JRP-RM problem. We prove its correctness and show that it can achieve an approximation ratio of \(1 - \varepsilon\), where \(\varepsilon\) is an arbitrarily positive constant. Moreover, we study the JRP-RM problem under a special case where the cost and payment are both linear functions of the transmission power. The simulation results show that MRPA can increase the system revenue about 34.2 and 18.9 % compared with the OPRA Yang et al. (2011 IEEE International Conference on Communications (ICC). IEEE, pp 1–6, 2011) and JRPA Xu et al. (Wirel Netw pp 2209–2219, 2010) algorithms while satisfying the selfishness constraint in most situations.

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

Access this article

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

Instant access to the full article PDF.

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

Similar content being viewed by others

References

  1. Adeane, J., RodriguesM. R. D., & Wassell, I. J. (2005). Ptimum power allocation in cooperative networks. In IEEE ICT, pp. 2813–2818.

  2. Ahmad, A., Ahmad, S., Rehmani, M. H., & Hassan, N. U. (2015). A survey on radio resource allocation in cognitive radio sensor networks. Communications Surveys and Tutorials IEEE, 17(2), 888–917.

    Article  Google Scholar 

  3. Al-Tous, H., & Barhumi, I. (2013). Joint power and bandwidth allocation for amplify-and-forward cooperative communications using stackelberg game. IEEE Transactions on Vehicular Technology, 62(4), 1678–1691.

    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 of Selected Area in Communications, 24(3), 659–672.

    Article  Google Scholar 

  5. Cao, Q., Zhao, H. V., & Jing, Y. (2012). Power allocation and pricing in multiuser relay networks using stackelberg and bargaining games. IEEE Transactions on Vehicular Technology, 61(7), 3177–3190.

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  7. Cui, S., Goldsmith, AJ., Bahai, A. (2004). Energy-efficiency of mimo and cooperative mimo techniques in sensor networks. IEEE Journal of Selected Area Communications, pp. 1089–1098.

  8. Ding, L., Melodia, T., Batalama, S., & Matyjas, J. (2010). Distributed routing, relay selection and spectrum allocation in cognitive and cooperative ad hoc networks. In IEEE SECON, pp. 1–9.

  9. Huang, J., Han, Z., Chiang, M., & Poor, H. (2008). Auction-based resource allocation for cooperative communications. IEEE Journal of Selected Area in Communications, 26(3), 1226–1237.

    Article  Google Scholar 

  10. 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 pp. 1348–1357.

  11. Munkres, J. (1957). Algorithms for the assignment and transportation problems. Journal of thr Society Industrial Applied Mathematics, 16(1), 169–189.

    MathSciNet  MATH  Google Scholar 

  12. Ma, K., Liu, Z. X., & Guan, X. P. (2012). Joint relay selection and power allocation for cooperative cellular networks. Wireless Personal Communications, pp. 305–321.

  13. Xie, K., Cao, J. N., & Wen, J. G. (2013). Optimal relay assignment and power allocation for cooperative communications. Journal of Computer Science and Technology, pp. 343–356.

  14. Kang, X., Zhang, R., & Motani, M. (2012). Price-based resource allocation for spectrum-sharing femtocell networks: A stackelberg game approach. Selected Areas in Communications, IEEE Journal on, 30(3), 538–549.

    Article  Google Scholar 

  15. Laneman, J., Tse, D., Wornell, G. W. (2004). User cooperation diversity—Part i: System description. IEEE Transaction on Information Theory, pp. 3062–3080.

  16. Lü, H. F., & Zhang, H. (2014). Stochastic optimization in cooperative relay networks for revenue maximization. Journal of Shanghai Jiaotong University (Science), 19, 287–293.

    Article  Google Scholar 

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

    Article  Google Scholar 

  18. Kadloor, S,, & Adve, R. (2010). Relay selection and power allocation in cooperative cellular networks. IEEE Transactions on Wireless Communications, pp. 1676–1685.

  19. Sendonaris, A., Erkip, E., & Aazhang, B. (2003). Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Transactions on Communications, pp. 1927–1938.

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

  21. PK, T., NDH, N., LN, T. (2009). Optimal relay assignment and power allocation for cooperative communications. In IEEE GLOBECOM, pp. 1–5.

  22. Wang, B., Han, Z., & Liu, K. (2009). Distributed relay selection and power control for multiuser cooperative communication networks using stackelberg game. IEEE Transaction Mobile Computing, 8(3), 975–990.

    Article  Google Scholar 

  23. Xu, H., Huang, L., Wang, G., Xu, T., & Liu, G. (2010). Joint relay assignment and power allocation for cooperative communications. Wireless Networks, pp. 2209–2219.

  24. Yang, D., Fang, X., & Xue, G. (2011a). Opra: Optimal relay assignment for capacity maximization in cooperative networks. In Communications (ICC), 2011 IEEE International Conference on, IEEE, pp. 1–6.

  25. Yang, D., Fang, X., & Xue, G. (2011b). Truthful auction for cooperative communications. In ACM MobiHoc, pp. 89–98.

  26. Yang, D., Fang, X., & Xue, G. (2012). Truthful auction for cooperative communications with revenue maximization. In IEEE ICC, pp. 4888–4892.

  27. Zhang, G., Cong, L., Zhao, L., Yang, K., & Zhang, H. (2009). Competitive resource sharing based on game theory in cooperative relay networks. ETRI Journal, 31(3), 89–91.

    Article  Google Scholar 

  28. Zhao, Y., Adve, R., Lim, T. (2006). Improving amplify-and-forward relay networks: Optimal power allocation versus selection. In IEEE ISIT, pp. 659–672.

Download references

Acknowledgments

This paper is supported by the National Science Foundation of China under No. U1301256, 61272133, 61472383 and 51274202, and the Natural Science Foundation of Anhui Province in China under No. 1408085MKL08.

Author information

Authors and Affiliations

Authors

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., Tang, S., Wang, X. et al. Price-based resource allocation for revenue maximization with cooperative communication. Wireless Netw 23, 2571–2585 (2017). https://doi.org/10.1007/s11276-016-1307-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-016-1307-y

Keywords

Navigation