Sciweavers

562 search results - page 49 / 113
» Positioning in Wireless Sensor Networks Using Array Processi...
Sort
View
SENSYS
2006
ACM
14 years 2 months ago
Run-time dynamic linking for reprogramming wireless sensor networks
From experience with wireless sensor networks it has become apparent that dynamic reprogramming of the sensor nodes is a useful feature. The resource constraints in terms of energ...
Adam Dunkels, Niclas Finne, Joakim Eriksson, Thiem...
SASN
2003
ACM
14 years 2 months ago
SECTOR: secure tracking of node encounters in multi-hop wireless networks
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be u...
Srdjan Capkun, Levente Buttyán, Jean-Pierre...
IS
2011
13 years 4 months ago
Optimized query routing trees for wireless sensor networks
In order to process continuous queries over Wireless Sensor Networks (WSNs), sensors are typically organized in a Query Routing Tree (denoted as T) that provides each sensor with ...
Panayiotis Andreou, Demetrios Zeinalipour-Yazti, A...
MOBIDE
2005
ACM
14 years 2 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
APNOMS
2006
Springer
14 years 22 days ago
Security Approaches for Cluster Interconnection in a Wireless Sensor Network
Abstract. A wireless sensor network is a collection of devices limited in lowpowered batteries, processing, communication bandwidth capabilities and low memory availability. Due to...
Alexandre Gava Menezes, Carlos Becker Westphall