Sciweavers

2429 search results - page 24 / 486
» Toposemantic Network Clustering
Sort
View
GLOBECOM
2010
IEEE
14 years 7 months ago
Maximization of Data Gathering in Clustered Wireless Sensor Networks
In this paper, we investigate the maximization of the amount of gathered data in a clustered wireless sensor network (WSN). The amount of gathered data is maximized by (1) choosing...
Tianqi Wang, Wendi Rabiner Heinzelman, Alireza Sey...
IPL
2000
76views more  IPL 2000»
14 years 9 months ago
Deterministic small-world communication networks
Many real life networks, including the World Wide Web, electric power grids, and social networks, are small-world networks. The two distinguishing characteristics of small-world n...
Francesc Comellas, Javier Ozón, Joseph G. P...
CLUSTER
2011
IEEE
13 years 9 months ago
Incorporating Network RAM and Flash into Fast Backing Store for Clusters
—We present Nswap2L, a fast backing storage system for general purpose clusters. Nswap2L implements a single device interface on top of multiple heterogeneous physical storage de...
Tia Newhall, Douglas Woos
CORR
2007
Springer
126views Education» more  CORR 2007»
14 years 9 months ago
Interference and Outage in Clustered Wireless Ad Hoc Networks
—In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, th...
Radha Krishna Ganti, Martin Haenggi
71
Voted
CJ
2010
128views more  CJ 2010»
14 years 9 months ago
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
Ajoy Kumar Datta, Lawrence L. Larmore, Priyanka Ve...