Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Distributed resource allocation with fairness for cognitive radios in wireless mobile ad hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Both spectrum sensing and power allocation have crucial effects on the performance of wireless cognitive ad hoc networks. In order to obtain the optimal available subcarrier sets and transmission powers, we propose in this paper a distributed resource allocation framework for cognitive ad hoc networks using the orthogonal frequency division multiple access (OFDMA) modulation. This framework integrates together the constraints of quality of service (QoS), maximum powers, and minimum rates. The fairness of resource allocation is guaranteed by introducing into the link capacity expression the probability that a subcarrier is occupied. An incremental subgradient approach is applied to solve the optimization problems that maximize the weighted sum capacities of all links without or with fairness constraints. Distributed subcarrier selection and power allocation algorithms are presented explicitly. Simulations confirm that the approach converges to the optimal solution faster than the ordinary subgradient method and demonstrate the effects of the key parameters on the system performance. It has been observed that the algorithms proposed in our paper outperform the existing ones in terms of the throughput and number of secondary links admitted and the fairness of resource allocation.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.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

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
Fig. 13
Fig. 14

Similar content being viewed by others

References

  1. Jang, J., & Lee, K. B. (2003). Transmit power adaptation for multiuser OFDM systems. IEEE Journal on selected areas in communications, 21, 171–178.

    Article  Google Scholar 

  2. Wong, C. Y., Cheng, R. S., Letaief, K. B., & Murch, R. D. (1999). Multiuser OFDM with adaptive subcarrier, bit, and power allocation. IEEE Journal on selected areas in communications, 17, 1747–1758.

    Article  Google Scholar 

  3. Kim, Y. H., Song, I., Yoon, S., & Park, S. R. (1999). A multicarrier CDMA system with adaptive subchannel allocation for forward links. IEEE Transactions on Vehicular Technology, 48, 1428–1437.

    Article  Google Scholar 

  4. Shen, Z., Andrews, J. G., & Evans, B. L. (2005). Adaptive resource allocation in multiuser OFDM systems with proportional rate constraints. IEEE Transactions on Wireless Communications, 4(6), 2726–2737.

    Article  Google Scholar 

  5. Bae, C. S., & Cho, D.-H. (2006). Adaptive resource allocation based on channel information in multihop OFDM systems. IEEE 64th Vehicular Technology Conference, 2006.

  6. Chen, M., Serbetli, S., & Yener, A. (2008). Distributed power allocation strategies for parallel relay networks. IEEE Transactions on Wireless Communications, 7(2), 552–561.

    Article  Google Scholar 

  7. Tang, J., & Zhang, X. (2008). Cross-layer-model based adaptive resource allocation for statistical QoS guarantees in mobile wireless networks. IEEE Transactions on Wireless Communications, 7(6), 2318–2328.

    Article  MathSciNet  Google Scholar 

  8. Tang, J., & Zhang, X. (2007). Cross-layer resource allocation over wireless relay networks for quality of service provisioning. IEEE Journal on Selected Areas in Communications, 25(4), 645–656.

    Article  Google Scholar 

  9. Sagduyu, Y. E., & Ephremides, A. (2004). The problem of medium access control in wireless sensor networks. IEEE Wireless Communications, 11(12), 44–53.

    Article  Google Scholar 

  10. Xue, Y., Li, B., & Nahrstedt, K. (2006). Optimal resource allocation in wireless ad hoc networks: a price-based approach. IEEE Transactions on Mobile Computing, 5(4), 347–364.

    Article  Google Scholar 

  11. Huang, W. L., & Letaief, K. B. (2007) Cross-layer scheduling and power control combined with adaptive modulation for wireless ad hoc networks. IEEE Transactions on Communications, 55(4), 728–739.

    Google Scholar 

  12. Alawieh, B., Assi, C. M., & Ajib, W. (2008). Distributed correlative power control schemes for mobile ad hoc networks using directional antennas. IEEE Transactions on Vehicular Technology, 57(3), 1733–1744.

    Article  Google Scholar 

  13. FCC (2002) Spectrum policy task force report, FCC, 02-155. Nov. 2002.

  14. Haykin, S. (2005). Cognitive radio: Brain-empowered wireless communications. IEEE Journal on Selected Areas in Communications, 20(2), 201–220.

    Article  Google Scholar 

  15. Akyildiz, I. F., Lee, W.-Y., & Chowdhury, K. R. (2009). CRAHNs: Cognitive radio ad hoc networks. Elsevier Ad Hoc Networks Journal, 7(5), 810–836.

    Article  Google Scholar 

  16. Zhao, Q., Tong, L., Swami, A., & Chen, Y. (2007). Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: A POMDP framework. IEEE Journal on Selected Areas in Communications, 25(3), 589–600.

    Article  Google Scholar 

  17. Ganesan, G., & Li, Y. (2007). Cooperative spectrum sensing in cognitive radio, part I: Two user networks. IEEE Transaction on Wireless Communications, 6(6), 2204–2213.

    Article  Google Scholar 

  18. Ganesan, G., & Li, Y. (2007) Cooperative spectrum sensing in cognitive radio, part II: Multiuser networks. IEEE Transaction on Wireless Communications, 6(6), 2214–2222.

    Google Scholar 

  19. Ganesan, G., Li, Y., Bing, B., & Li, S. (2008). Spatiotemporal sensing in cognitive radio networks. IEEE Journal on Selected Areas in Communications, 26(1), 5–12.

    Article  Google Scholar 

  20. Bazerque, J.-A., & Giannakis, G. B. (2007) Distributed scheduling and resource allocation for cognitive OFDMA radios, 2nd International Conference on Cognitive Radio Oriented Wireless Networks and Communications, CrownCom 2007.

  21. Kim, D., Le, L., & Hossain, E. (2008). Joint rate and power allocation for cognitive radios in dynamic spectrum access environment. IEEE Transactions on Wireless Communications, 7(12), 5517–5527.

    Article  Google Scholar 

  22. Qu, Q., Milstein, L. B., & Vaman, D. R. (2008). Cognitive radio based multi-user resource allocation in mobile ad hoc networks using multi-carrier CDMA modulation. IEEE Journal on Selected Areas in Communications, 26(1), 70–82.

    Article  Google Scholar 

  23. Al-Fuqaha, A., Khan, B., Rayes, A., Guizani, M., Awwad, O., & Brahim, G. B. (2008). Opportunistic channel selection strategy for better QoS in cooperative networks with cognitive radio capabilities. IEEE Journal on Selected Areas in Communications, 26(1), 156–167.

    Article  Google Scholar 

  24. Islam, H., Liang, Y.-C., & Hoang, A. T. (2008). Joint power control and beamforming for cognitive radio networks. IEEE Transactions on Wireless Communications, 7(7), 2415–2419.

    Article  Google Scholar 

  25. Kang, X., Liang, Y.-C., Nallanathan, A., Garg, H. K., & Zhang, R. (2009). Optimal power allocation for fading channels in cognitive radio networks: Ergodic capacity and outage capacity. IEEE Transactions on Wireless Communications, 8(2), 940–950.

    Article  Google Scholar 

  26. Zhang, R., Liang, Y.-C., & Cui, S. (2010). Dynamic resource allocation in cognitive radio networks: A convex optimization perspective. IEEE Signal Processing Magazine: Special Issue on Convex Optimization on Signal Processing, 27(3), 102–114.

    MathSciNet  Google Scholar 

  27. Larsson, P., & Kronander, J. (2009) Joint power, rate, and channel allocation in multilink (cognitive) radio system. IEEE Military Communications Conference, (MILCOM 2009), pp. 1–6, 18–21 October 2009.

  28. Chen, Y., Yu, G., Qiu, P., & Zhang, Z. (2008) Cognitive spectrum access with joint opportunistic power and rate control in fading channels. Third International Conference on Communications and Networking in China, 2008 (ChinaCom 2008), pp. 263–268, 25–27 August 2008.

  29. Zhou, P., Yuan, W., Liu, W., & Cheng, W. (2008) Joint power and rate control in cognitive radio networks: A game-theoretical approach. IEEE International Conference on Communications, 2008 (ICC 2008), pp. 3296–3301, 19–23 May 2008.

  30. Shashika Manosha, K. B., & Rajatheva, N. (2010) Joint power and rate control for spectrum underlay in cognitive radio networks with a novel pricing scheme. IEEE Vehicular Technology Conference Fall 2010 (VTC 2010-Fall), pp. 1–5, 6–9 Sept. 2010.

  31. Ding, L., Melodia, T., Batalama, S., Matyjas, J., & Medley, M. (2010). Cross-layer routing and dynamic spectrum allocation in cognitive radio ad hoc networks. IEEE Transactions on Vehicular Technology, 59(4), 1969–1979.

    Article  Google Scholar 

  32. Asghari, V., & Aissa, S. (2010). Adaptive rate and power transmission in spectrum-sharing systems. IEEE Transactions on Wireless Communications, 9(10), 3272–3280.

    Article  Google Scholar 

  33. Zhu, Y., Sun, Z., Wang, W., Peng, T., & Wang, W. (2009) Joint power and rate control considering fairness for cognitive radio network. IEEE Wireless Communications and Networking Conference, 2009 (WCNC 2009), pp. 1–6, 5–8 April 2009.

  34. Tang, L., Wang, H., Chen, Q., & Liu, G. (2009) Subcarrier and power allocation for OFDM-based cognitive radio networks. IEEE International Conference on Communications Technology and Applications, 2009 (ICCTA 2009), pp. 457–461, 16–18 Oct. 2009.

  35. Quan, Z., Cui, S., & Sayed, A. H. (2008). Optimal linear cooperation for spectrum sensing in cognitive radio networks. IEEE Journal of Selected Topics in Signal Processing, 2(1), 28–39.

    Article  Google Scholar 

  36. Goldsmith, A. (2004). Wireless communications. Cambridge, UK: Cambridge University.

    Google Scholar 

  37. Lo, E. S., Chan, P. W. C., Lau, V. K. N., Cheng, R. S., Letaief, K. B., Murch, R. D., et al. (2007). Adaptive resource allocation and capacity comparison of downlink multiuser MIMO-MC-CDMA and MIMO-OFDMA. IEEE Transactions on Wireless communications, 6(3), 1083–1093.

    Article  Google Scholar 

  38. Wong, C. Y., Cheng, R. S., Letaief, K. B., & Murch, R. D. (1999). Multiuser OFDM with adaptive subcarrier, bit, and power allocation. IEEE Journal on Selected Areas in Communications, 17(10), 1747–1758.

    Article  Google Scholar 

  39. Mishra, S. M., Sahai, A., & Broderson, R. W. (2006) Cooperative sensing among cognitive radio. In Proceedings of IEEE ICC, 2006.

  40. Yu, W., & Lui, R. (2006). Dual methods for nonconvex spectrum optimization of multicarrier systems. IEEE Transactions on Communications, 54(7), 1310–1322.

    Article  Google Scholar 

  41. Luo, Z.-Q., & Zhang, S. (2008). Dynamic spectrum management: Complexity and duality. IEEE Journal of Selected Topics in Signal Processing, 2(1), 57–73.

    Article  Google Scholar 

  42. Bertsekas, D. P. (1999) Nonlinear programming, 2nd ed. Athena Scientific.

  43. Hou, Y. T., Shi, Y., & Sherali, H. D. (2004) Rate allocation in wireless sensor networks with network lifetime requirement. In Proceedings of ACM MobiHoc’2004, pp. 67–77.

Download references

Acknowledgments

The work described in this paper was supported by the grants from the Research Grants Council of Hong Kong, China [Project No.: CityU113308], National Natural Science Foundation of China (60903213, 60973114), Scientific Research Foundation of State Key Lab. of Power Transmission Equipment and System Security (No. 2007DA10512709207), the Postdoctoral Science Foundation of China (201003314, 20090460706), the Fundamental Research Funds for the Central Universities (No. CDJZR10180004), New Century Excellent Talents in University (No. NCET-10-0877) and National “Qian Ren Plan” of China.

Author information

Authors and Affiliations

  1. High Performance Networking Research Center, State Key Lab of Power Transmission Equipment and System Security, College of Computer Science, Chongqing University, Chongqing, 400044, People’s Republic of China

    Songtao Guo & Xiaofeng Liao

  2. Department of Manufacturing Engineering and Engineering Management, City University of Hong Kong, Kowloon, Hong Kong

    Chuangyin Dang

Authors
  1. Songtao Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chuangyin Dang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiaofeng Liao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Songtao Guo.

Appendices

Appendix 1

1.1 Convexity of the optimization problem (5)

The aim of this appendix is to prove that (i) the constraint set of the optimization problem P1 is convex; (ii) the objective function is concave.

Firstly, we will show the set of the constraints (3) and (4) is a nonempty convex set.

The constraint (3) can be rewritten as

$$ \sum\limits_{k = 1}^{{A_{i} }} { - R_{i}^{(k)} } \le - R_{i}^{\min } . $$
(50)

As proven above, \( - R_{i}^{(k)} \) is convex. It is not difficult to obtain that the constraint (50) is a convex set.

Since \( \mu_{i}^{(k)} = \frac{{\gamma_{ii}^{(k)} P_{i}^{(k)} }}{{N_{i}^{(k)} }} \), \( \mu_{i}^{(k)} \)is concave and \( - \mu_{i}^{(k)} \) is convex. Thus, the constraint (2) is a convex set.

Since the constraint (4) is a linear combination of \( P_{i}^{(k)} \), the summation of the constraints (3) and (4) is also a convex set.

Secondly, it follows from (5) that\( R_{i}^{(k)} \)is continuous and twice differentiable with respect to \( P_{i}^{(k)} \).The twice derivation of \( R_{i}^{(k)} \) with respect to \( P_{i}^{(k)} \) can be obtained as follows

$$ \frac{{d^{2} R_{i}^{(k)} }}{{dP_{i}^{(k)2} }} = \frac{{ - B\left( {\kappa \gamma_{ii}^{(k)} } \right)^{2} }}{{\ln 2(N_{i}^{(k)} + \kappa \gamma_{ii}^{(k)} P_{i}^{(k)} )^{2} }}. $$
(51)

Since B is a positive real number, it is obvious that (51) is negative semidefinite. Thus, according to the Karush–Kuhn–Tucker condition, \( R_{i}^{(k)} \) is concave. In addition, the constraints (3) and (4) is a convex set and the objective function in the problem P1 can be rewritten as a summation of a set of concave functions, thus the problem P1 is a convex optimization problem.

Appendix 2

2.1 Convexity of the optimization problem with fairness constraint

As proven in Appendix 1, the constraint set of the objective function (8) is a convex set.

The objective function with fairness constraint can be written as

$$ C^{'} = \mathop {\min }\limits_{{P_{i}^{(k)} \ge 0}} - \sum\limits_{i = 1}^{J} {\sum\limits_{{k = 1,k \in F_{i} }}^{{A_{i} }} {R_{i}^{(k)} } } = \mathop {\min }\limits_{{P_{i}^{(k)} \ge 0}} - \sum\limits_{i = 1}^{J} {\sum\limits_{{k = 1,k \in F_{i} }}^{{A_{i} }} {\rho_{i}^{(k)} B\log_{2} \left( {1 + \kappa \frac{{s_{i}^{(k)} }}{{\rho_{i}^{(k)} }}} \right)} } . $$
(52)

We can see from (52) that \( R_{i}^{(k)} \) is continuous and twice differentiable with respect to \( \rho_{i}^{(k)} \) and \( P_{i}^{(k)} \), respectively. The Jacobian of \( R_{i}^{(k)} \) is calculated as

$$ \nabla R_{i}^{(k)} (\rho_{i}^{(k)} ,s_{i}^{(k)} ) = B\left[ {\begin{array}{*{20}c} {\log_{2} \left( {1 + \kappa \frac{{s_{i}^{(k)} }}{{\rho_{i}^{(k)} }}} \right) - \frac{{\kappa s_{i}^{(k)} }}{{\ln 2\left( {\rho_{i}^{(k)} + \kappa s_{i}^{(k)} } \right)}}} \\ {\frac{{\kappa \rho_{i}^{(k)} }}{{\ln 2\left( {\rho_{i}^{(k)} + \kappa s_{i}^{(k)} } \right)}}} \\ \end{array} } \right]. $$
(53)

The Hessian of \( R_{i}^{(k)} \) is calculated as

$$ \nabla^{2} R_{i}^{(k)} (\rho_{i}^{(k)} ,s_{i}^{(k)} ) = \frac{{B\kappa^{2} s_{i}^{(k)} }}{{\ln 2\left( {\rho_{i}^{(k)} + \kappa s_{i}^{(k)} } \right)^{2} }}\left[ {\begin{array}{*{20}c} { - \frac{{s_{i}^{(k)} }}{{\rho_{i}^{(k)} }}} & 1 \\ 1 & { - \frac{{\rho_{i}^{(k)} }}{{s_{i}^{(k)} }}} \\ \end{array} } \right]. $$
(54)

Since \( \gamma_{i}^{(k)} \), \( \gamma_{ii}^{(k)} \), \( N_{i}^{(k)} \)and \( P_{i}^{(k)} \) are positive real numbers, it is obvious that the Hessian of \( R_{i}^{(k)} \) is negative semidefinite and concave. Thus, the Hessian of \( - R_{i}^{(k)} \) is positive semidefinite and convex. The objective function (52) with fairness constraint is convex. The optimization problem under consideration of fairness has optimal solutions.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Guo, S., Dang, C. & Liao, X. Distributed resource allocation with fairness for cognitive radios in wireless mobile ad hoc networks. Wireless Netw 17, 1493–1512 (2011). https://doi.org/10.1007/s11276-011-0360-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-011-0360-9

Keywords

Search

Navigation