By Topic

Broadcast Scheduling in Interference Environment

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Huang, S.C.-H. ; Dept. of Comput. Sci., City Univ. of Hong Kong, Hong Kong ; Peng-Jun Wan ; Jing Deng ; Han, Y.S.

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.

Published in:

Mobile Computing, IEEE Transactions on  (Volume:7 ,  Issue: 11 )