Sciweavers

279 search results - page 7 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
WIOPT
2010
IEEE
13 years 5 months ago
Lifetime optimization for wireless sensor networks with correlated data gathering
—The nodes in wireless sensor networks often collect correlated measurements. Not taking into account this information redundancy is detrimental to the network lifetime, since co...
Nashat Abughalieh, Yann-Aël Le Borgne, Kris S...
IPSN
2005
Springer
14 years 1 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
ICC
2007
IEEE
101views Communications» more  ICC 2007»
14 years 1 months ago
On the Limitations of Random Sensor Placement for Distributed Signal Detection
— We consider the design of a sensor network for detecting an emitter who if present is known to be located in an interval but whose exact position is unknown. We seek to minimiz...
Zhenyu Tu, Rick S. Blum
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 7 months ago
Optimal Distortion-Power Tradeoffs in Gaussian Sensor Networks
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements ...
Nan Liu, Sennur Ulukus
IPSN
2003
Springer
14 years 20 days ago
A Collaborative Approach to In-Place Sensor Calibration
Abstract. Numerous factors contribute to errors in sensor measurements. In order to be useful, any sensor device must be calibrated to adjust its accuracy against the expected meas...
Vladimir Bychkovskiy, Seapahn Megerian, Deborah Es...