A distributed algorithm to approximate node-weighted minimum α-connected (θ,k)-coverage in dense sensor networks

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

Volumn 5059 LNCS, Issue , 2008, Pages 221-232

  Wu, Yongan ^a   Li, Min ^a   Cai, Zhiping ^a   Zhu, En ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

connectivity; ( and k) coverage; Dense sensor networks; Probabilistic model

Indexed keywords

BOOLEAN FUNCTIONS; COMMUNICATION; DETECTORS; INFORMATION THEORY; NEODYMIUM; NUCLEAR PROPULSION; PARALLEL ALGORITHMS; PROBABILITY; SENSORS; TELECOMMUNICATION NETWORKS; WIRELESS SENSOR NETWORKS; WIRELESS TELECOMMUNICATION SYSTEMS;

(PL) PROPERTIES; ALGORITHMICS; CHEBYSHEV; COMMUNICATION COMPLEXITIES; COMMUNICATION MODELS; CONNECTIVITY MAINTENANCE; DEGREE OF COVERAGE (DOC); DENSE SENSOR NETWORKS; DETERMINISTIC MODELING; DISTRIBUTED ALGORITHMS; ENERGY CONSTRAINTS; HEIDELBERG (CO); IN ORDER; INTERNATIONAL (CO); K-COVERAGE; NETWORK LIFE-TIME; NP-HARD; PROBABILISTIC COVERAGE; PROBABILISTIC MODEL (PM); REAL POWER; SIMULATION RESULTS; SPRINGER (CO);

SENSOR NETWORKS;

EID: 45849136377     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69311-6_24     Document Type: Conference Paper

References (19)

1. Estrin, D., Govindan, R., Heidemann, J., Kumar, S.: Next century challenges: Scalable co-ordination in sensor networks. In: 5th ACM International Conference on Mobile Computing and Networking (MOBICOM 1999), pp. 263-270. ACM Press, Seattle (1999)
2. Cerpa, A., Elson, J., Hamilton, M., Zhao, J., Estrin, D., Girod, L.: Habitat monitoring: Application driver for wireless communications technology. In: Proc. of ACM SIGCOMM Workshop on Data Communications in Latin America and the Caribbean, pp. 3-5. ACM Press, Costa Rica (2001)
3. Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: A survey. Computer Networks 38(4), 393-422 (2002)
4. Yang, S., Dai, F., Cardei, M., Wu, J., Patterson, F.: On connected multiple point coverage in wireless sensor networks. Journal of Wireless Information Networks 13(4), 289-301 (2006)
5. Hekmat, R., Van Mieghem, P.: Connectivity in wireless ad-hoc networks with a log-normal radio model. Mobile Networks and Applications 11(3), 351-360 (2006)
6. Hefeeda, M., Ahmadi, H.: A probabilistic coverage protocol for wireless sensor networks. In: 15th IEEE International Conference on Network Protocols (ICNP 2007), pp. 41-50. IEEE Press, Beijing (2007)
7. Hefeeda, M., Bagheri, M.: Randomized k-coverage algorithms for dense sensor networks. In: 26th IEEE International Conference on Computer Communications (INFOCOM 2007), pp. 2376-2380. IEEE Press, Anchorage (2007)
8. Chakrabarty, K., Iyengar, S., Qi, H., Cho, E.: Grid coverage for surveillance and target location in distributed sensor networks. IEEE Transactions on Computers 51(12), 1448-1453 (2002)
9. Huang, C., Tseng, Y.: The coverage problem in a wireless sensor network. In: 2nd ACM International Conference on Wireless Sensor Networks and Applications (WSNA 2003), pp. 115-121. ACM Press, San Diego (2003)
10. Zhou, Z., Das, S., Gupta, H.: Connected k-coverage problem in sensor networks. In: 13th International Conference on Computer Communications and Networks (ICCCN 2004), pp. 373-378. IEEE Press, Chicago (2004)
11. Wu, J., Dai, F.: On constructing k-connected k-dominating set in wireless networks. In: 19th International Parallel and Distributed Processing Symposium (IPDPS 2005), pp. 81a-81a. IEEE Press, Denver (2005)
12. Lu, J., Bao, L., Suda, T.: Coverage-Aware Sensor Engagement in Dense Sensor Networks. In: Yang, L.T., Amamiya, M., Liu, Z., Guo, M., Rammig, F.J. (eds.) EUC 2005. LNCS, vol. 3824, pp. 639-650. Springer, Heidelberg (2005)
13. Hefeeda, M., Ahmadi, H.: Network connectivity under probabilistic communication models in wireless sensor networks. In: 4th IEEE International Conference on Mobile Ad-hoc and Sensor Systems (MASS 2007), pp. 1-9. IEEE Press, Pisa (2007)
14. He, T., Huang, C., Lum, B., Stankovic, J., Adelzaher, T.: Range-free localization schemes for large scale sensor networks. In: 9th ACM International Conference on Mobile Computing and Networking (MOBICOM 2003), pp. 81-95. ACM Press, San Diego (2003)
15. Ganeriwal, S., Kumar, R., Srivastava, M.B.: Network-Wide Time Synchronization in Sensor Networks. NESL Technical Report (2003)
16. Gupta, H., Zhou, Z., Das, S.R., Gu, Q.: Connected sensor cover: Self-Organization of sensor networks for efficient query execution. In: 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc 2003), pp. 189-200. ACM Press, New York (2003)
17. Brönnimann, H., Goodrich, M.: Almost optimal set covers in finite VC-dimension. Discrete&Computational Geometry 14(4), 463-479 (1995)
18. Haussler, D., Welzl, E.: Epsilon-nets and simplex range queries. Discrete and Computational Geometry 2(1), 127-151 (1987)
19. Simulator can be downloaded from, http://www.isis.vanderbilt.edu/ Projects/nest/prowler/