Energy efficient monitoring in sensor networks

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

Volumn 4957 LNCS, Issue , 2008, Pages 436-448

  Deshpande, Amol ^a   Khuller, Samir ^a   Malekian, Azarakhsh ^a   Toossi, Mohammed ^a  

^a Institute of Advanced Computer Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENERGY EFFICIENCY; ENERGY MANAGEMENT; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; CONSERVATION; ENERGY CONSERVATION; NETWORK MANAGEMENT; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; ROUTING ALGORITHMS; SENSOR NETWORKS; SENSORS; WIRELESS SENSOR NETWORKS;

SET K-COVER; SIMILARITIES; TIME-SLOTS; ENERGY-EFFICIENT; EXPERIMENTAL EVALUATIONS; INFORMATICS; LATIN AMERICAN; MONITORING APPLICATIONS; NP-HARD; OF SENSORS; PROBLEM BASED; RANDOMIZED ROUTING;

WIRELESS SENSOR NETWORKS; APPROXIMATION ALGORITHMS;

EID: 43049084793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_38     Document Type: Conference Paper

References (12)

1. Abrams, Z., Goel, A., Plotkin, S.: Set k-cover algorithms for energy efficient monitoring in wireless sensor networks. In: IPSN 2004: Proceedings of the third international symposium on Information processing in sensor networks, pp. 424-432 (2004)
2. Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inf. Process. Lett. 85(6), 301-302 (2003)
3. Benini, L., Castelli, G., Macii, A., Macii, E., Poncino, M., Scarsi, R.: A discrete-time battery model for high-level power estimation. In: DATE 2000: Proceedings of the conference on Design, automation and test in Europe, New York, NY, USA, pp. 35-41 (2000)
4. Cardei, M., Thai, MT., Li, Y., Wu, W.: Energy-efficient target coverage in wireless sensor networks. In: IEEE Infocom (2005)
5. Cardei, M., Wu, J.: Energy-efficient coverage problems in wireless ad-hoc sensor networks. In: Computer Communications, pp. 413-420 (2006)
6. Feige, U., Halldorsson, M., Kortsarz, G., Srinivasan, A.: Approximating the domatic number. SIAM J. on Comput. 32, 172-195 (2002)
7. 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)
8. Goemans, M.X., Williamson, D.P.: 879-approximation algorithms for max cut and max 2sat. In: STOC 1994: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, pp. 422-431. ACM Press, New York (1994)
9. Hastad, J.: Some optimal inapproximability results. J. ACM 48, 798-859 (2001)
10. Liu, H., Jia, X., Wan, P.: Maximizing lifetime of sensor surveillance systems. IEEE/ACM Trans. on Networking 15, 172-195 (2007)
11. Slijepcevic, S., Potkonjak, M.: Power efficient organization of wireless sensor networks. In: IEEE International Conference on Communications (ICC 2001) (2001)
12. Yannakakis, M.: Node-and edge-deletion NP-complete problems. In: STOC 1978: Proceedings of the tenth annual ACM symposium on Theory of computing, pp. 253-264. ACM Press, New York (1978)