A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks
2009
Acta Mathematicae Applicatae Sinica (English Series)
A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. One of the key communication operations is to broadcast a message from a source node. This paper studies the minimum latency broadcast scheduling problem in wireless ad hoc networks under collision-free transmission model. The previously best known algorithm for this NP-hard problem produces a broadcast schedule whose latency is at least 648(rmax/r min ) 2
doi:10.1007/s10255-008-8806-2
fatcat:5epdezog5fcxxmpkl5o6ju7iga