Sciweavers

242 search results - page 23 / 49
» Deterministic small-world communication networks
Sort
View
SPAA
2009
ACM
15 years 6 months ago
Locally scalable randomized consensus for synchronous crash failures
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
Bogdan S. Chlebus, Dariusz R. Kowalski
P2P
2002
IEEE
178views Communications» more  P2P 2002»
15 years 4 months ago
A Scalable and Ontology-Based P2P Infrastructure for Semantic Web Services
Semantic Web Services are a promising combination of Semantic Web and Web service technology, aiming at providing means of automatically executing, discovering and composing seman...
Mario T. Schlosser, Michael Sintek, Stefan Decker,...
INFOCOM
2010
IEEE
14 years 10 months ago
Optimal Linear Network Coding Design for Secure Unicast with Multiple Streams
—Linear network coding is a promising technology that can maximize the throughput capacity of communication network. Despite this salient feature, there are still many challenges...
Jin Wang, Jianping Wang, Kejie Lu, Bin Xiao, Naiji...
GLOBECOM
2006
IEEE
15 years 5 months ago
Efficient Construction of Weakly-Connected Dominating Set for Clustering Wireless Ad Hoc Networks
In most of the proposed clustering algorithms for wireless ad hoc networks, the cluster-heads form a dominating set in the network topology. A variant of dominating set which is mo...
Bo Han, Weijia Jia
IWCMC
2006
ACM
15 years 5 months ago
Multipath fading in wireless sensor networks: measurements and interpretation
Multipath fading heavily contributes to the unreliability of wireless links, causing fairly large deviations from link quality predictions based on path loss models; its impact on...
Daniele Puccinelli, Martin Haenggi