### Abstract

Given a requested area, the Minimum Connected Sensor Cover problem is to find a minimum number of sensors such that their communication ranges induce a connected graph and their sensing ranges cover the requested area. Several polynomial-time approximation algorithms have been designed previously in the literature. Their best known performance ratio is O(r lnn) where r is the link radius of the sensor network and n is the number of sensors. In this paper, we will present two polynomial-time approximation algorithms. The first one is a random algorithm, with probability 1-ε, producing an approximation solution with performance ratio O(log^{3} n log log n), independent from r. The second one is a deterministic approximation with performance ratio O(r), independent from n.

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

Title of host publication | Proceedings - IEEE INFOCOM |

Pages | 1187-1194 |

Number of pages | 8 |

DOIs | |

Publication status | Published - 2013 Sep 2 |

Event | 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013 - Turin, Italy Duration: 2013 Apr 14 → 2013 Apr 19 |

### Other

Other | 32nd IEEE Conference on Computer Communications, IEEE INFOCOM 2013 |
---|---|

Country | Italy |

City | Turin |

Period | 13/4/14 → 13/4/19 |

### Fingerprint

### ASJC Scopus subject areas

- Computer Science(all)
- Electrical and Electronic Engineering

### Cite this

*Proceedings - IEEE INFOCOM*(pp. 1187-1194). [6566910] https://doi.org/10.1109/INFCOM.2013.6566910