Distributed resource allocation based on queue balancing in multihop cognitive radio networks

Authors:
Wei Wang;Kang G. Shin;Wenbo Wang
Affiliations:
Department of Information Science and Electronic Engineering, Zhejiang University, Hangzhou, China;Real-Time Computing Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI;Wireless Signal Processing and Network Lab, Beijing University of Posts and Telecommunications, Beijing, China
Venue:
IEEE/ACM Transactions on Networking (TON)
Year:
2012

Citing 19
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computers and Intractability; A Guide to the Theory of NP-Completeness

Computers and Intractability; A Guide to the Theory of NP-Completeness
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

Operations Research
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
Simplification of network dynamics in large systems

IEEE/ACM Transactions on Networking (TON)
Utilization and fairness in spectrum assignment for opportunistic spectrum access

Mobile Networks and Applications
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey

Computer Networks: The International Journal of Computer and Telecommunications Networking
Allocating dynamic time-spectrum blocks in cognitive radio networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Distributed algorithms for spectrum allocation, power control, routing, and congestion control in wireless networks

Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control

IEEE/ACM Transactions on Networking (TON)
A simple local-control approximation algorithm for multicommodity flow

SFCS '93 Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science
Cross-layer optimization for OFDM wireless networks-part I: theoretical framework

IEEE Transactions on Wireless Communications
Scheduling and performance limits of networks with constantly changing topology

IEEE Transactions on Information Theory
The capacity of wireless networks

IEEE Transactions on Information Theory
Product Multicommodity Flow in Wireless Networks

IEEE Transactions on Information Theory
Cognitive radio: brain-empowered wireless communications

IEEE Journal on Selected Areas in Communications
What and how much to gain by spectrum agility?

IEEE Journal on Selected Areas in Communications
Spectrum Sharing for Multi-Hop Networking with Cognitive Radios

IEEE Journal on Selected Areas in Communications

Distributed Delay-Aware Routing and Metrics Evaluation for Cognitive Radio Networks

Wireless Personal Communications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cognitive radio (CR) allows unlicensed users to access the licensed spectrum opportunistically (i.e., when the spectrum is left unused by the licensed users) to enhance the spectrum utilization efficiency. In this paper, the problem of allocating resources (channels and transmission power) in multihop CR networks is modeled as a multicommodity flow problem with the dynamic link capacity resulting from dynamic resource allocation, which is in sharp contrast with existing flow-control approaches that assume fixed link capacity. Based on queue-balancing network flow control that is ideally suited for handling dynamically changing spectrum availability in CR networks, we propose a distributed scheme (installed and operational in each node) for optimal resource allocation without exchanging spectrum dynamics information between remote nodes. Considering the power masks, each node makes resource-allocation decisions based on current or past local information from neighboring nodes to satisfy the throughput requirement of each flow. Parameters of these proposed schemes are configured to maintain the network stability. The performance of the proposed scheme for both asynchronous and synchronous scenarios is analyzed comparatively. Both cases of sufficient and insufficient network capacity are considered.