Cross-layer scheduling for cooperative multi-hop cognitive radio networks

IEEE Journal on Selected Areas in Communications

Volumn 31, Issue 3, 2013, Pages 534-543

  Xue, Dongyue ^a   Ekici, Eylem ^a  

^a Ohio State University   (United States)

Author keywords

Cognitive radio; congestion control; finite buffers; multi hop wireless networks; optimal scheduling

Indexed keywords

ALGORITHM APPROACHES; AVERAGE DELAY; CROSS LAYER SCHEDULING; CROSS-LAYER; DISTRIBUTED IMPLEMENTATION; FINITE BUFFER; MULTI-HOP COGNITIVE RADIO NETWORKS; MULTIHOP TRANSMISSION; MULTIHOP WIRELESS NETWORK; OPTIMAL SCHEDULING; OPTIMAL SCHEDULING ALGORITHM; PRIMARY TRAFFIC; PRIMARY USERS; SECONDARY USERS; SIMULATION STUDIES; TIME-AVERAGED;

ALGORITHMS; COGNITIVE RADIO; CONGESTION CONTROL (COMMUNICATION); SCHEDULING; WIRELESS NETWORKS;

OPTIMIZATION;

EID: 84874639547     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2013.130318     Document Type: Article

References (29)

1. "FCC Spectrum Policy Task Force: Report of the spectrum efficiency working group", November 2002.
2. I. Akyildiz, W. Lee, M. Vuran, and S. Mohanty, "NeXt generation/dynamic spectrum access/cognitive radio wireless networks: A survey, Computer Networks", in Computer Networks J. (Elsevier), vol. 50, no. 13, pp. 2127-2159, 2006. (Pubitemid 43975031)
3. L. Lai, H. Gamal, H. Jiang and H. Poor, "Cognitive Medium Access: Exploration, Exploitation and Competition", in IEEE Trans. Mobile Computing, vol. 10, no. 2, pp. 239-253, Feb. 2010.
4. Q. Zhao, L. Tong, A. Swami and Y. Chen, "Decentralized cognitive MAC for opportunistic spectrum access in ad hoc networks: a POMDP framework", in IEEE J. Sel. Areas Commun., vol. 25, no. 3, pp. 589-600, April 2007.
5. H. Su and X. Zhang, "Cross-layer based opportunistic MAC protocols for QoS provisioning over cognitive radio wireless networks", in IEEE J. Sel. Areas Commun., vol. 26, no. 1, pp. 118-129, January 2008.
6. H. Kim and K. G. Shin, "Efficient discovery of spectrum opportunities with MAC-layer sensing in cognitive radio networks", in IEEE Trans. Mobile Computing, vol. 7, no. 5,pp. 533-545, May 2008. (Pubitemid 351454003)
7. X. Liu, E. K. P. Chong, and N. B. Shroff, "A framework for opportunistic scheduling in wireless networks", in Computer Networks, vol. 41, no. 4, pp. 451-474, Mar. 2003.
8. S. Bayat, R. Louie, Y. Li, and B. Vucetic, "Cognitive radio relay networks with multiple primary and secondary users: distributed stable matching algorithms for spectrum access", in Proc. IEEE International Conference on Communications (ICC) 2011, pp. 1-6, June 2011.
9. L. Giupponi and C. Ibars, "Distributed cooperation among cognitive radios with complete and incomplete information", in EURASIP J. Advances in Signal Processing, vol. 2009, No. 3, pp. 1-13, March 2009.
10. Y. Han, A. Pandharipande, and S. H. Ting, "Cooperative decodeandforward relaying for secondary spectrum access", in IEEE Trans. Wireless Commun., vol. 8, no. 10, pp. 4945-4950, Oct. 2009.
11. R. Urgaonkar and M. Neely, "Opporunistic scheduling with reliability guarantees in cognitive radio networks", in IEEE Trans. Mobile Computing, vol. 8, no. 6, pp. 766-777, June 2009.
12. M. Lotfinezhad, B. Liang, and E. Sousa, "Optimal control of constrained cognitive radio networks with dynamic population size", in Proc. IEEE INFOCOM'10, pp. 1-9, March 2010.
13. K. Khalil, M. Karaca, O. Ercetin, and E. Ekici, "Optimal scheduling in cooperate-to-join cognitive radio networks", in Proc. IEEE INFOCOM' 11, pp. 3002-3010, April 2011.
14. D. Xue and E. Ekici, "Guaranteed opportunistic scheduling in multihop cognitive radio networks", in IEEE INFOCOM'11, pp. 2984-2992, April 2011.
15. L. Tassiulas and A. Ephremides, "Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks," in IEEE Trans. Autom. Control, vol. 37, no. 12, pp. 1936-1948, Dec. 1992.
16. L. Georgiadis, M. Neely, and L.Tassiulas, "Resource allocation and cross-Layer control in wireless networks", in Foundations and Trends in Networking, vol. 1, no. 1, pp. 1-149, April 2006.
17. M. Neely, "Dynamic power allocation and routing for satellite and wireless networks with time varing channels", Ph.D. dissertation, Mass. Inst. Technol. (MIT), Cambridge, MA, 2003.
18. X. Wu, R. Srikant, and J. Perkins, "Scheduling efficiency of distributed greedy scheduling algorithms in wireless networks", in IEEE Trans. Mobile Computing, vol. 6, no. 6, pp. 595-605, June 2007. (Pubitemid 46685739)
19. C. Joo, X. Lin, and N. Shroff, "Greedy maximal matching: performance limits for arbitrary network graphs under the node-exclusive interference model", in IEEE Trans. Autom. Control, vol. 54, no. 12, pp. 2734-2744, December 2009.
20. G. Sharma, R. Mazumdar, and N. Shroff, "On the complexity of scheduling in wireless neworks", in Proc. 12th Annual International Conference on Mobile Computing and Networking (MobiCom'06), pp. 227-238, 2006.
21. L. Le, E. Modiano, and N. Shroff, "Optimal control of wireless networks with finite buffers", in Proc. IEEE INFOCOM'10, pp. 1-9, March 2010.
22. L. Ying, R. Srikant and D. Towsley, "Cluster-based back-pressure routing algorithm", in Proc. IEEE INFOCOM08, pp. 484-492, April 2008.
23. S. Sakai, M. Togasaki, and K. Yamazaki, "A note on greedy algorithms for the maximum weighted independent set problem", in Discrete Applied Mathematics, vol. 126, No. 2-3, pp. 313-322, March 2003.
24. L. Bui, R. Srikant and A. Stolyar, "Novel architectures and algorithms for delay reduction in back-pressure scheduling and routin", in Proc. IEEE INFOCOM09 Mini-Conference, pp. 2936-2940, April 2009.
25. P. Huang, X. Lin, and C. Wang, "A low-complexity congestion control and scheduling algorithm for multi-hop wireless networks with orderoptimal per-flow delay", in Proc. IEEE INFOCOM'11, pp. 2588-2596, April 2011.
26. L. Jiang and J. Walrand, "A distributed algorithm for throughput and utility maximization in wireless networks", in IEEE/ACM Trans. Netw., vol. 18, no.3, pp. 960-972, June 2010.
27. J. Ni, B. Tan, and R. Srikant, "Q-CSMA: queue-length based CSMA/CA algorithms for achieving maximum throughput and low delay in wireless networks", in Proc. IEEE INFOCOM'10 Mini-Conference, 271-275, March 2010.
28. S. Rajagopalan, D. Shah, and J. Shin, "Network adiabatic theorem: an efficient randomized protocol for contention resolution", in Proc. ACM SIGMETRICS'09, pp. 133-144, June 2009.
29. L. Jiang, M. Leconte, J. Ni, R. Srikant, and J. Walrand, "Fast mixing of parallel Glauber dynamics and low-delay CSMA scheduling", in IEEE INFOCOM'11 Mini-Conference, pp. 371-375, April 2011.