The Community for Technology Leaders
Green Image
Issue No. 11 - November (2008 vol. 7)
ISSN: 1536-1233
pp: 1338-1348
Peng-Jun Wan , City Univ of Hong Kong, Kowloon Tong
Jing Deng , City Univ of Hong Kong, Kowloon Tong
Scott C.-H. Huang , City Univ of Hong Kong, Kowloon Tong
Yunghsiang S. Han , City Univ of Hong Kong, Kowloon Tong
ABSTRACT
Broadcast is a fundamental operation in wireless networks and naive flooding is not practical because it cannot deal with interference. Scheduling is a good way to avoid interference, but previous studies on broadcast scheduling algorithms all assume highly theoretical models such as the unit disk graph model. In this work, we re-investigate this problem using the 2-Disk and the signal-to-interference-plus-noise-ratio (SINR) model to realize it. We first design a constant approximation algorithm for the 2-Disk model and then extend it to the SINR model. This result is the first result on broadcast scheduling algorithms in SINR model, to the best of our knowledge.
INDEX TERMS
Algorithm/protocol design and analysis, Data communications
CITATION
Peng-Jun Wan, Jing Deng, Scott C.-H. Huang, Yunghsiang S. Han, "Broadcast Scheduling in Interference Environment", IEEE Transactions on Mobile Computing, vol. 7, no. , pp. 1338-1348, November 2008, doi:10.1109/TMC.2008.56
93 ms
(Ver 3.3 (11022016))