Game Theoretic Scheme Research Articles

Game Theoretic Resource Allocation in Media Cloud With Mobile Social Users

Due to the rapid increases in both the population of mobile social users and the demand for quality of experience (QoE), providing mobile social users with satisfied multimedia services has become an important issue. Media cloud has been shown to be an efficient solution to resolve the above issue, by allowing mobile social users to connect to it through a group of distributed brokers. However, as the resource in media cloud is limited, how to allocate resource among media cloud, brokers, and mobile social users becomes a new challenge. Therefore, in this paper, we propose a game theoretic resource allocation scheme for media cloud to allocate resource to mobile social users though brokers. First, a framework of resource allocation among media cloud, brokers, and mobile social users is presented. Media cloud can dynamically determine the price of the resource and allocate its resource to brokers. A mobile social user can select his broker to connect to the media cloud by adjusting the strategy to achieve the maximum revenue, based on the social features in the community. Next, we formulate the interactions among media cloud, brokers, and mobile social users by a four-stage Stackelberg game. In addition, through the backward induction method, we propose an iterative algorithm to implement the proposed scheme and obtain the Stackelberg equilibrium. Finally, simulation results show that each player in the game can obtain the optimal strategy where the Stackelberg equilibrium exists stably.

A coalitional game‐based relay load balancing and power allocation scheme in decode‐and‐forward cellular relay networks

AbstractIn this paper, a game theoretic relay load balancing and power allocation scheme is proposed for downlink transmission in a decode‐and‐forward orthogonal frequency division multiple access‐based cellular relay network. A system with a base station communicating with multiple users via multiple relays is considered. The relays have limited power, which must be divided among the users they support. In traditional scheme, each relay simply divides its transmit power equally among all its users. Moreover, each user selects the relay with the highest channel gain. In this work, we do not apply the traditional relay scheme. It is because the users are distributed randomly, and by applying the traditional relay selection scheme, it may happen that some relays have more users connected to them than other relays, which results in having unbalanced load among the relays. In order to avoid performance degradation, achieve relay load balancing, and maximize the total data rate of the network, a game theoretic approach is proposed, which efficiently assigns the users to relays. The power of each relay is wisely distributed among users by the efficient power allocation scheme. Simulation results indicate that the proposed game‐based scheme can considerably improve the average sum‐spectral efficiency. Moreover, it shows that by applying the game, users who can connect to uncongested relays join them as opposed to connecting to congested relays. Copyright © 2015 John Wiley & Sons, Ltd.

Energy-efficient infrastructure sharing in multi-operator mobile networks

Network infrastructure sharing and base station switching off mechanisms have been recently introduced as promising solutions toward energy and cost reduction in cellular networks. Although these techniques are usually studied independently, their combination offers new alternatives to MNOs for serving their users and could potentially provide them with additional benefits. In this article we introduce the concept of intra-cell roaming-based infrastructure sharing, where the MNOs may switch off their BSs and roam their traffic to active BSs operated by other MNOs in the same cell. Motivated by the coexistence of multiple operators in the same area, we present possible network deployments and architectures in current and future cellular scenarios, discussing their particular characteristics. In addition, we propose an innovative distributed game theoretic BS switching off scheme, employing an integrated cost function that takes into account all the different cases for a given operator to serve its own traffic (i.e. through active BSs of neighboring cells or exploiting intra-cell roaming-based infrastructure sharing). Finally, we demonstrate some indicative simulation results in realistic scenarios to quantify the potential energy and financial benefits that our proposed scheme offers to the MNOs in multi-operator environments, providing them with the necessary incentives to participate in the infrastructure sharing.

Selfish Node Detection and Low Cost Data Transmission in MANET using Game Theory

Abstract Mobile Ad hoc Network (MANET) is infrastructure less, dynamic, decentralized network of wireless mobile nodes. Although MANET is very much useful but it suffers from different security issues. Dropping packets by selfish nodes is one of them. Presence of selfish nodes in MANET may damage the entire communication system. So, it is highly required to detect those selfish nodes and promote cooperation in MANET. Here, a new game theoretic scheme has been proposed for selfish node detection in MANET. Besides detection of selfish nodes, using Least Total Cost Factor (LTCF), data packets will be transmitted from source to destination node through least cost path only. Due to the presence of selfish nodes in the network, if a path has been broken, then the next best path will be automatically selected for data transmission. So, this scheme guarantees secure low cost data transfer and smallest amount of idle time.

Energy efficiency in wireless sensor networks

A coalitional game theoretic scheme is proposed that aims at maximizing wireless sensor network lifetime under specified QoS. Employing a small number of nodes of increased computing power and lifetime called representatives , an adaptive clustering scheme is proposed where neighboring nodes form coalitions in order to increase energy efficiency at the cost of controllable data-accuracy reduction. The coalition formation is globally optimized by the representatives. The spatial correlation of the sensed phenomenon measurements is exploited to formulate a cooperation scheme that reduces drastically the number of node transmissions. The specifications regarding the accuracy of the collected data determine the extent of coalition formation. The efficiency and stability of the proposed coalitional scheme are studied through simulations.

Incentive Mechanism for Multiuser Cooperative Relaying in Wireless Ad Hoc Networks: A Resource-Exchange Based Approach

This paper studies the resource allocation (RA) and the relay selection (RS) problems in cooperative relaying (CR) based multiuser ad hoc networks, and a multiuser cooperative game is proposed to stimulate selfish user nodes to participate in the CR. The novelty of the game scheme lies in that it takes explicit count of that a wireless user can act as a data-source as well as a potential relay for other users. Consider a user has the selfish incentive to consume his/her spectrum resource solely to maximize his/her own data-rate and the selection cooperation (SC) rule which restricts relaying for a user to only one relay is explicitly imposed. To stimulate user nodes to share their energy and spectrum resource efficiently in the Pareto optimal sense, first, we formulate the RA problem for multiuser CR as a bargaining game. By solving the Nash bargaining solution of the game, Pareto optimal RA for cooperative partners can be achieved. Next, to implement the SC-rule imposed RS, a simple heuristic is proposed with the main method being to maintain the long-term priority fairness for cooperative partner selection for each selfish user. The proposed RS with RA (RS-RA) algorithm has a low computational complexity of $$O(K^{2})$$ O ( K 2 ) , where $$K$$ K is the number of users in a network. Simulation results demonstrate the system efficiency and fairness properties of the proposed bargaining game theoretic RS-RA scheme.

Fair and Efficient Spectrum Splitting for Unlicensed Secondary Users in Cooperative Cognitive Radio Networks

In cooperative cognitive radio networks (CCRNs), a licensed primary-user (PU) is allowed to leverage several unlicensed secondary-users (SUs) to relay its traffic. In this paper, a staged dynamic spectrum allocation (DSA) scheme is proposed for CCRNs. In the first stage, the network is uncongested. A simple pricing based DSA scheme is proposed for the PUs to lease their idled frequency bands to the SUs. And, hence, the initial quality of service (QoS) demands (in terms of the minimum rate requirements) of the PUs and the SUs are both satisfied through direct transmission on the allocated frequency bands. In the second stage, the network reaches the full-loaded situation. Therefore, a cooperative relaying based DSA scheme is proposed to stimulate the PUs to split more extra frequency bands to fulfill the increased QoS demands of the SUs, on condition that the QoS of the PUs are well maintained. By applying the cooperative bargaining game theory in the proposed cooperative relaying based DSA, on the one hand, the SUs can get fairness rate-rewards from the PUs according to the level of contribution that they can make to compensate the PUs for the rate-losses. Hence, the increased QoS demands of the SUs can be accommodated in short term. On the other hand, the PUs could retain the SUs successfully to obtain the long-term revenue, on condition that their QoS constraints are still satisfied. Finally, the analysis results of the proposed bargaining game theoretic DSA scheme (in the second stage) are testified through computer simulations.

Game-Theoretic Approach for Primary-Secondary User Power Control Under Fast Flat Fading Channels

Power control is an important concern in cognitive radio networks in which secondary users compete to access spectrum allocated to primary users. However, most existing studies have ignored the impact of primary users and only considered the interactions between secondary users. Hence in this study a realistic primary-secondary game-theoretic scheme is proposed in which primary users are rewarded for sharing their spectrum. The proposed model is analyzed for Rician and Rayleigh fast flat fading channels. In addition, closed-form expressions are also derived for the average utility functions and the existence of a unique Nash equilibrium is also shown. Finally, detailed simulation results are presented to verify the realistic performance of the scheme under those new channel conditions.

Cooperative game theoretic online routing scheme for wireless network managements

During wireless network operations, a widely used performance issue is energy efficiency. Along with the energy efficiency, another desirable property is load balancing. In this study, a new integrated routing scheme is proposed; it is composed of path setup and packet distribution algorithms. Owing to the online self-adjustment technique, the path setup algorithm can adaptively estimate link costs and establish routing paths. Based on the Shapley value approach, the proposed packet distribution algorithm can provide a fair and efficient solution for the packet forwarding problem. Under widely different and diversified network situations, this collaborative approach can offer a well-balanced network performance. The most important novelties of the proposed scheme are its flexibility, adaptability and responsiveness to current traffic conditions. Through simulation results, we can see the superiority of the proposed scheme whereas other existing schemes cannot offer such an attractive performance. The remaining energy ratio, network throughput, packet loss probability and average energy-consumption ratio are improved by about 5%, 10%, 15% and 20%, respectively, than the existing schemes.