Sciweavers

49 search results - page 4 / 10
» Information Survival Threshold in Sensor and P2P Networks
Sort
View
SIGMOD
2004
ACM
153views Database» more  SIGMOD 2004»
14 years 1 months ago
Spatially-decaying aggregation over a network: model and algorithms
Data items are often associated with a location in which they are present or collected, and their relevance or in uence decays with their distance. Aggregate values over such data...
Edith Cohen, Haim Kaplan
GLOBECOM
2007
IEEE
13 years 11 months ago
Resource Efficient Survivable Clustering for Wireless Sensor Networks
Abstract-- In this paper, we address both lifetime and survivability issues in wireless sensor networks (WSNs). We present an easy-to-implement clustering method called DED (distri...
Mohammad Masud Hasan, Jason P. Jue
DMSN
2005
ACM
13 years 9 months ago
The threshold join algorithm for top-k queries in distributed sensor networks
In this paper we present the Threshold Join Algorithm (TJA), which is an efficient TOP-k query processing algorithm for distributed sensor networks. The objective of a top-k query...
Demetrios Zeinalipour-Yazti, Zografoula Vagena, Di...
WISEC
2010
ACM
13 years 5 months ago
Efficient code diversification for network reprogramming in sensor networks
As sensors in a network are mostly homogeneous in software and hardware, a captured sensor can easily expose its code and data to attackers and further threaten the whole network....
Qijun Gu
ICDCS
2009
IEEE
14 years 4 months ago
Protecting Neighbor Discovery Against Node Compromises in Sensor Networks
The neighborhood information has been frequently used by protocols such as routing in sensor networks. Many methods have been proposed to protect such information in hostile envir...
Donggang Liu