Scheduling algorithms for multihop radio networks
IEEE/ACM Transactions on Networking (TON)
A new model for packet scheduling in multihop wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Achieving MAC layer fairness in wireless packet networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
Hybrid Channel Access Scheduling in Ad Hoc Networks
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Approximations of Independent Sets in Graphs
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
On Local Search for Weighted k-Set Packing
ESA '97 Proceedings of the 5th Annual European Symposium on Algorithms
Open Spectrum: A Path to Ubiquitous Connectivity
Queue - Wireless
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
IEEE Spectrum
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
DIMSUMNet: New Directions in Wireless Networking Using Coordinated Dynamic Spectrum Access
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Software-defined radio: basics and evolution to cognitive radio
EURASIP Journal on Wireless Communications and Networking
Utilization and fairness in spectrum assignment for opportunistic spectrum access
Mobile Networks and Applications
Measurement-based models of delivery and interference in static wireless networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Distributed channel management in uncoordinated wireless environments
Proceedings of the 12th annual international conference on Mobile computing and networking
NeXt generation/dynamic spectrum access/cognitive radio wireless networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A new pricing model for next generation spectrum access
TAPAS '06 Proceedings of the first international workshop on Technology and policy for accessing spectrum
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Channel assignment schemes for cellular mobile telecommunication systems: A comprehensive survey
IEEE Communications Surveys & Tutorials
Approaches to spectrum sharing
IEEE Communications Magazine
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Maximizing throughput for overlaid cognitive radio networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
A new joint strategy of radio channel allocation and power control for wireless mesh networks
Computer Communications
A highly available spectrum allocation service model in dynamic spectrum market
Future Generation Computer Systems
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, we propose a distributed low complexity approach where nodes self-organize into coordination groups and adapt their spectrum assignment to approximate the global optimal assignment. We design a distributed coordination protocol to regulate the coordination format and achieve fast system convergence. The proposed approach achieves similar performance in spectrum assignment compared to that of the conventional centralized approaches, but significantly reduces the number of computations and message exchanges required to adapt to topology changes. As a case study, we investigate the detailed coordination strategy to improve proportional fairness in spectrum assignment, and derive a theoretical lower bound on the minimum spectrum/througput each node can get from coordination. Such bound can be utilized to guide the coordination procedures. We also show that the difference between the proposed approach and the global optimal approach is upper-bounded. Experimental results demonstrate that the proposed approach provides similar performance as the topology-based optimization but with more than 50% of reduction in complexity.