Iterative construction of optimum signature sequence sets in synchronous CDMA systems
IEEE Transactions on Information Theory
On the stability of distributed sequence adaptation for cellular asynchronous DS-CDMA systems
IEEE Transactions on Information Theory
Dynamic frequency selection for cognitive radios based on game theory
CSNA '07 Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications
Asymptotic optimality for distributed spectrum sharing using bargaining solutions
IEEE Transactions on Wireless Communications
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Signal Processing
GADIA: A greedy asynchronous distributed interference avoidance algorithm
IEEE Transactions on Information Theory
Distributed graph coloring for self-organization in LTE networks
Journal of Electrical and Computer Engineering - Special issue on LTE/LTE-advanced cellular communication networks
Balancing reliability and utilization in dynamic spectrum access
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 7th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
| Hi-index | 0.06 |
One of the more commonly envisioned algorithms for cognitive radios is spectrum filling via dynamic frequency selection. Applying the cognitive radio design framework proposed in [1], we formalize a low complexity distributed ad-hoc dynamic frequency sele ction algorithm that converges to near-minimal interference frequency re-use patterns. We then examine the performance of this algorithm in the presences of practical considerations such as intra-network policy variations and timing issues and show that while this leads to situations that violate the framework of [1], the steady-state and convergence properties of the framework are still preserved.