Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
On the stability of input-queued switches with speed-up
IEEE/ACM Transactions on Networking (TON)
Maximizing throughput in wireless networks via gossiping
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach
Proceedings of the 12th annual international conference on Mobile computing and networking
On the complexity of scheduling in wireless networks
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)
Distributed link scheduling with constant overhead
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Linear time 1/2 -approximation algorithm for maximum weighted matching in general graphs
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
A refined performance characterization of longest-queue-first policy in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
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
Is it enough to drain the heaviest bottlenecks?
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Channel-assignment and scheduling in wireless mesh networks considering switching overhead
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Minimum energy scheduling in multi-hop wireless networks with retransmissions
IEEE Transactions on Wireless 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
Distributed SINR based scheduling algorithm for multi-hop wireless networks
Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems
Cross-layer interactions in multihop wireless sensor networks: A constrained queueing model
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Computer Networks: The International Journal of Computer and Telecommunications Networking
Improved bounds on the throughput efficiency of greedy maximal scheduling in wireless networks
IEEE/ACM Transactions on Networking (TON)
A refined performance characterization of longest-queue-first policy in wireless networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
In recent years, there have been many efforts to develop low-complexity scheduling schemes that can approximate optimal performance in multi-hop wireless networks. A centralized sub-optimal scheduling policy, called Greedy Maximal Scheduling (GMS) is a good candidate because it achieves high throughput. However, its distributed realization requires O(|V|) complexity, which becomes a major obstacle for practical implementation, where |V| is the number of nodes in the network. In this paper, we develop a simple distributed scheduling policy for multi-hop wireless networks. It achieves O(log |V|) complexity by relaxing the global ordering requirement of GMS. Instead, it deterministically schedules only links that have the largest queue length among their local neighbors. We show that, it still guarantees a fraction of the optimal performance, which is no smaller than GMS. We also further improve its performance and address some important implementation issues. The simulation results confirm that the new scheduling scheme achieves the performance equivalent of GMS and significantly outperforms state-of-the-art distributed random access scheduling policies.