Sciweavers

279 search results - page 52 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
INFOCOM
2008
IEEE
14 years 2 months ago
Probabilistic Approach to Provisioning Guaranteed QoS for Distributed Event Detection
—It has been of significant importance to provision network-wide guaranteed QoS for a wide range of event detection applications in wireless sensor networks (WSNs). This paper in...
Yanmin Zhu, Lionel M. Ni
CISS
2008
IEEE
14 years 2 months ago
A distributed scheme for detection of information flows
—Distributed detection of information flows spanning many nodes in a wireless sensor network is considered. In such a system, eavesdroppers are deployed near several nodes in th...
Ameya Agaskar, Lang Tong, Ting He
IPPS
2005
IEEE
14 years 1 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu
CORR
2007
Springer
144views Education» more  CORR 2007»
13 years 7 months ago
Distributing the Kalman Filter for Large-Scale Systems
This paper derives a near optimal distributed Kalman filter to estimate a large-scale random field monitored by a network of N sensors. The field is described by a sparsely con...
Usman A. Khan, José M. F. Moura
CCR
2006
117views more  CCR 2006»
13 years 7 months ago
Efficient and decentralized computation of approximate global state
Abstract-- The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Inte...
S. Keshav