Chi-Fu Huang
ABSTRACT
One fundamental issue 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 predefined value. 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: (i) positioning applications, (ii) situations which require stronger environmental monitoring capability, and (iii) scenarios which impose more stringent fault-tolerant capability.
- P. Bahl and V. N. Padmanabhan. RADAR: An in-building RF-based user location and tracking system. In IEEE INFOCOM, pages 775--784, 2000.Google Scholar
Cross Ref
- D. Braginsky and D. Estrin. Rumor routing algorithm for sensor networks. In ACM Int'l Workshop on Wireless Sensor Networks and Applications (WSNA), 2002. Google ScholarDigital Library
- N. Bulusu, J. Heidemann, and D. Estrin. GPS-less low cost outdoor localization for very small devices. IEEE Personal Commun., 7(5):28--34, Oct. 2000.Google ScholarCross Ref
- G. J. Pottie and W. J. Kaiser. Wireless integrated network sensors. Commun. ACM, 43(5):51--58, May 2000. Google ScholarDigital Library
- 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):11--25, Oct. 2001. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- J. O'Rourke. Computational geometry column 15. Int'l Journal of Computational Geometry and Applications, 2(2):215--217, 1992. Google ScholarDigital Library
- S. Meguerdichian, F. Koushanfar, M. Potkonjak, and M. B. Srivastava. Coverage problems in wireless ad-hoc sensor networks. In IEEE INFOCOM, pages 1380--1387, 2001. Google ScholarDigital Library
- 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), pages 139--150, 2001. Google Scholar
- 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), pages 106--116, 2001. Google Scholar
- D. Nicules and B. Nath. Ad-hoc positioning system (APS) using AoA. In IEEE INFOCOM, 2003.Google Scholar
- 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), pages 166--179, 2001. Google Scholar
- 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), pages 272--287, 2001. Google Scholar
- S. Slijepcevic and M. Potkonjak. Power efficient organization of wireless sensor networks. In IEEE Int'l Conf. on Communications (ICC), pages 472--476, 2001.Google Scholar
- K. Sohrabi, J. Gao, V. Ailawadhi, and G. J. Pottie. Protocols for self-organization of a wireless sensor network. IEEE Personal Commun., 7(5):16--27, Oct. 2000.Google ScholarCross Ref
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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), pages 221--235, 2001. Google Scholar
- 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. Google ScholarDigital Library
- W. Ye, J. Heidemann, and D. Estrin. An energy-efficient MAC protocol for wireless sensor networks. In IEEE INFOCOM, pages 1567--1576, 2002.Google Scholar
Index Terms
- The coverage problem in a wireless sensor network
Recommendations
The coverage problem in a wireless sensor network
One of the fundamental issues in sensor networks is the coverage problem, which reflects howwell 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 ...
Coverage algorithms in GPS-less wireless mobile sensor networks
Mobility '08: Proceedings of the International Conference on Mobile Technology, Applications, and SystemsThe coverage problem, being one of fundamental problems in wireless sensor networks, has been received lots of attention. To preserve the coverage of network, some researches suggest moving redundant mobile sensor nodes to uncovered areas for mitigating ...
Distributed protocols for ensuring both coverage and connectivity of a wireless sensor network
Wireless sensor networks have attracted a lot of attention recently. Such environments may consist of many inexpensive nodes, each capable of collecting, storing, and processing environmental information, and communicating with neighboring nodes through ...
Comments