1. On Connected Multiple Point Coverage in WSN Feb 20, 2008 Presented by Chinh Vu by S. Yang, F. Dai, M. Cardei, J. Wu, F. Patterson

2. Introduction of k-CS/k-CCS k- (Connected) Coverage Set - k-CCS problem: Given k> 0 and an undirected graph G = (V;E) find a subset of nodes C  V st: (1)each node in V is dominated (covered) by at least k different nodes in C (2)the number of nodes in C is minimized (3)the nodes in C are connected.

3. Introduction of k-CS/k-CCS (Cont’d) K-CS and k-CCS are extensions of DS and CDS, respectively Both of them are NP-complete

4. Formulization

5. Centralized algorithm

7. Analysis

8. Proof

9. Quasi-local algorithm

10. Analysis

11. Analysis (Cont’d)

12. Questions??? 1.What is difference b/n k-CS and k- CCS 2.What is different b/n CS problem and tradition target coverage? 3.In LPA, why do we need relaxation? 4.In CKA, why Quasi? 5.In CKA k-CCS, why do we need set D? 6.Relate C i to DS?