Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
Comparison between graph-based and interference-based STDMA scheduling
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
A power control MAC protocol for ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
A note on greedy algorithms for the maximum weighted independent set problem
Discrete Applied Mathematics
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
Approximations of Independent Sets in Graphs
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
A utility-based power-control scheme in wireless cellular systems
IEEE/ACM Transactions on Networking (TON)
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Impact of interference on multi-hop wireless network performance
Proceedings of the 9th annual international conference on Mobile computing and networking
A duality model of TCP and queue management algorithms
IEEE/ACM Transactions on Networking (TON)
Proceedings of the 12th annual international conference on Mobile computing and networking
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
IEEE/ACM Transactions on Networking (TON)
Two-phase routing, scheduling and power control for wireless mesh networks with variable traffic
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Realistic propagation simulation of urban mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS-aware fair rate allocation in wireless mesh networks
Computer Communications
Communication models for throughput optimization in mesh networks
Proceedings of the 5th ACM symposium on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Proceedings of the 4th Annual International Conference on Wireless Internet
Throughput optimization of urban wireless mesh networks
Throughput optimization of urban wireless mesh networks
Approximation algorithms for the weighted independent set problem
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Joint rate and power control algorithms for wireless networks
IEEE Transactions on Signal Processing
Joint scheduling and power control for wireless ad hoc networks
IEEE Transactions on Wireless Communications
Rate-regulated power control for supporting flexible transmission in future CDMA mobile networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
A significant amount of research on optimal scheduling has focused on the case where links can transmit with only a single bit-rate and a single transmission power. This paper develops techniques to accommodate multiple bit-rates and multiple transmission powers as well as a continuum of transmission powers. Optimizing over a large number of bit-rates and transmission powers typically increases the computed throughput at the expense of increasing the computation time. This paper examines the trade-off between computed throughput and computation time, with emphasis on the case when the relationship between bit-rate and SINR is the same as it is for 802.11a/g. One finding of this paper is a progression of Pareto optimal schemes that increases the computed capacity. A second finding is that optimizing over two transmission powers and two or three bit-rates achieves nearly the same throughput as optimizing over a continuum of transmission powers and all supported bit-rates. However, optimizing over a continuum of transmission powers and all supported bit-rates is far more computationally complex than optimizing over two transmission powers and a few bit-rates.