Broadcast Scheduling in Interference Environment

Authors:
Scott C. -H. Huang;Peng-Jun Wan;Jing Deng;Yunghsiang S. Han
Affiliations:
City Univ of Hong Kong, Kowloon Tong;City Univ of Hong Kong, Kowloon Tong;City Univ of Hong Kong, Kowloon Tong;City Univ of Hong Kong, Kowloon Tong
Venue:
IEEE Transactions on Mobile Computing
Year:
2008

Citing 0
Cited 9

Data Collection with Multiple Sinks in Wireless Sensor Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
On Approximation Algorithms for Interference-Aware Broadcast Scheduling in 2D and 3D Wireless Sensor Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Minimum-Latency Schedulings for Group Communications in Multi-channel Multihop Wireless Networks

WASA '09 Proceedings of the 4th International Conference on Wireless Algorithms, Systems, and Applications
Chorus: collision resolution for efficient wireless broadcast

INFOCOM'10 Proceedings of the 29th conference on Information communications
Interference-aware gossiping scheduling in uncoordinated duty-cycled multi-hop wireless networks

WASA'10 Proceedings of the 5th international conference on Wireless algorithms, systems, and applications
Minimum latency data aggregation in the physical interference model

Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Minimum latency data aggregation in the physical interference model

Computer Communications
On interference-aware gossiping in uncoordinated duty-cycled multi-hop wireless networks

Ad Hoc Networks
Constant-approximation for optimal data aggregation with physical interference

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

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.