{"issue":"3","publication":"Distributed Computing","date_created":"2018-08-10T07:05:12Z","type":"journal_article","page":"241-254","publication_identifier":{"issn":["0178-2770","1432-0452"]},"_id":"3872","intvolume":"        31","year":"2017","status":"public","author":[{"last_name":"Ogierman","full_name":"Ogierman, Adrian","first_name":"Adrian"},{"first_name":"Andrea","last_name":"Richa","full_name":"Richa, Andrea"},{"last_name":"Scheideler","full_name":"Scheideler, Christian","id":"20792","first_name":"Christian"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"doi":"10.1007/s00446-017-0307-1","abstract":[{"text":"This paper considers the problem of how to efficiently share a wireless medium which is subject to harsh external interference or even jamming. So far, this problem is understood only in simplistic single-hop or unit disk graph models. We in this paper initiate the study of MAC protocols for the SINR interference model (a.k.a. physical model). This paper makes two contributions. First, we introduce a new adversarial SINR model which captures a wide range of interference phenomena. Concretely, we consider a powerful, adaptive adversary which can jam nodes at arbitrary times and which is only limited by some energy budget. Our second contribution is a distributed MAC protocol called Sade which provably achieves a constant competitive throughput in this environment: we show that, with high probability, the protocol ensures that a constant fraction of the non-blocked time periods is used for successful transmissions.","lang":"eng"}],"volume":31,"title":"Sade: competitive MAC under adversarial SINR","publication_status":"published","date_updated":"2022-01-06T06:59:47Z","citation":{"short":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, J. Zhang, Distributed Computing 31 (2017) 241–254.","chicago":"Ogierman, Adrian, Andrea Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Sade: Competitive MAC under Adversarial SINR.” <i>Distributed Computing</i> 31, no. 3 (2017): 241–54. <a href=\"https://doi.org/10.1007/s00446-017-0307-1\">https://doi.org/10.1007/s00446-017-0307-1</a>.","ama":"Ogierman A, Richa A, Scheideler C, Schmid S, Zhang J. Sade: competitive MAC under adversarial SINR. <i>Distributed Computing</i>. 2017;31(3):241-254. doi:<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>","bibtex":"@article{Ogierman_Richa_Scheideler_Schmid_Zhang_2017, title={Sade: competitive MAC under adversarial SINR}, volume={31}, DOI={<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>}, number={3}, journal={Distributed Computing}, publisher={Springer Nature}, author={Ogierman, Adrian and Richa, Andrea and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2017}, pages={241–254} }","mla":"Ogierman, Adrian, et al. “Sade: Competitive MAC under Adversarial SINR.” <i>Distributed Computing</i>, vol. 31, no. 3, Springer Nature, 2017, pp. 241–54, doi:<a href=\"https://doi.org/10.1007/s00446-017-0307-1\">10.1007/s00446-017-0307-1</a>.","ieee":"A. Ogierman, A. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Sade: competitive MAC under adversarial SINR,” <i>Distributed Computing</i>, vol. 31, no. 3, pp. 241–254, 2017.","apa":"Ogierman, A., Richa, A., Scheideler, C., Schmid, S., &#38; Zhang, J. (2017). Sade: competitive MAC under adversarial SINR. <i>Distributed Computing</i>, <i>31</i>(3), 241–254. <a href=\"https://doi.org/10.1007/s00446-017-0307-1\">https://doi.org/10.1007/s00446-017-0307-1</a>"},"publisher":"Springer Nature","user_id":"15504","department":[{"_id":"79"}]}