A simple improved distributed algorithm for minimum CDS in unit disk graphs

Stefan Funke, Alexander Kesselman, Ulrich Meyer, Michael Segal

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    13 Scopus citations

    Abstract

    Several routing schemes in ad hoc networks first establish a virtual backbone and then route messages via backbone nodes. One common way of constructing such a backbone is based on the construction of a minimum connected dominating set (CDS). In this paper we present a very simple distributed algorithm for computing a small CDS. Our algorithm has an approximation factor of at most 6.91, improving upon the previous best known approximation factor of 8 due to Wan et al. [INFOCOM'02]. The improvement relies on a refined analysis of the relationship between the size of a maximal independent set and a minimum CDS in a unit disk graph. This subresult also implies improved approximation factors for many existing algorithm.

    Original languageEnglish
    Title of host publication2005 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2005
    Pages220-223
    Number of pages4
    DOIs
    StatePublished - 1 Dec 2005
    Event2005 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2005 - Montreal, QC, Canada
    Duration: 22 Aug 200524 Aug 2005

    Publication series

    Name2005 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2005
    Volume2

    Conference

    Conference2005 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications, WiMob'2005
    Country/TerritoryCanada
    CityMontreal, QC
    Period22/08/0524/08/05

    ASJC Scopus subject areas

    • General Engineering

    Fingerprint

    Dive into the research topics of 'A simple improved distributed algorithm for minimum CDS in unit disk graphs'. Together they form a unique fingerprint.

    Cite this