A Simple Greedy Algorithm for Link Scheduling with the Physical Interference Model

In wireless networks, mutual interference prevents wireless devices from correctly receiving packages from others and becomes one of the challenges in the design of protocols for wireless networks. Spatial-reuse Time Division Multiple Access (STDMA) has been used to cope with this problem. In this scheme, links are assigned to several time slots and in each slot all the links can transmit simultaneously. In this paper, we propose a greedy link scheduling algorithm to find a short schedule for a problem instance in the physical interference model. Our scheduling algorithm is inspired by the k-MAX-CUT algorithm in [13]. Experimental results show that our greedy algorithm can give a better schedule compared with the greedy algorithm in [3], with an improvement about 20%-30% when the density of links is high.

[1]  Xiang-Yang Li,et al.  Efficient Algorithms for p-Self-Protection Problem in Static Wireless Sensor Networks , 2008, IEEE Transactions on Parallel and Distributed Systems.

[2]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..

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

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

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

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

[7]  Randeep Bhatia,et al.  Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2005, IEEE Journal on Selected Areas in Communications.

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

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

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

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

[12]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

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

[16]  Randeep Bhatia,et al.  Joint Channel Assignment and Routing for Throughput Optimization in Multiradio Wireless Mesh Networks , 2006, IEEE J. Sel. Areas Commun..

[17]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[18]  Aravind Srinivasan,et al.  Algorithmic aspects of capacity in wireless networks , 2005, SIGMETRICS '05.

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

[20]  Peter Brucker,et al.  On the Complexity of Scheduling , 2009, Introduction to Scheduling.

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