Data networks
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Wireless Communications
Proceedings of the 11th annual international conference on Mobile computing and networking
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks
Proceedings of the 11th annual international conference on Mobile computing and networking
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
CRAHNs: Cognitive radio ad hoc networks
Ad Hoc Networks
Transmission power selection for ad hoc networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Power controlled network protocols for multi-rate ad hoc networks
IEEE Transactions on Wireless Communications
Dynamic allocation of subcarriers and transmit powers in an OFDMA cellular network
IEEE Transactions on Information Theory
Rematch: a highly reliable scheduling algorithm on heterogeneous wireless mesh network
The Journal of Supercomputing
Efficient recovery algorithms for wireless mesh networks with cognitive radios
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Optimal traffic splitting in multi-hop cognitive radio networks
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
IEEE/ACM Transactions on Networking (TON)
Distributed resource allocation based on queue balancing in multihop cognitive radio networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.06 |
We develop distributed algorithms to allocate resources in multi-hop wireless networks with the aim of minimizing the total cost. In order to observe the fundamental duplexing constraint that co-located transmitters and receivers cannot operate simultaneously on the same frequency band, we first devise a spectrum allocation scheme that divides the whole spectrum into multiple sub-bands and activates conflict-free links on each sub-band. We show that the minimum number of required sub-bands grows asymptotically at a logarithmic rate with the chromatic number of network connectivity graph. A simple distributed and asynchronous algorithm is developed to feasibly activate links on the available sub-bands. Given a feasible spectrum allocation, we then develop node-based distributed algorithms for optimally controlling the transmission powers on active links for each sub-band, jointly with traffic routes and user input rates in response to channel states and traffic demands. We show that under specified conditioans, the algorithms asymptotically converge to the optimal operating point.