Skip to main navigation Skip to search Skip to main content

Minimum-latency broadcast scheduling in wireless ad hoc networks

Scott C.-H. Huang, Peng-Jun Wan, Xiaohua Jia, Hongwei Du, Weiping Shang

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

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. © 2007 IEEE.
Original languageEnglish
Title of host publicationProceedings - IEEE INFOCOM
Pages733-739
DOIs
Publication statusPublished - 2007
EventIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications - Anchorage, AK, United States
Duration: 6 May 200712 May 2007

Publication series

Name
ISSN (Print)0743-166X

Conference

ConferenceIEEE INFOCOM 2007: 26th IEEE International Conference on Computer Communications
PlaceUnited States
CityAnchorage, AK
Period6/05/0712/05/07

Fingerprint

Dive into the research topics of 'Minimum-latency broadcast scheduling in wireless ad hoc networks'. Together they form a unique fingerprint.

Cite this