IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-1-4614-5242-3_3.html
   My bibliography  Save this book chapter

CDS in Unit Disk Graph

In: Connected Dominating Set: Theory and Applications

Author

Listed:
  • Ding-Zhu Du

    (University of Texas, Dallas)

  • Peng-Jun Wan

    (Illinois Institute of Technology)

Abstract

A unit disk is a disk with diameter one. Denote by disk r (o) the disk with center o and radius r. A graph G = (V, E) is called a unit disk graph if it can be embedded into the Euclidean plane such that an edge between two nodes u and v exists if and only if disk0. 5(u) ∩ disk0. 5(v)≠∅, that is, their Euclidean distance d(u, v) ≤ 1. The unit disk graph is a mathematical model for wireless sensor networks when all sensors have the same communication radius.

Suggested Citation

  • Ding-Zhu Du & Peng-Jun Wan, 2013. "CDS in Unit Disk Graph," Springer Optimization and Its Applications, in: Connected Dominating Set: Theory and Applications, edition 127, chapter 0, pages 35-62, Springer.
    • Handle: RePEc:spr:spochp:978-1-4614-5242-3_3
    DOI: 10.1007/978-1-4614-5242-3_3
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:spochp:978-1-4614-5242-3_3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.