A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks
Uloženo v:
| Název: | A Jamming-Resistant MAC Protocol for Single-Hop Wireless Networks |
|---|---|
| Autoři: | Baruch Awerbuch, Andrea Richa, Christian Scheideler |
| Přispěvatelé: | The Pennsylvania State University CiteSeerX Archives |
| Zdroj: | http://www.public.asu.edu/~aricha/mypapers/podc08.pdf. |
| Rok vydání: | 2008 |
| Sbírka: | CiteSeerX |
| Témata: | Categories and Subject Descriptors C.2.5 [Computer-Communication Networks, Local and Wide- Area Networks—Access schemes, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Sequencing and scheduling General Terms Algorithms, Reliability, Theory Keywords wireless ad-hoc networks, MAC protocols, jamming ∗ Supported by NSF CCF 0515080, ANIR-0240551, CCR |
| Popis: | 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. |
| Druh dokumentu: | text |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| Relation: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.6406; http://www.public.asu.edu/~aricha/mypapers/podc08.pdf |
| Dostupnost: | http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.6406 http://www.public.asu.edu/~aricha/mypapers/podc08.pdf |
| Rights: | Metadata may be used without restrictions as long as the oai identifier remains attached to it. |
| Přístupové číslo: | edsbas.5CA09E5E |
| Databáze: | BASE |
Nájsť tento článok vo Web of Science | Abstrakt: | 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. |
|---|