ε-Net Approach to Sensor k-Coverage

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5682 LNCS, Issue , 2009, Pages 104-114

  Fusco, Giordano ^a   Gupta, Himanshu ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BATTERY POWER; K-COVERAGE; NP COMPLETE; OPTIMAL SOLUTIONS; POSITION DETECTION; WIRELESS SENSOR;

FAULT DETECTION; FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; INTRUSION DETECTION; QUALITY ASSURANCE; SENSORS;

APPROXIMATION ALGORITHMS;

EID: 70349328242     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03417-6_11     Document Type: Conference Paper

References (16)

1. Gupta, H., Zhou, Z., Das, S., Gu, Q.: Connected sensor cover: Self-organization of sensor networks for efficient query execution. TON 14(1) (2006) (Pubitemid 43264669)
2. Charkrabarty, K., Iyengar, S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. Transaction on Computers (2002)
3. Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor ad-hoc networks. In: ICC (2001) (Pubitemid 32485785)
4. Meguerdichian, S., Koushanfar, F., Qu, G., Potkonjak, M.: Exposure in wireless ad-hoc sensor networks. In: MobiCom (2001) (Pubitemid 33006711)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to algorithms, 2nd edn. MIT Press/ McGraw-Hill, Cambridge (2001)
6. Br̈onnimann, H., Goodrich, M.T.: Almost optimal set covers in finite vc-dimension. Discrete & Computational Geometry 14(4), 463-479 (1995)
7. Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete & Computational Geometry 2, 127-151 (1987)
8. Hefeeda, M., Bagheri, M.: Randomized k-coverage algorithms for dense sensor networks. In: INFOCOM, pp. 2376-2380 (2007) (Pubitemid 47334484)
9. Ye, F., Zhong, G., Lu, S., Zhang, L.: Peas: A robust energy conserving protocol for long-lived sensor networks. In: ICDCS (2003) (Pubitemid 137636771)
10. Shakkottai, S., Srikant, R., Shroff, N.: Unreliable sensor grids: Coverage, connectivity and diameter. In: INFOCOM (2003)
11. Zhou, Z., Das, S.R., Gupta, H.: Connected k-coverage problem in sensor networks. In: ICCCN, pp. 373-378 (2004) (Pubitemid 40540245)
12. Matou?sek, J., Seidel, R., Welzl, E.: How to net a lot with little: Small ?-nets for disks and halfspaces. In: SCG, pp. 16-22 (1990) (Pubitemid 20728474)
13. O'Rourke, J.: Art Gallery Theorems and Algorithms, vol.3. Oxford University Press, New York (1987)
14. Valtr, P.: Guarding galleries where no point sees a small area. Israel Journal of Mathematics 104, 1-16 (1998) (Pubitemid 128335921)
15. Fusco, G., Gupta, H.: Net approach to sensor k-coverage. Technical report, Stony Brook University (2009), http://www.cs.sunysb.edu/~fusco/ publications.html
16. Fusco, G., Gupta, H.: Selection and orientation of directional sensors for coverage maximization. In: SECON (2009)