• 정보보호학회논문지
• /
• 제33권3호
• /
• pp.549-559
• /
• 2023

5G 네트워크의 핵심 기술로 모바일 에지 컴퓨팅(Mobile Edge Computing, MEC)이 주목받음에 따라, 모바일 사용자의 데이터를 기반으로 한 5G 네트워크 기반 에지 AI 기술이 최근 다양한 분야에서 이용되고 있다. 하지만, 전통적인 인공지능 보안에서와 마찬가지로, 에지 AI 핵심 기능을 담당하는 코어망 내 표준 5G 네트워크 기능들에 대한 적대적 교란이 발생할 가능성이 존재한다. 더불어, 3GPP에서 정의한 5G 표준 내 Standalone 모드의MEC 환경에서 발생할 수 있는 데이터 오염 공격은 기존 LTE망 대비 현재 연구가 미비한 실정이다. 본연구에서는 5G에서 에지 AI의 핵심 기능을 담당하는 네트워크 기능인 NWDAF를 활용하는 MEC 환경에 대한 위협 모델을 탐구하고, 일부 개념 증명으로써 Leaf NWDAF에 대한 데이터 오염 공격 탐지 성능을 향상시키기 위한 특징 선택 방법을 제안한다. 제안한 방법론을 통해, NWDAF에서의 Slowloris 공격 기반 데이터 오염 공격에 대해 최대 94.9%의 탐지율을 달성하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권12호
• /
• pp.5442-5463
• /
• 2016

Designing efficient routing protocols for a wireless sensor network with mobile sinks (mWSN) is a challenging task since the network topology and data paths change frequently as sink nodes move. In this paper, we design a novel lightweight reactive ring based routing protocol called R3, which removes the need of proactively maintaining data paths to mobile sinks as they move in the network. To achieve high packet delivery ratio and low transmission cost, R3 combines ring based forwarding and trail based forwarding together. To support efficient ring based forwarding, we build a ring based structure for a network in a way such that each node in the network can easily obtain its ring ID and virtual angle information. For this purpose, we artificially create a virtual hole in the central area of the network and accordingly find a shortest cycled path enclosing the hole, which serves as base ring and is used for generating the remaining ring based structure. We accordingly present the detailed design description for R3, which only requires each node to keep very limited routing information. We derive the communication overhead by ring based forwarding. Extensive simulation results show that R3 can achieve high routing performance as compared with existing work.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권6호
• /
• pp.2811-2830
• /
• 2017

In this paper, we study the problem of mobile data offloading for a network that contains multiple mobile network operators (MNOs), multiple WiFi or femtocell access points (APs) and multiple mobile users (MUs). MNOs offload their subscribed MUs' data traffic by leasing the unused Internet connection bandwidth of third party APs. We propose a combinatorial auction-based two-stage matching mechanism comprised of MU-AP matching and AP-MNO matching. The MU-AP matching is designed to match the MUs to APs in order to maximize the total offloading data traffic and achieve better MU satisfaction. Conversely, for AP-MNO matching, MNOs compete for APs' service using the Nash bargaining solution (NBS) and the Vickrey auction theories and, in turn, APs will receive monetary compensation. We demonstrated that the proposed mechanism converges to a distributed stable matching result. Numerical results demonstrate that the proposed algorithm well capture the tradeoff among the total data traffic, social welfare and the QoS of MUs compared to other schemes. Moreover, the proposed mechanism can considerably offload the total data traffic and improve the network social welfare with less computation complexity and communication overhead.

• 한국정보과학회논문지:정보통신
• /
• 제27권2호
• /
• pp.219-225
• /
• 2000

적절한 이동 인터넷 서비스를 제공하기 위해서는 IP의 이동성을 제공하는 Mobile IP의 지원이 필요하며 이를 위한 서비스 네트웍의 구축을 위해서는 속도, 확장성 그리고 서비스 제공능력이 뛰어난 IETF(Internet Engineering Task Force)의 MPLS(Multi-protocol Label Switching)로 구성이 바람직하다. 본 논문은 현재 MPLS표준화에서 이동성을 지원하는 노력을 하고있지 않은 상태에서 Mobile IP를 효율적으로 수용하는 MPLS 구조를 제시한다. 제시하는 구조는 Mobile IP의 등록 메시지와 MPLS 레이블의 분배를 결합하여 망 내의 터널링 시 3계층의 캡슐화가 아닌 2계층을 터널링을 활용하여 헤더의 남용을 막고 홈 에이전트로 유입되는 패킷들이 이동성 바인딩 리스트를 참조하지 않고 지연 없이 망 내로 터널링 될 수 있는 구조를 보여준다. 제시하는 구조는 특히 무선 망과의 연동과 인터넷과의 연동 기능을 수행하는 IMT-2000망에서 이동 인터넷을 위한 서비스 패킷 망의 기본 구조로 활용될 수 있다.

• 디지털콘텐츠학회 논문지
• /
• 제9권1호
• /
• pp.33-39
• /
• 2008

Ad Hoc Network는 인프라스트럭처 기반의 네트워크가 아니고 노드들이 분포되어 있기 때문에 공격을 받기가 쉽다. 침입탐지시스템은 다른 노드들의 신뢰 수준을 감지하고 노드의 로컬 보안에 대한 검사와 감시 능력을 제공한다. 본 논문에서는 침입 탐지를 하는데 오버헤드를 줄이기 위해 클러스터링 기법을 적용하였다. 그리고 노드들 간의 신뢰도를 측정하기 위해 클러스터 헤드가 멤버 노드로부터 받은 신뢰 정보와 자신의 정보를 조합하여 다른 노드의 신뢰도를 평가한다. 이렇게 함으로써 네트워크내의 노드들의 대한 인증을 정확하게 수행할 수 있게 되어 안전한 데이터 전송을 제공하게 된다.

• 한국컴퓨터정보학회논문지
• /
• 제23권10호
• /
• pp.81-86
• /
• 2018

In the field of mobile games, social network games are steadily increasing in market scale and public interest every year. This paper proposes a method to design a social network game, which is one of the most successful genres in mobile games. The method uses Unity3D, the most commonly used engine for mobile game development. NGUI, a versatile developmental tool of Unity3D, is used to create shops and battle UIs. This paper particularly focuses on how to use the web hosting service to search and operate the necessary data from the database in the server. In addition, the proposed social network game is easy to implement real-time battle using Animator and Raycast, and is characterized by efficient battle implementation through time delay using Coroutine function.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권4호
• /
• pp.38-43
• /
• 2017

Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1601-1604
• /
• 1997

The most important topic in research of mobile robot is path planning in order to avoid with obstacle. In this study the path planning algorithm using a neural network model is proposed. The inputs of neural network are range data which are acquired form laser range finderm and weights are based on difference with goal direction. The thresholds are made by consdiering the marginal distance between mobile robot and obstacle. Consequently the outputs are obtained by multiplying input and weight. The obtained heading directiion enables the mobile robot to approach the goal, without any collision with obstacles around. The effectiveness of the this method of real-time navigation of a mobile robot is estimated by computer simulation in complex environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권3호
• /
• pp.872-885
• /
• 2015

The rapid increase of smart mobile devices and mobile applications has led to explosive growth of data traffic in cellular network. Offloading data traffic becomes one of the most urgent technical problems. Recent work has proposed to exploit opportunistic communications to offload cellular traffic for mobile data dissemination services, especially for accepting large delayed data. The basic idea is to deliver the data to only part of subscribers (called target-nodes) via the cellular network, and allow target-nodes to disseminate the data through opportunistic communications. Human mobility shows temporal and spatial characteristics and predictability, which can be used as effective guidance efficient opportunistic communication. Therefore, based on the regularity of human mobility we propose NodeRank algorithm which uses the encounter characteristics between nodes to choose target nodes. Different from the existing work which only using encounter frequency, NodeRank algorithm combined the contact time and inter-contact time meanwhile to ensure integrity and availability of message delivery. The simulation results based on real-world mobility traces show the performance advantages of NodeRank in offloading efficiency and network redundant copies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제2권1호
• /
• pp.5-21
• /
• 2008

In order to securely transmit multicast data packets in a mobile environment where frequent join/leave events are a characteristic of the environment, there is a need for a new secure and efficient group key management solution. We propose a secure group key generation/distribution solution providing scalability and reliability. Using this solution, when a mobile node, which is in a multicast session, enters a new domain, the agent of the domain joins the multicast session and coordinates its data packets with the mobile node. The agent encrypts and transmits subsequent data packets to the mobile node, using a local one-time pad key. This key is generated with FI sequences, enabling the mobile node to regenerate the same data packet, based on the information sent by the agent. Our performance analysis demonstrates that the proposed solution can significantly reduce the number of key generations and distributions, when it is applied to the hierarchical mobile IPv6 network.