Sciweavers

441 search results - page 55 / 89
» Approximate Coverage in Wireless Sensor Networks
Sort
View
127
Voted
IPSN
2009
Springer
15 years 10 months ago
Approximating sensor network queries using in-network summaries
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
Alexandra Meliou, Carlos Guestrin, Joseph M. Helle...
JSAC
2008
140views more  JSAC 2008»
15 years 3 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham
COMPGEOM
2006
ACM
15 years 9 months ago
Minimum-cost coverage of point sets by disks
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
Helmut Alt, Esther M. Arkin, Hervé Brö...
WIOPT
2006
IEEE
15 years 9 months ago
Optimizing data replication for expanding ring-based queries in wireless sensor networks
We consider the problem of optimizing the number of replicas for event information in wireless sensor networks, when queries are disseminated using expanding rings. We obtain clos...
Bhaskar Krishnamachari, Joon Ahn
124
Voted
VTC
2010
IEEE
180views Communications» more  VTC 2010»
15 years 1 months ago
Analysis of Enhanced Deployment Models for Sensor Networks
Abstract—We present the estimation and evaluation of deployment models for sensor networks that exploit different amounts of a priori information. Topologies generated from the m...
Frank Oldewurtel, Petri Mähönen