@inproceedings{d5239381511b41479a98d7857fe2ab9f,
title = "Minimum-latency broadcast scheduling in wireless ad hoc networks",
abstract = "A wide range of applications for wireless ad hoc networks are time-critical and impose stringent requirement on the communication latency. This paper studies the problem Minimum-Latency Broadcast Scheduling (MLBS) in wireless ad hoc networks represented by unit-disk graphs. This problem is NP-hard. A trivial lower bound on the minimum broadcast latency is the radius R of the network with respect to the source of the broadcast, which is the maximum distance of all the nodes from the source of the broadcast. The previously best-known approximation algorithm for MLBS produces a broadcast schedule with latency at most 648R. In this paper, we present three progressively improved approximation algorithms for MLBS. They produce broadcast schedules with latency at most 24R - 23, 16R - 15, and R +O (log R) respectively.",
author = "Huang, \{Scott C.H.\} and Wan, \{Peng Jun\} and Xiaohua Jia and Hongwei Du and Weiping Shang",
year = "2007",
doi = "10.1109/INFCOM.2007.91",
language = "英语",
isbn = "1424410479",
series = "Proceedings - IEEE INFOCOM",
pages = "733--739",
booktitle = "Proceedings - IEEE INFOCOM 2007",
note = "IEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications ; Conference date: 06-05-2007 Through 12-05-2007",
}