Sciweavers

19 search results - page 3 / 4
» Fault Tolerant All-to-All Broadcast in General Interconnecti...
Sort
View
DIALM
2007
ACM
144views Algorithms» more  DIALM 2007»
13 years 8 months ago
Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures
Reliable broadcast can be a very useful primitive for many distributed applications, especially in the context of sensoractuator networks. Recently, the issue of reliable broadcas...
Vartika Bhandari, Nitin H. Vaidya
ICC
2007
IEEE
13 years 11 months ago
A Novel k-Parent Flooding Tree for Secure and Reliable Broadcasting in Sensor Networks
Abstract— Securing broadcast communication over sensor networks is an important research challenge. In general, broadcast communication has two important metrics: security and re...
Avinash Srinivasan, Jie Wu
PODC
2012
ACM
11 years 7 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
DAC
2003
ACM
14 years 5 months ago
A survey of techniques for energy efficient on-chip communication
Interconnects have been shown to be a dominant source of energy consumption in modern day System-on-Chip (SoC) designs. With a large (and growing) number of electronic systems bei...
Vijay Raghunathan, Mani B. Srivastava, Rajesh K. G...
DAC
2006
ACM
13 years 8 months ago
Steiner network construction for timing critical nets
Conventionally, signal net routing is almost always implemented as Steiner trees. However, non-tree topology is often superior on timing performance as well as tolerance to open f...
Shiyan Hu, Qiuyang Li, Jiang Hu, Peng Li