Localized Scheduling for Practical and Optimal Capacity Utilization in Large Wireless Networks

Given many known results on wireless network capacity, practical and optimal capacity utilization remains an open question. The existing link scheduling schemes in the literature are not applicable in large wireless networks because of their global operations for topology collection and transmission synchronization. As network size increases, global operations become infeasible to implement. We propose in this paper a localized link scheduling solution for achieving order optimal network capacity. Our method eliminates the global operations and improves significantly the practicality of scheduling implementation. As the cost, localized scheduling reduces the network capacity utilization. However, we prove that the reduction can be bounded by a constant factor. From the scaling order point of view, we hence provide a practical scheduling approach to optimize the network utilization.

[1]  Xiang-Yang Li,et al.  Efficient interference-aware TDMA link scheduling for static wireless networks , 2006, MobiCom '06.

[2]  Roger Wattenhofer,et al.  Topology control meets SINR: the scheduling complexity of arbitrary topologies , 2006, MobiHoc '06.

[3]  Alireza Keshavarz-Haddad,et al.  Broadcast capacity in multihop wireless networks , 2006, MobiCom '06.

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

[5]  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..

[6]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[7]  Roger Wattenhofer,et al.  Complexity in geometric SINR , 2007, MobiHoc '07.

[8]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[9]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2006, MobiCom '06.

[10]  R. Srikant,et al.  The multicast capacity of large multihop wireless networks , 2010, TNET.

[11]  Prasanna Chaporkar,et al.  Throughput Guarantees Through Maximal Scheduling in Wireless Networks , 2008 .

[12]  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.

[13]  Paolo Santi,et al.  Computationally efficient scheduling with the physical interference model for throughput improvement in wireless mesh networks , 2006, MobiCom '06.

[14]  Shaojie Tang,et al.  Multicast capacity for large scale wireless ad hoc networks , 2007, MobiCom '07.

[15]  Rong Zheng,et al.  Information Dissemination in Power-Constrained Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[17]  Hongqiang Zhai,et al.  An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks , 2008, MobiHoc '08.