scholarly journals Robust Nash Dynamic Game Strategy for User Cooperation Energy Efficiency in Wireless Cellular Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-10 ◽  
Author(s):  
Shuhuan Wen ◽  
Baozhu Hu ◽  
Ahmad B. Rad ◽  
Xinbin Li ◽  
Huibin Lu ◽  
...  
Keyword(s):  
Game Theory ◽  
Energy Efficiency ◽  
Imperfect Information ◽  
Dynamic Game ◽  
Base Station ◽  
Mobile Users ◽  
User Cooperation ◽  
Decode And Forward ◽  
Data Rates ◽  
The Game Theory

Recently, there is an emerging trend of addressing “energy efficiency” aspect of wireless communications. It has been shown that cooperating users relay each other's information to improve data rates. The energy is limited in the wireless cellular network, but the mobile users refuse to relay. This paper presents an approach that encourages user cooperation in order to improve the energy efficiency. The game theory is an efficient method to solve such conflicts. We present a cellular framework in which two mobile users, who desire to communicate with a common base station, may cooperate via decode-and-forward relaying. In the case of imperfect information assumption, cooperative Nash dynamic game is used between the two users' cooperation to tackle the decision making problems: whether to cooperate and how to cooperate in wireless networks. The scheme based on “cooperative game theory” can achieve general pareto-optimal performance for cooperative games, and thus, maximize the entire system payoff while maintaining fairness.

scholarly journals User Association and Power Control for Energy Efficiency Maximization in M2M-Enabled Uplink Heterogeneous Networks with NOMA

Sensors ◽  
2019 ◽  
Vol 19 (23) ◽  
pp. 5307 ◽  
Author(s):  
Shuang Zhang ◽  
Guixia Kang
Keyword(s):  
Energy Efficiency ◽  
Power Control ◽  
Heterogeneous Networks ◽  
Base Station ◽  
Sequential Optimization ◽  
User Association ◽  
Decode And Forward ◽  
Vast Number ◽  
Machine Type ◽  
Machine Type Communication

To support a vast number of devices with less energy consumption, we propose a new user association and power control scheme for machine to machine enabled heterogeneous networks with non-orthogonal multiple access (NOMA), where a mobile user (MU) acting as a machine-type communication gateway can decode and forward both the information of machine-type communication devices and its own data to the base station (BS) directly. MU association and power control are jointly considered in the formulated as optimization problem for energy efficiency (EE) maximization under the constraints of minimum data rate requirements of MUs. A many-to-one MU association matching algorithm is firstly proposed based on the theory of matching game. By taking swap matching operations among MUs, BSs, and sub-channels, the original problem can be solved by dealing with the EE maximization for each sub-channel. Then, two power control algorithms are proposed, where the tools of sequential optimization, fractional programming, and exhaustive search have been employed. Simulation results are provided to demonstrate the optimality properties of our algorithms under different parameter settings.

scholarly journals An Optimal Energy Efficiency of a Two-tier Network in Control-Data Separation Architecture

2020 ◽  
pp. 545-550
Author(s):  
Zaid Mujaiyid Putra Bin Ahmad Baidowi ◽  
◽  
Xiaoli Chu
Keyword(s):  
Energy Efficiency ◽  
Point Processes ◽  
Threshold Value ◽  
Base Station ◽  
Base Stations ◽  
Mobile Users ◽  
Maximization Problem ◽  
User Association ◽  
Data Separation ◽  
Cell Base

In this paper, we propose to maximize the Energy Efficiency (EE) of a two-tier network by jointly optimizing the number of active small cell base stations (SBSs) and the user-cell association. We apply the concept of signaling and data separation where a macro cell base station (MBS) provides full coverage while the SBSs provide high data transmission. First, we model the spatial distributions of the SBSs and mobile users following two independent Poisson Point Processes (PPP) and derive the expressions for the Signal-to-Interference Ratio (SIR), user cell associations, power consumption and energy efficiency of the Heterogeneous Network (HetNet). Then, we formulate the EE maximization problem and solve it by proposing the Switching off Decision and User Association (SODUA) algorithm. The algorithm associates a mobile user to an SBS that offers the highest SIR and calculates the load of each SBS. The algorithm, then, decides to switch off the SBSs that have fewer mobile users than a threshold value, where the mobile users will be offloaded to a nearby SBS that offers the highest SIR. Finally, we calculate the EE of the HetNet. We compare the EE achieved by the proposed algorithm (i.e. after offloading) and that "without offloading". The results show that the proposed algorithm improves the EE of the HetNet and that the EE cannot be further improved by switching off more SBSs than a certain number.

scholarly journals GLIDE: A Game Theory and Data-Driven Mimicking Linkage Intrusion Detection for Edge Computing Networks

Complexity ◽  
2020 ◽  
Vol 2020 ◽  
pp. 1-18 ◽  
Author(s):  
Qianmu Li ◽  
Jun Hou ◽  
Shunmei Meng ◽  
Huaqiu Long
Keyword(s):  
Game Theory ◽  
Intrusion Detection ◽  
Real Time ◽  
Dynamic Game ◽  
Complex Problem ◽  
Computing Methods ◽  
Edge Computing ◽  
Data Driven ◽  
Active Defence ◽  
The Game Theory

The real-time and high-continuity requirements of the edge computing network gain more and more attention because of its active defence problem, that is, a data-driven complex problem. Due to the dual constraints of the hybrid feature of edge computing networks and the uncertainty of new attack features, implementing active defence measures such as detection, evasion, trap, and control is essential for the security protection of edge computing networks with high real-time and continuity requirements. The basic idea of safe active defence is to make the defence gain more significant than the attack loss. To encounter the new attacks with uncertain features introduced by the ubiquitous transmission network in the edge computing network, this paper investigates the attack behaviour and presents an attack-defence mechanism based on game theory. Based on the idea of dynamic intrusion detection, we utilize the game theory in the field of edge computing network and suggest a data-driven mimicry intrusion detection game model-based technique called GLIDE. The game income of participants and utility computing methods under different deployment strategies are analysed in detail. According to the proof analysis of the Nash equilibrium condition in the model, the contradictory dynamic game relationship is described. Therefore, the optimal deployment strategy of the multiredundancy edge computing terminal intrusion detection service in the edge computing network is obtained by solving the game balance point. The detection probability of the edge computing network for network attacks is improved, and the cost of intrusion detection of the edge computing network is reduced.

Reputation and Gossip in Game Theory

2019 ◽  
pp. 213-229
Author(s):  
Charles Roddie
Keyword(s):  
Game Theory ◽  
Strategic Behavior ◽  
Third Party ◽  
The Past ◽  
Past Behavior ◽  
Future Behavior ◽  
The Game Theory ◽  
Shed Light

When interacting with others, it is often important for you to know what they have done in similar situations in the past: to know their reputation. One reason is that their past behavior may be a guide to their future behavior. A second reason is that their past behavior may have qualified them for reward and cooperation, or for punishment and revenge. The fact that you respond positively or negatively to the reputation of others then generates incentives for them to maintain good reputations. This article surveys the game theory literature which analyses the mechanisms and incentives involved in reputation. It also discusses how experiments have shed light on strategic behavior involved in maintaining reputations, and the adequacy of unreliable and third party information (gossip) for maintaining incentives for cooperation.

scholarly journals The Superiority of Quantum Strategy in 3-Player Prisoner’s Dilemma

Mathematics ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 1443
Author(s):  
Zhiyuan Dong ◽  
Ai-Guo Wu
Keyword(s):  
Game Theory ◽  
Prisoner's Dilemma ◽  
Prisoner’S Dilemma ◽  
Quantum Game ◽  
Final State ◽  
The Game Theory ◽  
Initial States ◽  
Quantum Strategy ◽  
Selection Of

In this paper, we extend the quantum game theory of Prisoner’s Dilemma to the N-player case. The final state of quantum game theory of N-player Prisoner’s Dilemma is derived, which can be used to investigate the payoff of each player. As demonstration, two cases (2-player and 3-player) are studied to illustrate the superiority of quantum strategy in the game theory. Specifically, the non-unique entanglement parameter is found to maximize the total payoff, which oscillates periodically. Finally, the optimal strategic set is proved to depend on the selection of initial states.

Pre- and post-operam comparison of the energy consumption of a radio base station under energy efficiency actions

2021 ◽  
Vol 236 ◽  
pp. 110772
Author(s):  
Carmela Vetromile ◽  
Antonio Spagnuolo ◽  
Antonio Petraglia ◽  
Antonio Masiello ◽  
Maria Rosa di Cicco ◽  
...  
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Base Station

The Analysis of Willingness to Cooperate for Farmers to Participate in Water Management Based on Game Theory

2013 ◽  
Vol 448-453 ◽  
pp. 1002-1010
Author(s):  
Cong Liu
Keyword(s):  
Water Management ◽  
Game Theory ◽  
Dynamic Game ◽  
Collective Rationality ◽  
Game Analysis ◽  
Static Game ◽  
Free Riders ◽  
Evolution Analysis ◽  
Prisoners Dilemma ◽  
Willingness To Cooperate

To analyze the willingness to cooperate of farmers to participate in water management, we base on game theory and first carry on single static game analysis of willingness to cooperate for farmers to participate in water management, and find that farmers are into a Prisoners Dilemma in a single game, individual rationality comes into conflict with collective rationality, at this time farmers have a tendency to "free riders", so it is difficult to achieve cooperation between the farmers. Then trying to break the prisoners' dilemma, we carry on the farmers repeated dynamic game, the analysis is carried on in the context of incomplete information and limited rationality, we carry on game evolution analysis for willingness to cooperate for farmers to participate in water management. In order to guarantee the rationality of the study, we conduct a survey of willingness to cooperate of farmers to participate in water management in province of Zhejiang and finally confirm that the study is reasonable. And through the analysis of the full text, we conclude six important conclusions.

scholarly journals Estimation of Optimum Rendezvous Point for Mobile Sink (ORP-MS) in WSN

2018 ◽  
Vol 7 (3.12) ◽  
pp. 1322 ◽  
Author(s):  
Vrince Vimal ◽  
Madhav J Nigam
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Network ◽  
Sensor Network ◽  
High Throughput ◽  
Mobile Sink ◽  
Base Station ◽  
Wireless Sensor ◽  
Cluster Heads ◽  
Rendezvous Point ◽  
Coverage Holes

Clustering of the sensors in wireless sensor network is done to achieve energy efficiency. The nodes, which are unable to join any cluster, are referred to as isolated nodes and tend to transfer information straight to the base station. It is palpable that isolated nodes and cluster heads communicate with the base station and tend to exhaust their energy leaving behind coverage holes. In this paper, we propose the innovative clustering scheme using mobile sink approach to extend networks lifetime. The proposed (ORP-MS) algorithm is implemented in MATLAB 2017a and the results revealed that the proposed algorithm outdid the existing algorithms in terms networks lifetime and energy efficiency simultaneously achieved high throughput.  

Sign in / Sign up

Export Citation Format

Share Document