Sphere-packings, lattices, and groups
Sphere-packings, lattices, and groups
Mobile Radio Communications
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Selfish routing
Interference Avoidance Methods for Wireless Systems (Information Technology Transmission, Processing and Storage)
Utilization and fairness in spectrum assignment for opportunistic spectrum access
Mobile Networks and Applications
Auction-based spectrum sharing
Mobile Networks and Applications
Self-Organizing Sensor Networks for Integrated Target Surveillance
IEEE Transactions on Computers
Adaptive channel allocation spectrum etiquette for cognitive radio networks
Mobile Networks and Applications
Analysis and design of cognitive radio networks and distributed radio resource management algorithms
Analysis and design of cognitive radio networks and distributed radio resource management algorithms
Spectrum sharing through distributed coordination in dynamic spectrum access networks
Wireless Communications & Mobile Computing - Cognitive Radio, Software Defined Radio And Adaptive Wireless Systems
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Performance of distributed dynamic frequency selection schemes for interference reducing networks
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Distributed network control for mobile multi-modal wireless sensor networks
Journal of Parallel and Distributed Computing
Autonomous Spectrum Balancing for Digital Subscriber Lines
IEEE Transactions on Signal Processing
Wireless systems and interference avoidance
IEEE Transactions on Wireless Communications
Simultaneous Water Filling in Mutually Interfering Systems
IEEE Transactions on Wireless Communications
Iterative construction of optimum signature sequence sets in synchronous CDMA systems
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Distributed multiuser power control for digital subscriber lines
IEEE Journal on Selected Areas in Communications
Dynamic spectrum access in open spectrum wireless networks
IEEE Journal on Selected Areas in Communications
Distributed interference compensation for wireless networks
IEEE Journal on Selected Areas in Communications
Spectrum sharing for unlicensed bands
IEEE Journal on Selected Areas in Communications
Distributed Rule-Regulated Spectrum Sharing
IEEE Journal on Selected Areas in Communications
Sequential Bandwidth and Power Auctions for Distributed Spectrum Sharing
IEEE Journal on Selected Areas in Communications
Stabilizing relaxed nonlinear FMA yields a (combinatorial) optimizer
ICONIP'12 Proceedings of the 19th international conference on Neural Information Processing - Volume Part I
| Hi-index | 754.84 |
In this paper, the problem of distributed dynamic frequency allocation is considered for a canonical communication network, which spans several networks such as cognitive radio networks and digital subscriber lines (DSLs). A greedy asynchronous distributed interference avoidance (GADIA) algorithm for horizontal spectrum sharing has been proposed that achieves performance close to that of a centralized optimal algorithm. The convergence of the GADIA algorithm to a near-optimal frequency allocation strategy is proved and several asymptotic performance bounds have been established for various spatial configurations of the network nodes. Furthermore, the near-equilibrium dynamics of the GADIA algorithm has been studied using the Glauber dynamics, by identifying the problem with the antiferromagnetic inhomogeneous long-range Potts model. Using the near-equilibrium dynamics and methods from stochastic analysis, the robustness of the algorithm with respect to time variations in the activity of network nodes is studied. These analytic results along with simulation studies reveal that the performance is close to that of an optimum centralized frequency allocation algorithm. Further simulation studies confirm that our proposed algorithm outperforms the iterative water-filling algorithm in the low signal-to-interference-plus-noise ratio (SINR) regime, in terms of achieved sum rate, complexity, convergence rate, and robustness to time-varying node activities.