The Coverage Problem in a Wireless Sensor Network
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
One of the fundamental issues in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this problem as a decision problem, whose goal is to determine whether every point in the service area of the sensor network is covered by at least k sensors, where k is a given parameter. The sensing ranges of sensors can be unit disks or non-unit disks. We present polynomial-time algorithms, in terms of the number of sensors, that can be easily translated to distributed protocols. The result is a generalization of some earlier results where only k = 1 is assumed. Applications of the result include determining insufficiently covered areas in a sensor network, enhancing fault-tolerant capability in hostile regions, and conserving energies of redundant sensors in a randomly deployed network. Our solutions can be easily translated to distributed protocols to solve the coverage problem.
- P.K. Agarwal and M. Sharir, Arrangements and their applications. in: Handbook of Computational Geometry, eds. J.-R. Sack and J. Urrutia, (Elsevier, North-Holland, New York, 2000) pp. 49–119.
- P. Bahl and V.N. Padmanabhan, RADAR: an in-building RF-based user location and tracking system, in: IEEE INFOCOM (2000) pp. 775–784
- D. Braginsky and D. Estrin, Rumor routing algorithm for sensor networks, in: ACM Int’l Workshop on Wireless Sensor Networks and Applications (WSNA) (2002).
- N. Bulusu, J. Heidemann and D. Estrin, GPS-less low cost outdoor localization for very small devices, IEEE Personal Commun. 7(5) (2000) 28–34. CrossRef
- D. Ganesan, R. Govindan, S. Shenker and D. Estrin, Highly resilient, energy efficient multipath routing in wireless sensor networks, ACM Mobile Comput. and Commun. Review 5(4) (2001) 11–25.
- D. Halperin, Arrangements, in: Handbook of Discrete and Computational Geometry, eds. J.E. Goodman and J. O’Rourke, chapter 21, (CRC Press LLC, Boca Raton, FL, 1997) pp. 389–412.
- W.R. Heinzelman, A. Chandrakasan and H. Balakrishnan, Energy-efficient communication protocols for wireless microsensor networks, in: Hawaii Int’l Conf. on Systems Science (HICSS) (2000).
- S. Meguerdichian, F. Koushanfar, M. Potkonjak and M.B. Srivastava, Coverage problems in wireless ad-hoc sensor networks. in: IEEE INFOCOM (2001) pp. 1380–1387.
- S. Meguerdichian, F. Koushanfar, G. Qu and M. Potkonjak, Exposure in wireless ad-hoc sensor networks, in: ACM Int’l Conf. on Mobile Computing and Networking (MobiCom) (2001) pp. 139–150
- S. Meguerdichian, S. Slijepcevic, V. Karayan and M. Potkonjak, Localized algorithms in wireless ad-hoc networks: location discovery and sensor exposure, in: ACM Int’l Symp. on Mobile Ad Hoc Networking and Computing (MobiHOC) (2001) pp. 106–116.
- D. Nicules and B. Nath, Ad-hoc positioning system (APS) using AoA, in: IEEE INFOCOM (2003).
- J. O’Rourke, Computational geometry column 15, Int’l Journal of Computational Geometry and Applications 2(2) (1992) 215–217. CrossRef
- G.J. Pottie and W.J. Kaiser, Wireless integrated network sensors, Commun. ACM 43(5) (2000) 51–58. CrossRef
- A. Savvides, C.-C. Han and M.B. Strivastava, Dynamic fine-grained localization in ad-hoc networks of sensors, in: ACM Int’l Conf. on Mobile Computing and Networking (MobiCom) (2001) pp. 166–179.
- E. Shih, S.-H. Cho, N. Ickes, R. Min, A. Sinha, A. Wang and A. Chandrakasan. Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks, in: ACM Int’l Conf. on Mobile Computing and Networking (MobiCom) (2001) pp. 272–287.
- S. Slijepcevic and M. Potkonjak, Power efficient organization of wireless sensor networks, in: IEEE Int’l Conf. on Communications (ICC) (2001) pp. 472–476.
- K. Sohrabi, J. Gao, V. Ailawadhi and G.J. Pottie, Protocols for self-organization of a wireless sensor network, IEEE Personal Commun. 7(5) (2000) 16–27. CrossRef
- D. Tian and N.D. Georganas, A coverage-preserving node scheduling scheme for large wireless sensor networks, in: ACM Int’l Workshop on Wireless Sensor Networks and Applications (WSNA) (2002).
- Y.-C. Tseng, S.-P. Kuo, H.-W. Lee and C.-F. Huang, Location tracking in a wireless sensor network by mobile agents and its data fusion strategies, in: Int’l Workshop on Information Processing in Sensor Networks (IPSN) (2003).
- G. Veltri, Q. Huang, G. Qu and M. Potkonjak, Minimal and maximal exposure path algorithms for wireless embedded sensor networks. in: ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys) (2003) pp. 40–50.
- X. Wang, G. Xing, Y. Zhang, C. Lu, R. Pless and C. Gill, Coverage and connectivity configuration in wireless sensor networks. in: ACM Int’l Conf. on Embedded Networked Sensor Systems (SenSys) 2003 pp. 28–39.
- A. Woo and D. E. Culler, A transmission control scheme for media access in sensor networks, in: ACM Int’l Conf. on Mobile Computing and Networking (MobiCom) (2001) pp. 221–235.
- F. Ye, G. Zhong, S. Lu and L. Zhang, PEAS: a robust energy conserving protocol for long-lived sensor networks, in: Int’l Conf. on Distributed Computing Systems (ICDCS) (2003).
- W. Ye, J. Heidemann and D. Estrin, An energy-efficient MAC protocol for wireless sensor networks, in: IEEE INFOCOM (2002) pp. 1567–1576.
- The Coverage Problem in a Wireless Sensor Network
Mobile Networks and Applications
Volume 10, Issue 4 , pp 519-528
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers
- Additional Links
- ad hoc network
- computer geometry
- coverage problem
- ubiquitous computing
- wireless network
- sensor network
- Industry Sectors