Results 1  10
of
212,336
Localized sensor selfdeployment with coverage guarantee
 ACM SIGMOBILE Mobile Computing and Communications Review
"... We pinpoint a new sensor selfdeployment problem, achieving focused coverage around a Point of Interest (POI), and introduce an evaluation metric, coverage radius. We propose two purely localized solution protocols Greedy Advance (GA) and GreedyRotationGreedy (GRG), both of which are resilient to ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We pinpoint a new sensor selfdeployment problem, achieving focused coverage around a Point of Interest (POI), and introduce an evaluation metric, coverage radius. We propose two purely localized solution protocols Greedy Advance (GA) and GreedyRotationGreedy (GRG), both of which are resilient
Domination and Coverage Guarantees Through Distributed Computation
"... Node domination and coverage problems form the basis of several important resource allocation problems in communication networks and information systems. The problems are invariably NPhard. Worst case approximation guarantees can however be obtained through existing polynomial complexity approximati ..."
Abstract
 Add to MetaCart
Node domination and coverage problems form the basis of several important resource allocation problems in communication networks and information systems. The problems are invariably NPhard. Worst case approximation guarantees can however be obtained through existing polynomial complexity
GPR the Federal Contraceptive Coverage Guarantee: Progress and Prospects, ” Fall 2013).
"... more specific objections by specific employers. In both cases, the businesses are forprofit corporations owned privately by members of a single family, and both the owners and the corporations themselves are plaintiffs. In both cases, the plaintiffs object not to coverage of all contraceptive met ..."
Abstract
 Add to MetaCart
in a process that results in their employees obtaining coverage for contraception. All of these cases involve various legal claims and complexities, including challenges under the First Amendment’s protection for religious A fter years of controversy, the federal contraceptive coverage guarantee under
Minimizing Seed Set Selection with Probabilistic Coverage Guarantee in a Social Network
"... A topic propagating in a social network reaches its tipping point if the number of users discussing it in the network exceeds a critical threshold such that a wide cascade on the topic is likely to occur. In this paper, we consider the task of selecting initial seed users of a topic with minimum si ..."
Abstract
 Add to MetaCart
size so that with a guaranteed probability the number of users discussing the topic would reach a given threshold. We formulate the task as an optimization problem called seed minimization with probabilistic coverage guarantee (SMPCG). This problem departs from the previous studies on social in
Lifetime and Coverage Guarantees Through Distributed CoordinateFree Sensor Activation
"... Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distributed sensing of a target field. Each sensor is a small batteryoperated device that can sense events of interest in its sens ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
Wireless Sensor Networks are emerging as a key sensing technology, with diverse military and civilian applications. In these networks, a large number of sensors perform distributed sensing of a target field. Each sensor is a small batteryoperated device that can sense events of interest in its sensing range and can communicate with neighboring sensors. A sensor cover is a subset of the set of all sensors such that every point in the target field is in the interior of the sensing ranges of at least k different sensors in the subset, where k is a given positive integer. The lifetime of the network is the time from the point the network starts operation until the set of all sensors with nonzero remaining energy does not constitute a sensor cover. An important goal in sensor networks is to design a schedule, that is, a sequence
Implementing the federal contraceptive coverage guarantee: progress and prospects. Guttmacher Policy Rev
, 2013
"... Background—The Affordable Care Act requires most private health plans to cover contraceptive methods, services and counseling, without any outofpocket costs to patients; that requirement took effect for millions of Americans in January 2013. Study design—Data for this study come from a subset of t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
injectable contraception, the vaginal ring and the intrauterine device. Conclusions—The implementation of the federal contraceptive coverage requirement appears to have had a notable impact on the outofpocket costs paid by privately insured women, and that
Poster Abstract: Localized Sensor SelfDeployment with Coverage Guarantee
"... We pinpoint a new sensor selfdeployment problem, achieving focused coverage around a Point of Interest (POI), and introduce an evaluation metric, coverage radius. We propose two purely localized solution protocols Greedy Advance (GA) and GreedyRotationGreedy (GRG), both of which are resilient to ..."
Abstract
 Add to MetaCart
We pinpoint a new sensor selfdeployment problem, achieving focused coverage around a Point of Interest (POI), and introduce an evaluation metric, coverage radius. We propose two purely localized solution protocols Greedy Advance (GA) and GreedyRotationGreedy (GRG), both of which are resilient
Article CoverageGuaranteed Sensor Node Deployment Strategies for Wireless Sensor Networks
, 2010
"... sensors ..."
A Search Algorithm for Teams of Heterogeneous Agents with Coverage Guarantees
"... Among common ISR tasks, searching for a target in a complex environment is a problem for which autonomous systems are well suited. This work considers the problem of searching for targets using a team of heterogeneous agents. The system maintains a gridbased world model which contains information a ..."
Abstract
 Add to MetaCart
about the probability that a target is located in a given cell of the map. Agents formulate control decisions for a fixed number of time steps using a modular algorithm that allows parameterizations of agent capabilities. This paper investigates a solution that guarantees total map coverage. The control
1 Lifetime and Coverage Guarantees Through Distributed CoordinateFree Sensor Activation
"... Abstract—In wireless sensor networks, a large number of sensors perform distributed sensing of a target field. A sensor cover is a subset of the set of all sensors that covers the target field. The lifetime of the network is the time from the point the network starts operation until the set of all s ..."
Abstract
 Add to MetaCart
Abstract—In wireless sensor networks, a large number of sensors perform distributed sensing of a target field. A sensor cover is a subset of the set of all sensors that covers the target field. The lifetime of the network is the time from the point the network starts operation until the set of all sensors with nonzero remaining energy does not constitute a sensor cover any more. An important goal in sensor networks is to design a schedule, that is, a sequence of sensor covers to activate in every time slot, so as to maximize the lifetime of the network. In this paper, we design a polynomialtime, distributed algorithm for maximizing the lifetime of the network and prove that its lifetime is at most a factor O(log n ∗ log nB) lower than the maximum possible lifetime, where n is the number of sensors and B is an upper bound on the initial energy of each sensor. Our algorithm does not require knowledge of the locations of nodes or directional information, which is difficult to obtain in sensor networks. Each sensor only needs to know the distances between adjacent nodes in its transmission range and their sensing radii. In every slot, the algorithm first assigns a weight to each node that is exponential in the fraction of its initial energy that has been used up so far. Then, in a distributed manner, it finds an O(log n) approximate minimum weight sensor cover, which it activates in the slot.
Results 1  10
of
212,336