{"type":"journal_article","file_date_updated":"2018-03-20T07:02:33Z","issue":"4","publication":"Transactions on Algorithms","date_created":"2017-10-17T12:42:07Z","title":"Principles of Robust Medium Access and an Application to Leader Election","date_updated":"2022-01-06T06:59:47Z","status":"public","has_accepted_license":"1","author":[{"first_name":"Baruch","full_name":"Awerbuch, Baruch","last_name":"Awerbuch"},{"first_name":"Andrea W.","last_name":"Richa","full_name":"Richa, Andrea W."},{"full_name":"Scheideler, Christian","last_name":"Scheideler","first_name":"Christian","id":"20792"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jin","full_name":"Zhang, Jin","last_name":"Zhang"}],"_id":"387","year":"2014","ddc":["040"],"abstract":[{"lang":"eng","text":"This article studies the design of medium access control (MAC) protocols for wireless networks that are provably robust against arbitrary and unpredictable disruptions (e.g., due to unintentional external interference from co-existing networks or due to jamming). We consider a wireless network consisting of a set of n honest and reliable nodes within transmission (and interference) range of each other, and we model the external disruptions with a powerful adaptive adversary. This adversary may know the protocol and its entire history and can use this knowledge to jam the wireless channel at will at any time. It is allowed to jam a (1 − )-fraction of the timesteps, for an arbitrary constant > 0 unknown to the nodes. 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 (asymptotically optimal) throughput for the nonjammed time periods under any of the aforementioned adversarial strategies. The derived principles are also useful to build robust applications on top of the MAC layer, and we present an exemplary study for leader election, one of the most fundamental tasks in distributed computing."}],"doi":"10.1145/2635818","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Subprojekt C1","_id":"13"},{"_id":"4","name":"SFB 901 - Project Area C"}],"department":[{"_id":"79"}],"file":[{"file_name":"387-a24-awerbuch_2_.pdf","creator":"florida","date_updated":"2018-03-20T07:02:33Z","file_size":521454,"file_id":"1388","access_level":"closed","date_created":"2018-03-20T07:02:33Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"citation":{"mla":"Awerbuch, Baruch, et al. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>.","apa":"Awerbuch, B., Richa, A. W., Scheideler, C., Schmid, S., &#38; Zhang, J. (2014). Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>, (4). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>","ieee":"B. Awerbuch, A. W. Richa, C. Scheideler, S. Schmid, and J. Zhang, “Principles of Robust Medium Access and an Application to Leader Election,” <i>Transactions on Algorithms</i>, no. 4, 2014.","short":"B. Awerbuch, A.W. Richa, C. Scheideler, S. Schmid, J. Zhang, Transactions on Algorithms (2014).","bibtex":"@article{Awerbuch_Richa_Scheideler_Schmid_Zhang_2014, title={Principles of Robust Medium Access and an Application to Leader Election}, DOI={<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>}, number={4}, journal={Transactions on Algorithms}, publisher={ACM}, author={Awerbuch, Baruch and Richa, Andrea W. and Scheideler, Christian and Schmid, Stefan and Zhang, Jin}, year={2014} }","ama":"Awerbuch B, Richa AW, Scheideler C, Schmid S, Zhang J. Principles of Robust Medium Access and an Application to Leader Election. <i>Transactions on Algorithms</i>. 2014;(4). doi:<a href=\"https://doi.org/10.1145/2635818\">10.1145/2635818</a>","chicago":"Awerbuch, Baruch, Andrea W. Richa, Christian Scheideler, Stefan Schmid, and Jin Zhang. “Principles of Robust Medium Access and an Application to Leader Election.” <i>Transactions on Algorithms</i>, no. 4 (2014). <a href=\"https://doi.org/10.1145/2635818\">https://doi.org/10.1145/2635818</a>."},"publisher":"ACM","user_id":"477"}