Sciweavers

279 search results - page 29 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
PODC
2009
ACM
14 years 6 days ago
Brief announcement: locality-based aggregate computation in wireless sensor networks
We present DRR-gossip, an energy-efficient and robust aggregate computation algorithm in wireless sensor networks. We prove that the DRR-gossip algorithm requires O(n) messages a...
Jen-Yeu Chen, Gopal Pandurangan, Jianghai Hu
AINA
2008
IEEE
14 years 2 months ago
Senceive: A Middleware for a Wireless Sensor Network
— A significant amount of research effort is being carried out by the research community to increase the scope and usefulness of wireless sensor networks; to optimise life time ...
Christian Hermann, Waltenegus Dargie
TIP
2008
126views more  TIP 2008»
13 years 7 months ago
Maximum-Entropy Expectation-Maximization Algorithm for Image Reconstruction and Sensor Field Estimation
Abstract--In this paper, we propose a maximum-entropy expectation-maximization (MEEM) algorithm. We use the proposed algorithm for density estimation. The maximum-entropy constrain...
Hunsop Hong, Dan Schonfeld
IPSN
2011
Springer
12 years 11 months ago
Exploration of path space using sensor network geometry
In a sensor network there are many paths between a source and a destination. An efficient method to explore and navigate in the ‘path space’ can help many important routing p...
Ruirui Jiang, Xiaomeng Ban, Mayank Goswami, Wei Ze...
PIMRC
2010
IEEE
13 years 5 months ago
On the feasibility of receive collaboration in wireless sensor networks
In this paper, a new type of collaboration in wireless sensor networks (WSN) is suggested that exploits array processing algorithms for better reception of a signal. For receive co...
Behnam Banitalebi, S. Sigg, M. Beigl