Routing-Cost Constrained CDS

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 7 in Connected Dominating Set: Theory and Applications, 2013, pp 119-131 from Springer

Abstract: Abstract Consider a graph as shown in Fig. 7.1. C = { 4, 5, 6} is a minimum CDS. G = (V, E). The minimum routing between nodes 1 and 3 not through C is 1-2-3 and through D is 1-4-5-6-2, which is significantly longer than 1-2-3. This example indicates a problem about CDS that while CDS is introduced to save resources in wireless networks, routing cost and communication delay may be increased.

Keywords: Minimal Routing; Routing Cost; Communication Delay; Unit Disk Graph; Polynomial-time Constant-approximation (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_7

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

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

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 ().