Sciweavers

279 search results - page 11 / 56
» Randomized k-Coverage Algorithms For Dense Sensor Networks
Sort
View
ISCIS
2005
Springer
14 years 1 months ago
Computing Communities in Large Networks Using Random Walks
Dense subgraphs of sparse graphs (communities), which appear in most real-world complex networks, play an important role in many contexts. Computing them however is generally expe...
Pascal Pons, Matthieu Latapy
ICASSP
2009
IEEE
14 years 2 months ago
Time-space-sequential algorithms for distributed Bayesian state estimation in serial sensor networks
We consider distributed estimation of a time-dependent, random state vector based on a generally nonlinear/non-Gaussian state-space model. The current state is sensed by a serial ...
Ondrej Hlinka, Franz Hlawatsch
GLOBECOM
2010
IEEE
13 years 5 months ago
Finding and Mending Barrier Gaps in Wireless Sensor Networks
Constructing sensing barriers using wireless sensor networks has important applications in military operations and homeland security. The goal of forming a sensing barrier is to de...
Anwar Saipulla, Benyuan Liu, Jie Wang
TSP
2010
13 years 2 months ago
Greedy gossip with eavesdropping
Abstract-- This paper presents greedy gossip with eavesdropping (GGE), a new average consensus algorithm for wireless sensor network applications. Consensus algorithms have recentl...
Deniz Üstebay, Boris N. Oreshkin, Mark Coates...
CISS
2007
IEEE
14 years 1 months ago
Coverage-Based Information Retrieval for Lifetime Maximization in Sensor Networks
—We consider information retrieval in a wireless sensor network deployed to monitor a spatially correlated random field. We address sensor scheduling in each data collection und...
Tong Zhao, Qing Zhao