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 probability of scheduling conflict-free transmissions, and thereby improve the reliability of the broadcast schedule. We present and prove correctness of a constant approximation algorithm for minimum-latency broadcast scheduling under this network model. We also present a greedy heuristic algorithm for the same problem. Experimental results are provided to evaluate the performance of our algorithms. In addition, the algorithms are analyzed to justify their performance trends.

[1]  Chunming Qiao,et al.  A Constant Approximation Algorithm for Interference Aware Broadcast in Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[2]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[3]  Imrich Chlamtac,et al.  Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.

[4]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[5]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[6]  Dave Maltz,et al.  A Simple Protocol for Multicast and Broadcast in Mobile Ad Hoc Networks , 2001 .

[7]  Pramod K. Varshney,et al.  Tuning the carrier sensing range of IEEE 802.11 MAC , 2004, IEEE Global Telecommunications Conference, 2004. GLOBECOM '04..

[8]  Xavier Gérard Viennot.  A Strahler bijection between Dyck paths and planar trees , 2002, Discret. Math..

[9]  David Peleg,et al.  Faster communication in known topology radio networks , 2005, PODC '05.

[10]  Srinivasan Parthasarathy,et al.  Minimizing broadcast latency and redundancy in ad hoc networks , 2008, TNET.

[11]  Leland L. Beck,et al.  Smallest-last ordering and clustering and graph coloring algorithms , 1983, JACM.

[12]  Gene Tsudik,et al.  Flooding for reliable multicast in multi-hop ad hoc networks , 1999, DIALM '99.

[13]  Xiaohua Jia,et al.  Minimum-Latency Broadcast Scheduling in Wireless Ad Hoc Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.