Sciweavers

165 search results - page 20 / 33
» Sensor Graphs for Guaranteed Cooperative Localization Perfor...
Sort
View
CORR
2012
Springer
209views Education» more  CORR 2012»
13 years 7 months ago
Densest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and ...
Bahman Bahmani, Ravi Kumar, Sergei Vassilvitskii
IPSN
2005
Springer
15 years 5 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu
ADHOC
2005
102views more  ADHOC 2005»
14 years 11 months ago
Localized LMST and RNG based minimum-energy broadcast protocols in ad hoc networks
In the minimum energy broadcasting problem, each node adjusts its transmission power to minimize the total energy consumption while still guaranteeing the full coverage of the net...
Julien Cartigny, François Ingelrest, David ...
114
Voted
SAMOS
2007
Springer
15 years 5 months ago
k  +   Neigh : An Energy Efficient Topology Control for Wireless Sensor Networks
For most applications in wireless sensor networks (WSNs), it is often assumed that the deployment of sensor nodes is unmanaged and random, so the density of local node may vary thr...
Dong-Min Son, Young-Bae Ko
SECON
2010
IEEE
14 years 9 months ago
Back-Tracking Based Sensor Deployment by a Robot Team
Existing solutions to carrier-based sensor placement by a single robot, in a bounded unknown region of interest (ROI), do not guarantee full area coverage and/or do not terminate. ...
Greg Fletcher, Xu Li, Amiya Nayak, Ivan Stojmenovi...