Papers
Topics
Authors
Recent
Search
2000 character limit reached

A Survey on Adversarial Contention Resolution

Published 6 Mar 2024 in cs.DC | (2403.03876v4)

Abstract: Contention resolution addresses the challenge of coordinating access by multiple processes to a shared resource such as memory, disk storage, or a communication channel. Originally spurred by challenges in database systems and bus networks, contention resolution has endured as an important abstraction for resource sharing, despite decades of technological change. Here, we survey the literature on resolving worst-case contention, where the number of processes and the time at which each process may start seeking access to the resource is dictated by an adversary. We also highlight the evolution of contention resolution, where new concerns -- such as security, quality of service, and energy efficiency -- are motivated by modern systems. These efforts have yielded insights into the limits of randomized and deterministic approaches, as well as the impact of different model assumptions such as global clock synchronization, knowledge of the number of processors, feedback from access attempts, and attacks on the availability of the shared resource.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (192)
  1. Contention resolution with message deadlines. In Christian Scheideler and Michael Spear, editors, SPAA ’20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020, pages 23–35. ACM, 2020.
  2. Broadcasting on adversarial multiple access channels. In 2019 IEEE 18th International Symposium on Network Computing and Applications (NCA), pages 1–4, 2019.
  3. N. Alon and J.H. Spencer. The Probabilistic Method. Wiley Series in Discrete Mathematics and Optimization. Wiley, 2016.
  4. A lower bound for radio broadcast. Journal of Computer and System Sciences, 43(2):290–298, 1991.
  5. Broadcasting in ad hoc multiple access channels. Theoretical Computer Science, 584:155–176, 2015.
  6. Deterministic broadcast on multiple access channels. In 2010 Proceedings IEEE INFOCOM, pages 1–5. IEEE, 2010.
  7. Medium access control for adversarial channels with jamming. In International Colloquium on Structural Information and Communication Complexity, pages 89–100. Springer, 2011.
  8. Packet latency of deterministic broadcasting in adversarial multiple access channels. Journal of Computer and System Sciences, 99:27–52, 2019.
  9. Adversarial multiple access channel with individual injection rates. In International Conference On Principles Of Distributed Systems, pages 174–188. Springer, 2009.
  10. Adversarial multiple access channels with individual injection rates. Theory of Computing Systems, 61(3):820–850, 2017.
  11. T. E. Anderson. The performance of spin lock alternatives for shared-money multiprocessors. IEEE Transactions on Parallel and Distributed Systems, 1(1):6–16, 1990.
  12. Windowed backoff algorithms for wifi: Theory and performance under batched arrivals. Distributed Computing, 34:367–393, 2021.
  13. Is our model for contention resolution wrong?: Confronting the cost of collisions. In Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA, pages 183–194. ACM, 2017.
  14. Universal-stability results and performance bounds for greedy contention-resolution protocols. Journal of the ACM (JACM), 48(1):39–69, 2001.
  15. Daily Mail Annabel Grossman. Interrupted service: Priest fed up with mobile phones ringing during mass installs jamming device to stop calls and texts coming through in church, 2014. https://www.dailymail.co.uk/news/article-2876243/Priest-fed-mobile-phones-ringing-Mass-installs-jamming-device.html.
  16. Adaptive packet scheduling over a wireless channel under constrained jamming. Theor. Comput. Sci., 692:72–89, 2017.
  17. Contention resolution in multiple-access channels: k-selection in radio networks. In Proceedings of the 16th Annual International Conference on Computing and Combinatorics (COCOON), pages 378–388, 2010.
  18. Simulative Evaluation of Adaptive Jamming Detection in Wireless Multi-hop Networks. In International Conference on Distributed Computing Systems Workshops, pages 213–220, 2010.
  19. A jamming-resistant MAC protocol for single-hop wireless networks. In Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC), pages 45–54, 2008.
  20. Principles of robust medium access and an application to leader election. ACM Trans. Algorithms, 10(4):24:1–24:26, 2014.
  21. On the Performance of IEEE 802.11 Under Jamming. In INFOCOM, pages 1265–1273, 2008.
  22. Analyzing contention and backoff in asynchronous shared memory. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC 2017, Washington, DC, USA, July 25-27, 2017, pages 53–62, 2017.
  23. Adversarial contention resolution for simple channels. In Proceedings of the 17171717th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 325–332, 2005.
  24. Contention resolution with heterogeneous job sizes. In Proceedings of the 14th Conference on Annual European Symposium (ESA), pages 112–123, 2006.
  25. How to Scale Exponential Backoff: Constant Throughput, Polylog Access Attempts, and Robustness. In Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’16, pages 636–654, 2016.
  26. Scaling exponential backoff: Constant throughput, polylogarithmic channel-access attempts, and robustness. J. ACM, 66(1):6:1–6:33, 2019.
  27. Resource-competitive algorithms. SIGACT News, 46(3):57–71, September 2015.
  28. Contention resolution for coded radio networks. In Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 119–130. ACM, 2022.
  29. Contention resolution without collision detection. In Proceedings of the 52525252nd Annual ACM Symposium on Theory of Computing (STOC), pages 105–118, 2020.
  30. Contention resolution with log-logstar channel accesses. In Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pages 499–508, 2016.
  31. Contention resolution with constant throughput and log-logstar channel accesses. SIAM J. Comput., 47(5):1735–1754, 2018.
  32. On the Relevance of Adversarial Queueing Theory in Practice. In The 2014 ACM International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS ’14, pages 343–354, 2014.
  33. Performance of IEEE 802.16 MAC layer protocol under conditions of self-similar traffic. In TENCON 2008 - 2008 IEEE Region 10 Conference, pages 1–4, 2008.
  34. Reliable Broadcast in Radio Networks: The Bounded Collision Case. In Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pages 258 – 264, 2006.
  35. Giuseppe Bianchi. Ieee 802.11-saturation throughput analysis. IEEE communications letters, 2(12):318–320, 1998.
  36. Giuseppe Bianchi. Performance analysis of the ieee 802.11 distributed coordination function. IEEE Journal on selected areas in communications, 18(3):535–547, 2000.
  37. Kalman filter estimation of the number of competing terminals in an IEEE 802.11 network. In Proceedings of the 22n⁢dsuperscript22𝑛𝑑22^{nd}22 start_POSTSUPERSCRIPT italic_n italic_d end_POSTSUPERSCRIPT Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), volume 2, pages 844–852, 2003.
  38. Distributed online and stochastic queuing on a multiple access channel. In Marcos K. Aguilera, editor, Distributed Computing - 26th International Symposium, DISC 2012, Salvador, Brazil, October 16-18, 2012. Proceedings, volume 7611 of Lecture Notes in Computer Science, pages 121–135. Springer, 2012.
  39. Distributed online and stochastic queueing on a multiple access channel. ACM Trans. Algorithms, 14(2), May 2018.
  40. Dynamic sharing of a multiple access channel. arXiv preprint arXiv:1001.3044, 2010.
  41. Adversarial queuing theory. Journal of the ACM (JACM), 48(1):13–38, 2001.
  42. Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit. IEEE/ACM Transactions on Networking, 8(6):785–799, 2000.
  43. IEEE 802.11 protocol: Design and performance evaluation of an adaptive backoff mechanism. IEEE Journal on Selected Areas in Communications, 18(9):1774–1786, 2000.
  44. B. Canberk and S. Oktug. Self similarity analysis and modeling of VoIP traffic under wireless heterogeneous network environment. In Telecommunications, 2009. AICT ’09. Fifth Advanced International Conference on, pages 76–82, 2009.
  45. J. Capetanakis. Generalized tdma: The multi-accessing tree protocol. IEEE Transactions on Communications, 27(10):1476–1484, 1979.
  46. Simple contention resolution via multiplicative weight updates. In Proceedings of the Second Symposium on Simplicity in Algorithms, SOSA@SODA 2019, January 8-9, 2019 - San Diego, CA, USA, pages 16:1–16:16, 2019.
  47. Exponential separations in the energy complexity of leader election. In Proceedings of the Annual ACM SIGACT Symposium on Theory of Computing (STOC), 2017.
  48. Exponential separations in the energy complexity of leader election. ACM Trans. Algorithms, 15(4), October 2019.
  49. Tight trade-off in contention resolution without collision detection. In Avery Miller, Keren Censor-Hillel, and Janne H. Korhonen, editors, PODC ’21: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, July 26-30, 2021, pages 139–149. ACM, 2021.
  50. Broadcasting competitively against adaptive adversary in multi-channel radio networks. In Quentin Bramas, Rotem Oshman, and Paolo Romano, editors, 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14-16, 2020, Strasbourg, France (Virtual Conference), volume 184 of LIPIcs, pages 22:1–22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020.
  51. Bogdan S Chlebus. Randomized communication in radio networks. Combinatorial Optimization-Dordrecht, 9(1):401–456, 2001.
  52. Scalable wake-up of multi-channel single-hop radio networks. Theoretical Computer Science, 615(C):23 – 44, February 2016.
  53. Deterministic broadcasting in unknown radio networks. In David B. Shmoys, editor, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, January 9-11, 2000, San Francisco, CA, USA, pages 861–870, 2000.
  54. On the wake-up problem in radio networks. In Luís Caires, Giuseppe F. Italiano, Luís Monteiro, Catuscia Palamidessi, and Moti Yung, editors, Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings, volume 3580 of Lecture Notes in Computer Science, pages 347–359. Springer, 2005.
  55. Energy efficient adversarial routing in shared channels. In The 31st ACM Symposium on Parallelism in Algorithms and Architectures, pages 191–200, 2019.
  56. A better wake-up in radio networks. In Soma Chaudhuri and Shay Kutten, editors, Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John’s, Newfoundland, Canada, July 25-28, 2004, pages 266–274. ACM, 2004.
  57. Almost optimal explicit selectors. In International Symposium on Fundamentals of Computation Theory, pages 270–280. Springer, 2005.
  58. Adversarial queuing on the multiple-access channel. In Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing, pages 92–101, 2006.
  59. Stability of the multiple-access channel under maximum broadcast loads. In Symposium on Self-Stabilizing Systems, pages 124–138. Springer, 2007.
  60. Maximum throughput of multiple access channels in adversarial environments. Distributed Computing, 22(2):93–116, 2009.
  61. Adversarial queuing on the multiple access channel. ACM Transactions on Algorithms, 8(1):5:1–5:31, January 2012.
  62. P-DCF: Enhanced backoff scheme for the IEEE 802.11 DCF. In 2005 IEEE 61st Vehicular Technology Conference, volume 3, 2005.
  63. Strategic contention resolution in multiple channels. In International Workshop on Approximation and Online Algorithms, pages 165–180. Springer, 2018.
  64. The wake-up problem in multihop radio networks. SIAM J. Comput., 36(5):1453–1471, 2007.
  65. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43(2):177–189, 2002.
  66. Distributed broadcast in radio networks of unknown topology. Theoretical Computer Science, 302(1-3):337–364, 2003.
  67. Federal Communications Commission. FCC 14-55: Notice of Apparent Liability for Forfeiture of Illegal Operation of Signal Jamming Device, 2014. https://apps.fcc.gov/edocs_public/attachmatch/FCC-14-55A1.pdf.
  68. R.L. Cruz. A calculus for network delay. i. network elements in isolation. IEEE Transactions on Information Theory, 37(1):114–131, 1991.
  69. R.L. Cruz. A calculus for network delay. ii. network analysis. IEEE Transactions on Information Theory, 37(1):132–141, 1991.
  70. Consensus and mutual exclusion in a multiple access channel. In International Symposium on Distributed Computing, pages 512–526. Springer, 2009.
  71. Maximal independent sets in multichannel radio networks. In Proceedings of the 2013 ACM symposium on Principles of distributed computing, pages 335–344, 2013.
  72. Contention resolution in a non-synchronized multiple access channel. In 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pages 525–533. IEEE, 2013.
  73. Asynchronous shared channel. In Proceedings of the ACM Symposium on Principles of Distributed Computing, PODC ’17, pages 391–400, 2017.
  74. Gossiping in a Multi-channel Radio Network: An Oblivious Approach to Coping with Malicious Interference. In Proceedings of the International Symposium on Distributed Computing (DISC), pages 208–222, 2007.
  75. Improved algorithms for latency minimization in wireless networks. Theoretical Computer Science, 412(24):2657–2667, 2011.
  76. Lower bounds for clear transmissions in radio networks. In José R. Correa, Alejandro Hevia, and Marcos Kiwi, editors, LATIN 2006: Theoretical Informatics, pages 447–454, Berlin, Heidelberg, 2006. Springer Berlin Heidelberg.
  77. Initializing sensor networks of non-uniform density in the weak sensor model. In Workshop on Algorithms and Data Structures, pages 565–576. Springer, 2007.
  78. Initializing sensor networks of non-uniform density in the weak sensor model. Algorithmica, 73(1):87–114, 2015.
  79. On the capacity of a collision channel under stack-based collision resolution algorithm. Technical report, Computer Science Department, Technion, 1982.
  80. Investigating the energy consumption of a wireless network interface in an ad hoc networking environment. In Proceedings IEEE INFOCOM 2001, volume 3, pages 1548–1557, 2001.
  81. Unbounded contention resolution in multiple-access channels. Algorithmica, 67(3):295–314, 2013.
  82. Unbounded contention resolution in multiple-access channels. In David Peleg, editor, Distributed Computing - 25th International Symposium (DISC), pages 225–236, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg.
  83. Contention resolution on a fading channel. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC ’16, pages 155–164, 2016.
  84. Contention resolution on multiple channels with collision detection. In Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, PODC ’16, pages 175–184, 2016.
  85. INET Framework. Measuring Channel Utilization, 2023. https://inet.omnetpp.org/docs/showcases/measurement/utilization/doc/index.html.
  86. Local queuing under contention. In 32nd International Symposium on Distributed Computing (DISC 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2018.
  87. Stable memoryless queuing under contention. In 33rd International Symposium on Distributed Computing (DISC 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.
  88. The wakeup problem in synchronous broadcast systems (extended abstract). In Gil Neiger, editor, Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, July 16-19, 2000, Portland, Oregon, USA, pages 113–121. ACM, 2000.
  89. The wakeup problem in synchronous broadcast systems. SIAM J. Discret. Math., 14(2):207–222, 2001.
  90. Efficient optical communication in parallel computers. In Proceedings 4th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pages 41–48, 1992.
  91. Sayeed Ghani. The impact of self similar traffic on wireless LAN. In Proceedings of the 6th International Wireless Communications and Mobile Computing Conference, IWCMC ’10, pages 52–56, 2010.
  92. Interference-Resilient Information Exchange. In INFOCOM, pages 2249–2257, 2009.
  93. Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. Theoretical Computer Science, 410(6-7):546–569, 2009.
  94. Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks. In International Conference On Principles Of Distributed Systems (OPODIS), pages 215–229, 2006.
  95. (Near) Optimal Resource-competitive Broadcast with Jamming. In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA ’14, pages 257–266, 2014.
  96. Contention resolution with predictions. In Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing, pages 127–137, 2021.
  97. Making Evildoers Pay: Resource-Competitive Broadcast in Sensor Networks. In Proceedings of the 31t⁢hsuperscript31𝑡ℎ31^{th}31 start_POSTSUPERSCRIPT italic_t italic_h end_POSTSUPERSCRIPT Symposium on Principles of Distributed Computing (PODC), pages 145–154, 2012.
  98. Leslie Ann Goldberg. Notes on contention resolution. 2000.
  99. Estimating the multiplicities of conflicts to speed their resolution in multiple access channels. J. ACM, 34(2):289–325, 1987.
  100. Estimating the multiplicities of conflicts in multiple access channels (preliminary report). In 24th Annual Symposium on Foundations of Computer Science, Tucson, Arizona, USA, 7-9 November 1983, pages 383–392. IEEE Computer Society, 1983.
  101. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. Journal of the ACM (JACM), 32(3):589–596, 1985.
  102. Randomized routing on fat-trees. In Proc. of the Symp. on Foundations of Computer Science (FOCS), pages 241–249, 1985.
  103. A hierarchical jammed-area mapping service for ubiquitous communication in smart communities. IEEE Communications Magazine, 56(1):92–98, 2018.
  104. J. Hayes. An adaptive technique for local distribution. IEEE Transactions on Communications, 26(8):1178–1186, 1978.
  105. Transactional memory: Architectural support for lock-free data structures. In Proceedings of the 20th Annual International Symposium on Computer Architecture, page 289?300, New York, NY, USA, 1993. Association for Computing Machinery.
  106. Micha Hofri. Stack algorithms for collision-detecting channels and their analysis: A limited survey. In Modelling and Performance Evaluation Methodology, pages 69–88. Springer, 1984.
  107. Contention resolution on a restrained channel. In 2020 IEEE 26th International Conference on Parallel and Distributed Systems (ICPADS), pages 89–98. IEEE, 2020.
  108. New view on adversarial queueing on MAC. IEEE Commun. Lett., 25(4):1144–1148, 2021.
  109. Piotr Indyk. Explicit constructions of selectors and related combinatorial structures, with applications. In Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’02, page 697–704, USA, 2002. Society for Industrial and Applied Mathematics.
  110. Online packet scheduling under adversarial jamming. In Approximation and Online Algorithms - 12th International Workshop, WAOA 2014, Wrocław, Poland, September 11-12, 2014, Revised Selected Papers, volume 8952 of Lecture Notes in Computer Science, pages 193–206. Springer, 2014.
  111. Distributed deterministic broadcasting in wireless networks of weak devices under the SINR model. arXiv preprint arXiv:1210.1804, 2012.
  112. Distributed deterministic broadcasting in wireless networks of weak devices. In International Colloquium on Automata, Languages, and Programming, pages 632–644. Springer, 2013.
  113. Deterministic oblivious local broadcast in the SINR model. In Ralf Klasing and Marc Zeitoun, editors, Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, Proceedings, volume 10472 of Lecture Notes in Computer Science, pages 312–325. Springer, 2017.
  114. Probabilistic algorithms for the wakeup problem in single-hop radio networks. In International Symposium on Algorithms and Computation, pages 535–549. Springer, 2002.
  115. Probabilistic algorithms for the wake-up problem in single-hop radio networks. Theory of Computing Systems, 38(3):347–367, 2005.
  116. The cost of synchronizing multiple-access channels. In Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, pages 421–430, 2015.
  117. A resource-competitive jamming defense. Distributed Comput., 31(6):419–439, 2018.
  118. Conflict on a Communication Channel. In Proceedings of the 30t⁢hsuperscript30𝑡ℎ30^{th}30 start_POSTSUPERSCRIPT italic_t italic_h end_POSTSUPERSCRIPT Symposium on Principles of Distributed Computing (PODC), pages 277–286, 2011.
  119. J. Komlos and A. Greenberg. An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Transactions on Information Theory, 31(2):302–306, September 2006.
  120. Dariusz R. Kowalski. On selection problem in radio networks. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC 2005, Las Vegas, NV, USA, July 17-20, 2005, pages 158–166, 2005.
  121. Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science, 333(3):355–371, 2005.
  122. Computer Networking: A Top-Down Approach Featuring the Internet. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2nd edition, 2002.
  123. An ΩΩ\Omegaroman_Ω(Dlog\logroman_log(N/D)) lower bound for broadcast in radio networks. In Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, pages 65–74, 1993.
  124. An ΩΩ\Omegaroman_Ω(Dlog\logroman_log(N/D)) lower bound for broadcast in radio networks. SIAM journal on Computing, 27(3):702–712, 1998.
  125. On Link Layer Denial of Service in Data Wireless LANs. Wireless Communications & Mobile Computing, 5(3):273–284, 2005.
  126. Localizing jammers in wireless networks. In 2009 IEEE International Conference on Pervasive Computing and Communications, pages 1–6. IEEE, 2009.
  127. SPREAD: Foiling Smart Jammers using Multi-layer Agility. In Proceedings of the International Conference on Computer Communications (INFOCOM), pages 2536–2540, 2007.
  128. An error-minimizing framework for localizing jammers in wireless networks. IEEE Transactions on Parallel and Distributed Systems, 25(2):508–517, 2013.
  129. On the logarithmic backoff algorithm for MAC protocol in MANETs. In Integrated Approaches in Information Technology and Web Engineering: Advancing Organizational Knowledge Sharing, chapter 12, pages 174–184. IGI Global, 2009.
  130. Gianluca De Marco. Distributed broadcast in unknown radio networks. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008, pages 208–217. SIAM, 2008.
  131. Gianluca De Marco. Distributed broadcast in unknown radio networks. SIAM J. Comput., 39(6):2162–2175, 2010.
  132. Towards power-sensitive communication on a multiple-access channel. In 2010 International Conference on Distributed Computing Systems, ICDCS 2010, Genova, Italy, June 21-25, 2010, pages 728–735. IEEE Computer Society, 2010.
  133. Fast nonadaptive deterministic algorithm for conflict resolution in a dynamic multiple-access channel. SIAM Journal on Computing, 44(3):868–888, 2015.
  134. Contention resolution in a non-synchronized multiple access channel. Theoretical Computer Science, 689:1 – 13, 2017.
  135. Deterministic contention resolution on a shared channel. In Proceedings of the 39th IEEE International Conference on Distributed Computing Systems, ICDCS, pages 472–482, 2019.
  136. Faster deterministic wakeup in multiple access channels. In Mario Coppo, Elena Lodi, and G. Michele Pinna, editors, Theoretical Computer Science, 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings, volume 3701 of Lecture Notes in Computer Science, pages 196–204.
  137. Faster deterministic wakeup in multiple access channels. Discret. Appl. Math., 155(8):898–903, 2007.
  138. Gps anti-jam: A simple method of single antenna null-steering for aerial applications. In Proceedings of the ION 2015 Pacific PNT Meeting, pages 470–483, 2015.
  139. Speed Dating Despite Jammers. In Proceedings of the International Conference on Distributed Computing in Sensor Systems (DCOSS), pages 1–14, 2009.
  140. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst., 9(1):21–65, February 1991.
  141. Ethernet: Distributed packet switching for local computer networks. CACM, 19(7):395–404, July 1976.
  142. Debasis Mitra. Probabilistic models and asymptotic results for concurrent processing with exclusive and non-exclusive locks. SIAM Journal on Computing, 14(4):1030–1051, 1985.
  143. Probabilistic models of database locking: Solutions, computational algorithms, and asymptotics. J. ACM, 31(4):855–878, September 1984.
  144. Removing Exponential Backoff from TCP. SIGCOMM Comput. Commun. Rev., 38(5):17–28, September 2008.
  145. The complexity of connectivity in wireless networks. In Infocom, pages 1–13, 2006.
  146. Deterministic protocols in the sinr model without knowledge of coordinates. Journal of Computer and System Sciences, 2020.
  147. A survey on jamming attacks and countermeasures in wsns. Commun. Surveys Tuts., 11(4):42–56, October 2009.
  148. K. Nakano and S. Olariu. Uniform leader election protocols for radio networks. IEEE Transactions on Parallel and Distributed Systems, 13(5):516–526, May 2002.
  149. USA Today Nancy Trejos. FCC fines Marriott $600,000 for Wi-Fi blocking, 2014. https://www.usatoday.com/story/money/business/2014/10/03/marriott-fcc-nashville-fined-wifi-blocking/16648695/.
  150. Using Channel Hopping to Increase 802.11 Resilience to Jamming Attacks. In INFOCOM, pages 2526–2530, 2007.
  151. Calvin Newport. Radio network lower bounds made easy. In International Symposium on Distributed Computing, pages 258–272. Springer, 2014.
  152. Pulse News. Angry priest installs phone jamming device in church to stop calls, 2014. https://www.pulse.ng/communities/religion/enough-is-enough-angry-priest-installs-phone-jamming-device-in-church-to-stop-calls/xq02ts1.
  153. A survey of QoS enhancements for IEEE 802.11 wireless LAN: Research articles. Wireless Communications and Mobile Computing, 4(5):547–566, August 2004.
  154. Competitive MAC under adversarial SINR. In IEEE Conference on Computer Communications (INFOCOM), pages 2751–2759, 2014.
  155. Sade: competitive MAC under adversarial SINR. Distributed Computing, 31(3):241–254, 2018.
  156. V. Paxson and S. Floyd. Wide area traffic: the failure of Poisson modeling. IEEE/ACM Transactions on Networking, 3(3):226–244, 1995.
  157. Telos: Enabling Ultra-Low Power Wireless Research. In IPSN, 2005.
  158. V. Ramaiyan and J. Vaishakh. An information theoretic point of view to contention resolution. In 2014 Sixth International Conference on Communication Systems and Networks (COMSNETS), pages 1–8, 2014.
  159. A jamming-resistant MAC protocol for multi-hop wireless networks. In Proceedings of the International Symposium on Distributed Computing (DISC), pages 179–193, 2010.
  160. Competitive and fair medium access despite reactive jamming. In Proceedings of the 31s⁢tsuperscript31𝑠𝑡31^{st}31 start_POSTSUPERSCRIPT italic_s italic_t end_POSTSUPERSCRIPT International Conference on Distributed Computing Systems (ICDCS), pages 507–516, 2011.
  161. Competitive and fair throughput for co-existing networks under adversarial interference. In Proceedings of the 31s⁢tsuperscript31𝑠𝑡31^{st}31 start_POSTSUPERSCRIPT italic_s italic_t end_POSTSUPERSCRIPT ACM Symposium on Principles of Distributed Computing (PODC), 2012.
  162. An Efficient and Fair MAC Protocol Robust to Reactive Interference. IEEE/ACM Transactions on Networking, 21(1):760–771, 2013.
  163. Competitive Throughput in Multi-Hop Wireless Networks Despite Adaptive Jamming. Distributed Computing, 26(3):159–171, 2013.
  164. Jamming-resistant MAC protocols for wireless networks. In Encyclopedia of Algorithms, pages 999–1002. 2016.
  165. Competitive throughput in multi-hop wireless networks despite adaptive jamming. Distributed Comput., 26(3):159–171, 2013.
  166. An efficient and fair MAC protocol robust to reactive interference. IEEE/ACM Trans. Netw., 21(3):760–771, 2013.
  167. The effect of traffic distribution and transport protocol on WLAN performance. In Telecommunication Networks and Applications Conference (ATNAC), 2009 Australasian, pages 1–6, 2009.
  168. Advanced contention management for dynamic software transactional memory. In Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, pages 240–248, New York, NY, USA, 2005. Association for Computing Machinery.
  169. Algorithmic models for sensor networks. In Proceedings 20th IEEE International Parallel & Distributed Processing Symposium, pages 11–pp. IEEE, 2006.
  170. N-BEB: New backoff algorithm for IEEE 802.11 MAC protocol. In 2014 37th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO), pages 540–544, 2014.
  171. A survey on LPWA technology: LoRa and NB-IoT. ICT Express, 3(1):14 – 21, 2017.
  172. Chicago Tribune Steve Schmadeke. Lawyer: Man accused of jamming calls on Red Line ‘disturbed by people talking around him’, 2016. http://www.chicagotribune.com/news/local/breaking/ct-cell-phone-jamming-red-line-20160309-story.html.
  173. B Stuck. An introduction to traffic handling characteristics of bus local area network distributed access methods. IEEE Communications Magazine, 22(8):46–56, 1984.
  174. X. Sun and L. Dai. Backoff design for IEEE 802.11 DCF networks: Fundamental tradeoff and design criterion. IEEE/ACM Transactions on Networking, 23(1):300–316, 2015.
  175. Queue Analysis for Wireless Packet Data Traffic, pages 217–227. Springer Berlin Heidelberg, Berlin, Heidelberg, 2005.
  176. Free synchronous packet access in a broadcast channel with feedback. Problemy peredachi informatsii, 14(4):32–59, 1978.
  177. Free synchronous packet access in a broadcast channel with feedback. Problems of Information Transmission, 14(4):259–280, 1979.
  178. Jamming attacks on wireless networks: A taxonomic survey. International Journal of Production Economics, 172:76–94, 2016.
  179. Dingyu Wang. Optimal protocols for 2-party contention resolution. In Colette Johnen, Elad Michael Schiller, and Stefan Schmid, editors, Stabilization, Safety, and Security of Distributed Systems (SSS), pages 456–468, Cham, 2021. Springer International Publishing.
  180. A realistic power consumption model for wireless sensor network devices. In 2006 3rd annual IEEE communications society on sensor and ad hoc communications and networks, volume 1, pages 286–295. IEEE, 2006.
  181. Dan E. Willard. Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. Comput., 15(2):468–477, May 1986.
  182. C. Williamson. Internet traffic measurement. IEEE Internet Computing, 5(6):70–74, 2001.
  183. Will E Leland Daniel V Wilson. High time-resolution measurement and analysis of LAN traffic: Implications for LAN interconnection. In Proceedings of IEEE Infocom, pages 1360–1366, 1991.
  184. Deejam: Defeating energy-efficient jamming in ieee 802.15.4-based wireless networks. In 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, pages 60–69, 2007.
  185. Denial of Service in Sensor Networks. Computer, 35(10):54–62, 2002.
  186. Jam: A jammed-area mapping service for sensor networks. In RTSS 2003. 24th IEEE Real-Time Systems Symposium, 2003, pages 286–297. IEEE, 2003.
  187. Jamming Sensor Networks: Attack and Defense Strategies. IEEE Networks, 20(3):41–47, 2006.
  188. The Feasibility of Launching and Detecting Jamming Attacks in Wireless Networks. In MobiHoc, pages 46–57, 2005.
  189. Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference. IEEE Communications Surveys & Tutorials, 13(4):617–641, 2011.
  190. J. Yu and A. P. Petropulu. Study of the effect of the wireless gateway on incoming self-similar traffic. IEEE Transactions on Signal Processing, 54(10):3741–3758, 2006.
  191. Design of small gps anti-jam antenna. In 2018 IEEE International Symposium on Antennas and Propagation & USNC/URSI National Radio Science Meeting, pages 1289–1290. IEEE, 2018.
  192. Singletons for simpletons: Revisiting windowed backoff using chernoff bounds. In Accepted to the Tenth International Conference on Fun With Algorithms (FUN), 2020.

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up