Sciweavers

441 search results - page 66 / 89
» Approximate Coverage in Wireless Sensor Networks
Sort
View
INFOCOM
2010
IEEE
14 years 7 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
ALGOSENSORS
2007
Springer
15 years 3 months ago
Assigning Sensors to Missions with Demands
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...
BIOWIRE
2007
Springer
15 years 1 months ago
Self-organizing Desynchronization and TDMA on Wireless Sensor Networks
Desynchronization is a novel primitive for sensor networks: it implies that nodes perfectly interleave periodic events to occur in a round-robin schedule. This primitive can be us...
Julius Degesys, Ian Rose, Ankit Patel, Radhika Nag...
INFOCOM
2007
IEEE
15 years 3 months ago
Optimal Policies for Distributed Data Aggregation in Wireless Sensor Networks
Abstract— We consider the scenario of distributed data aggregation in wireless sensor networks, where each sensor can obtain and estimate the information of the whole sensing fi...
Zhenzhen Ye, Alhussein A. Abouzeid, Jing Ai
APSCC
2007
IEEE
14 years 9 months ago
Joint Sink Mobility and Data Diffusion for Lifetime Optimization in Wireless Sensor Networks
Abstract— In this paper, we address the problem of lifetime optimization under storage constraint for wireless sensor networks with a mobile sink node. The problem is particularl...
Yu Gu, Hengchang Liu, Fei Song, Baohua Zhao