Citation Context

...lly, or stays quiet. Moreover, we explain why finding a NE is different than simply aiming at finding a maximal transmission schedule, which is the standard goal of transmission scheduling algorithms =-=[3]-=- [4]. (iii) We present a distributed scheme that iteratively converges to a NE. We show that each NE is Pareto optimal. We study its efficiency, in the sense of speed of convergence to the NE and the ...

Citation Context

...eral enough to be applied to any type of multihop wireless network. However, our emphasis is on future multihop networks. For example, our work is relevant to the Device-to-Device (D2D) communication =-=[2]-=-, which is expected to be a key technology in 5G systems for providing seamless, high quality wireless access. D2D are expected to extend internet access services and support a number of emerging appl...

Citation Context

...and the best NE involves 2519. The (plotted) difference of 63 corresponds to 2.5% fewer successful transmissions than the best possible case, which is insignificant. VI. RELATED WORK Mackenzie et al. =-=[8]-=- were the first to propose the modeling of Slotted Aloha as a non-cooperative game and analyze the NE of the game. Payoff model #1 is inspired by this work. In [9], the authors relax the assumption th...

Citation Context

...t. VI. RELATED WORK Mackenzie et al. [8] were the first to propose the modeling of Slotted Aloha as a non-cooperative game and analyze the NE of the game. Payoff model #1 is inspired by this work. In =-=[9]-=-, the authors relax the assumption that each node has a packet to send at each time slot. Moreover, they also consider a team optimization approach (though without applying coalitional game theory). I...

Citation Context

...es consider a fully connected wireless network, where all nodes interfere with each other and consequently only one among the N nodes of the topology is able to transmit successfully at each slot. In =-=[11]-=-, the authors consider a single-cell wireless LAN providing a general game-theoretic framework for designing contention based medium access control protocols. Various utility functions are proposed an...

Citation Context

...up objective can be achieved. For this reason, the framework of game theory has recently become a very useful mathematical tool for modeling and analyzing multiple access schemes in wireless networks =-=[1]-=-. In this paper, we study contention-based channel access in the context of multihop wireless networks. Our work is general enough to be applied to any type of multihop wireless network. However, our ...

Citation Context

...cause non-negligible interference to him. The target is the minimization of the total regret. The no-regret approach is used in conjunction with other learning techniques to find a NE of the game. In =-=[13]-=-, the authors study the same problem using graphical games (even though they call them ‘local interaction games’) and propose two approaches: a) the minimization of the number of competing neighbors (...

Citation Context

... or stays quiet. Moreover, we explain why finding a NE is different than simply aiming at finding a maximal transmission schedule, which is the standard goal of transmission scheduling algorithms [3] =-=[4]-=-. (iii) We present a distributed scheme that iteratively converges to a NE. We show that each NE is Pareto optimal. We study its efficiency, in the sense of speed of convergence to the NE and the numb...

Citation Context

...the authors relax the assumption that each node has a packet to send at each time slot. Moreover, they also consider a team optimization approach (though without applying coalitional game theory). In =-=[10]-=-, the authors use pricing in the payoff function to motivate the nodes to cooperate. By enforcing cooperation through pricing mechanisms, the throughput of the centralized slotted Aloha can be achieve...

Citation Context

...Coordination Function (DCF). Again, the assumption is that every wireless node can hear every other node in the network. Graphical games have already been applied a few times in wireless networks. In =-=[12]-=-, the authors study channel selection for cognitive radio networks. Each secondary user chooses a channel to transmit assuming that only his neighboring nodes that have chosen the same channel cause n...

Citation Context

...the difference of a NE under payoff model #1 from the notion of the maximal strategy (transmission) vector that plays a central role in transmission scheduling [3] [4]. Using similar terminology with =-=[7]-=-, we call a strategy vector feasible if all nodes in the strategy vector either wait or have a successful transmission. A strategy vector is called a maximal strategy vector if adding an extra transmi...

Citation Context

... our network was fully connected. However, in multihop topologies the payoff of a player depends only on his strategy and the strategy of some of his neighbors. These games are called graphical games =-=[6]-=- and our model is an example of this type of game. Fig. 2: Indicative NE for the network of Fig.1. The full arrows indicate the active transmissions at a NE under payoff model #1. The dashed arrows in...