Broadcast in radio networks tolerating byzantine adversarial behavior
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
On reliable broadcast in a radio network
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Reliable broadcast in radio networks: the bounded collision case
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We consider the problem of reliable broadcast tolerating Byzantine faults in a message-bounded radio network. Following the same model as in [4] and with a different assumption on the message bounds of nodes, we investigate the possibility of reliable broadcast given the communication range, message bounds of honest and dishonest nodes, and the maximum number of dishonest nodes per neighborhood.