Critical Conditions for Connected-K-Coverage in Sensor Networks

IEEE Communications Letters - United States
doi 10.1109/lcomm.2008.080729
Full Text
Abstract

Available in full text

Date
Authors

Unknown

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

M-Connected Coverage Problem in Wireless Sensor Networks

ISRN Sensor Networks
2012English

Optimal Coverage Model in Clifford 3-Connected Wireless Sensor Networks

Advanced Engineering Forum
2011English

Energy-Efficient Connected Coverage of Discrete Targets in Wireless Sensor Networks

International Journal of Ad Hoc and Ubiquitous Computing
HardwareComputer NetworksSoftwareArchitectureCommunications
2009English

Area K-Coverage Optimization Protocol for Heterogeneous Dense Wireless Sensor Networks

International Journal of Advanced Computer Science and Applications
Computer Science
2017English

Energy-Efficient Location-Independent K-Connected Scheme in Wireless Sensor Networks*

English

Variable Radii Connected Sensor Cover in Sensor Networks

ACM Transactions on Sensor Networks
Computer NetworksCommunications
2009English

Lifetime Maximization of Sensor Networks Under Connectivity and K-Coverage Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Distributed Algorithms for Dynamic Coverage in Sensor Networks

2007English

Private Computation — K-Connected Versus 1-Connected Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy