• Proceedings of the KAIS Fall Conference
• /
• 2007.11a
• /
• pp.205-208
• /
• 2007

본 논문에서 마이크로 및 피코 셀 환경에 적합한 인증된 바인딩 업데이트 프로토콜을 제안한다. 제안하는 프로토콜은 CGA (Cryptographically Generated Address) 기반의 티켓 방식을 이용한다. 이 방식은 호스트의 공개키와 서브넷 프리픽스를 이용하여 생성한다. 또한 초기통신 시에 대응노드는 이동 노드에게 홈 에이전트를 통한 티켓을 발행한다. 이는 이동노드와 대응노드 간에 직접 바인딩 갱신을 할 수 있도록 도와준다. 또한 대응노드는 티켓 확인을 통한 이동노드를 인증하고 바인딩 업데이트를 안전하게 수행한다. 몇 가지 공격 시나리오를 통한 프로토콜의 안전성을 분석한다. 마지막으로 결론 및 향후 연구 방향에 대해서 제시한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06a
• /
• pp.11-12
• /
• 2008

• Proceedings of the IEEK Conference
• /
• 2000.11c
• /
• pp.189-192
• /
• 2000

This paper presents a new DR(Dead Reckoning) algorithm in client-server-based networked virtual environment using network delay estimation. In the algorithm, a new update packet is sent to server (or client) whenever the difference of current real value and tracking value after network delay is larger than threshold. To confirm the proposed algorithm, a test network game was implemented. Through iterative field tests, we knew that this algorithm provides fair service and stability.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5819-5840
• /
• 2018

Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.

• International Journal of Internet, Broadcasting and Communication
• /
• v.14 no.4
• /
• pp.121-131
• /
• 2022

We look at the initial stage of Meta (previous Facebook)'s new metaverse platform and investigate its platform design in pre-launch and ignition life stage. From the Rocket Model (RM)'s theoretical logic, the results reveal that Meta firstly focuses on investing in key content developers by acquiring virtual reality (VR), video, music content firms and offering production support platform of the augmented reality (AR) content, 'Spark AR' last three years (2019~2021) for attracting high-potential developers and users. In terms of three matching criteria, Meta develops an Artificial Intelligence (AI) powered translation software, partners with Microsoft (MS) for cloud computing and AI, and develops an AI platform for realistic avatar, MyoSuite. In 'connect' function, Meta curates the game concept submitted by game developers, welcomes other game and SNS based metaverse apps, and expands Horizon Worlds (HW) on VR devices to PCs and mobile devices. In 'transact' function, Meta offers 'HW Creator Funding' program for metaverse, launches the first commercialized Meta Avatar Store on Meta's conventional SNS and Messaging apps by inviting all fashion creators to design and sell clothing in this store. Mata also launches an initial test of non-fungible token (NFT) display on Instagram and expands it to Facebook in the US. Lastly, regarding optimization, especially in the face of recent data privacy issues that have adversely affected corporate key performance indicators (KPIs), Meta assures not to collect any new data and to make its privacy policy easier to understand and update its terms of service more user friendly.

• 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 Communications and Networks
• /
• v.14 no.6
• /
• pp.662-671
• /
• 2012

Plug-in hybrid electric vehicles (PHEVs) will be widely used in future transportation systems to reduce oil fuel consumption. Therefore, the electrical energy demand will be increased due to the charging of a large number of vehicles. Without intelligent control strategies, the charging process can easily overload the electricity grid at peak hours. In this paper, we consider a smart charging and discharging process for multiple PHEVs in a building's garage to optimize the energy consumption profile of the building. We formulate a centralized optimization problem in which the building controller or planner aims to minimize the square Euclidean distance between the instantaneous energy demand and the average demand of the building by controlling the charging and discharging schedules of PHEVs (or 'users'). The PHEVs' batteries will be charged during low-demand periods and discharged during high-demand periods in order to reduce the peak load of the building. In a decentralized system, we design an energy cost-sharing model and apply a non-cooperative approach to formulate an energy charging and discharging scheduling game, in which the players are the users, their strategies are the battery charging and discharging schedules, and the utility function of each user is defined as the negative total energy payment to the building. Based on the game theory setup, we also propose a distributed algorithm in which each PHEV independently selects its best strategy to maximize the utility function. The PHEVs update the building planner with their energy charging and discharging schedules. We also show that the PHEV owners will have an incentive to participate in the energy charging and discharging game. Simulation results verify that the proposed distributed algorithm will minimize the peak load and the total energy cost simultaneously.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3565-3583
• /
• 2022

The task scheduling problem has received a lot of attention in recent years as a crucial area for research in the cloud environment. However, due to the difference in objectives considered by service providers and users, it has become a major challenge to resolve the conflicting interests of service providers and users while both can still take into account their respective objectives. Therefore, the task scheduling problem as a bi-objective game problem is formulated first, and then a task scheduling model based on the bi-objective game (TSBOG) is constructed. In this model, energy consumption and resource utilization, which are of concern to the service provider, and cost and task completion rate, which are of concern to the user, are calculated simultaneously. Furthermore, a many-objective evolutionary algorithm based on a partitioned collaborative selection strategy (MaOEA-PCS) has been developed to solve the TSBOG. The MaOEA-PCS can find a balance between population convergence and diversity by partitioning the objective space and selecting the best converging individuals from each region into the next generation. To balance the players' multiple objectives, a crossover and mutation operator based on dynamic games is proposed and applied to MaPEA-PCS as a player's strategy update mechanism. Finally, through a series of experiments, not only the effectiveness of the model compared to a normal many-objective model is demonstrated, but also the performance of MaOEA-PCS and the validity of DGame.

• Journal of Korea Game Society
• /
• v.9 no.2
• /
• pp.135-142
• /
• 2009

Mesh denoising is a method to remove noise applying various filters. However, those methods usually spend much time since filtering is performed on CPU. Because GPU is specialized for floating point operations and faster than CPU, real-time processing for complex operations is possible. Especially mesh denoising is adequate for GPU parallel processing since it repeats the same operations for vertices or triangles. In this paper, we propose mesh denoising algorithm based on bilateral filtering using GPU parallel processing to reduce processing time. It finds neighbor triangles of each vertex for applying bilateral filter, and computes its normal vector. Then it performs bilateral filtering to estimate new vertex position and to update its normal vector.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.215-218
• /
• 2017

본 논문에서는 바둑 대국 동영상에서 배경 영상과의 차이를 이용하여 바둑판 내에서의 움직임을 분석하고, 분석 결과를 이용하여 바둑돌의 착수 위치 및 바둑돌의 종류를 인식하는 자동 바둑 기보 저장 알고리즘을 제안한다. 카메라의 내부 특성이 변하지 않고 렌즈 왜곡이 존재하지 않는다고 가정하였을 때, 바둑판 위에 움직임이 없는 배경 영상과 현재의 영상 간의 차이의 변화량을 블록 단위로 누적한 블록 단위 움직임 맵(Block Motion Map)을 기반으로 움직임의 존재 여부를 판단하고, 착수 후 물체의 움직임이 없어진 영상을 배경 영상으로 갱신하며, 해당 영상과 이전 배경 영상의 패치(Patch)를 이용하여 착수 위치 및 바둑돌의 종류를 인식한다.