Skip to main content

Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis

  • Conference paper
Quality, Reliability, Security and Robustness in Heterogeneous Networks (QShine 2010)

Abstract

We consider the problem of 2-node cooperation for cellular networks. In the considered system, a node and a cooperative relay are selected in a proportionally fair (PF) manner to transmit to the base station (BS), which uses the maximal ratio combining (MRC) for reception. The proposed scheme integrates the PF criterion in selective cooperation to maximize the overall utility of all 2-node cooperative transmissions, and is called proportionally fair selective cooperation (PFSC). This technique does not require distributed space-time coding algorithms and its simplicity allows for immediate implementation in existing hardware.

In this research, we further provide a mathematical framework to analyze the performance of PFSC under a Rayleigh flat fading channel. We also present an analytical expression for quantifying the throughput gain of a PFSC-enabled cellular network over a traditional PFS-enabled cellular network without node cooperation. Using simulations, we show that our model is very accurate.

To our knowledge, it is the first time that a closed-form expression is obtained for the throughput of 2-node cooperative communication in a cellular network with the PF constraint.

This work was supported, in part, by Johns Hopkins University, Applied Physics Laboratory’s internal research and development funds.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Sendonaris, A., Erkip, E., Aazhang, B.: User cooperation diversity. part i. system description. IEEE Transactions on Communications 51(11), 1927–1938 (2003)

    Article  Google Scholar 

  2. Sendonaris, A., Erkip, E., Aazhang, B.: User cooperation diversity. part ii. implementation aspects and performance analysis. IEEE Transactions on Communications 51(11), 1939–1948 (2003)

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  5. Aktas, E., Evans, J., Hanly, S.: Distributed decoding in a cellular multiple-access channel. IEEE Transactions on Wireless Communications 7(1), 241–250 (2008)

    Article  Google Scholar 

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

    Article  Google Scholar 

  7. Sung, Y., Misra, S., Tong, L., Ephremides, A.: Cooperative routing for distributed detection in large sensor networks. IEEE Journal on Selected Areas in Communications 25(2), 471–483 (2007)

    Article  Google Scholar 

  8. Huang, J., Han, Z., Chiang, M., Poor, H.V.: Auction-based resource allocation for cooperative communications. IEEE Journal on Selected Areas in Communications 26(7), 1226–1237 (2008)

    Article  Google Scholar 

  9. Simeone, O., Somekh, O., Kramer, G., Poor, H.V., Shamai, S.: Throughput of cellular systems with conferencing mobiles and cooperative base stations. EURASIP Journal on Wireless Communications and Networking 2008, 1–14 (2008)

    Article  Google Scholar 

  10. Chen, W., Dai, L., Ben Letaief, K., Cao, Z.: A unified cross-layer framework for resource allocation in cooperative networks. IEEE Transactions on Wireless Communications 7(8), 3000–3012 (2008)

    Article  Google Scholar 

  11. Papadogiannis, A., Hardouin, E., Gesbert, D.: Decentralising multi-cell cooperative processing on the downlink: a novel robust framework. EURASIP Journal on Wireless Communications and Networking (August 2009)

    Google Scholar 

  12. Liu, E., Zhang, Q., Leung, K.K.: Theoretical analysis of selective relaying, cooperative multi-hop networks with fairness constraints. In: Proc. IEEE International Conference on Communications ICC 2009, pp. 1–5 (June 2009)

    Google Scholar 

  13. Coso, A.D., Spagnolini, U., Ibars, C.: Cooperative distributed MIMO channels in wireless sensor networks. IEEE Journal on Selected Areas in Communications 25(2), 402–414 (2007)

    Article  Google Scholar 

  14. Rong, Y., Hua, Y.: Optimal power schedule for distributed MIMO links. IEEE Transactions on Wireless Communications 7(8), 2896–2900 (2008)

    Article  Google Scholar 

  15. Kelly, F.: Charging and rate control for elastic traffic. European Transactions on Telecommunications 8, 33–37 (1997)

    Article  Google Scholar 

  16. Kushner, H.J., Whiting, P.A.: Convergence of proportional-fair sharing algorithms under general conditions. IEEE Transactions on Wireless Communications 3(4), 1250–1259 (2004)

    Article  Google Scholar 

  17. Borst, S.: User-level performance of channel-aware scheduling algorithms in wireless data networks. IEEE/ACM Transactions on Networking 13(3), 636–647 (2005)

    Article  Google Scholar 

  18. Bu, T., Li, L., Ramjee, R.: Generalized proportional fair scheduling in third generation wireless data networks. In: Proc. INFOCOM 2006, the 25th Joint Conference of the IEEE Computer and Communications Societies, pp. 1–12. IEEE, Los Alamitos (2006)

    Google Scholar 

  19. Caire, G., Muller, R.R., Knopp, R.: Hard fairness versus proportional fairness in wireless communications: The single-cell case. IEEE Transactions on Information Theory 53(4), 1366–1385 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  20. Li, L., Pal, M., Yang, Y.R.: Proportional fairness in multi-rate wireless lans. In: Proc. of the 27th Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2008, pp. 1004–1012. IEEE, Los Alamitos (2008)

    Google Scholar 

  21. Liu, E., Leung, K.K.: Expected throughput of the proportional fair scheduling over Rayleigh fading channels. IEEE Communications Letters 14(6), 515–517 (2010)

    Article  Google Scholar 

  22. Bianchi, G., Campbell, A.T.: A programmable mac framework for utility-based adaptive quality of service support. IEEE Journal on Selected Areas in Communications 18(2), 244–255 (2000)

    Article  Google Scholar 

  23. Shi, L., Liu, C., Liu, B.: Network utility maximization for triple-play services. Computer Communications 31(10), 2257–2269 (2008)

    Article  Google Scholar 

  24. Xu, D., Li, Y., Chiang, M., Calderbank, A.: Elastic service availability: utility framework and optimal provisioning. IEEE Journal on Selected Areas in Communications 26(6), 55–65 (2008)

    Article  Google Scholar 

  25. Zhang, X., Tao, M., Ng, C.: Utility-based wireless resource allocation for variable rate transmission. IEEE Transactions on Wireless Communications 7(9), 3292–3296 (2008)

    Article  Google Scholar 

  26. Gao, Q., Zhang, J., Hanly, S.: Cross-layer rate control in wireless networks with lossy links: Leaky-pipe flow, effective network utility maximization and hop-by-hop algorithms. IEEE Transactions on Wireless Communications 8(6), 3068–3076 (2009)

    Article  Google Scholar 

  27. Jalali, A., Padovani, R., Pankaj, R.: Data throughput of CDMA-HDR a high efficiency-high data rate personal communication wireless system. In: Proc. IEEE 51st VTC 2000-Spring Tokyo Vehicular Technology, vol. 3, pp. 1854–1858 (January 2000)

    Google Scholar 

  28. Smith, P.J., Roy, S., Shafi, M.: Capacity of MIMO systems with semicorrelated flat fading. IEEE Transactions on Information Theory 49(10), 2781–2788 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  29. McKay, M.R., Smith, P.J., Suraweera, H.A., Collings, I.B.: On the mutual information distribution of OFDM-based spatial multiplexing: Exact variance and outage approximation. IEEE Transactions on Information Theory 54(7), 3260–3278 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  30. Liu, E., Zhang, Q., Leung, K.K.: Resource allocation for frequency-selective fading, multi-carrier systems. In: Proc. IEEE International Conference on Communications ICC 2009 (June 2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Liu, E., Zhang, Q., Leung, K.K. (2012). Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis. In: Zhang, X., Qiao, D. (eds) Quality, Reliability, Security and Robustness in Heterogeneous Networks. QShine 2010. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 74. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29222-4_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29222-4_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29221-7

  • Online ISBN: 978-3-642-29222-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics