Sciweavers

52 search results - page 10 / 11
» Network design arc set with variable upper bounds
Sort
View
ICDCS
2007
IEEE
13 years 10 months ago
Communication-Efficient Tracking of Distributed Cumulative Triggers
In recent work, we proposed D-Trigger, a framework for tracking a global condition over a large network that allows us to detect anomalies while only collecting a very limited amo...
Ling Huang, Minos N. Garofalakis, Anthony D. Josep...
PODC
2012
ACM
11 years 8 months ago
Byzantine broadcast in point-to-point networks using local linear coding
The goal of Byzantine Broadcast (BB) is to allow a set of fault-free nodes to agree on information that a source node wants to broadcast to them, in the presence of Byzantine faul...
Guanfeng Liang, Nitin H. Vaidya
FOSSACS
2001
Springer
13 years 10 months ago
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
Rémi Morin
SP
2006
IEEE
100views Security Privacy» more  SP 2006»
14 years 8 days ago
Fundamental Limits on the Anonymity Provided by the MIX Technique
The MIX technique forms the basis of many popular services that offer anonymity of communication in open and shared networks such as the Internet. In this paper, fundamental limit...
Dogan Kesdogan, Dakshi Agrawal, Dang Vinh Pham, Di...
JSAC
2008
140views more  JSAC 2008»
13 years 6 months ago
Optimality and Complexity of Pure Nash Equilibria in the Coverage Game
In this paper, we investigate the coverage problem in wireless sensor networks using a game theory method. We assume that nodes are randomly scattered in a sensor field and the goa...
Xin Ai, Vikram Srinivasan, Chen-Khong Tham