• KIPS Transactions on Computer and Communication Systems
• /
• v.6 no.7
• /
• pp.315-320
• /
• 2017

In this paper, I design a new scheme that is immune to malicious attack based on the weighted voting game. By using stochastic learning, the proposed scheme can revoke the certification of malicious node. Through the revocation process, the proposed scheme can effectively adapt the dynamic Mobile Ad hoc network situation. Simulation results clearly indicate that the developed scheme has better performance than other existing schemes under widely diverse network environments.

• Journal of Korea Game Society
• /
• v.9 no.5
• /
• pp.95-104
• /
• 2009

Recently, increasing numbers of games and simulators are being implemented by employing the physically-based modeling techniques for better realism. In this paper, we propose the implementation techniques for overhead crane simulator based on ODE, the well-known open source dynamic engine. By comparing the dynamic behavior of the proposed system with a commercial engine based simulator, the physical plausibility and the effectiveness of the ODE based OHC simulator are verified. We expect the proposed the OHC simulator can be successfully utilized for virtual training in various educational institutes.

• Journal of Korea Game Society
• /
• v.13 no.5
• /
• pp.63-72
• /
• 2013

To enhance the effect of science educational contents, we developed a motion based training content: 3D space exploration. In this content, we used the 3D depth camera for user's motion recognition. Learners have to conduct the space station maintenance mission using the motion based natural and intuitive interface. The result this study is expected to propose the immersive training simulation for young science learners.

• Journal of the Korean Data and Information Science Society
• /
• v.25 no.4
• /
• pp.697-703
• /
• 2014

Deal-or-No-Deal game is a famous TV show program of NBC, USA, which is composed of 10 stages at most. At each stage from the first and the ninth, a banker suggests a deal price to participants. In this paper, we intend to reveal the banker's deal price model using a constrained linear model and quadratic program. As results, we provide a linear model in relation to the deal price at each stage and then show using simulation data that the deal price is equal to the nearest integer of the value to be obtained by the provided linear model.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.159-177
• /
• 2018

Participatory sensing is becoming popular and has shown its great potential in data acquisition for ambient assisted living. In this paper, we propose an incentive mechanism in participatory sensing for ambient assisted living, which benefits both the platform and the mobile devices that participated in the sensing task. Firstly, we analyze the profit of participant and platform, and a Stackelberg game model is formulated. The model takes privacy, reputation, power state and quality of data into consideration, and aims at maximizing the profit for both participant and publisher. The discussion of properties of the game show that there exists an unique Stackelberg equilibrium. Secondly, two algorithms are given: one describes how to reach the Stackelberg equilibrium and the other presents the procedures of employing the incentive strategy. Finally, we conduct simulations to evaluate the properties and effectiveness of the proposed mechanism. Simulation results show that the proposed incentive mechanism works well, and the participants and the publisher will be benefitted from it. With the mechanism, the total amount of sensory data can be maximized and the quality of the data can be guaranteed effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1811-1813
• /
• 2016

DCF (Distributed Coordination Function) resolves the channel contention problem in a distributed manner by forcing nodes to randomly choose a waiting time in a contention window. However, since the size of a contention is limited, the collision probability increases with the number of sending nodes. To resolve the problem, in this paper, we propose a transmission control method based on the minority game (MG). Each node can determine autonomously whether to send or not without message exchanges with other nodes to maximize its profit. Through simulation studies, we verify that the proposed method can improves the performance of DCF in terms of collision probability in a congestion situation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.11
• /
• pp.5253-5270
• /
• 2016

With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.2
• /
• pp.611-627
• /
• 2017

For enhancing the coverage of wireless networks and increasing the spectrum efficiency, small cell networks (SCNs) are considered to be one of the most prospective schemes. Most of the existing literature on resource allocation among non-cooperative small cell base stations (SBSs) has widely drawn close attention and there are only a small number of the cooperative ideas in SCNs. Based on the motivation, we further investigate the cooperative approach, which is formulated as a coalition formation game with power control algorithm (CFG-PC). First, we formulate the downlink sub-channel resource allocation problem in an SCN as a coalition formation game. Pareto order and utilitarian order are applied to form coalitions respectively. Second, to achieve more availability and efficiency power assignment, we expand and solve the power control using particle swarm optimization (PSO). Finally, with our proposed algorithm, each SBS can cooperatively work and eventually converge to a stable SBS partition. As far as the transmit rate of per SBS and the system rate are concerned respectively, simulation results indicate that our proposed CFG-PC has a significant advantage, relative to a classical coalition formation algorithm and the non-cooperative case.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1554-1566
• /
• 2014

Cloud Computing allows application providers seamlessly scaling their services and enables users scaling their usage according to their needs. In this paper, using queuing game model, we present service scheduling schemes which are used in software as a service (SaaS). The object is maximizing the Cloud Computing platform's (CCP's) payoff via controlling the service requests whether to join or balk, and controlling the value of CCP's admission fee. Firstly, we treat the CCP as one virtual machine (VM) and analyze the optimal queue length with a fixed admission fee distribution. If the position number of a new service request is bigger than the optimal queue length, it balks. Otherwise, it joins in. Under this scheme, the CCP's payoff can be maximized. Secondly, we extend this achievement to the multiple VMs situation. A big difference between single VM and multiple VMs is that the latter one needs to decide which VM the service requests turn to for service. We use a corresponding algorithm solve it. Simulation results demonstrate the good performance of our schemes.

• Journal of Information Technology Applications and Management
• /
• v.14 no.4
• /
• pp.139-158
• /
• 2007

Information sharing is key to effective supply chain management. In reality, however, it is impossible to get perfect information. Accordingly, only uncertain information can be accessed in business environment, and thus it is important to deal with the uncertainties of information in managing supply chains. This study adopts meteorological forecast as a typical uncertain information. The meteorological events may affect the demands for various weather-sensitive goods, such as beer, ices, clothes, electricity etc. In this study, a beer distribution game is modified by introducing meterological forecast information provided in a probabilistic format. The behavior patterns of the modified beer supply chains are investigated. for two conditions using the weather forecast with or without an information sharing. A value score is introduced to generalize the well-known performance measures employed in the study of supply chains, i.e.. inventory, backlog, and deviation of orders. The simulation result showed that meterological forecast information used in an information sharing environment was more effective than without information sharing, which emphasizes the synergy of uncertain information added to the information sharing environment.