A fast and simple randomized parallel algorithm for maximal matching
Information Processing Letters
Distributed computing: a locality-sensitive approach
Distributed computing: a locality-sensitive approach
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Capacity assignment in Bluetooth scatternets: optimal and heuristic algorithms
Mobile Networks and Applications
Impact of interference on multi-hop wireless network performance
Wireless Networks - Special issue: Selected papers from ACM MobiCom 2003
Achieving 100% throughput in an input-queued switch
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Randomized scheduling algorithms for high-aggregate bandwidth switches
IEEE Journal on Selected Areas in Communications
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Maxmin fair scheduling in wireless ad hoc networks
IEEE Journal on Selected Areas in Communications
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
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
A distributed switch scheduling algorithm
Performance Evaluation
Adaptive network coding and scheduling for maximizing throughput in wireless networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Multi-hop broadcast from theory to reality: practical design for ad hoc networks
Proceedings of the 1st international conference on Autonomic computing and communication systems
Complexity in wireless scheduling: impact and tradeoffs
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
A local greedy scheduling scheme with provable performance guarantee
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Distributed throughput maximization in wireless mesh networks via pre-partitioning
IEEE/ACM Transactions on Networking (TON)
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
A fluid-flow model for backlog-based CSMA policies
Proceedings of the 4th Annual International Conference on Wireless Internet
Network adiabatic theorem: an efficient randomized protocol for contention resolution
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Foundations and Trends® in Networking
Scheduling partition for order optimal capacity in large-scale wireless networks
Proceedings of the 15th annual international conference on Mobile computing and networking
IEEE/ACM Transactions on Networking (TON)
Utilizing multi-hop neighbor information in spectrum allocation for wireless networks
IEEE Transactions on Wireless Communications
Distributed link scheduling with constant overhead
IEEE/ACM Transactions on Networking (TON)
Performance of random access scheduling schemes in multi-hop wireless networks
IEEE/ACM Transactions on Networking (TON)
Queue back-pressure random access in multihop wireless networks: optimality and stability
IEEE Transactions on Information Theory
Coding and control for communication networks
Queueing Systems: Theory and Applications
Low complexity stable link scheduling for maximizing throughput in wireless networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
Distributed throughput maximization in wireless networks via random power allocation
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Low-complexity distributed scheduling algorithms for wireless networks
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Practical scheduling schemes with throughput guarantees for multi-hop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of throughput versus complexity tradeoffs in wireless networks
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Self-organization properties of CSMA/CA systems and their consequences on fairness
IEEE Transactions on Information Theory
Implementing utility-optimal CSMA
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Back-pressure routing and optimal scheduling in wireless broadcast networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Localized scheduling for practical and optimal capacity utilization in large wireless networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Toward practical opportunistic routing with intra-session network coding for mesh networks
IEEE/ACM Transactions on Networking (TON)
Distributed cross-layer algorithms for the optimal control of multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
On distributed scheduling in wireless networks exploiting broadcast and network coding
IEEE Transactions on Communications
Minimum energy scheduling in multi-hop wireless networks with retransmissions
IEEE Transactions on Wireless Communications
Joint random access and power selection for maximal throughput in wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Optimal control of wireless networks with finite buffers
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
A greedy link scheduler for wireless networks with Gaussian multiple access and broadcast channels
INFOCOM'10 Proceedings of the 29th conference on Information communications
Incorporating traffic dependency information in distributed spectrum allocation
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Longest-queue-first scheduling under SINR interference model
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
IEEE Transactions on Information Theory
IEEE Transactions on Signal Processing
On the stability of flow-aware CSMA
Performance Evaluation
Cross-layer interactions in multihop wireless sensor networks: A constrained queueing model
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Joint congestion control and distributed scheduling for throughput guarantees in wireless networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Distributed random access algorithm: scheduling and congestion control
IEEE Transactions on Information Theory
Cross-layer design in multihop wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the complexity of scheduling in wireless networks
EURASIP Journal on Wireless Communications and Networking - Special issue on adaptive cross-layer strategies for fourth generation wireless communications
A distributed CSMA algorithm for throughput and utility maximization in wireless networks
IEEE/ACM Transactions on Networking (TON)
Throughput optimal distributed power control of stochastic wireless networks
IEEE/ACM Transactions on Networking (TON)
MAC scheduling with low overheads by learning neighborhood contention patterns
IEEE/ACM Transactions on Networking (TON)
Understanding and tackling the root causes of instability in wireless mesh networks
IEEE/ACM Transactions on Networking (TON)
Optimal transmission modes by simulated annealing
Proceedings of the 6th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks
End-to-end maxmin fairness in multihop wireless networks: Theory and protocol
Journal of Parallel and Distributed Computing
A greedy link scheduler for wireless networks with Gaussian multiple-access and broadcast channels
IEEE/ACM Transactions on Networking (TON)
Mathematical and Computer Modelling: An International Journal
Cluster-based back-pressure routing algorithm
IEEE/ACM Transactions on Networking (TON)
Wireless network stability in the SINR model
SIROCCO'12 Proceedings of the 19th international conference on Structural Information and Communication Complexity
Optimal control of wireless networks with finite buffers
IEEE/ACM Transactions on Networking (TON)
Performance of CSMA in multi-channel wireless networks
Queueing Systems: Theory and Applications
Cachet: a decentralized architecture for privacy preserving social networking with caching
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Lingering issues in distributed scheduling
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
IEEE/ACM Transactions on Networking (TON)
On the efficiency of CSMA-CA scheduling in wireless multihop networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.24 |
A major challenge in the design of wireless networks is the need for distributed scheduling algorithms that will efficiently share the common spectrum. Recently, a few distributed algorithms for networks in which a node can converse with at most a single neighbor at a time have been presented. These algorithms guarantee 50% of the maximum possible throughput. We present the first distributed scheduling framework that guarantees maximum throughput. It is based on a combination of a distributed matching algorithm and an algorithm that compares and merges successive matching solutions. The comparison can be done by a deterministic algorithm or by randomized gossip algorithms. In the latter case, the comparison may be inaccurate. Yet, we show that if the matching and gossip algorithms satisfy simple conditions related to their performance and to the inaccuracy of the comparison (respectively), the framework attains the desired throughput.It is shown that the complexities of our algorithms, that achieve nearly 100% throughput, are comparable to those of the algorithms that achieve 50% throughput. Finally, we discuss extensions to general interference models. Even for such models, the framework provides a simple distributed throughput optimal algorithm.