@inproceedings{bd4a93fd8eb24d8d88d993e67b8b7bca,
title = "Reliable broadcast in radio networks: The bounded collision case",
abstract = "We study the problem of achieving global broadcast in a radio network where a node can multicast messages to all of its neighbors (that is, nodes within some given distance r), and up to t nodes in any single neighborhood may be corrupted. Previous work assumes that corrupted nodes can neither cause collisions nor spoof addresses of honest nodes. In this work, we eliminate these assumptions and allow each faulty node to cause a (known) bounded number of collisions and spoof the addresses of arbitrary other nodes. We show that the maximum tolerable t in this case is identical to the maximum tolerable t when collisions and address spoofing are not allowed. Thus, by causing collisions and spoofing addresses an adversary may be able to degrade the efficiency of achieving broadcast, but it cannot affect the feasibility of this task.",
keywords = "Broadcast, Byzantine failure, Fault tolerance, Radio networks",
author = "Koo, {Chiu Yuen} and Jonathan Katz and Vartika Bhandari and Vaidya, {Nitin H.}",
year = "2006",
language = "English (US)",
isbn = "1595933840",
series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",
pages = "258--264",
booktitle = "Proceedings of the 25th Annual ACM Symposium on Principles of Distributed Computing 2006",
note = "25th Annual ACM Symposium on Principles of Distributed Computing 2006 ; Conference date: 23-07-2006 Through 26-07-2006",
}