Sciweavers

1397 search results - page 136 / 280
» Online data cleaning in wireless sensor networks
Sort
View
UIC
2007
Springer
15 years 7 months ago
A Lightweight Scheme for Node Scheduling in Wireless Sensor Networks
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...
Ming Liu, Yuan Zheng, Jiannong Cao, Wei Lou, Guiha...
IPSN
2005
Springer
15 years 7 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
AINA
2007
IEEE
15 years 8 months ago
Efficient Hybrid Channel Access for Data Intensive Sensor Networks
In this paper, we introduce novel probabilistic transmission protocols for data intensive wireless sensor networks. The protocols combine a randomized transmission scheme with sch...
Chih-Kuang Lin, Vladimir Zadorozhny, Prashant Kris...
IJAHUC
2006
128views more  IJAHUC 2006»
15 years 1 months ago
Avoid 'void' in geographic routing for data aggregation in sensor networks
: Wireless sensor networks have attracted great attention in research and industrial development due to its fast-growing application potentials. New techniques must be developed fo...
Shigang Chen, Guangbin Fan, Jun-Hong Cui
COMCOM
2011
14 years 8 months ago
Reconstructing social interactions using an unreliable wireless sensor network
In the very active field of complex networks, research advances have largely been stimulated by the availability of empirical data and the increase in computational power needed ...
Adrien Friggeri, Guillaume Chelius, Eric Fleury, A...