Sciweavers

70 search results - page 7 / 14
» A Framework for Resilient Online Coverage in Sensor Networks
Sort
View
TNN
2008
119views more  TNN 2008»
13 years 7 months ago
Selecting Useful Groups of Features in a Connectionist Framework
Abstract--Suppose for a given classification or function approximation (FA) problem data are collected using sensors. From the output of the th sensor, features are extracted, ther...
Debrup Chakraborty, Nikhil R. Pal
SASN
2006
ACM
14 years 1 months ago
Location-aware key predistribution scheme for wide area wireless sensor networks
Key predistribution in wireless sensor networks refers to the problem of distributing secret keys among sensors prior to deployment. Solutions appeared in the literature can be cl...
Katerina Simonova, Alan C. H. Ling, Xiaoyang Sean ...
IPSN
2004
Springer
14 years 1 months ago
Distributed particle filters for sensor networks
Abstract. This paper describes two methodologies for performing distributed particle filtering in a sensor network. It considers the scenario in which a set of sensor nodes make m...
Mark Coates
MOBIDE
2010
ACM
13 years 7 months ago
Using data mining to handle missing data in multi-hop sensor network applications
A sensor's data loss or corruption, aka sensor data missing, is a common phenomenon in modern wireless sensor networks. It is more severe for multi-hop sensor network (MSN) a...
Le Gruenwald, Hanqing Yang, Md. Shiblee Sadik, Rah...
GLOBECOM
2009
IEEE
13 years 11 months ago
Tame Pool-Based Pairwise Key Predistribution for Large-Scale Sensor Networks
Many existing pairwise key establishment in sensor networks were developed based on the polynomial-based method. However, this method cannot offer the basic authentication function...
Yen-Hua Liao, Chin-Laung Lei, Ai-Nung Wang, Wen-Ch...