Utility Maximization with Packet Collision Constraint in Cognitive Radio Networks

SUMMARY We study joint rate control and resource allocation with a packet collision constraint that maximizes the total utility of secondary users in cognitive radio networks. We formulate and decouple the original optimization problem into separable subproblems and then develop an algorithm that converges to optimal rate control and resource allocation. The proposed algorithm can operate on different time-scales to reduce the amortized time complexity.

[1]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[2]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[3]  Yiwei Thomas Hou,et al.  A Distributed Optimization Algorithm for Multi-Hop Cognitive Radio Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[4]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[5]  Zhi Ding,et al.  Opportunistic spectrum access in cognitive radio networks , 2008, IJCNN.

[6]  Michael J. Neely,et al.  Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.