Sciweavers

5815 search results - page 1065 / 1163
» Self-monitoring for sensor networks
Sort
View
114
Voted
CCS
2008
ACM
15 years 2 months ago
Efficient security primitives derived from a secure aggregation algorithm
By functionally decomposing a specific algorithm (the hierarchical secure aggregation algorithm of Chan et al. [3] and Frikken et al. [7]), we uncover a useful general functionali...
Haowen Chan, Adrian Perrig
125
Voted
NETWORK
2008
139views more  NETWORK 2008»
15 years 19 days ago
Composing semantic services in open sensor-rich environments
Consider a scenario where Jane is at an airport. She wants to find a restaurant with healthy food and short waiting time on the way to her terminal. The airport can provide such s...
Jie Liu, Feng Zhao
127
Voted
AAAI
2004
15 years 2 months ago
Intelligent Systems Demonstration: The Secure Wireless Agent Testbed (SWAT)
We will demonstrate the Secure Wireless Agent Testbed (SWAT), a unique facility developed at Drexel University to study integration, networking and information assurance for next-...
Gustave Anderson, Andrew Burnheimer, Vincent A. Ci...
125
Voted
EWSN
2009
Springer
16 years 1 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»
16 years 24 days 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,...
« Prev « First page 1065 / 1163 Last » Next »