Abstract-The usage of wireless sensor networks (WSNs) to monitor a region is an important functionality in defense and security applications. In these applications, a fundamental issue is to determine the minimum degree of coverage in the concerned region. The past researches focus on the binary disk sensing model, where sensors are assumed to be accurate in detecting targets within their sensing ranges. In this paper, we investigate the coverage problem under a more realistic model, the probabilistic sensing model, in which the probability of detection by a sensor decays with the distances. We generalize the coverage problem to the probabilistic sensing model and propose an algorithm to calculate the minimum degree of coverage. The accuracy of the proposed algorithm is verified via simulations.
Given an edge-weighted graph G and two distinct vertices s and t of G, the next-to-shortest path problem asks for a path from s to t of minimum length among all paths from s to t except the shortest ones. In this article, we consider the version where G is directed and all edge weights are positive. Some properties of the requested path are derived when G is an arbitrary digraph. In addition, if G is planar, an O(n 3 )-time algorithm is proposed, where n is the number of vertices of G.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.