QoS-aware target coverage in wireless sensor networks

Wireless Communications and Mobile Computing

Volumn 9, Issue 12, 2009, Pages 1645-1659

  Gu, Yu ^a,b,c   Ji, Yusheng ^d   Li, Jie ^c   Zhao, Baohua ^a,b  

^a UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

^b State Key Laboratory of Networking and Switching Technology   (China)

^c UNIVERSITY OF TSUKUBA   (Japan)

^d NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

Column generation; Lifetime optimization; Target coverage; Wireless sensor networks

Indexed keywords

COLUMN GENERATION; COVERAGE PATTERNS; EXPERIMENTAL DATA; FEASIBLE SET; HARSH ENVIRONMENT; NETWORK LIFETIME; NETWORK PARAMETERS; NP COMPLETE; QOS REQUIREMENTS; QUALITY OF SERVICE CONSTRAINTS; RANDOM SELECTION ALGORITHMS; SAMPLING RATES; SIMULATION RESULT; STEEPEST ASCENT; SUB-PROBLEMS; SURVEILLANCE SENSORS; TARGET COVERAGE;

COMPUTER SIMULATION; OPTIMIZATION; QUALITY OF SERVICE; ROUTING PROTOCOLS; SENSOR NETWORKS; TARGETS; WIRELESS TELECOMMUNICATION SYSTEMS;

WIRELESS SENSOR NETWORKS;

EID: 72949083734     PISSN: 15308669     EISSN: None     Source Type: Journal    
DOI: 10.1002/wcm.748     Document Type: Article

References (22)

1. The Crossbow Company. http://www.xbow.com, 2008.
2. He T, Krishnamurthy S, Luo L, et al. Vigilnet: an integrated sensor network system for energy-efficient surveillance. ACM Transactions on Sensor Networks (TOSN) 2006; 2: 1-38.
3. Horst R, Tuy H. Global Optimization: Deterministic Approaches (3rd edn). Springer-Verlag: Berlin, 1996.
4. Desaulniers G, Desrosiers J, Solomon MM.Column Generation. Springer: New York, NY, 2005.
5. Cardei M, Thai YL, Wu W. Energy-efficient target coverage in wireless sensor networks. In Proceedings of IEEE INFOCOM 2005, Miami, U.S.A., March 2005.
6. Cardei M, Wu J. Energy-efficient coverage problems in wireless ad hoc sensor networks. Computer Communications Journal (Elsevier) 2006; 29: 413-420. (Pubitemid 43243224)
7. Cardei M, Du DZ. Improving wireless sensor network lifetime through power aware organization. ACM Wireless Networks 2005; 11: 333-340.
8. Lu M, Wu J, Cardei M, Li M. Energy-efficient connected coverage of discrete targets in wireless sensor networks. In Proceedings of IEEE International Conference on Computer Networks and Mobile Computing (ICCNMC'05), August 2005.
9. Jaggi N, Abouzeid AA. Energy-efficient connected coverage in wireless sensor networks. In Proceedings 4th Asian International Mobile Computing Conference (AMOC), Kolkota, India, January 2006.
10. Liu H, Wan P, Jia X. Maximal lifetime scheduling for k to 1 sensor-target surveillance networks. Computer Networks 2006; 50: 2839-2854. (Pubitemid 44149233)
11. Liu H, Wan P, Jia X. Maximal lifetime scheduling for sensor surveillance systems with k sensors to 1 target. IEEE Transactions on Parallel and Distributed Systems 2006; 17: 2839-2854. (Pubitemid 44149233)
12. Huang CF, Tseng YC. The Coverage Problem in a Wireless Sensor Network. In Proceedings of ACM International Conference on Wireless Sensor Networks and Applications, San Diego, U.S.A., September 2003; 115-121.
13. Meguerdichian S, Potkonjak M. Low power 0/1 coverage and scheduling techniques in sensor networks.Technical Reports 030001, University of California, Los Angeles, January 2003.
14. Lee JJ, Krishnamachari B, Kuo J. Impact of heterogeneous deployment on lifetime sensing coverage in sensor networks. In Proceedings of IEEE Conference on Sensor and ad hoc Communications and Networks (SECON), Santa Clara, U.S.A., 2004; 367-376.
15. Mhatre V, Rosenberg C, Kofman D, Mazumdar R. A minimum cost heterogeneous sensor network with a lifetime constraint. IEEE Transactions on Mobile Computing 2005; 4: 4-15.
16. Liu B, Liu Z, Towsley D. On the capacity of hybrid wireless networks. In Proceedings of IEEE INFOCOM, San Francisco, CA, U.S.A., 2003; 1543-1552.
17. Margi CB, Petkov V, Obraczka K, Manduchi R. Characterizing energy consumption in a visual sensor network testbed. In Proceedings of IEEE/Create-Net International Conference on Testbeds and Research Infrastructures for the Development of Networks and Communities (TridentCom), Barcelona, Spain, March 2006.
18. 3 · l) potential reduction algorithm for linear programming. Mathematical Programming 1991; 50: 239-258.
19. The Lindo System Company. http://www.lindo.com, 2008.
20. Vance H, Barnhart C, Johnson E. Solving binary cutting stock problems by column generation and branch-and-bound. Computational Optimization and Applications 1994; 3: 111- 130.
21. Gomes CP, Selman B, Crato N, Kautz HA. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning 2000; 24: 67-100.
22. Lubbecke ME, Desrosiers J. Selected topics in column generation. Technical Report G-2002-64, GERAD, Montreal, December 2002.