Broadcast Scheduling in Interference Environment

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Jing Deng, Assistant Professor (Creator)
The University of North Carolina at Greensboro (UNCG )
Web Site:

Abstract: Broadcast is a fundamental operation in wireless networks, and nai¨ve flooding is not practical, because it cannot deal with interference. Scheduling is a good way of avoiding interference, but previous studies on broadcast scheduling algorithms all assume highly theoretical models such as the unit disk graph model. In this work, we reinvestigate this problem by using the 2-Disk and the signal-to-interference-plus-noise-ratio (SINR) models. We first design a constant approximation algorithm for the 2-Disk model and then extend it to the SINR model. This result, to the best of our knowledge, is the first result on broadcast scheduling algorithms in the SINR model.

Additional Information

IEEE Transactions on Mobile Computing, vol. 7, no. 11, pp. 1338-1348, November 2008.
Language: English
Date: 2008
SINR, Broadcast, TDMA

Email this document to