Sciweavers

6122 search results - page 1109 / 1225
» Securing network access in wireless sensor networks
Sort
View
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
Policy-Driven Data Dissemination for Context-Aware Applications
Context-aware pervasive-computing applications require continuous monitoring of their physical and computational environment to make appropriate adaptation decisions in time. The ...
Guanling Chen, David Kotz
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...
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,...
IWNAS
2006
IEEE
15 years 4 months ago
Hint-based Routing in WSNs using Scope Decay Bloom Filters
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...
Xiuqi Li, Jie Wu, Jun (Jim) Xu
« Prev « First page 1109 / 1225 Last » Next »