Sciweavers

Share
MOBIHOC
2008
ACM

An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks

9 years 9 months ago
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks
Broadcast scheduling is a fundamental problem in wireless ad hoc networks. The objective of a broadcast schedule is to deliver a message from a given source to all other nodes in a minimum amount of time. At the same time, in order for the broadcast to proceed as predicted in the schedule, it must not contain parallel transmissions which can be conflicting based on the collision and interference parameters in the wireless network. Most existing work on this problem use a limited network model which accounts only for conflicts occurring inside the transmission ranges of the nodes. The broadcast schedules produced by these algorithms are likely to experience unpredictable delays when deployed in the network. This is because they do not take into consideration other important sources of conflict in parallel transmissions, namely the interference range and the carrier sensing range. In this paper we develop a conflict-aware network model, which uses these parameters to increase the probab...
Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Tha
Added 24 Dec 2009
Updated 24 Dec 2009
Type Conference
Year 2008
Where MOBIHOC
Authors Reza Mahjourian, Feng Chen, Ravi Tiwari, My T. Thai, Hongqiang Zhai, Yuguang Fang
Comments (0)
books