Wei-Fang Cheng

Learn More
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In this work, we study a new coverage scenario, sweep coverage, which differs with the previous static coverage. In sweep coverage, we only need to monitor certain points of interest(More)
Localization is crucial for wireless ad hoc and sensor networks. As the distance-measurement ranges are often less than that of the communication range for many ranging systems, most communication-dense wireless networks are often localization-sparse. Consequently, most existing algorithms fail to provide accurate localization supports. In order to address(More)
Barrier coverage, which guarantees that every movement crossing a barrier of sensors will be detected, is known to be an appropriate model of coverage for moving detection and boundary guard. The related problems about barrier coverage with stationary sensors are extensively studied. When sensors are randomly deployed, we require much more sensors to(More)
Unlike traditional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may be able to switch to several directions and each direction has a limited angle of sensing range. Area coverage is still an essential issue in a directional sensor network which consists of a number of directional sensors. In this paper, we(More)
Being abandoned for farmland seriously affected China's grain output for farmlands. It has become an important phenomenon over the past 20 years in China. Multispectral remote sensing has the advantage of wide range and high speed in requiring data. It has great potential in the research on land use. Therefore, to extract abandoned farmland in China, the(More)
Multipath is a sought-after mechanism to achieve reliability along the error-prone channel in wireless sensor networks. However, its benefits are not easily explored because the critical energy constraints and the multipath interference. In this paper, we first prove that finding several disjoint paths with minimum energy consumption is an NP-complete(More)
  • 1