Line Coverage in Wireless Sensor Networks

Abstract

Wireless sensor networks provide an alternative way of improving our environments, such as environment surveillance, hazard monitoring, and other customized environment applications. The quality of these applications depends on good coverage of a sensor network. This paper studies the best-case and worst-case line coverage problems for line paths in sensor networks. Based on computational geometry and graph theory, a plane sweep algorithm is proposed to find the optimal line paths for both coverage problems in polynomial time.