1. THE COVERAGE PROBLEM IN THREE-DIMENSIONAL WIRELESS SENSOR NETWORKS Journal of Interconnection Networks 8.03 (2007): 209-227 Authors: Chi-Fu Huang; Tseng Chee-Yu; Lo Li-Chu; Summary: Robert Burden

2. ASSUMPTIONS 1.Nodes have a fixed sensing range in all directions 2.There is no interference 3.Work applies to both Mobile and Static sensor networks

3. OBJECTIVES Goal of Work Efficiently deploying a mobile sensor network in 3D space. Problems Addressed 1.3D coverage Maximization Technology Replaced Sliced 2D deployment Aim of Work Evaluate the proposed technique for deploying sensors in 3D unknown space

4. PROPOSAL

6. CONTRIBUTIONS Only paper I could find attempting to tackle three dimensional sensor deployment

7. IMPACT This paper has been cited by 165 research papers.

8. EVALUATION Mathematical Proofs Set Logic Proof

9. OPEN PROBLEMS No future work is presented in this paper. A lot of the same issues we haven’t solved in 2D sensor deployment are still applicable Energy Consumption, Resource minimization, Sensing Holes

10. DISCUSSION Is 3D deployment simply a matter of running our traditional 2D algorithms twice once for x and once for y? If we were to deploy nodes in a multi-story office building what problems would we run into?

11. DISCUSSION

12. CITATION H UANG, C HI -F U, Y U -C HEE T SENG, AND L I -C HU L O. "T HE COVERAGE PROBLEM IN THREE - DIMENSIONAL WIRELESS SENSOR NETWORKS." J OURNAL OF I NTERCONNECTION N ETWORKS 8.03 (2007): 209-227.