Sciweavers

207 search results - page 39 / 42
» Random Asynchronous Wakeup Protocol for Sensor Networks
Sort
View
MOBIHOC
2004
ACM
14 years 6 months ago
On greedy geographic routing algorithms in sensing-covered networks
Greedy geographic routing is attractive in wireless sensor networks due to its efficiency and scalability. However, greedy geographic routing may incur long routing paths or even ...
Guoliang Xing, Chenyang Lu, Robert Pless, Qingfeng...
ICASSP
2011
IEEE
12 years 11 months ago
Convergence results in distributed Kalman filtering
Abstract—The paper studies the convergence properties of the estimation error processes in distributed Kalman filtering for potentially unstable linear dynamical systems. In par...
Soummya Kar, Shuguang Cui, H. Vincent Poor, Jos&ea...
MOBISYS
2005
ACM
14 years 7 months ago
Shake them up!: a movement-based pairing protocol for CPU-constrained devices
This paper presents a new pairing protocol that allows two CPU-constrained wireless devices Alice and Bob to establish a shared secret at a very low cost. To our knowledge, this i...
Claude Castelluccia, Pars Mutaf
AINA
2007
IEEE
14 years 1 months ago
An Adaptive Localized Algorithm for Multiple Sensor Area Coverage
— Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of t...
Antoine Gallais, Jean Carle
ISCC
2006
IEEE
190views Communications» more  ISCC 2006»
14 years 1 months ago
Time-Critical Underwater Sensor Diffusion with No Proactive Exchanges and Negligible Reactive Floods
— In this paper we study multi-hop ad hoc routing in a scalable Underwater Sensor Network (UWSN), which is a novel network paradigm for ad hoc investigation of the world below th...
Uichin Lee, Jiejun Kong, Joon-Sang Park, Eugenio M...