DocumentCode
2863057
Title
Target Coverage With QoS Requirements in Wireless Sensor Networks
Author
Gu, Yu ; Liu, Hengchang ; Zhao, Baohua
Author_Institution
Univ. of Sci. & Technol. of China, Hefei
fYear
2007
fDate
11-13 Oct. 2007
Firstpage
35
Lastpage
38
Abstract
It has been a challenging problem to support target coverage with QoS requirements in wireless sensor networks, because we need to consider both energy constraint and so-called target Q-coverage requirement, i.e. different targets may require different sensing quality in terms of the number of transducers, data sampling rate, etc. First we prove that this problem is NP- complete, then we formulate the optimization using Linear Programming techniques, however, directly solving this optimization seems desperately complex due to the combinatorial complexity. Thus a column generation based approach is developed to solve this problem by decomposing the original problem into a master problem as well as a corresponding sub problem and solves them iteratively. Numerical results are given to verify our approach and gain some insights into the performance aspects in designing such surveillance systems.
Keywords
computational complexity; linear programming; quality of service; wireless sensor networks; NP-complete problem; QoS requirements; combinatorial complexity; energy constraint; lifetime optimization; linear programming techniques; target Q-coverage requirement; wireless sensor networks; Computer science; Intelligent networks; Iterative algorithms; Linear programming; Monitoring; Sampling methods; Sensor phenomena and characterization; Sensor systems and applications; Surveillance; Wireless sensor networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Pervasive Computing, 2007. IPC. The 2007 International Conference on
Conference_Location
Jeju City
Print_ISBN
978-0-7695-3006-2
Type
conf
DOI
10.1109/IPC.2007.116
Filename
4438390
Link To Document