, Volume 59, Issue 1, pp 94–114 | Cite as

Energy Efficient Monitoring in Sensor Networks

  • Amol Deshpande
  • Samir KhullerEmail author
  • Azarakhsh Malekian
  • Mohammed Toossi


We study a set of problems related to efficient battery energy utilization for monitoring applications in a wireless sensor network with the goal to increase the sensor network lifetime. We study several generalizations of a basic problem called Set k-Cover. The problem can be described as follows: we are given a set of sensors, and a set of targets to be monitored. Each target can be monitored by a subset of the sensors. To increase the lifetime of the sensor network, we would like to partition the sensors into k sets (or time-slots), and activate each set of sensors in a different time-slot, thus extending the battery life of the sensors by a factor of k. The goal is to find a partitioning that maximizes the total coverage of the targets for a given k. This problem is known to be NP-hard. We develop an improved approximation algorithm for this problem using a reduction to Max k-Cut. Moreover, we are able to demonstrate that this algorithm is efficient, and yields almost optimal solutions in practice.

We also consider generalizations of this problem in several different directions. First, we allow each sensor to be active in α different sets (time-slots). This means that the battery life is extended by a factor of \(\frac{k}{\alpha}\), and allows for a richer space of solutions. We also consider different coverage requirements, such as requiring that all targets, or at least a certain number of targets, be covered in each time slot. In the Set k-Cover formulation, there is no requirement that a target be monitored at all, or in any number of time slots. We develop a randomized rounding algorithm for this problem.

We also consider extensions where each sensor can monitor only a bounded number of targets in any time-slot, and not all the targets adjacent to it. This kind of problem may arise when a sensor has a directional camera, or some other physical constraint might prevent it from monitoring all adjacent targets even when it is active. We develop the first approximation algorithms for this problem.


Algorithms Complexity Approximation algorithm Sensor networks Energy efficiency Target monitoring 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: IPSN ’04: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, pp. 424–432 (2004) Google Scholar
  2. 2.
    Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw. 38 (2002) Google Scholar
  3. 3.
    Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inf. Process. Lett. 85(6), 301–302 (2003) zbMATHCrossRefGoogle Scholar
  4. 4.
    Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Smorodinsky, S.: Coloring geometric range spaces. In: Proceedings of the 8th Latin American Theoretical Informatics (LATIN’08) (2008) Google Scholar
  5. 5.
    Benini, L., Castelli, G., Macii, A., Macii, E., Poncino, M., Scarsi, R.: A discrete-time battery model for high-level power estimation. In: DATE ’00: Proceedings of the Conference on Design, Automation and Test in Europe, New York, NY, USA, pp. 35–41 (2000) Google Scholar
  6. 6.
    Buchsbaum, A.L., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: SODA ’07 (2007) Google Scholar
  7. 7.
    Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. Comput. Commun. 413–420 (2006) Google Scholar
  8. 8.
    Cardei, M., Thai, M.T., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: IEEE Infocom (2005) Google Scholar
  9. 9.
    Cerpa, A., Elson, J., Estrin, D., Girod, L., Hamilton, M., Zhao, J.: Habitat monitoring: application driver for wireless communications technology. In: Proceedings of ACM SIGCOMM Workshop on Data Communications in Latin America and the Caribbean (2001) Google Scholar
  10. 10.
    Deshpande, A., Khuller, S., Malekian, A., Toossi, M.: Energy efficient monitoring in sensor networks. In: LATIN 2008: Theoretical Informatics, 8th Latin American Symposium, Búzios, Brazil, April 7–11, 2008, Proceedings, pp. 436–448 (2008) Google Scholar
  11. 11.
    Feige, U.: On maximizing welfare when utility functions are subadditive. In: STOC (2006) Google Scholar
  12. 12.
    Feige, U., Halldorsson, M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. Comput. 32, 172–195 (2002) zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Frieze, A.M., Jerrum, M.: Improved approximation algorithms for max k-cut and max bisection. In: Proceedings of the 4th International IPCO Conference, pp. 1–13 (1995) Google Scholar
  14. 14.
    Goemans, M.X., Williamson, D.P.: 879-approximation algorithms for max cut and max 2sat. In: STOC ’94: Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 422–431. ACM Press, New York (1994) CrossRefGoogle Scholar
  15. 15.
    Hastad, J.: Some optimal inapproximability results. J. ACM 48, 798–859 (2001) zbMATHMathSciNetGoogle Scholar
  16. 16.
    Hill, J., Szewczyk, R., Woo, A., Hollar, S., Cullerand, D., Pister, K.: System architecture directions for networked sensors. In: Proceedings of ASPLOS (November 2000) Google Scholar
  17. 17.
    Hsin, C., Liu, M.: Network coverage using low duty-cycled sensors: random & coordinated sleep algorithms. In: IPSN ’04: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, New York, NY, USA, pp. 433–442. ACM Press, New York (2004) CrossRefGoogle Scholar
  18. 18.
    Intanagonwiwat, C., Govindan, R., Estrin, D.: Directed diffusion: a scalable and robust communication paradigm for sensor networks. In: Proceedings of ACM MOBICOM, Boston, MA (August 2000) Google Scholar
  19. 19.
    Juang, P., Oki, H., Wang, Y., Martonosi, M., Pehand, L., Rubenstein, D.: Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with zebranet. In: Proceedings of ASPLOS (October 2002) Google Scholar
  20. 20.
    Kahn, J.M., Katz, R.H., Pister, K.S.J.: Mobile networking for smart dust. In: ACM MOBICOM, Seattle, WA (August 1999) Google Scholar
  21. 21.
    Liu, H., Jia, X., Wan, P., Yi, C., Makki, S., Pissinou, N.: Maximizing lifetime of sensor surveillance systems. IEEE/ACM Trans. Netw. 15, 172–195 (2007) Google Scholar
  22. 22.
    Lu, G., Sadagopan, N., Krishnamachari, B., Goel, A.: Delay efficient sleep scheduling in wireless sensor networks. In: IEEE Infocom (2005) Google Scholar
  23. 23.
    Madden, S., Franklin, M.J., Hellerstein, J.M., Hong, W.: TAG: A Tiny AGgregation service for ad-hoc sensor networks. In: Proceedings of USENIX OSDI (2002) Google Scholar
  24. 24.
    Mainwaring, A., Polastre, J., Szewczyk, R., Culler, D.: Wireless sensor networks for habitat monitoring. In: ACM Workshop on Sensor Networks and Applications (2002) Google Scholar
  25. 25.
    Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: IEEE International Conference on Communications (ICC’01) (2001) Google Scholar
  26. 26.
    Vondrak, J.: Optimal approximation for the submodular welfare problem in the value oracle model. In: STOC (2008) Google Scholar
  27. 27.
    Wang, X., Xing, G., Zhang, Y., Lu, C., Pless, R., Gill, C.: Integrated coverage and connectivity configuration in wireless sensor networks. In: SenSys ’03: Proceedings of the 1st International Conference on Embedded networked Sensor Systems, pp. 28–39 (2003) Google Scholar
  28. 28.
    Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: STOC ’78: Proceedings of the Tenth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 253–264. ACM Press, New York (1978) CrossRefGoogle Scholar
  29. 29.
    Yao, Y., Gehrke, J.: Query processing in sensor networks. In: Proceedings of Conference on Innovative Data Systems Research (CIDR) (2003) Google Scholar
  30. 30.
    Zhou, Z., Das, S., Gupta, H.: Connected k-coverage problem in sensor networks. In: Intl. Conference on Computer Communications and Networks (ICCCN) (2004) Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  • Amol Deshpande
    • 1
  • Samir Khuller
    • 1
    Email author
  • Azarakhsh Malekian
    • 1
  • Mohammed Toossi
    • 2
  1. 1.Computer Science DepartmentUniversity of MarylandCollege ParkUSA
  2. 2.GoogleMountain ViewUSA

Personalised recommendations