research-article

Principles of Robust Medium Access and an Application to Leader Election

Authors:

Baruch Awerbuch,

Christian Scheideler,

Jin ZhangAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 10, Issue 4

Article No.: 24, Pages 1 - 26

https://doi.org/10.1145/2635818

Published: 13 August 2014 Publication History

Abstract

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.

References

[1]

G. Alnifie and R. Simon. 2007. A multi-channel defense against jamming attacks in wireless sensor networks. In Proceedings of Q2SWinet. 95--104.

Digital Library

[2]

G. Antonoiu, G. Antonoiu, P. K. Srimani, and P. K. Srimani. 1996. A self-stabilizing leader election algorithm for tree graphs. Journal on Parallel and Distributed Computing 34 (1996), 227--232.

Digital Library

[3]

H. Attiya and J. Welch. 2004. Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons, Chapter 3.

Digital Library

[4]

B. Awerbuch. 1987. Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC’87).

Digital Library

[5]

B. Awerbuch, A. Richa, and C. Scheideler. 2008. A jamming-resistant MAC protocol for single-hop wireless networks. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC’08).

Digital Library

[6]

E. Bayraktaroglu, C. King, X. Liu, G. Noubir, R. Rajaraman, and B. Thapa. 2008. On the performance of IEEE 802.11 under jamming. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’08). 1265--1273.

[7]

M. A. Bender, M. Farach-Colton, S. He, B. C. Kuszmaul, and C. E. Leiserson. 2005. Adversarial contention resolution for simple channels. In Proceedings of the Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA’05).

Digital Library

[8]

T. Brown, J. James, and A. Sethi. 2006. Jamming and sensing of encrypted wireless ad hoc networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC’06). 120--130.

Digital Library

[9]

S. Cai, T. Izumi, and K. Wada. 2009. Space complexity of self-stabilizing leader election in passively-mobile anonymous agents. In Proceedings of the 16th International Colloquium on Structural Information and Communication Complexity (SIROCCO’09).

Digital Library

[10]

J. T. Chiang and Y.-C. Hu. 2007. Cross-layer jamming detection and mitigation in wireless broadcast networks. In Proceedings of the Annual International Conference on Mobile Computing and Networking (MOBICOM’07). 346--349.

Digital Library

[11]

B. S. Chlebus, D. R. Kowalski, and M. A. Rokicki. 2006. Adversarial queuing on the multiple-access channel. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC’06).

Digital Library

[12]

A. Czumaj and W. Rytter. 2006. Broadcasting algorithms in radio networks with unknown topology. Journal of Algorithms 60, 2 (2006), 115--143.

Digital Library

[13]

E. W. Dijkstra. 1974. Self-Stabilization in spite of distributed control. Communications of ACM 17, 11 (1974), 643--644.

Digital Library

[14]

S. Dolev, S. Gilbert, R. Guerraoui, F. Kuhn, and C. C. Newport. 2009. The wireless synchronization problem. In Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing (PODC’09). 190--199.

Digital Library

[15]

S. Dolev, S. Gilbert, R. Guerraoui, and C. Newport. 2007a. Gossiping in a multi-channel radio network: An oblivious approach to coping with malicious interference. In Proceedings of the Symposium on Distributed Computing (DISC’07).

Digital Library

[16]

S. Dolev, S. Gilbert, R. Guerraoui, and C. Newport. 2008. Secure communication over radio channels. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC’08). 105--114.

Digital Library

[17]

S. Dolev, S. Gilbert, R. Guerraoui, and C. C. Newport. 2007b. Gossiping in a multi-channel radio network. In Proceedings of the 21st International Symposium on Distributed Computing (DISC’07). 208--222.

Digital Library

[18]

R. G. Gallager, P. A. Humblet, and P. M. Spira. 1983. A distributed algorithm for minimum-weight spanning trees. ACM Transactions on Programming and Language Systems 5, 1 (1983), 66--77.

Digital Library

[19]

S. Ghosh and A. Gupta. 1996. An exercise in fault-containment: self-stabilizing leader election. Information Processing Letters 59, 5 (1996), 281--288.

Digital Library

[20]

S. Gilbert, R. Guerraoui, D. Kowalski, and C. Newport. 2009a. Interference-resilient information exchange. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’09).

[21]

S. Gilbert, R. Guerraoui, D. R. Kowalski, and C. C. Newport. 2009b. Interference-Resilient information exchange. In Proceedings of the 28th IEEE International Conference on Computer Communications (INFOCOM’09). 2249--2257.

[22]

S. Gilbert, R. Guerraoui, and C. Newport. 2006. Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. In Proceedings of OPODIS.

Digital Library

[23]

L. A. Goldberg, P. D. Mackenzie, M. Paterson, and A. Srinivasan. 2000. Contention resolution with constant expected delay. Journal of the ACM 47, 6 (2000).

Digital Library

[24]

J. Hastad, T. Leighton, and B. Rogoff. 1996. Analysis of backoff protocols for mulitiple access channels. SIAM Journal on Computing 25, 4 (1996).

Digital Library

[25]

J. Hromkovic, R. Klasing, A. Pelc, P. Ruzicka, and W. Unger. 2005. Dissemination of Information in Communication Networks: Broadcasting, Gossiping, Leader Election, and Fault-Tolerance (Chapter 8). Springer-Verlag, New York, Chapter 8.

Digital Library

[26]

G. Itkis, C. Lin, and J. Simon. 1995. Deterministic, constant space, self-stabilizing leader election on uniform rings. In Proceedings of the 9th International Workshop on Distributed Algorithms (WDAG’95). 288--302.

Digital Library

[27]

C. Y. Koo, V. Bhandari, J. Katz, and N. H. Vaidya. 2006. Reliable broadcast in radio networks: The bounded collision case. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC’06).

Digital Library

[28]

E. Korach, S. Kutten, and S. Moran. 1990. A modular technique for the design of efficient distributed leader finding algorithms. ACM Transactions on Programming Languages and Systems 12, 1 (1990), 84--101.

Digital Library

[29]

F. Kuhn, T. Moscibroda, and R. Wattenhofer. 2004. Radio network clustering from scratch. In Proceedings of ESA.

[30]

S. Kutten and B. Patt-Shamir. 1997. Time-adaptive self stabilization. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC’97).

Digital Library

[31]

B.-J. Kwak, N.-O. Song, and L. E. Miller. 2005. Performance analysis of exponential backoff. IEEE/ACM Transactions on Networking 13, 2 (2005), 343--355.

Digital Library

[32]

Y. W. Law, L. van Hoesel, J. Doumen, P. Hartel, and P. Havinga. 2005. Energy-efficient link-layer jamming attacks against wireless sensor network MAC protocols. In Proceedings of SASN. 76--88.

Digital Library

[33]

S. Lee, D. Levin, V. Gopalakrishnan, and B. Bhattacharjee. 2007. Backbone construction in selfish wireless networks. In Proceedings of the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS’07).

Digital Library

[34]

M. Li, I. Koutsopoulos, and R. Poovendran. 2007. Optimal jamming attacks and network defense policies in wireless sensor networks. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’07). 1307--1315.

[35]

X. Liu, G. Noubir, R. Sundaram, and S. Tan. 2007. SPREAD: Foiling smart jammers using multi-layer agility. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’07). 2536--2540.

[36]

D. Meier, Y. A. Pignolet, S. Schmid, and R. Wattenhofer. 2009. Speed dating despite jammers. In Proceedings of DCOSS.

Digital Library

[37]

K. Nakano and S. Olariu. 2000. Randomized leader election protocols in radio networks with no collision detection. In Proceedings of the 11th International Conference on Algorithms and Computation (ISAAC’00). Springer-Verlag, 362--373.

Digital Library

[38]

V. Navda, A. Bohra, S. Ganguly, and D. Rubenstein. 2007. Using channel hopping to increase 802.11 resilience to jamming attacks. In Proceedings of the IEEE International Conference on Computer Communications (INFOCOM’07). 2526--2530.

[39]

R. Negi and A. Perrig. 2003. Jamming Analysis of MAC Protocols. Technical Report. Carnegie Mellon University.

[40]

K. Nikano and S. Olariu. 2002. Uniform leader election protocols for radio networks. IEEE Transactions on Parallel and Distributed Systems 13, 5 (2002), 516--526. 2002.1003864

Digital Library

[41]

A. Pelc and D. Peleg. 2005. Feasibility and complexity of broadcasting with random transmission failures. In Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (PODC’05).

Digital Library

[42]

P. Raghavan and Eli Upfal. 1999. Stochastic contention resolution with short delays. SIAM Journal on Computing 28, 2 (1999), 709--719.

Digital Library

[43]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. 2010. A jamming-resistant MAC protocol for multi-hop wireless networks. In Proceedings of the 24th International Symposium on Distributed Computing (DISC’10). 179--193.

Digital Library

[44]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. 2011. Competitive and fair medium access despite reactive jamming. In Proceedings of the 31st International Conference on Distributed Computing Systems (ICDCS).

Digital Library

[45]

A. Richa, C. Scheideler, S. Schmid, and J. Zhang. 2012. Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31st Annual ACM Symposium on Principles of Distributed Computing (PODC’12).

Digital Library

[46]

J. Schmidt, A. Siegel, and A. Srinivasan. 1995. Chernoff-Hoeffding bounds for applications with limited independence. SIAM Journal on Discrete Mathematics 8, 2 (1995), 223--250.

Digital Library

[47]

M. K. Simon, J. K. Omura, R. A. Schultz, and B. K. Levin. 2001. Spread Spectrum Communications Handbook. McGraw-Hill.

[48]

G. Smaragdakis, I. Matta, and A. Bestavros. 2004. SEP: A stable election protocol for clustered heterogeneous wireless sensor networks. In Proceedings of the 2nd International Workshop on Sensor and Actor Network Protocols and Applications (SANPA’04).

[49]

D. Thuente and M. Acharya. 2006. Intelligent jamming in wireless networks with applications to 802.11b and other networks. In Proceedings of MILCOM.

Digital Library

[50]

D. E. Willard. 1986. Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing 15, 2 (1986), 468--477.

Digital Library

[51]

A. D. Wood, J. A. Stankovic, and G. Zhou. 2007. DEEJAM: Defeating energy-efficient jamming in IEEE 802.15.4-based wireless networks. In Proceedings of SECON.

[52]

W. Xu, K. Ma, W. Trappe, and Y. Zhang. 2006. Jamming sensor networks: Attack and defense strategies. IEEE Network 20, 3 (2006), 41--47.

Digital Library

[53]

W. Xu, W. Trappe, Y. Zhang, and T. Wood. 2005. The feasibility of launching and detecting jamming attacks in wireless networks. In Proceedings of the ACM International Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC’05). 46--57.

Digital Library

[54]

W. Xu, T. Wood, and Y. Zhang. 2004. Channel surfing and spatial retreats: Defenses against wireless denial of service. In Proceedings of the Workshop on Wireless Security.

Digital Library

Cited By

Hounkanli KMiller APelc A(2019)Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access ChannelTheoretical Computer Science10.1016/j.tcs.2019.09.020Online publication date: Sep-2019
https://doi.org/10.1016/j.tcs.2019.09.020
Anantharamu LChlebus BKowalski DRokicki M(2019)Packet latency of deterministic broadcasting in adversarial multiple access channelsJournal of Computer and System Sciences10.1016/j.jcss.2018.07.00199(27-52)Online publication date: Feb-2019
https://doi.org/10.1016/j.jcss.2018.07.001
Hounkanli KMiller APelc A(2017)Global Synchronization and Consensus Using Beeps in a Fault-Prone MACAlgorithms for Sensor Systems10.1007/978-3-319-53058-1_2(16-28)Online publication date: 24-Jan-2017
https://doi.org/10.1007/978-3-319-53058-1_2
Show More Cited By

Index Terms

Principles of Robust Medium Access and an Application to Leader Election
1. Networks
  1. Network properties
    1. Network structure
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Scheduling algorithms
    2. Online algorithms
      1. Online learning algorithms
        Scheduling algorithms
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning
        Sequential decision making

Recommendations

A jamming-resistant MAC protocol for single-hop wireless networks
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing

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 ...
Competitive and fair throughput for co-existing networks under adversarial interference
PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing

This paper initiates the formal study of a fundamental problem: How to efficiently allocate a shared communication medium among a set of K co-existing networks in the presence of arbitrary external interference? While most literature on medium access ...
A medium access protocol exploiting multiuser-detection in CDMA ad-hoc networks

A new medium access protocol which exploits the physical layer capability of multiuser detection is proposed to help in improving the throughput/delay performance of ad-hoc networks. When more than one node has packets buffered for a common node in the ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 10, Issue 4

August 2014

190 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/2660854

Editor:
Susanne Albers
Technische Universität München

Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 August 2014

Accepted: 01 May 2013

Revised: 01 April 2013

Received: 01 November 2011

Published in TALG Volume 10, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
214
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Hounkanli KMiller APelc A(2019)Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access ChannelTheoretical Computer Science10.1016/j.tcs.2019.09.020Online publication date: Sep-2019
https://doi.org/10.1016/j.tcs.2019.09.020
Anantharamu LChlebus BKowalski DRokicki M(2019)Packet latency of deterministic broadcasting in adversarial multiple access channelsJournal of Computer and System Sciences10.1016/j.jcss.2018.07.00199(27-52)Online publication date: Feb-2019
https://doi.org/10.1016/j.jcss.2018.07.001
Hounkanli KMiller APelc A(2017)Global Synchronization and Consensus Using Beeps in a Fault-Prone MACAlgorithms for Sensor Systems10.1007/978-3-319-53058-1_2(16-28)Online publication date: 24-Jan-2017
https://doi.org/10.1007/978-3-319-53058-1_2
Dams JHoefer MKesselheim T(2016)Jamming-Resistant Learning in Wireless NetworksIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2015.248662224:5(2809-2818)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1109/TNET.2015.2486622
Janson TTraub-Ens ASchindelhauer C(2016)Turning interferences into noise in ad hoc networksTelecommunications Systems10.1007/s11235-015-0084-862:2(435-448)Online publication date: 1-Jun-2016
https://dl.acm.org/doi/10.1007/s11235-015-0084-8
Klonowski MPajak DBlelloch GAgrawal K(2015)Electing a Leader in Wireless Networks Quickly Despite JammingProceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures10.1145/2755573.2755602(304-312)Online publication date: 13-Jun-2015
https://dl.acm.org/doi/10.1145/2755573.2755602

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents