Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks.

Ammari, H. M., & Das, S. K. (2012). Centralized and Clustered k-Coverage Protocols for Wireless Sensor Networks. IEEE Transactions on Computers, 118-133.

Type

Journal article

Intellectual base

Primary research

Year

2012

DOI

10.1109/tc.2011.49

Link

https://doi.org/10.1109/TC.2011.49

Cited from

mathematics

Cited by

1 citation across 1 artifact.

Each citation links to the sentence it supports in the citing article.

Primes

• Dense Set
  • Sensor and surveillance networks require coverage: any incident must fall within detection range of some sensor.

    This sourceFormalizes sensor-network coverage as a k-coverage / density condition — every point of a region within detection range of at least k sensors — with a minimum sensor spatial density characterization.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:25b6a26a74a3 · see in the full table