Sciweavers

292 search results - page 19 / 59
» Communication and Round Efficient Information Checking Proto...
Sort
View
CONEXT
2009
ACM
13 years 8 months ago
Scaling all-pairs overlay routing
This paper presents and experimentally evaluates a new algorithm for efficient one-hop link-state routing in full-mesh networks. Prior techniques for this setting scale poorly, as...
David Sontag, Yang Zhang, Amar Phanishayee, David ...
KIVS
2011
Springer
12 years 10 months ago
A Feasibility Check for Geographical Cluster Based Routing under Inaccurate Node Localization in Wireless Sensor Networks
Localized geographic single path routing along a wireless network graph requires exact location information about the network nodes to assure message delivery guarantees. Node loc...
Hannes Frey, Ranjith Pillay
CAV
2006
Springer
132views Hardware» more  CAV 2006»
13 years 11 months ago
Symmetry Reduction for Probabilistic Model Checking
We present an approach for applying symmetry reduction techniques to probabilistic model checking, a formal verification method for the quantitative analysis of systems with stocha...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
PODC
2009
ACM
14 years 8 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
NETWORK
2010
158views more  NETWORK 2010»
13 years 2 months ago
Broadcasting safety information in vehicular networks: issues and approaches
A primary goal of intelligent transportation systems is to improve road safety. The ability of vehicles to communicate is a promising way to alleviate traffic accidents by reducin...
R. Chen, Wen-Long Jin, A. Regan