Sciweavers

147 search results - page 12 / 30
» Dependable k-coverage algorithms for sensor networks
Sort
View
PRDC
2009
IEEE
14 years 1 months ago
An Early-Stopping Protocol for Computing Aggregate Functions in Sensor Networks
Abstract—In this paper, we study algebraic aggregate computations in Sensor Networks. The main contribution is the presentation of an early-stopping protocol that computes the av...
Antonio Fernández Anta, Miguel A. Mosteiro,...
WISEC
2010
ACM
13 years 11 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
IPSN
2004
Springer
14 years 2 days ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
ALGOSENSORS
2004
Springer
14 years 3 days ago
Multi: A Hybrid Adaptive Dissemination Protocol for Wireless Sensor Networks
Abstract. Data dissemination (routing) is a basic function in wireless sensor networks. Dissemination algorithms for those networks depend on the characteristics of the application...
Carlos Mauricio S. Figueiredo, Eduardo Freire Naka...
LCN
2006
IEEE
14 years 22 days ago
Practical Evaluation of the Performance Impact of Security Mechanisms in Sensor Networks
Security has become a major concern for many realworld applications for wireless sensor networks (WSN). In this domain, many security solutions have been proposed. Usually, all th...
Martin Passing, Falko Dressler