โป ์๋ฌธ์ ๊ณต๊ธฐ๊ด๊ณผ์ ํ์ฝ๊ธฐ๊ฐ์ด ์ข ๋ฃ๋์ด ์ด๋์ด ์ ํ๋ ์ ์์ต๋๋ค.
Abstract
1. Introduction
2. Target Coverage Problem
2.1. Assumptions
2.2. Problem Definition
2.3. Maximum Set Cover Problem
2.4. Non-disjoint Sets Constraint
3. Sensors Selection Mechanism
3.1. Theoretical Bound
3.2. Sensors Cost Evaluation
4. Using Greedy Algorithms
4.1. Greedy Minimum Set Cover
4.2. Approximation Ratio of Greedy-MSSC
4.3. Greedy Maximum Set Cover
4.4. Complexity Analysis
5. Simulation Results
5.1. Experiment 1
5.2. Experiment 2
5.3. Experiment 3
5.4. Experiment 4
6. Related Works
6.1. Sensors Placement Optimization Problem
6.2. Sleep Scheduling Mechanisms
6.3. Connected Target Coverage
6.4. Target Coverage under QoS Constraint
7. Conclusion
Acknowledgement
References
0๊ฐ์ ๋ ผ๋ฌธ์ด ์ฅ๋ฐ๊ตฌ๋์ ๋ด๊ฒผ์ต๋๋ค.