Distributed Low-Complexity Maximum-Throughput Scheduling for Wireless Backhaul Networks

We introduce a low-complexity distributed slotted MAC protocol that can support all feasible arrival rates in a wireless backhaul network (WBN). For arbitrary wireless networks, such a maximum throughput protocol has been notoriously hard to realize because even if global topology information is available, the problem of computing the optimal link transmission set at each slot is NP-complete. For the logical tree structures induced by WBN traffic matrices, we first introduce a centralized algorithm that solves the optimal scheduling problem in a number of steps at most linear in the number of nodes in the network. This is achieved by discovering and exploiting a novel set of graph-theoretical properties of WBN contention graph. Guided by the centralized algorithm, we design a distributed protocol where, at the beginning of each slot, nodes coordinate and incrementally compute the optimal link transmission set. We then introduce an algorithm to compute the minimum number of steps to complete this computation, thus minimizing the per-slot overhead. Using both analysis and simulations, we show that in practice our protocol yields low overhead when implemented over existing wireless technologies and significantly outperforms existing suboptimal distributed slotted scheduling mechanisms.

[1]  Kameswari Chebrolu,et al.  Design and evaluation of a new MAC protocol for long-distance 802.11 mesh networks , 2005, MobiCom '05.

[2]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-layer rate control in wireless networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[4]  Koushik Kar,et al.  Fairness and Throughput Guarantees with Maximal Scheduling in Multi-hop Wireless Networks , 2006, 2006 4th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks.

[5]  Jaap-Henk Hoepman,et al.  Simple Distributed Weighted Matchings , 2004, ArXiv.

[6]  Lisa Zhang,et al.  Designing Multihop Wireless Backhaul Networks with Delay Guarantees , 2006, INFOCOM.

[7]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[8]  Eytan Modiano,et al.  Enabling distributed throughput maximization in wireless mesh networks: a partitioning approach , 2006, MobiCom '06.

[9]  Leandros Tassiulas,et al.  Distributed dynamic scheduling for end-to-end rate guarantees in wireless ad hoc networks , 2005, MobiHoc '05.

[10]  R. Srikant,et al.  Regulated Maximal Matching: A Distributed Scheduling Algorithm for Multi-Hop Wireless Networks With Node-Exclusive Spectrum Sharing , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[11]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[12]  Devavrat Shah,et al.  Delay bounds for approximate maximum weight matching algorithms for input queued switches , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[13]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[14]  Israel Cidon,et al.  Distributed Assignment Algorithms for Multihop Packet Radio Networks , 1989, IEEE Trans. Computers.

[15]  Brahim Bensaou,et al.  On max-min fairness and scheduling in wireless ad-hoc networks: analytical framework and implementation , 2001, MobiHoc.

[16]  F.C. Harmantzis,et al.  Affordable infrastructure for deploying WiMAX systems: mesh v. non mesh , 2005, 2005 IEEE 61st Vehicular Technology Conference.