On the distributed complexity of computing maximal matchings
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Bounds on delays and queue lengths in input-queued cell switches
Journal of the ACM (JACM)
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the complexity of scheduling in wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Towards optimal MAC without message passing in wireless networks
CFI '09 Proceedings of the 4th International Conference on Future Internet Technologies
EZ-Flow: removing turbulence in IEEE 802.11 wireless mesh networks without message passing
Proceedings of the 5th international conference on Emerging networking experiments and technologies
Elucidating the instability of random access wireless Mesh networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Implementing utility-optimal CSMA
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Minimum energy scheduling in multi-hop wireless networks with retransmissions
IEEE Transactions on Wireless Communications
Max-contribution: on optimal resource allocation in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
An investigation on the nature of wireless scheduling
INFOCOM'10 Proceedings of the 29th conference on Information communications
Energy-conserving scheduling in multi-hop wireless networks with time-varying channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
D-TDMA: An Approach of Dynamic TDMA Scheduling for Target Tracking in Wireless Sensor Networks
GREENCOM-CPSCOM '10 Proceedings of the 2010 IEEE/ACM Int'l Conference on Green Computing and Communications & Int'l Conference on Cyber, Physical and Social Computing
Enhance & explore: an adaptive algorithm to maximize the utility of wireless networks
MobiCom '11 Proceedings of the 17th annual international conference on Mobile computing and networking
Understanding and tackling the root causes of instability in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
International Journal of Communication Systems
Robust cross layer optimization in relay aided cellular networks
Wireless Networks
Distributed scheduling schemes for wireless mesh networks: A survey
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
It has been an important research topic since 1992 to maximize stability region in constrained queueing systems, which includes the study of scheduling over wireless ad hoc networks. In this paper, we propose a framework to study a wide range of existing and future scheduling algorithms and characterize the achieved tradeoffs in stability, delay, and complexity. These characterizations reveal interesting properties hidden in the study of any one or two dimensions in isolation. For example, decreasing complexity from exponential to polynomial, while keeping stability region the same, generally comes at the expense of exponential growth of delays. Investigating trade-offs in the 3-dimensional space allows a designer to fix one dimension and vary the other two jointly. For example, incentives for using scheduling algorithms with only partial throughput-guarantee can be quantified with regards to delay and complexity. Trade-off analysis is then extended to systems with congestion control through utility maximization for non-stabilizable arrival inputs, where the complexity-utility-delay trade-off is shown to be different from the complexity-stability-delay tradeoff. Finally, we analyze more practical models with bounded message size, and consider "effective throughput" which reflects resource occupied by control messages. We show that effective throughput may degrade significantly in certain scheduling algorithms, and suggest a mechanism to avoid this problem in light of the 3D tradeoff framework.