TY - GEN
T1 - A jamming-resistant MAC protocol for single-hop wireless networks
AU - Awerbuch, Baruch
AU - Richa, Andrea
AU - Scheideler, Christian
PY - 2008
Y1 - 2008
N2 - In this paper we consider the problem of designing a medium access control (MAC) protocol for single-hop wireless networks that is provably robust against adaptive adversarial jamming. The wireless network consists of a set of honest and reliable nodes that are within the transmission range of each other. In addition to these nodes there is an adversary. The adversary may know the protocol and its entire history and use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 - ∈)-fraction of the time steps, for an arbitrary constant ∈ > 0, but it has to make a jamming decision before it knows the actions of the nodes at the current step. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant throughput for the non-jammed time steps under any adversarial strategy above. We also show that our protocol is very energy efficient and that it can be extended to obtain a robust and efficient protocol for leader election and the fair use of the wireless channel.
AB - In this paper we consider the problem of designing a medium access control (MAC) protocol for single-hop wireless networks that is provably robust against adaptive adversarial jamming. The wireless network consists of a set of honest and reliable nodes that are within the transmission range of each other. In addition to these nodes there is an adversary. The adversary may know the protocol and its entire history and use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 - ∈)-fraction of the time steps, for an arbitrary constant ∈ > 0, but it has to make a jamming decision before it knows the actions of the nodes at the current step. The nodes cannot distinguish between the adversarial jamming or a collision of two or more messages that are sent at the same time. We demonstrate, for the first time, that there is a local-control MAC protocol requiring only very limited knowledge about the adversary and the network that achieves a constant throughput for the non-jammed time steps under any adversarial strategy above. We also show that our protocol is very energy efficient and that it can be extended to obtain a robust and efficient protocol for leader election and the fair use of the wireless channel.
KW - Jamming
KW - MAC protocols
KW - Wireless ad-hoc networks
UR - http://www.scopus.com/inward/record.url?scp=57549097287&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=57549097287&partnerID=8YFLogxK
U2 - 10.1145/1400751.1400759
DO - 10.1145/1400751.1400759
M3 - Conference contribution
AN - SCOPUS:57549097287
SN - 9781595939890
T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
SP - 45
EP - 54
BT - PODC'08
PB - Association for Computing Machinery (ACM)
T2 - 27th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing
Y2 - 18 August 2008 through 21 August 2008
ER -