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

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Volumn , Issue , 2008, Pages 331-340

  Mahjourian, Reza ^a   Thai, My ^a   Chen, Feng ^a   Zhai, Hongqiang ^b   Tiwari, Ravi ^a   Fang, Yuguang ^a  

^a UNIVERSITY OF FLORIDA   (United States)

^b PHILIPS RESEARCH LABORATORIES   (Netherlands)

Author keywords

Approximation algorithm; Broadcast scheduling; Conflict aware; Wireless networks

Indexed keywords

BROADCAST SCHEDULES; BROADCAST SCHEDULING; CARRIER SENSING; CONFLICT-AWARE; CONSTANT APPROXIMATION ALGORITHMS; FUNDAMENTAL PROBLEMS; INTERFERENCE RANGES; NETWORK MODELS; PARALLEL TRANSMISSIONS; TRANSMISSION RANGES; WIRELESS AD HOC NETWORKS;

APPROXIMATION ALGORITHMS; BROADCASTING; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC ALGORITHMS; POLYNOMIAL APPROXIMATION; SCHEDULING; SCHEDULING ALGORITHMS; TELECOMMUNICATION NETWORKS; TRANSMISSIONS; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC NETWORKS;

EID: 57349125628     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1374618.1374663     Document Type: Conference Paper

References (13)

1. Z. Chen, C. Qiao, J. Xu, and T. Lee. A constant approximation algorithm for interference aware broadcast in wireless networks. In INFOCOM, pages 740-748, 2007.
2. I. Chlamtac and S. Kutten. On broadcasting in radio networks - Problem analysis and protocol design. IEEE Transactions on Communications, 33:1240-1246, dec 1985.
3. I. Chlamtac and S. Kutten. Tree-based broadcasting in multihop radio networks. IEEE Transactions on Computers, C-36(10): 1209-1223, 1987.
4. B. N. Clark, C. J. Colbourn, and D. S. Johnson. Unit disk graphs. Discrete Mathematics, 86(1-3): 165-177, December 1990.
5. J. Deng, B. Liang, and P. Varshney. Tuning the carrier sensing range of ieee 802.11 mac. In GLOBECOM, pages 2987-2991, 2004.
6. R. Gandhi, S. Parthasarathy, and A. Mishra. Minimizing broadcast latency and redundancy in ad hoc networks. In MobiHoc '03: Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, pages 222-232, 2003.
7. L. Gasieniec, D. Peleg, and Q. Xin. Faster communication in known topology radio networks. In PODC '05: Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing, pages 129-137, 2005.
8. C. Ho, K. Obraczka, G. Tsudik, and K. Viswanath. Flooding for reliable multicast in multi-hop ad hoc networks. In Proceedings of the 3rd Int'l Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pages 64-71, 1999.
9. S. C.-H. Huang, P.-J. Wan, X. Jia, H. Du, and W. Shang. Minimum-latency broadcast scheduling in wireless ad hoc networks. In INFOCOM, pages 733-739, 2007.
10. J. Jercheva, Y. Hu, D. Maltz, and D. Johnson. A simple protocol for multicast and broadcast in mobile ad hoc networks, July 2002.
11. D. W. Matula and L. L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. J. ACM, 30(3):417-427, 1983.
12. S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu. The broadcast storm problem in a mobile ad hoc network. In MobiCom '99, pages 151-162. ACM Press, 1999.
13. X. G. Viennot. A strahler bijection between dyck paths and planar trees. Discrete Math., 246(1-3):317-329, 2002.