Optimization-Based Design of Wireless Link Scheduling With Physical Interference Model

We address the link-scheduling problem in wireless multihop networks under the realistic physical interference model. Different from most works, which adopt the protocol interference model that treats the pairwise interference, we use the physical interference model to reflect the aggregated signal-to-interference-plus-noise ratio (SINR), which is a more accurate abstraction of the real scenarios. We first propose a centralized scheduling method based on the integer linear programming (ILP) and get an approximate solution by relaxing it to linear programming (LP). The probability bound of getting the guaranteed approximate factor is given, which is distinguished from other LP-based algorithms. Then, for the cases where the required global information is hard to get, a distributed scheduling algorithm is proposed. We simplify the formulation of the scheduling problem in the distributed scenarios and calculate the optimal solution as the transmission probability. This method can be implemented on each node through the Jacobi algorithm, only relying on local channel information. Simulation results show that it converges fast to the optimal solution and provides good throughput performance comparable with the centralized algorithm.

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

[2]  Vasilis Friderikos,et al.  Non-Independent Randomized Rounding for Link Scheduling in Wireless Mesh Networks , 2006, IEEE Vehicular Technology Conference.

[3]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[4]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

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

[6]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[7]  Catherine Rosenberg,et al.  What is the right model for wireless channel interference? , 2006, IEEE Transactions on Wireless Communications.

[8]  Koushik Kar,et al.  Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks , 2008, IEEE Transactions on Information Theory.

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

[10]  Leonard Kleinrock,et al.  Spatial TDMA: A Collision-Free Multihop Channel Access Protocol , 1985, IEEE Trans. Commun..

[11]  Bruce E. Hajek,et al.  Link scheduling in polynomial time , 1988, IEEE Trans. Inf. Theory.

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

[13]  Samir Ranjan Das,et al.  A measurement study of interference modeling and scheduling in low-power wireless networks , 2008, SenSys '08.

[14]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[15]  Gustavo de Veciana,et al.  MAC Scheduling With Low Overheads by Learning Neighborhood Contention Patterns , 2010, IEEE/ACM Transactions on Networking.

[16]  Aravind Srinivasan,et al.  Cross-layer latency minimization in wireless networks with SINR constraints , 2007, MobiHoc '07.

[17]  Roger Wattenhofer,et al.  How Optimal are Wireless Scheduling Protocols? , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[18]  Gustavo de Veciana,et al.  On Optimal MAC Scheduling With Physical Interference , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[19]  Aravind Srinivasan,et al.  Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[20]  Roger Wattenhofer,et al.  Capacity of Arbitrary Wireless Networks , 2009, IEEE INFOCOM 2009.

[21]  Paolo Santi,et al.  Approximation Algorithms for Wireless Link Scheduling With SINR-Based Interference , 2010, IEEE/ACM Transactions on Networking.

[22]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[23]  Yung Yi,et al.  Learning contention patterns and adapting to load/topology changes in a MAC scheduling algorithm , 2006, 2006 2nd IEEE Workshop on Wireless Mesh Networks.

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

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

[26]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

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

[28]  Roger Wattenhofer,et al.  Coloring unstructured radio networks , 2005, SPAA '05.

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

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

[31]  Izhak Rubin,et al.  Optimum Integrated Link Scheduling and Power Control for Multihop Wireless Networks , 2007, IEEE Transactions on Vehicular Technology.

[32]  Christian Scheideler,et al.  An O(log n) dominating set protocol for wireless ad-hoc networks under the physical interference model , 2008, MobiHoc '08.

[33]  Vincent W. S. Wong,et al.  Optimal SINR-based Random Access , 2010, 2010 Proceedings IEEE INFOCOM.

[34]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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

[37]  Aravind Srinivasan,et al.  End-to-end packet-scheduling in wireless ad-hoc networks , 2004, SODA '04.

[38]  Di Yuan,et al.  Throughput of optimal spatial reuse TDMA for wireless ad-hoc networks , 2004, 2004 IEEE 59th Vehicular Technology Conference. VTC 2004-Spring (IEEE Cat. No.04CH37514).

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

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

[41]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .