How Optimal are Wireless Scheduling Protocols?

In wireless networks mutual interference impairs the quality of received signals and might even prevent the correct reception of messages. It is therefore of paramount importance to dispose of power control and scheduling algorithms, coordinating the transmission of communication requests. We propose a new measure disturbance in order to comprise the intrinsic difficulty of finding a short schedule for a problem instance. Previously known approaches suffer from extremely bad performance in certain network scenarios even if disturbance is low. To overcome this problem, we present a novel scheduling algorithm for which we give analytical worst-case guarantees on its performance. Compared to previously known solutions, the algorithm achieves a speed up, which can be exponential in the size of the network.

[1]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[2]  Jens Zander,et al.  Performance of optimum transmitter power control in cellular radio systems , 1992 .

[3]  Jens Zander,et al.  Distributed cochannel interference control in cellular radio systems , 1992 .

[4]  Gerard J. Foschini,et al.  A simple distributed autonomous power control algorithm and its convergence , 1993 .

[5]  David J. Goodman,et al.  Distributed power control in cellular radio systems , 1994, IEEE Trans. Commun..

[6]  Tsern-Huei Lee,et al.  Downlink power control algorithms for cellular radio systems , 1995 .

[7]  S. Papavassiliou,et al.  Joint optimal channel base station and power assignment for wireless access , 1996, TNET.

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

[9]  Anders Hansson,et al.  Comparison between graph-based and interference-based STDMA scheduling , 2001, MobiHoc '01.

[10]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Izhak Rubin,et al.  On the performance of graph-based scheduling algorithms for packet radio networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

[12]  Rate performance objectives of multihop wireless networks , 2004, IEEE Transactions on Mobile Computing.

[13]  Jean-Yves Le Boudec,et al.  Rate performance objectives of multihop wireless networks , 2004, IEEE INFOCOM 2004.

[14]  Tamer A. ElBatt,et al.  Joint scheduling and power control for wireless ad hoc networks , 2002, IEEE Transactions on Wireless Communications.

[15]  Di Yuan,et al.  A column generation method for spatial TDMA scheduling in ad hoc networks , 2004, Ad Hoc Networks.

[16]  J. Boudec,et al.  Optimal power control, scheduling, and routing in UWB networks , 2004, IEEE Journal on Selected Areas in Communications.

[17]  Ramesh R. Rao,et al.  A Joint Solution to Scheduling and Power Control for Multicasting in Wireless Ad Hoc Networks , 2005, EURASIP J. Adv. Signal Process..

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

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

[20]  Roger Wattenhofer,et al.  The Complexity of Connectivity in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[21]  Roger Wattenhofer,et al.  Protocol Design Beyond Graph-Based Models , 2006, HotNets.