Sciweavers

528 search results - page 9 / 106
» Approximation algorithm for minimal convergecast time proble...
Sort
View
ALGOSENSORS
2008
Springer
13 years 9 months ago
Target Counting under Minimal Sensing: Complexity and Approximations
We consider the problem of counting a set of discrete point targets using a network of sensors under a minimalistic model. Each sensor outputs a single integer, the number of disti...
Sorabh Gandhi, Rajesh Kumar 0003, Subhash Suri
AINA
2010
IEEE
14 years 22 days ago
Mobile Element Path Planning for Time-Constrained Data Gathering in Wireless Sensor Networks
— We consider the problem of gathering data from a sensor network using mobile elements. In particular, we consider the case where the data are produced by measurements and need ...
Khaled Almiani, Anastasios Viglas, Lavy Libman
ICDE
2006
IEEE
201views Database» more  ICDE 2006»
14 years 9 months ago
Approximate Data Collection in Sensor Networks using Probabilistic Models
Wireless sensor networks are proving to be useful in a variety of settings. A core challenge in these networks is to minimize energy consumption. Prior database research has propo...
David Chu, Amol Deshpande, Joseph M. Hellerstein, ...
ADHOCNOW
2008
Springer
14 years 2 months ago
Novel Algorithms for the Network Lifetime Problem in Wireless Settings
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
Michael Elkin, Yuval Lando, Zeev Nutov, Michael Se...
JCO
2006
103views more  JCO 2006»
13 years 7 months ago
On optimal placement of relay nodes for reliable connectivity in wireless sensor networks
The paper addresses the relay node placement problem in two-tiered wireless sensor networks. Given a set of sensor nodes in Euclidean plane, our objective is to place minimum numbe...
Hai Liu, Peng-Jun Wan, Xiaohua Jia