Sciweavers

5813 search results - page 1054 / 1163
» Sensor Networks
Sort
View
EWSN
2009
Springer
15 years 10 months ago
Solving the Wake-Up Scattering Problem Optimally
Abstract. In their EWSN'07 paper [1], Giusti et al. proposed a decentralized wake-up scattering algorithm for temporally spreading the intervals in which the nodes of a wirele...
Luigi Palopoli, Roberto Passerone, Amy L. Murphy, ...
PODS
2006
ACM
96views Database» more  PODS 2006»
15 years 10 months ago
Efficient gossip-based aggregate computation
Recently, there has been a growing interest in gossip-based protocols that employ randomized communication to ensure robust information dissemination. In this paper, we present a ...
Srinivas R. Kashyap, Supratim Deb, K. V. M. Naidu,...
PERCOM
2005
ACM
15 years 9 months ago
When Does Opportunistic Routing Make Sense?
Different opportunistic routing protocols have been proposed recently for routing in sensor networks. These protocols exploit the redundancy among nodes by using a node that is av...
Adam Wolisz, Jan M. Rabaey, Rahul C. Shah, Sven Wi...
EWSN
2010
Springer
15 years 7 months ago
Radio Interferometric Angle of Arrival Estimation
Abstract. Several localization algorithms exist for wireless sensor networks that use angle of arrival measurements to estimate node position. However, there are limited options fo...
Isaac Amundson, János Sallai, Xenofon D. Ko...
GLOBECOM
2009
IEEE
15 years 4 months ago
Data Acquisition through Joint Compressive Sensing and Principal Component Analysis
—In this paper we look at the problem of accurately reconstructing distributed signals through the collection of a small number of samples at a data gathering point. The techniqu...
Riccardo Masiero, Giorgio Quer, Daniele Munaretto,...
« Prev « First page 1054 / 1163 Last » Next »