Document Open Access Logo

Strategic Contention Resolution with Limited Feedback

Authors George Christodoulou, Martin Gairing, Sotiris Nikoletseas, Christoforos Raptopoulos, Paul Spirakis

PDF
Thumbnail PDF

File

LIPIcs.ESA.2016.30.pdf
  • Filesize: 0.52 MB
  • 16 pages

Document Identifiers

Author Details

George Christodoulou
Martin Gairing
Sotiris Nikoletseas
Christoforos Raptopoulos
Paul Spirakis

Cite AsGet BibTex

George Christodoulou, Martin Gairing, Sotiris Nikoletseas, Christoforos Raptopoulos, and Paul Spirakis. Strategic Contention Resolution with Limited Feedback. In 24th Annual European Symposium on Algorithms (ESA 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 57, pp. 30:1-30:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.ESA.2016.30

Abstract

In this paper, we study contention resolution protocols from a game-theoretic perspective. We focus on acknowledgment-based protocols, where a user gets feedback from the channel only when she attempts transmission. In this case she will learn whether her transmission was successful or not. Users that do not transmit will not receive any feedback. We are interested in equilibrium protocols, where no player has an incentive to deviate. The limited feedback makes the design of equilibrium protocols a hard task as best response policies usually have to be modeled as Partially Observable Markov Decision Processes, which are hard to analyze. Nevertheless, we show how to circumvent this for the case of two players and present an equilibrium protocol. For many players, we give impossibility results for a large class of acknowledgment-based protocols, namely age-based and backoff protocols with finite expected finishing time. Finally, we provide an age-based equilibrium protocol, which has infinite expected finishing time, but every player finishes in linear time with high probability.
Keywords
  • contention resolution
  • acknowledgment-based protocols
  • game theory

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

References

  1. N. Abramson. The ALOHA system: Another alternative for computer communications. In Proceedings of the November 17-19, 1970, fall joint computer conference, pages 281-285. ACM New York, NY, USA, 1970. Google Scholar
  2. E. Altman, R. El Azouzi, and T. Jiménez. Slotted aloha as a game with partial information. Comput. Netw., 45(6):701-713, 2004. URL: http://dx.doi.org/10.1016/j.comnet.2004.02.013.
  3. E. Altman, D. Barman, A. Benslimane, and R. El Azouzi. Slotted aloha with priorities and random power. In Proc. IEEE Infocom, 2005. Google Scholar
  4. V. Auletta, L. Moscardelli, P. Penna, and G. Persiano. Interference games in wireless networks. In WINE, pages 278-285, 2008. Google Scholar
  5. M. Bender, M. Farach-Colton, S He, B. Kuszmaul, and C. Leiserson. Adversarial contention resolution for simple channels. In SPAA'05, pages 325-332. ACM, 2005. URL: http://dx.doi.org/10.1145/1073970.1074023.
  6. J. Capetanakis. Generalized tdma: The multi-accessing tree protocol. IEEE Transactions on Communications, 27(10):1476-1484, 1979. Google Scholar
  7. J. Capetanakis. Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory, 25(5):505-515, 1979. Google Scholar
  8. George Christodoulou, Katrina Ligett, and Evangelia Pyrga. Contention resolution under selfishness. Algorithmica, 70(4):675-693, 2014. Google Scholar
  9. A. Fiat, Y. Mansour, and U. Nadav. Efficient contention resolution protocols for selfish agents. In SODA'07, pages 179-188, Philadelphia, PA, USA, 2007. SIAM. Google Scholar
  10. Mihály Geréb-Graus and Thanasis Tsantilas. Efficient optical communication in parallel computers. In SPAA'92, pages 41-48, New York, NY, USA, 1992. ACM. URL: http://dx.doi.org/10.1145/140901.140906.
  11. L. A. Goldberg and P. D. MacKenzie. Analysis of practical backoff protocols for contention resolution with multiple servers. J. Comput. Syst. Sci., 58(1):232-258, 1999. URL: http://dx.doi.org/10.1006/jcss.1998.1590.
  12. L. A. Goldberg, P. D. Mackenzie, M. Paterson, and A. Srinivasan. Contention resolution with constant expected delay. J. ACM, 47(6):1048-1096, 2000. URL: http://dx.doi.org/10.1145/355541.355567.
  13. Leslie Ann Goldberg. Notes on contention resolution. http://www.cs.ox.ac.uk/people/leslieann.goldberg/contention.html, 2002. Google Scholar
  14. A. Greenberg and S. Winograd. A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM, 32(3):589-596, 1985. URL: http://dx.doi.org/10.1145/3828.214125.
  15. Hayes J. An adaptive technique for local distribution. IEEE Transactions on Communications, 26(8):1178-1186, 1978. Google Scholar
  16. Elias Koutsoupias and Katia Papakonstantinopoulou. Contention issues in congestion games. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part II, pages 623-635, 2012. URL: http://dx.doi.org/10.1007/978-3-642-31585-5_55.
  17. R.T. Ma, V. Misra, and D. Rubenstein. Modeling and analysis of generalized slotted-aloha mac protocols in cooperative, competitive and adversarial environments. In ICDCS'06, page 62, Washington, DC, USA, 2006. IEEE. URL: http://dx.doi.org/10.1109/ICDCS.2006.56.
  18. P. D. MacKenzie, C. G. Plaxton, and R. Rajaraman. On contention resolution protocols and associated probabilistic phenomena. J. ACM, 45(2):324-378, 1998. URL: http://dx.doi.org/10.1145/274787.274816.
  19. I. Menache and N. Shimkin. Efficient rate-constrained nash equilibrium in collision channels with state information. In INFOCOM 2008., pages 403-411, 2008. Google Scholar
  20. R. Metcalfe and D. Boggs. Distributed packet switching for local computer networks. Communications of the ACM, 19:395-404, 1976. Google Scholar
  21. J.R. Norris. Markov Chains. Cambridge University Press, 1998. Google Scholar
  22. Loren K. Platzman. Optimal infinite-horizon undiscounted control of finite probabilistic systems. SIAM Journal on Control and Optimization, 18(4):362-380, 1980. Google Scholar
  23. Martin L. Puterman. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John Wiley &Sons, Inc., 1994. Google Scholar
  24. P. Raghavan and E. Upfal. Stochastic contention resolution with short delays. Technical report, Weizmann Science Press of Israel, Jerusalem, Israel, Israel, 1995. Google Scholar
  25. L. Roberts. Aloha packet system with and without slots and capture. SIGCOMM Comput. Commun. Rev., 5(2):28-42, April 1975. URL: http://dx.doi.org/10.1145/1024916.1024920.
  26. Sheldon R. Ross. A First Course in Probability. Pearson, 2012. Google Scholar
  27. F.A. Tobagi and L. Kleinrock. Packet switching in radio channels: Part ii-the hidden terminal problem in carrier sense multiple-access and the busy-tone solution. IEEE Transactions on Communications, 23(12):1417-1433, 1975. Google Scholar
  28. B. S. Tsybakov and V. A. Mikhailov. Free synchronous packet access in a broadcast channel with feedback. Problems of Information Transmission, 14(4):259-280, 1978. Google Scholar
  29. D. Wang, C. Comaniciu, and U. Tureli. Cooperation and fairness for slotted aloha. Wirel. Pers. Commun., 43(1):13-27, 2007. URL: http://dx.doi.org/10.1007/s11277-006-9240-5.
  30. D. Zheng, W. Ge, and J. Zhang. Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach. In MobiHoc'07, pages 1-10. ACM, 2007. URL: http://dx.doi.org/10.1145/1288107.1288109.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact