A nash power-aware MAC game for ad hoc wireless networks

Computer Communications, 2010

In this paper, the problem of designing a power-aware medium access control (MAC) algorithm for Ad hoc wireless networks is considered. Based on the insights obtained from analyzing the problem in optimization framework, we formulate it as a random scheduling MAC in the game theory framework. Defining a payoff for each link as a function of its persistence probability and power, the objective of the proposed non-cooperative static power-aware MAC game (PAMG) is to find the appropriate strategy for the link in its 2D strategy space. The game theoretic aspects of PAMG including existence, uniqueness, and convergence to the Nash equilibrium are investigated analytically under some mild conditions. Based on PAMG, a message passing totally asynchronous distributed power-aware MAC (PAM) algorithm is presented. In the proposed algorithm, at each active time slot the link broadcasts a message simultaneous to its transmission. At each inactive time slot it listens to the channel to capture the other active links messages and updates its cost factor. Simulation results are provided to evaluate the convergence and performance of the algorithm and are compared to the optimal solution.

2008

This paper presents a game theoretic model aimed at optimizing the performance of medium access control in ad-hoc wireless networks. IEEE 802.11 is the commonly used protocol in such networks, so our model is specifically tailored for it. The network of wireless nodes is abstracted into a community of selfish users playing a non-cooperative game. The resource they vie for is the common random-access wireless channel. We define new utility functions for the nodes and show that these utility functions have insightful and elegant mathematical properties to steer the game to a unique non-trivial Nash equilibrium. This defines a stable operating point from which no player has an incentive to deviate unilaterally. At this stable point each node has an equal non-trivial share of the common wireless transmission channel. Thus selfish behavior of the nodes is used as a mechanism to enforce desirable properties of the network as a whole. Simulations show that this design scores over the traditional Distributed Coordination Function (DCF) in IEEE 802.11 MAC in terms of throughput and collision overhead, thus greatly improving the system-wide MAC layer performance of the network. Since the utility functions produce high performance objectives over a wide range of network sizes in a completely distributed fashion with the nodes behaving selfishly, a self-enforcing mechanism for efficient working of ad-hoc and large unattended networks of constrained wireless devices is achieved.

Ad Hoc Networks, 2011

We consider a distributed joint random access and power control scheme for interference management in wireless ad hoc networks. To derive decentralized solutions that do not require any cooperation among the users, we formulate this problem as noncooperative joint random access and power control game, in which each user minimizes its average transmission cost with a given rate constraint. Using

Proceedings of the 38th Annual Hawaii International Conference on System Sciences, 2005

This paper focuses on the competitively optimal power-control and signal-shaping for "ad-hoc" networks composed by Multiple-Antenna noncooperative transmit/receive terminals affected by spatially colored Multiple-Access Interference (MAI). For this purpose, the MAI-impaired network is modeled as a noncooperative strategic game, and sufficient conditions for the existence and uniqueness of the Nash Equilibrium are provided. Specifically, the following main results are achieved. First, we develop an iterative, fully decentralized, asynchronous and scalable power-control and signal-shaping algorithm that is competitively optimal and maximizes the information throughput sustained by links active over the network. Second, we test that the proposed decentralized access algorithm outperforms the (conventional) centralized orthogonal ones (as TDMA) in terms of aggregate network throughput. Third, we show that, when the throughput requested by the users are no sustainable by the network, the proposed algorithm converges to the allowable operating point at the minimum Euclidean distance from the requested one. Finally, we propose two fully decentralized Connection Admission Procedures (CAPs) that rely on the proposed decentralized access algorithm and optimize the tradeoff between aggregated networking throughput and users QoS requirements.

Proceedings of the 8th ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks, 2013

In this paper, we revisit the power control problem in wireless networks by introducing a signaling game approach. This game is known in the literature as "Cheap Talk". Under the considered scenario, we consider two players named player I and player II. We assume that player I only knows his channel state without any information about the channel state of player II and vice-versa. Player I moves first and sends a signal to player II which can be accurate or distorted. Player II picks up his power control strategy based on this information and his belief about the nature of the informed player's information. In order to analyze such a model, the proposed scheme game is transformed into 4 × 4 matrix game. We establish the existence of Nash equilibria and show by numerical results the equilibria and the performance of the proposed signaling game.

Journal of Advanced Research, 2011

Power control algorithms are an important consideration in mobile ad hoc networks since they can improve network capacity and lifetime. Existing power control approaches in ad hoc network basically use deterministic or probabilistic techniques to build network topology that satisfy certain criteria (cost metrics), such as preserving network connectivity, minimizing interference or securing QoS constraints.

In this paper, we study the problem of power control in a wireless ad hoc system. We consider multiple links of two hops relating source to destination. We propose to use a utility function corresponding to an approximation of the capacity of each link at high Signal to Interference plus Noise Ratio (SINR). We study analytically the problem of maximizing the sum utilities. We assume that users adjust their powers in an interference aware manner and propose a solution based on a distributed pricing power allocation algorithm. Then we prove its convergence to a unique optimal point. The overall approach's efficiency is illustrated via several simulations.

Lecture Notes in Computer Science, 2005

Wireless Ad-hoc networks are expected to be made up of energy aware entities (nodes) interested in their own perceived performance. We consider a simple random access model for a wireless ad hoc network to address problems of finding an optimal channel access rate and providing incentive for cooperation to forward other nodes' traffic. By casting these problems as noncooperative games, we derive conditions for the Nash equilibrium and provide distributed algorithms to learn the Nash equilibrium.

IEEE Communications Surveys & Tutorials, 2005

The application of mathematical analysis to the study of wireless ad hoc networks has met with limited success due to the complexity of mobility and traffic models, the dynamic topology, and the unpredictability of link quality that characterize such networks. The ability to model individual, independent decision makers whose actions potentially affect all other decision makers renders game theory particularly attractive to analyze the performance of ad hoc networks. In this paper, we describe how various interactions in wireless ad hoc networks can be modeled as a game. This allows the analysis of existing protocols and resource management schemes, as well as the design of equilibrium-inducing mechanisms that provide incentives for individual users to behave in socially-constructive ways. We survey the recent literature on game theoretic analysis of ad hoc networks, highlighting its applicability to power control and waveform adaptation, medium access control, routing, and node participation, among others.

Nigerian Journal of Technology, 2019

Efficient energy usage is a major design challenge in wireless sensor networks. In this paper, an efficient power control scheme that mitigates interference and reduces the energy usage of the sensor nodes in a wireless sensor network is presented using the game theory. A non-cooperative game was formulated among the sensor nodes in the modeled network by setting a transmission power limit at the receiving nodes which ensured that the transmitting nodes transmits at the optimal power level. The utility of the sensor nodes and the interference proportion within the network was evaluated at the optimal and discrete transmit powers. The Nash equilibrium of the proposed game was studied and it corresponds to a stability point where the network performance was optimized. Simulation results showed that the proposed scheme is effective for optimization of network resource utilization, reduction in the energy consumption of the nodes, increasing the transmission sum rate, reduction of interference within the network, and improving the network capacity.