Randomized k-coverage algorithms for dense sensor networks

Proceedings - IEEE INFOCOM

Volumn , Issue , 2007, Pages 2376-2380

  Hefeeda, Mohamed ^a   Bagheri, Majid ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ENERGY EFFICIENCY; PARALLEL ALGORITHMS; PROBLEM SOLVING; RANDOM PROCESSES; SENSOR NETWORKS;

LOGARITHMIC FACTORS; MESSAGE COMPLEXITY;

APPROXIMATION ALGORITHMS;

EID: 34548297823     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INFCOM.2007.284     Document Type: Conference Paper

References (12)

1. D. Mehta, M. Lopez, and L. Lin, "Optimal coverage paths in adhoc sensor networks," in Proc. of IEEE International Conference on Communications (ICC'03), May 2003.
2. S. Kumar, T. H. Lai, and J. Balogh, "On k-coverage in a mostly sleeping sensor network," in Proc. of ACM International Conference on Mobile Computing and Networking (MOBICOM'04), Philadelphia, PA, September 2004, pp. 144-158.
3. D. Hall and J. Llinas, Handbook of Multisensor Data Fusion. CRC Press, 2001.
4. S. Yang, F. Dai, M. Cardei, and J. Wu, "On connected multiple point coverage in wireless sensor networks," Journal of Wireless Information Networks, May 2006.
5. R. Iyengar, K. Kar, and S. Banerjee, "Low-coordination topologies for redundancy in sensor networks," in Proc. of ACM Mobihoc'05, Urbana-Champaign, IL, May 2005.
6. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W H. Freeman, 1979.
7. H. Bronnimann and M. Goodrich, "Almost optimal set covers in finite VC-dimension," Discrete and Computational Geometry, vol. 14, no. 4, April 1995.
8. Z. Zhou, S. Das, and H. Gupta, "Connected k-coverage problem in sensor networks," in Proc. of International Conference on Computer Communications and Networks (ICCCN'04), Chicago, IL, October 2004.
9. D. Haussler and E. Welzl, "Epsilon-nets and simplex range queries," Discrete and Computational Geometry, vol. 2, no. 1, December 1987.
10. M. Hefeeda and M. Bagheri, "Efficient k-coverage algorithms for wireless sensor networks," School of Computing Science, Simon Fraser University, Tech. Rep. TR 2006-22, September 2006.
11. A. So and Y. Ye, "On solving coverage problems in a wireless sensor network using voronoi diagrams," in Proc. of Workshop on Internet and Network Economics (WINE'05), Hong Kong, December 2005.
12. J. Matousek, R. Seidel, and E. Welzl, "How to net a lot with little: Small e-nets for disks and halfspaces," in Proc. of the 6th Annual ACM Symposium on Computational Geometry (SoCG'90), Berkeley, CA, June 1990.