Throughput satisfaction-based scheduling for cognitive radio networks

IEEE Transactions on Vehicular Technology

Volumn 61, Issue 9, 2012, Pages 4079-4094

  Gozupek, Didem ^a   Eraslan, Başak ^a   Alagoz, Fatih ^a  

^a BOGAZICI UNIVERSITY   (Turkey)

Author keywords

Cognitive radio networks (CRN); dynamic spectrum access (DSA); resource allocation; scheduling

Indexed keywords

COGNITIVE RADIO NETWORK; CONSTANT FACTORS; DYNAMIC SPECTRUM ACCESS; FAIR SCHEDULING; IN-CHANNELS; LOW COMPUTATIONAL COMPLEXITY; MAX-MIN; NP-HARD; OPPORTUNISTIC SCHEDULING; RESOURCE ASSIGNMENT; SCHEDULING PROBLEM; SPECTRAL ACTIVITY;

COGNITIVE RADIO; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; RADIO SYSTEMS; RESOURCE ALLOCATION; THROUGHPUT;

SCHEDULING;

EID: 84869427754     PISSN: 00189545     EISSN: None     Source Type: Journal    
DOI: 10.1109/TVT.2012.2210257     Document Type: Article

References (34)

1. I. Akyildiz,W. Lee, M. Vuran, and S.Mohanty, "Next generation/dynamic spectrum access/cognitive radio wireless networks: A survey," Comput. Netw., vol. 50, no. 13, pp. 2127-2159, Sep. 2006.
2. R. Urgaonkar and M. Neely, "Opportunistic scheduling with reliability guarantees in cognitive radio networks," IEEE Trans. Mobile Comput., vol. 8, no. 6, pp. 766-777, Jun. 2009.
3. D. Xue and E. Ekici, "Guaranteed opportunistic scheduling in multihop cognitive radio networks," in Proc. IEEE INFOCOM, 2011, pp. 2984-2992.
4. C. Tian and D. Yuan, "Cross-layer opportunistic scheduling for multiclass users in cognitive radio networks," in Proc. IEEE Int. Conf. WiCOM, 2008, pp. 1-4.
5. R. Wang, V. Lau, and Y. Cui, "Decentralized fair Scheduling in two-hop relay-assisted cognitive OFDMA systems," IEEE J. Sel. Topics Signal Process., vol. 5, no. 1, pp. 171-181, Feb. 2011.
6. R. Santos, F. Lima, W. Freitas, and F. Cavalcanti, "QoS based radio resource allocation and scheduling with different user data rate requirements for OFDMA systems," in Proc. IEEE PIMRC, 2007, pp. 1-5.
7. E. Rodrigues and F. Casadevall, "Adaptive radio resource allocation framework for multi-user OFDM," in Proc. IEEE VTC, 2009, pp. 1-6.
8. Z. Zhang, Y. He, and E. Chong, "Opportunistic scheduling for OFDM systems with fairness constraints," EURASIP J. Wireless Commun. Netw., vol. 2008, pp. 1-12, Jan. 2008.
9. S. Pal, S. Kundu, M. Chatterjee, and S. Das, "Combinatorial reverse auction based scheduling in multi-rate wireless systems," IEEE Trans. Comput., vol. 56, no. 10, pp. 1329-1341, Oct. 2007.
10. H. Mahmoud, T. Yucek, and H. Arslan, "OFDM for cognitive radio: Merits and challenges," IEEE Wireless Commun., vol. 16, no. 2, pp. 6- 15, Apr. 2009.
11. G. Aristomenopoulos, T. Kastrinogiannis, V. Kaldanis, G. Karantonis, and S. Papavassiliou, "A novel framework for dynamic utility-based QoE provisioning in wireless networks," in Proc. IEEE GLOBECOM, 2010, pp. 1-6.
12. T. Kastrinogiannis and S. Papavassiliou, "Utility based short-term throughput driven scheduling approach for efficient resource allocation in CDMA wireless networks,"Wirel. Pers. Commun., vol. 52, no. 3, pp. 517- 535, 2010.
13. C. Uc-Rios and D. Lara-Rodriguez, "A low complexity scheduling for maximizing satisfied users in wireless networks," in Proc. IEEE ICSPCS, 2010, pp. 1-5.
14. C. Raman, J. Singh, R. Yates, and N. Mandayam, "Scheduling variable rate links - Centralized and decentralized approaches," in Cognitive Wireless Networks: Concepts, Methodologies and Visions Inspiring the Age of Enlightenment ofWireless Communications. Berlin, Germany: Springer- Verlag, 2007, p. 285.
15. K. Khalil, M. Karaca, O. Erçetin, and E. Ekici, "Optimal scheduling in cooperate-to-join cognitive radio networks," in Proc. IEEE INFOCOM, 2011, pp. 3002-3010.
16. Q. Cheng and B. Kollimarla, "Joint channel and power allocation based on user satisfaction for cognitive radio," in Proc. IEEE Conf. Inf. Sci. Syst., 2009, pp. 579-584.
17. J. Cho, S. Jang, W. Jung, and J. Kim, "Power allocation and user satisfaction-based switching method in cognitive radio MIMO system," in Proc. IEEE ICTC, 2010, pp. 397-402.
18. M. Nguyen and H. Lee, "Effective scheduling in infrastructure-based cognitive radio network," IEEE Trans. Mobile Comput., vol. 10, no. 6, pp. 853-867, Jun. 2011.
19. J. Tang, S. Misra, and G. Xue, "Joint spectrum allocation and scheduling for fair spectrum sharing in cognitive radio wireless networks," Comput. Netw., vol. 52, no. 11, pp. 2148-2158, 2008.
20. R. Yates, C. Raman, and N. Mandayam, "Fair and efficient scheduling of variable rate links via a spectrum server," in Proc. IEEE ICC, 2006, vol. 11, pp. 5246-5251.
21. C. Peng, H. Zheng, and B. Zhao, "Utilization and fairness in spectrum assignment for opportunistic spectrum access," Mobile Netw. Appl., vol. 11, no. 4, pp. 555-576, Aug. 2006.
22. D. Gözüpek and F. Alagöz, "An interference aware throughput maximizing scheduler for centralized cognitive radio networks," in Proc. IEEE Int. Symp. PIMRC, 2010, pp. 1-6.
23. J. Hou, J. Yang, and S. Papavassiliou, "Integration of pricing with call admission control to meet QoS requirements in cellular networks," IEEE Trans. Parallel Distrib. Syst., vol. 13, no. 9, pp. 898-910, Sep. 2002.
24. P. Hande, Z. Shengyu, and C. Mung, "Distributed rate allocation for inelastic flows," IEEE/ACM Trans. Netw., vol. 15, no. 6, pp. 1240-1253, Dec. 2007.
25. J. Dreo, A. Petrowski, E. Taillard, and P. Siarry, Metaheuristics for Hard Optimization Simulated Annealing, Tabu Search, Evolutionary and Genetic Algorithms, Ant Colonies, ⋯ Methods and Case Studies. New York: Springer-Verlag, 2006.
26. T. El-Ghazali, Metaheuristics: From Design to Implementation. Chichester, U.K.: Wiley, 2009.
27. D. Gözüpek and F. Alagöz, "Genetic algorithm-based scheduling in cognitive radio networks under interference temperature constraints," Int. J. Commun. Syst., vol. 24, no. 2, pp. 239-257, Feb. 2011.
28. S. Kim, E. Lee, M. Choi, H. Jeong, and S. Seo, "Design optimization of vehicle control networks," IEEE Trans. Veh. Technol., vol. 60, no. 7, pp. 3002-3016, Sep. 2011.
29. D. Gözüpek, G. Genç, and C. Ersoy, "Channel assignment problem in cellular networks: A reactive tabu search approach," in Proc. IEEE Int. Symp. Comput. Inf. Sci., 2009, pp. 298-303.
30. D.Williamson and D. Shmoys, The Design of Approximation Algorithms. Cambridge, U.K.: Cambridge Univ. Press, 2011.
31. S. Assmann, D. Johnson, D. Kleitman, and J. Leung, "On a dual version of the one-dimensional bin packing problem," J. Algorithms, vol. 5, no. 4, pp. 502-525, 1984.
32. K. Jansen and R. Solis-Oba, "An asymptotic fully polynomial time approximation scheme for bin covering," in Proc. 13th Int. Symp. Algor. Comput., 2002, vol. 2518, Lecture Notes in Computer Science, pp. 175-186.
33. D. Gözüpek, M. Shalom, and F. Alagöz, "A graph theoretic approach to scheduling in cognitive radio networks," IEEE/ACM Trans. Netw., 2012, submitted for publication. [Online]. Available: http://www.cmpe.boun.edu.tr/gozupek/gozupek-GraphCogSch-2012.pdf
34. CPLEX, 2011. [Online]. Available: http://www.ilog.com/products/cplex