Results 1  10
of
6,379
Coverage Problems in Wireless Adhoc Sensor Networks
 in IEEE INFOCOM
, 2001
"... Wireless adhoc sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new systembuilding challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as ..."
Abstract

Cited by 441 (9 self)
 Add to MetaCart
, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. In this paper, we address one of the fundamental problems, namely coverage. Coverage in general, answers the questions about quality of service (surveillance) that can be provided
The Budgeted Maximum Coverage Problem
, 1997
"... The budgeted maximum coverage problem is: given a collection S of sets with associated costs defined over a domain of weighted elements, and a budget L, find a subset of S 0 ` S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0 is maxim ..."
Abstract

Cited by 188 (7 self)
 Add to MetaCart
The budgeted maximum coverage problem is: given a collection S of sets with associated costs defined over a domain of weighted elements, and a budget L, find a subset of S 0 ` S such that the total cost of sets in S 0 does not exceed L, and the total weight of elements covered by S 0
The Coverage Problem in a Wireless Sensor Network
, 2005
"... One of the fundamental issues 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 ne ..."
Abstract

Cited by 292 (8 self)
 Add to MetaCart
One of the fundamental issues 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
The Generalized Maximum Coverage Problem
"... We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 +ɛ)approximation for every ..."
Abstract

Cited by 15 (1 self)
 Add to MetaCart
We define a new problem called the Generalized Maximum Coverage Problem (GMC). GMC is an extension of the Budgeted Maximum Coverage Problem, and it has important applications in wireless OFDMA scheduling. We use a variation of the greedy algorithm to produce a ( 2e−1 e−1 +ɛ)approximation for every
On the Coverage Problem for Myopic Sensors
 In Proc. of the International Conference on Wireless Networks, Communications, and Mobile Computing, WIRELESSCOM 2005, Maui
"... The objective of the coverage problem is to organize the monitoring of targets by sensors in an energy efficient manner so as to maximize the lifetime of coverage. We consider the coverage problem in a network of myopic sensors, such as video sensors and acoustic sensors, which are only able to cove ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The objective of the coverage problem is to organize the monitoring of targets by sensors in an energy efficient manner so as to maximize the lifetime of coverage. We consider the coverage problem in a network of myopic sensors, such as video sensors and acoustic sensors, which are only able
Coverage Problem revisited
"... Motivated by some problems in genome assembling, we investigate properties of spacings from absolutely continuous distributions. Several results on the asymptotic behavior of the maximal uniform and nonuniform kspacings are presented. Applications of these results to the coverage problem for the p ..."
Abstract
 Add to MetaCart
Motivated by some problems in genome assembling, we investigate properties of spacings from absolutely continuous distributions. Several results on the asymptotic behavior of the maximal uniform and nonuniform kspacings are presented. Applications of these results to the coverage problem
Mobile Sensor Network Deployment using Potential Fields: A Distributed, Scalable Solution to the Area Coverage Problem
, 2002
"... This paper considers the problem of deploying a mobile sensor network in an unknown environment. A mobile sensor network is composed of a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. Such networks are capable of selfdeployment; ..."
Abstract

Cited by 343 (15 self)
 Add to MetaCart
This paper considers the problem of deploying a mobile sensor network in an unknown environment. A mobile sensor network is composed of a distributed collection of nodes, each of which has sensing, computation, communication and locomotion capabilities. Such networks are capable of self
On the pcoverage problem on the real line
"... In this paper we consider the pcoverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. Then we analyze how the structure of the optimal solution changes if the setup costs of th ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we consider the pcoverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. Then we analyze how the structure of the optimal solution changes if the setup costs
Approximating lowdimensional coverage problems
 In Symposium on Computational Geometry
, 2012
"... ar ..."
A Set Coverage Problem
"... This paper shows that with B = {1, 2,..., n}, the smallest k such that (B × B) − {(j, j)  j ∈ B} = k⋃ (Ci × Di) i=1. This provides a simple is s(n), where s(n) is the smallest integer k such that n � ( k ⌊ k 2 ⌋ setbased formulation and a new proof of a result for boolean ranks [2] and bicliqu ..."
Abstract
 Add to MetaCart
This paper shows that with B = {1, 2,..., n}, the smallest k such that (B × B) − {(j, j)  j ∈ B} = k⋃ (Ci × Di) i=1. This provides a simple is s(n), where s(n) is the smallest integer k such that n � ( k ⌊ k 2 ⌋ setbased formulation and a new proof of a result for boolean ranks [2] and biclique covering of bipartite graphs [1, 5], making these intricate results more accessible. Key words:
Results 1  10
of
6,379