CDS in Unit Disk Graph

Ding-Zhu Du and Peng-Jun Wan
Additional contact information
Ding-Zhu Du: University of Texas, Dallas
Peng-Jun Wan: Illinois Institute of Technology

Chapter Chapter 3 in Connected Dominating Set: Theory and Applications, 2013, pp 35-62 from Springer

Abstract: 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.

Keywords: Wireless Sensor Network; Induction Hypothesis; Simplicial Complex; Neighborhood Area; Euclidean Plane (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-5242-3_3

Ordering information: This item can be ordered from
http://www.springer.com/9781461452423

DOI: 10.1007/978-1-4614-5242-3_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().