Sensor-mission assignment in wireless sensor networks

ACM Transactions on Sensor Networks

Volumn 6, Issue 4, 2010, Pages 1-33

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

^a KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS   (Saudi Arabia)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Algorithms; Performance; Theory

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION;

ASSIGNMENT PROBLEMS; ENERGY AWARENESS; NETWORK LIFETIME; OPTIMAL SOLUTIONS; PERFORMANCE; THEORY; UPPER BOUND;

WIRELESS SENSOR NETWORKS;

EID: 77954961197     PISSN: 15504859     EISSN: 15504867     Source Type: Journal    
DOI: 10.1145/1777406.1777415     Document Type: Article

References (31)

1. AHUJA, R., MAGNANTI, T., AND ORLIN, J. 1993. Network Flows. Prentice Hall.
2. AURENHAMMER, F. 1991. Voronoi diagrams-A survey of a fundamental geometric data structure. ACM Comput. Surv. 23, 3, 345-405.
3. BERMAN, P. A d/2 approximation for maximum weight independent set in d-claw free graphs. In Proceedings of the Scandinavian Workshop on Algorithm Theory (SWAT'00). 214-219.
4. BOSE, P., MORIN, P., STOJMENOVIC, I., AND URRUTIA, J. 2001. Routing with guaranteed delivery in ad hoc wireless networks. Wirel. Netw. 7, 6, 609-616.
5. BYERS, J. AND NASSER, G. 2000. Utility-based decision-making in wireless sensor networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc'00).
6. CLARK, B., COLBOURN, C., AND JOHNSON, D. 1990. Unit disk graphs. Discr. Math 86, 165-177.
7. DE VRIES, S. AND VOHRA, R. 2003. Combinatorial auctions: A survey. INFORMS J. Comput. 15, 3, 284-309.
8. ERLEBACH, T. AND FIALA, J. 2001. Independence and coloring problems on intersection graphs of disks. http://citeseerx.ist.psu.edu/viewdoc/summary?doi= 10.1.14. 9021.
9. FLEISCHER, L., GOEMANS, M. X., MIRROKNI, V. S., AND SVIRIDENKO, M. 2006. Tight approximation algorithms for maximum general assignment problems. In Proceedings of the Annual ACM/SIAM Symposium on Discrete Algorithms (SODA'06). 611-620.
10. GALIL, Z., MICALI, S., AND GABOW, H. 1986. An O (EV log V) algorithm for finding a maximal weighted matching in general graphs. SIAM J. Comput. 15, 1, 120-130.
11. GAREY, M. AND JOHNSON, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Colmpleteness. Freeman.
12. 1-ε. Acta Math. 182, 105-142.
13. HAZAN, E., SAFRA, S., AND SCHWARTZ, O. 2006. On the complexity of approximating k-set packing. Comput. Complex. 15, 1, 20-39.
14. HEINZELMAN, W., CHANDRAKASAN, A., AND BALAKRISHNAN, H. 2000. Energy-Efficient communication protocols for wireless microsensor networks. In Proceedings of the Hawaaian International Conference on Systems Science.
15. HOCHBAUM, D. AND MAASS, W. 1985. Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 1, 130-136.
16. HUNT, H., MARATHE, M., RADHAKRISHNAN, V., RAVI, S., ROSENKRANTZ, D., AND STEARNS, R. 1998. NC-Approximation schemes for NP-and PSPACE-hard problems for geometric graphs. J. Algor. 26, 2, 238-274.
17. JIA, L., RAJARAMAN, R., AND SUEL, T. 2002. An efficient distributed algorithm for constructing small dominating sets. Distrib. Comput. 15, 4, 193-205.
18. JOHNSON, M. P., ROWAIHY, H., PIZZOCARO, D., BAR-NOY, A., CHALMERS, S., LA PORTA, T., AND PREECE, A. 2008. Frugal sensor assignment. In Proceedigns of the International Conference on Distributed Computing in Sensor Systems (DCOSS'08).
19. KAPLAN, L. 2006. Global node selection for localization in a distributed sensor network. IEEE Trans. Aerospace Electron. Syst. 42, 1, 113-135.
20. KARP, B. AND KUNG, H. 2000. Greedy perimeter stateless routing for wireless networks. In Proceedings of the ACM Annual International Conference on Mobile Computing and Networking (MobiCom'00).
21. LU, J., BAO, L., AND SUDA, T. 2005. Coverage-aware sensor engagement in dense sensor networks. In Proceedings of the International Confernece on Embedded and Ubiquitous Computing (EUC'05).
22. MARATHE, M., RADHAKRISHNAN, V., HUNT, H., AND RAVI, S. 1997. Hierarchically specified unit disk graphs. Theor. Comput. Sci. 174, 1-2, 23-65.
23. MATSUI, T. 1998. 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. 194-200.
24. MULLEN, T., AVASARALA, V., AND HALL, D. L. 2006. Customer-Driven sensor management. IEEE Intell. Syst. 21, 2, 41-49.
25. PERILLO, M. AND HEINZELMAN, W. March 2003. Optimal sensor management under energy and reliability constraints. In Proceedings of the IEEE Conference on Wireless Communications and Networking.
26. ROWAIHY, H., ESWARAN, S., JOHNSON, M. P., VERMA, D., BAR-NOY, A., BROWN, T., AND LA PORTA, T. 2007a. A survey of sensor selection schemes in wireless sensor networks. In SPIE Defense and Security Symposium.
27. ROWAIHY, H., JOHNSON, M. P., BAR-NOY, T. B. A., AND LA PORTA, T. 2007b. Assigning sensors to competing missions (long version). Tech. rep. NAS-TR-0080-2007, Network and Security Research Center, Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA.
28. SHIH, K., CHEN, Y., CHIANG, C., AND LIU, B. June 2006. A distributed active sensor selection scheme for wireless sensor networks. In Proceedings of the IEEE Symposium on Computers and Communications.
29. SUNG, S. C. AND VLACH, M. 2005. Maximizing weighted number of just-in-time jobs on unrelated parallel machines. J. Schedul. 8-5, 453-460.
30. WANG, L. AND XIAO, Y. 2006. A survey of energy-efficient scheduling mechanisms in sensor networks. Mobile Netw. Appl. 11, 5, 723-740.
31. ZHAO, F., SHIN, J., AND REICH, J. 2002. Information-Driven dynamic sensor collaboration. IEEE Signal Process. Mag. 19, 2, 61-72.