Scheduling Multicast Transmissions under SINR Constraints

The problem of scheduling wireless transmissions under signal to interference-plus-noise ratio (SINR) constraints has received increasing attention recently. While previous work has considered the unicast case where each transmission has one sender and one receiver, we consider the setting of multicast requests where each transmission has one sender and a set of receivers. A set of multicast transmissions can be scheduled in the same round if the SINR at all receivers is above a certain threshold. The goal is to minimise the number of rounds. Building on the relationship between SINR scheduling and unit disk graph colouring established by Halldorsson (ESA 2009), we present an O(log Γ)-approximation algorithm for multicast scheduling in the SINR model, where Γ is the ratio of the longest to the shortest link length, considering only the longest link of each multicast request. The algorithm uses uniform power assignment and can be implemented online. We also compare the model of atomic multicasts (where all receivers of a multicast must receive the transmission in the same round) to the model of splittable multicasts (where a multicast sender can transmit in several rounds, each time serving a subset of its receivers). Furthermore, we consider the throughput maximisation problem and obtain an O(log Γ)-competitive randomised online algorithm and show that every deterministic algorithm, even for unicast links and using arbitrary power assignments, has competitive ratio Ω(log Γ).

[1]  Paolo Santi,et al.  Latency and Capacity Optimal Broadcasting in Wireless Multihop Networks , 2009, 2009 IEEE International Conference on Communications.

[2]  Amos Fiat,et al.  Algorithms - ESA 2009 , 2009, Lecture Notes in Computer Science.

[3]  Martin Hoefer,et al.  Online capacity maximization in wireless networks , 2010, SPAA '10.

[4]  Berthold Vöcking,et al.  Oblivious interference scheduling , 2009, PODC '09.

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

[6]  Magnús M. Halldórsson.  Wireless Scheduling with Power Control , 2009, ESA.

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

[8]  Chen Avin,et al.  On the Power of Uniform Power: Capacity of Wireless Networks with Bounded Resources , 2009, ESA.

[9]  Harry B. Hunt,et al.  Simple heuristics for unit disk graphs , 1995, Networks.

[10]  T. Moscibroda,et al.  The Worst-Case Capacity of Wireless Sensor Networks , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.

[11]  Roger Wattenhofer,et al.  Wireless Communication Is in APX , 2009, ICALP.

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

[13]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[14]  Michael Dinitz,et al.  Maximizing Capacity in Arbitrary Wireless Networks in the SINR Model: Complexity and Game Theory , 2009, IEEE INFOCOM 2009.

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

[16]  Berthold Vöcking,et al.  Improved algorithms for latency minimization in wireless networks , 2009, Theor. Comput. Sci..

[17]  Roger Wattenhofer,et al.  Local broadcasting in the physical interference model , 2008, DIALM-POMC '08.