Greedy Algorithms for Target Coverage Lifetime Management Problem in Wireless Sensor Networks

Provided by: Science & Engineering Research Support soCiety (SERSC)
Topic: Mobility
Format: PDF
When several low power sensors are randomly deployed in a field for monitoring targets located at fixed positions, managing the network lifetime is useful as long as replacing battery of dead sensors is not often feasible. The most commonly investigated mechanism for coverage preserving while maximizing the network lifetime is to design efficient sleep scheduling protocols, so that sensors can alternate their state between being active or not. Maximizing lifetime of a sensor network while satisfying a predefined coverage requirement is an optimization problem, which most of times cannot be optimally solved in polynomial time.

Find By Topic