Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
DOI10.1007/s10255-008-8806-2zbMath1225.05103OpenAlexW2042839128MaRDI QIDQ2267270
Peng-Jun Wan, Wei-Ping Shang, Xiao-Dong Hu
Publication date: 1 March 2010
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10255-008-8806-2
Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- A lower bound for radio broadcast
- On Broadcasting in Radio Networks--Problem Analysis and Protocol Design
- Centralized broadcast in multihop radio networks
- Logarithmic inapproximability of the radio broadcast problem
- Faster communication in known topology radio networks
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Polylogarithmic Additive Inapproximability of the Radio Broadcast Problem
This page was built for publication: Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks