The Community for Technology Leaders
2010 IEEE 30th International Conference on Distributed Computing Systems (2010)
Genova, Italy
June 21, 2010 to June 25, 2010
ISSN: 1063-6927
ISBN: 978-0-7695-4059-7
pp: 408-417
We consider message-efficient broadcast tolerating Byzantine faults in a multi-hop wireless sensor network. Assuming a grid network where all nodes have a communication range of $r$, and a single neighborhood contains at most $t$ dishonest and collision-capable (bad) nodes, each with a message budget $m_f$, we investigate the minimum message budget $m$ that each honest (good) node must have in order to achieve reliable broadcast. We consider three cases: (1) $m_f$ is known in advance and $m$ is homogeneous among all good nodes, (2) $m_f$ is known in advance and $m$ is heterogeneous among good nodes, (3) $m_f$ is unknown. For the first two cases, we present possibility results and broadcast protocols that have message costs within twice the lower bound. For the third case, we present a coding scheme that helps verify the integrity of messages at a receiving node without using any cryptographic techniques. This code leads to a {\em reactive local broadcast} primitive that has probabilistic reliability guarantees. Combined with a previously proposed scheme, it results in a broadcast protocol for $t
Sensor Network, Broadcast, Byzantine, Fault Tolerant

M. Bertier, G. Tan and A. Kermarrec, "Message-Efficient Byzantine Fault-Tolerant Broadcast in a Multi-hop Wireless Sensor Network," 2010 IEEE 30th International Conference on Distributed Computing Systems(ICDCS), Genova, Italy, 2010, pp. 408-417.
90 ms
(Ver 3.3 (11022016))