### Abstract

To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, ^{mD}(u,v)≤α·m(u,v) where α is a constant, ^{mD}(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for α<5, this problem has a polynomial-time approximation scheme, that is, for any ε>0, there is a polynomial-time (1+ε)- approximation.

Original language | English |
---|---|

Pages (from-to) | 38-43 |

Number of pages | 6 |

Journal | Theoretical Computer Science |

Volume | 447 |

DOIs | |

Publication status | Published - 2012 Aug 17 |

### Fingerprint

### Keywords

- Minimum connected dominating set
- Polynomial-time approximation
- Routing cost constraint
- Wireless sensor networks

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Theoretical Computer Science*,

*447*, 38-43. https://doi.org/10.1016/j.tcs.2011.10.010

**Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks.** / Du, Hongwei; Ye, Qiang; Zhong, Jiaofei; Wang, Yuexuan; Lee, Wonjun; Park, Haesun.

Research output: Contribution to journal › Article

*Theoretical Computer Science*, vol. 447, pp. 38-43. https://doi.org/10.1016/j.tcs.2011.10.010

}

TY - JOUR

T1 - Polynomial-time approximation scheme for minimum connected dominating set under routing cost constraint in wireless sensor networks

AU - Du, Hongwei

AU - Ye, Qiang

AU - Zhong, Jiaofei

AU - Wang, Yuexuan

AU - Lee, Wonjun

AU - Park, Haesun

PY - 2012/8/17

Y1 - 2012/8/17

N2 - To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, mD(u,v)≤α·m(u,v) where α is a constant, mD(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for α<5, this problem has a polynomial-time approximation scheme, that is, for any ε>0, there is a polynomial-time (1+ε)- approximation.

AB - To reduce routing cost in wireless sensor networks, we study a problem of minimizing the size of connected dominating set D under constraint that for any two nodes u and v, mD(u,v)≤α·m(u,v) where α is a constant, mD(u,v) is the number of intermediate nodes on a shortest path connecting u and v through D and m(u,v) is the number of intermediate nodes in a shortest path between u and v in a given unit disk graph. We show that for α<5, this problem has a polynomial-time approximation scheme, that is, for any ε>0, there is a polynomial-time (1+ε)- approximation.

KW - Minimum connected dominating set

KW - Polynomial-time approximation

KW - Routing cost constraint

KW - Wireless sensor networks

UR - http://www.scopus.com/inward/record.url?scp=84863324941&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84863324941&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2011.10.010

DO - 10.1016/j.tcs.2011.10.010

M3 - Article

VL - 447

SP - 38

EP - 43

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

ER -