Game theoretic power aware wireless data access

The paper examines the following wireless data access scenario: a number of clients are interested in a set of data items kept at the server. A client sends a query request to inform the server of its desired data item. The server replies in the common broadcast channel. We first define a utility function that considers the client's power consumption in transmit, receive and idle modes. Specifically, utility is expressed as the number of queries that can be completed given a fixed energy source. Based on the utility function, we formulate our power aware wireless data access scheme as a non-cooperative game, called the WDA game. From our theoretical analysis, we show that clients are not always necessary to send query requests to the server. Instead, each client determines the request probability without any explicit communication with one another. Furthermore, we design and evaluate the server and client algorithms for the WDA game. Simulation results confirm that our proposed scheme, compared with a simple always-request one, increases the utility and lifetime of every client while reducing the number of requests sent, at the cost of a slightly larger average query delay.published_or_final_versio

Selfish grids: Game-theoretic modeling and NAS/PSA benchmark evaluation

Selfish behaviors of individual machines in a Grid can potentially damage the performance of the system as a whole. However, scrutinizing the Grid by taking into account the noncooperativeness of machines is a largely unexplored research problem. In this paper, we first present a new hierarchical game-theoretic model of the Grid that matches well with the physical administrative structure in real-life situations. We then focus on the impact of selfishness in intrasite job execution mechanisms. Based on our novel utility functions, we analytically derive the Nash equilibrium and optimal strategies for the general case. To study the effects of different strategies, we have also performed extensive simulations by using a well-known practical scheduling algorithm over the NAS (Numerical Aerodynamic Simulation) and the PSA (Parameter Sweep Application) workloads. We have studied the overall job execution performance of the Grid system under a wide range of parameters. Specifically, we find that the Optimal selfish strategy significantly outperforms the Nash selfish strategy. Our performance evaluation results can serve as a valuable reference for designing appropriate strategies in a practical Grid. © 2007 IEEE.published_or_final_versio

Game Theoretic Power Aware Wireless Data Access

Abstract — This paper examines the following wireless data access scenario: a number of clients are interested in a set of data items kept at the server. A client sends a query request to inform the server of its desired data item. The server replies in the common broadcast channel. We first define a utility function that considers client’s power consumption in transmit, receive and idle modes. Specifically, utility is expressed as the number of queries that can be completed given a fixed energy source. Based on the utility function, we formulate our power aware wireless data access scheme as a non-cooperative game, called the WDA game. From our theoretical analysis, we show that clients are not always necessary to send query requests to the server. Instead, each client determines the request probability without any explicit communication with one another. Furthermore, we design and evaluate the server and client algorithms for the WDA game. Simulation results confirm that our proposed scheme, comparing with a simple always-request one, increases the utility and lifetime of every client while reducing the number of requests sent, at the cost of a slightly larger average query delay