Assigning sensors to missions with demands

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

Volumn 4837 LNCS, Issue , 2008, Pages 114-125

  Bar Noy, Amotz ^a,b   Brown, Theodore ^a,c   Johnson, Matthew P ^a   La Porta, Thomas ^d   Liu, Ou ^a   Rowaihy, Hosam ^d  

^a CITY UNIVERSITY OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c CITY UNIVERSITY OF NEW YORK   (United States)

^d PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC ASPECTS; IF THERE ARE; MATCHING PROBLEMS; MAXIMUM INDEPENDENT SET; MAXIMUM MATCHING; NP-HARD; POLYNOMIAL-TIME; SENSOR ASSIGNMENT; SET PACKING; STRONGLY NP-HARD;

APPROXIMATION ALGORITHMS; HYBRID SENSORS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; SENSOR NETWORKS; SENSORS; SET THEORY; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 49949114784     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77871-4_11     Document Type: Conference Paper

References (24)

1. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows. Prentice-Hall, Englewood Cliffs (1993)
2. Berman, P.: A d/2 approximation for maximum weight independent set in d-claw free graphs. In: Proceedings of SWAT, pp. 214-219 (2000)
3. Byers, J., Nasser, G.: Utility-based decision-making in wireless sensor networks. In: Proceedings of the IEEE Workshop on Mobile and Ad Hoc Networking and Computing (2000)
4. Clark, B., Colbourn, C., Johnson, D.: Unit disk graphs. Discrete Math 86, 165-177 (1990)
5. de Vries, S., Vohra, R.V.: Combinatorial auctions: a survey. INFORMS J. on Computing 15-3, 284-309 (2003)
6. Erlebach, T., Fiala, J.: Independence and coloring problems on intersection graphs of disks (manuscript) (2001)
7. Fleischer, L., Goemans, M.X., Mirrokni, V.S., Sviridenko, M.: Tight approximation algorithms for maximum general assignment problems. In: Proceedings of SODA 2006, pp. 611-620 (2006)
8. Galil, Z., Micali, S., Gabow, H.N.: An O(EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput. 15(1), 120-130 (1986)
9. 1-ε. Acta Mathematica 182, 105-142 (1999)
10. Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity 15(1), 20-39 (2006)
11. Hochbaum, D.S., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32(1), 130-136 (1985)
12. Hunt III, H.B., Marathe, M.V., Radhakrishnan, V., Ravi, S.S., Rosenkrantz, D.J., Stearns, R.: NC-approximation schemes for NP- and PSPACE-hard problems for geometric graphs. J. Algorithms 26(2), 238-274 (1998)
13. Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM 50(6), 795-824 (2003)
14. Kaplan, L.: Global node selection for localization in a distributed sensor network. IEEE Transactions on Aerospace and Electronic Systems 42(1), 113-135 (2006)
15. Lehmann, D., Mueller, R., Sandholm, T.: The winner determination problem. In: Cramton, Shoham, Steinberg (eds.) Combinatorial Auctions, MIT Press, Cambridge (2006)
16. Marathe, M.V., Radhakrishnan, V., Hunt III, H.B., Ravi, S.S.: Hierarchically specified unit disk graphs. Theor. Comput. Sci. 174(1-2), 23-65 (1997)
17. Matsui, T.: Approximation algorithms for maximum independent set problems and fractional coloring problems on unit disk graphs. In: Proceedings of the Japan Conference on Discrete and Computational Geometry, pp. 194-200 (1998)
18. Mullen, T., Avasarala, V., Hall, D.L.: Customer-driven sensor management. IEEE Intelligent Systems 21(2), 41-49 (2006)
19. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci. 43, 425-440 (1991)
20. Perillo, M., Heinzelman, W.: Optimal sensor management under energy and reliability constraints. In: Proceedings of the IEEE Conference on Wireless Communications and Networking (2003)
21. Rowaihy, H., Eswaran, S., Johnson, M., Verma, D., Bar-Noy, A., Brown, T., La Porta, T.: A survey of sensor selection schemes in wireless sensor networks. In: SPIE Defense and Security Symposium Conference on Unattended Ground, Sea, and Air Sensor Technologies and Applications IX (2007)
22. Shih, K., Chen, Y., Chiang, C., Liu, B.: A distributed active sensor selection scheme for wireless sensor networks. In: Proceedings of the IEEE Symposium on Computers and Communications (June 2006)
23. Sung, S.C., Vlach, M.: Maximizing weighted number of just-in-time jobs on unrelated parallel machines. J. Scheduling 8-5, 453-460 (2005)
24. Zhao, F., Shin, J., Reich, J.: Information-driven dynamic sensor collaboration. IEEE Signal Processing Magazine 19(2), 61-72 (2002)