An efficient approximation for minimum latency broadcast in multi-channel multi-hop wireless networks

Authors:
Shan Shan;Wei Wang;Hongjie Du;Xiaofeng Gao;Weili Wu
Affiliations:
Dept. of Computer Science, Univ. of Texas at Dallas, Richardson, TX;Dept. of Mathematics, Xi'an JiaoTong Univ., P.R. China;Dept. of Computer Science, Univ. of Texas at Dallas, Richardson, TX;Dept. of Computer Science, Univ. of Texas at Dallas, Richardson, TX;Dept. of Computer Science, Univ. of Texas at Dallas, Richardson, TX
Venue:
IEEE Communications Letters
Year:
2010

Citing 3
Cited 0

Minimizing broadcast latency and redundancy in ad hoc networks

Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
An approximation algorithm for conflict-aware broadcast scheduling in wireless ad hoc networks

Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Low-Latency Broadcast in Multirate Wireless Mesh Networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss the minimum latency broadcast problem (MLB) in multi-channel multi-hop wireless networks (MLB-MC). This problem is NP-hard since its special version, MLB in single-channel network (MLB-SC) is proved to be NP-hard [1]. We design an efficient approximation for MLB-MC, analyze its approximation ratio, and evaluate its performance via numerical experiments. Furthermore, we give a general theorem as an upper bound to compare the performance between approximations for MLB-MC and MLB-SC.