• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2631-2649
• /
• 2021

Device-to-Device (D2D) communication is one of the enabling technologies for 5G networks that support proximity-based service (ProSe) for wireless network communications. This paper proposes a power control algorithm based on the Nash equilibrium and game theory to eliminate the interference between the cellular user device and D2D links. This leadsto reliable connectivity with minimal power consumption in wireless communication. The power control in D2D is modeled as a non-cooperative game. Each device is allowed to independently select and transmit its power to maximize (or minimize) user utility. The aim is to guide user devices to converge with the Nash equilibrium by establishing connectivity with network resources. The proposed algorithm with pricing factors is used for power consumption and reduces overall interference of D2Ds communication. The proposed algorithm is evaluated in terms of the energy efficiency of the average power consumption, the number of D2D communication, and the number of iterations. Besides, the algorithm has a relatively fast convergence with the Nash Equilibrium rate. It guarantees that the user devices can achieve their required Quality of Service (QoS) by adjusting the residual cost coefficient and residual energy factor. Simulation results show that the power control shows a significant reduction in power consumption that has been achieved by approximately 20% compared with algorithms in [11].

• Hwankyungkyoyuk
• /
• v.13 no.2
• /
• pp.38-50
• /
• 2000

We are evidently Home Economicus, egoistic rational utility maximiger, and all the capitalism economic situation make us adapt to such life, and recognize that it is rational to act like that. This can be demonstrated in Prisoner′s Dilemma(PD) which always select the non-cooperative choice for free rider in rational selection process of public goods. This paper notice the "what is problem\ulcorner"The problem is not in free rider itself but in free rider egoism. The practical behavior of free rider egoism can be explained by way of Prisoner′s Dilemma. In PD situation, the prisoner makes a rational choice, non-cooperative alternative, but he doesn′arrive at preto-optimality. It is dilemma. Why can′t he arrive \ulcorner Because he is isolated from other prisoner. So we call it prisoner′s dilemma. The PD situation can be compared with our real economic life, which, we think, have kept by rational choice of the public goods. We actually have made our life as an individual one although we organized communities of capitalism. Of course, we know each others as members of same society, but each individual being can′t secure the belief, which has composed basis of community. So, it is very similar and common between PD situation and our real economic life in the production of public goods. We conclude that this non-cooperative process of PD situation can be utilized as instrument of EE. So this non-cooperative process can show us the effectiveness of EE as follows. \circled1 Game situation life PD can be used as good instrument for explaining the rational selection dilemma(error) to Homo-Economicus, the rational agent, with the optimal and rational language. \circled2 We can show that the selection result is dilemma, not arrive pareto - optimality. \circled3 The dilemma can be resolved with accomplishing the good communal life based on the belief, not on the isolation.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.1
• /
• pp.85-92
• /
• 2005

In this paper, Nash equilibriums of generation markets are investigated using a game theory application for simplified competitive electricity markets. We analyze the characteristics of equilibrium states in N-company spot markets modeled by uniform pricing auctions and propose a new method for obtaining Nash equilibriums of the auction. We assume that spot markets are operated as uniform pricing auctions and that each generation company submits its bids into the auction in the form of a seal-bid. Depending on the bids of generation companies, market demands are allocated to each company accordingly. The uniform pricing auction in this analysis can be formulated as a non-cooperative and static game in which generation companies correspond to players of the game. The coefficient of the bidding function of company-n is the strategy of player-n (company-n) and the payoff of player-n is defined as its profit from the uniform price auction. The solution of this game can be obtained using the concept of the non-cooperative equilibrium originating from the Nash idea. Based on the so called residual demand curve, we can derive the best response function of each generation company in the uniform pricing auction with N companies, analytically. Finally, we present an efficient means to obtain all the possible equilibrium set pairs and to examine their feasibilities as Nash equilibriums. A simple numerical example with three generation companies is demonstrated to illustrate the basic idea of the proposed methodology. From this, we can see the applicability of the proposed method to the real-world problem, even though further future analysis is required.

• Journal of Communications and Networks
• /
• v.17 no.1
• /
• pp.75-83
• /
• 2015

In mobile ad-hoc networks (MANETs), nodes are mobile in nature. Collaboration between mobile nodes is more significant in MANETs, which have as their greatest challenges vulnerabilities to various security attacks and an inability to operate securely while preserving its resources and performing secure routing among nodes. Therefore, it is essential to develop an effective secure routing protocol to protect the nodes from anonymous behaviors. Currently, game theory is a tool that analyzes, formulates and solves selfishness issues. It is seldom applied to detect malicious behavior in networks. It deals, instead, with the strategic and rational behavior of each node. In our study,we used the dynamic Bayesian signaling game to analyze the strategy profile for regular and malicious nodes. This game also revealed the best actions of individual strategies for each node. Perfect Bayesian equilibrium (PBE) provides a prominent solution for signaling games to solve incomplete information by combining strategies and payoff of players that constitute equilibrium. Using PBE strategies of nodes are private information of regular and malicious nodes. Regular nodes should be cooperative during routing and update their payoff, while malicious nodes take sophisticated risks by evaluating their risk of being identified to decide when to decline. This approach minimizes the utility of malicious nodes and it motivates better cooperation between nodes by using the reputation system. Regular nodes monitor continuously to evaluate their neighbors using belief updating systems of the Bayes rule.

• Journal of Internet Computing and Services
• /
• v.11 no.5
• /
• pp.105-117
• /
• 2010

In recent years, dynamic collaboration (DC) among cloud providers (CPs) is becoming an inevitable approach for the widely use of cloud computing and to realize the greatest value of it. In our previous paper, we proposed a combinatorial auction (CA) based cloud market model called CACM that enables a DC platform among different CPs. The CACM model allows any CP to dynamically collaborate with suitable partner CPs to form a group before joining an auction and thus addresses the issue of conflicts minimization that may occur when negotiating among providers. But how to determine optimal group bidding prices, how to obtain the stability condition of the group and how to distribute the winning prices/profits among the group members in the CACM model have not been studied thoroughly. In this paper, we propose to formulate the above problems of cooperative negotiation in the CACM model as a bankruptcy game which is a special type of N-person cooperative game. The stability of the group is analyzed by using the concept of the core and the amount of allocationsto each member of the group is obtained by using Shapley value. Numerical results are presented to demonstrate the behaviors of the proposed approaches.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.49 no.1
• /
• pp.53-58
• /
• 2012

With a game-theoretic view, p-persistence slotted ALOHA is structured as a non-cooperative game, in which a Nash equilibrium is sought to provide a value for the probability of attempting to deliver a packet. An expression of Nash equilibrium necessarily includes the number of active outer stations, which is hardly available in many practical applications. In this paper, we thus propose a Bayesian scheme of predicting the number of active outer stations prior to deciding whether to attempt to deliver a packet or not. Despite only requiring the minimal information that an outer station is genetically able to acquire by itself, the Bayesian scheme demonstrates the competitive predicting performance against a method which depends on heavy information.

• Journal of Korea Society of Industrial Information Systems
• /
• v.20 no.4
• /
• pp.111-126
• /
• 2015

Currently, many enterprises are trying to allocate the investment costs and risks through collaboration, and strengthen their competitiveness by sharing their resources and gains. Intercorporate sharing economy, a type of intercorporate collaboration, refers to the economic activity to share the idle resources of enterprises and enhance their efficiency. For a successful intercorporate economy with the participation of various stakeholders, there is a need to establish the clear allocation method of gains. Accordingly, this study suggested three methods-the MST method that can apply transaction cost incurred when forming a coalition for sharing economy; the average of transaction cost incurred by each participant, and the Shapley Value application method for the transaction cost incurred between the participants. In addition, this study also suggested gain allocation methods such as the "Equal distribution of gain" method, a gain allocation method based on the Cooperative Game Theory, the the "Proportional distribution of gain" method, and the Shapley Value method that takes in consideration the transaction costs.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.113-114
• /
• 2017

본 논문에서는 셀룰라시스템의 상향링크 자원을 사용하는 D2D 단말의 전송전력 최적화문제를 게임이론적 방법으로 고찰해본다. 먼저, 전송전력 최적화문제를 비협력적 전송전력게임으로 구성하고, 구성된 전송전력게임이 나쉬 평형을 가지게 됨을 확인한다. 본 논문에서 도출된 나쉬 평형에서는 개별 D2D 단말은 오로지 자신의 전송전력을 최적화하도록 전송전력값을 선택한다. 하지만, 시스템 입장에서는 결국 모든 단말의 전송전력값은 나쉬평형이라고 하는 전송전력의 유일한 수렴점에 도달하게 된다. 컴퓨터실험을 통하여 다수 개의 D2D 사용자 환경에서 나쉬평형이 존재함을 확인한다.

• ETRI Journal
• /
• v.34 no.2
• /
• pp.159-167
• /
• 2012

In this paper, a new distributed resource allocation algorithm is proposed to alleviate the cross-tier interference for orthogonal frequency division multiplexing access macrocell and femtocell overlay. Specifically, the resource allocation problem is modeled as a non-cooperative game. Based on game theory, we propose an iterative algorithm between subchannel and power allocation called distributed resource allocation which requires no coordination among the two-hierarchy networks. Finally, a macrocell link quality protection process is proposed to guarantee the macrocell UE's quality of service to avoid severe cross-tier interference from femtocells. Simulation results show that the proposed algorithm can achieve remarkable performance gains as compared to the pure waterfilling algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.34-49
• /
• 2015

Market means of spectrum trading have been utilized as a vital method of spectrum sharing and access in future cognitive radio system. In this paper, we consider the spectrum trading with multiple primary carrier providers (PCP) leasing the spectrum to multiple secondary carrier providers (SCP) for a short period of time. Several factors including the price of the resource, duration of leasing, and the spectrum quality guides the proposed model. We formulate three trading policies based on the game theory for dynamic spectrum access in a LTE based cognitive radio system (CRS). In the first, we consider utility function based resource sharing (UFRS) without any knowledge of past transaction. In the second policy, each SCP deals with PCP using a non-cooperative resource sharing (NCRS) method which employs optimal strategy based on reinforcement learning. In variation of second policy, third policy adopts a Nash bargaining while incorporating a recommendation entity in resource sharing (RERS). The simulation results suggest overall increase in throughput while maintaining higher spectrum efficiency and fairness.