English
Related papers

Related papers: A Non-Cooperative Multiple Access Game for Timely …

200 papers

Recently, low-complexity and distributed Carrier Sense Multiple Access (CSMA)-based scheduling algorithms have attracted extensive interest due to their throughput-optimal characteristics in general network topologies. However, these…

Networking and Internet Architecture · Computer Science 2014-05-06 Bin Li , Atilla Eryilmaz

Semantic communication acts as a key enabler for effective task execution in AI-driven systems, prioritizing the extraction of the underlying meaning before transmission. However, when devices rely on different logic and internal…

Information Theory · Computer Science 2026-03-09 Giuseppe Di Poce , Mattia Merluzzi , Emilio Calvanese Strinati , Paolo Di Lorenzo

Carrier Sense Multiple Access with Enhanced Collision Avoidance (CSMA/ECA) is a distributed MAC protocol that allows collision-free access to the medium in WLAN. The only difference between CSMA/ECA and the well-known CSMA/CA is that the…

Networking and Internet Architecture · Computer Science 2010-11-29 Jaume Barcelo , Boris Bellalta , Cristina Cano , Anna Sfairopoulou , Miquel Oliver , Kshitiz Verma

We consider an attacker-operator game for monitoring a large-scale network that is comprised on components that differ in their criticality levels. In this zero-sum game, the operator seeks to position a limited number of sensors to monitor…

Computer Science and Game Theory · Computer Science 2019-03-19 Jezdimir Milosevic , Mathieu Dahan , Saurabh Amin , Henrik Sandberg

In multi-rate IEEE 802.11 WLANs, the traditional user association based on the strongest received signal and the well known anomaly of the MAC protocol can lead to overloaded Access Points (APs), and poor or heterogeneous performance. Our…

Computer Science and Game Theory · Computer Science 2016-05-03 Mikael Touati , Rachid El-Azouzi , Marceau Coupechoux , Eitan Altmanand Jean-Marc Kelif

This paper presents a game theoretic solution for joint channel allocation and power control in cognitive radio networks analyzed under the physical interference model. The objective is to find a distributed solution that maximizes the…

Networking and Internet Architecture · Computer Science 2025-01-29 J. R. Gallego , M. Canales , J. Ortin

Wireless sensor networks benefit from communication protocols that reduce power requirements by avoiding frame collision. Time Division Media Access methods schedule transmission in slots to avoid collision, however these methods often lack…

Distributed, Parallel, and Cluster Computing · Computer Science 2007-05-23 T. Herman , S. Tixeuil

We consider the effects of altruistic behavior on random medium access control (slotted ALOHA) for local area communication networks. For an idealized, synchronously iterative, two-player game with asymmetric player demands, we find a…

Computer Science and Game Theory · Computer Science 2015-03-13 G. Kesidis , Y. Jin , A. P. Azad , E. Altman

Topology control algorithms allow each node in a wireless multi-hop network to adjust the power at which it makes its transmissions and choose the set of neighbors with which it communicates directly, while preserving global goals such as…

Networking and Internet Architecture · Computer Science 2013-09-13 Xiaoyu Chu , Harish Sethu

We propose a new method for opportunistic power control in multi-carrier interference channels for delay-tolerant data services. In doing so, we utilize a game theoretic framework with novel constraints, where each user tries to maximize…

Computer Science and Game Theory · Computer Science 2011-06-28 Mohammad R. Javan , Ahmad R. Sharafat

Network congestion games are a convenient model for reasoning about routing problems in a network: agents have to move from a source to a target vertex while avoiding congestion, measured as a cost depending on the number of players using…

Computer Science and Game Theory · Computer Science 2022-07-05 Aline Goeminne , Nicolas Markey , Ocan Sankur

In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the…

Optimization and Control · Mathematics 2017-03-28 Maojiao Ye , Guoqiang Hu

The problem of noncooperative resource allocation in a multipoint-to-multipoint cellular network is considered in this paper. The considered scenario is general enough to represent several key instances of modern wireless networks such as a…

Information Theory · Computer Science 2011-05-11 Stefano Buzzi , Alessio Zappone

Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can…

Networking and Internet Architecture · Computer Science 2019-11-13 Jian Ni , Bo Tan , R. Srikant

We analyze the distributed power allocation problem in parallel multiple access channels (MAC) by studying an associated non-cooperative game which admits an exact potential. Even though games of this type have been the subject of…

Computer Science and Game Theory · Computer Science 2010-11-29 Panayotis Mertikopoulos , Elena V. Belmega , Aris L. Moustakas , Samson Lasaulce

In this article, we revisit a communication-control co-design problem for a class of two-player stochastic differential games on an infinite horizon. Each 'player' represents two active decision makers, namely a scheduler and a remote…

Systems and Control · Electrical Eng. & Systems 2025-03-04 Shubham Aggarwal , Tamer Başar , Dipankar Maity

We consider a gossip approach for finding a Nash equilibrium in a distributed multi-player network game. We extend previous results on Nash equilibrium seeking to the case when the players' cost functions may be affected by the actions of…

Systems and Control · Computer Science 2017-05-09 Farzad Salehisadaghiani , Lacra Pavel

This is the first part of a two-part paper that studies the problem of jamming in a fixed-rate transmission system with fading. Both transmitter and jammer are subject to power constraints which can be enforced over each codeword short-term…

Information Theory · Computer Science 2008-08-27 George T. Amariucai , Shuangqing Wei

Evolutionary anti-coordination games on networks capture real-world strategic situations such as traffic routing and market competition. In such games, agents maximize their utility by choosing actions that differ from their neighbors'…

Computer Science and Game Theory · Computer Science 2024-04-02 Zirou Qiu , Chen Chen , Madhav V. Marathe , S. S. Ravi , Daniel J. Rosenkrantz , Richard E. Stearns , Anil Vullikanti

Wireless local area networks (WLAN) still suffer from a severe performance discrepancy between different users in the uplink. This is because of the spatially varying channel conditions provided by the wireless medium. Cooperative medium…

Information Theory · Computer Science 2009-11-04 Georg Böcherer