• Title/Summary/Keyword: 모델리스트

Search Result 185, Processing Time 0.026 seconds

On NeMRI-Based Multicasting for Network Mobility (네트워크 이동성을 고려한 NeMRI 기반의 멀티캐스트 라우팅 프로토콜)

  • Kim, Moon-Seong;Park, Jeong-Hoon;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.9 no.2
    • /
    • pp.35-42
    • /
    • 2008
  • Mobile IP is a solution to support mobile nodes, however, it does not handle NEtwork MObility (NEMO). The NEMO Basic Support (NBS) protocol ensures session continuity for all the nodes in the mobile network. Since the protocol is based on Mobile IP, it inherits the same fundamental problem such as tunnel convergence, when supporting the multicast for NEMO. In this paper, we propose the multicast route optimization scheme for NEMO environment. We assume that the Mobile Router (MR) has a multicast function and the Nested Mobile Router Information (NeMRI) table. The NeMRI is used to record o list of the CoAs of all the MRs located below it. And it covers whether MRs desire multicast services. Any Route Optimization (RO) scheme can be employed here for pinball routing. Therefore, we achieve optimal routes for multicasting based on the given architecture. We also propose cost analytic models to evaluate the performance of our scheme. We observe significantly better multicast cost in NEMO compared with other techniques such as Bi-directional Tunneling, Remote Subscription, and Mobile Multicast based on the NBS protocol.

  • PDF

Wi-Fi Fingerprint Location Estimation System Based on Reliability (신뢰도 기반 Wi-Fi 핑거프린트 위치 추정 시스템)

  • Son, Sanghyun;Park, Youngjoon;Kim, Beomjun;Baek, Yunju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38C no.6
    • /
    • pp.531-539
    • /
    • 2013
  • Fingerprinting technique uses the radio signal strength measured reference locations is typically used, although there are many Wi-Fi based location tracking techniques. However, it needs numerous reference locations for precision and accuracy. This paper the analyzes problems of previous techniques and proposes a fingerprinting system using reliability based on a signal strength map. The system collects the signal strength data from a number of reference locations designated by the developer. And then it generates path-loss models to one of the access points for each reference location. These models calculate the predicted signal strength and reliability for a lattice. To evaluate proposed method and system performance, We perform experiments in a $20m{\times}22m$ real indoor environment installed access points. According to the result, the proposed system reduced distance error than RADAR. Comparing the existing system, it reduced about 1.74m.

The Effective Application Management Using Characteristics of Tizen Wearable Platform (타이젠 웨어러블 플랫폼의 특성을 이용한 효율적인 어플리케이션 관리)

  • Ham, Dong-eup
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2017.10a
    • /
    • pp.318-321
    • /
    • 2017
  • Most of wearable platforms(i. e. Samsung Gear, Android Wear) are using most of Tizen mobile platform features without any changes. However wearable devices have unique characteristics due to wearable type, small battery, screen shape, poor network and relative short but frequent user interfaces. In general, a wearable device has a process to be paired with the mobile device, which includes capability exchange that includes information such as device model name, network capability (3G, LTE, Wi-Fi and so on), manufacturer and supported languages. In other word, a wearable device depends heavily on the companion device (i. e. phone, tablet), so wearable platform should consider this. In this paper, we provide the effective application management mechanism using these characteristics of wearable platform to enhance user experience and to reduce sluggish of wearable platform.

  • PDF

Data Sharing Technique between Heterogeneous based on Cloud Service (클라우드 서비스 기반 이기종간의 데이터 공유 기법)

  • Seo, Jung-Hee;Park, Hung-Bog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.3
    • /
    • pp.391-398
    • /
    • 2018
  • There are many problems caused by data sharing between general heterogeneous digital devices due to various interfaces. To solve this problem, this paper proposes heterogeneous data sharing with cloud service and mobile through D2D communication that supports communication between different devices. The proposed technique is used to reduce the load on the server to perform data synchronization. Also, in order to minimize data latency caused by data replication between different devices, a technique to enhance the speed of data writing with copying only the modified parts in the chunk list is adopted and cloud service model integrated with mobile environment is realized in order to minimize the network bandwidth consumed for synchronization for data sharing. Therefore, it is possible to share data in different spaces efficiently with maintaining data integrity and minimizing latency in data.

On Transmission Scheduling with Tuning-Limited Transmitters in WDM Star Networks (파장 분할 방식 성형 통신망에서 조정 제약을 갖는 전송기를 이용한 전송 스케줄링)

  • Choi, Hong-Sik;Lee, Kyung-Joon;Kim, Jin
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.129-140
    • /
    • 2002
  • In this paper, we consider the problem of packet transmission in a wavelength division multiplexed(WDM) optical network. Our network model assumes that receivers are fixed-tuned and transmitters are tunable such that optical lasers assigned to transmitters have limited access to the network bandwidth: hence each node must be equipped with multiple optical lasers and/or multiple optical filters in order to maintain a single-hop network. We first analyze scheduling all-to-all packet transmissions and present optimum scheduling for all-to-all packet transmissions. We then extend the analysis to the case of arbitrary traffic demands. We show that the scheduling with arbitrary traffic demand is NP-hard. A heuristic algorithm based on list scheduling is presented. The upper bound so obtained is compared with the lower bound and provides performance guarantees with arbitrary demands. The result are applicable to arbitrary tuning delay, arbitrary number of wavelength channels and optical lasers of arbitrary tuning ranges.

A Study on Development of Dump Truck Route Exploration System (토공 운반경로 탐색 시스템 개발에 관한 연구)

  • Kang, Sanghyeok;Park, Soohyun;Seo, Jongwon
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.38 no.6
    • /
    • pp.957-965
    • /
    • 2018
  • This study presents a geographic information system based dump truck route exploring system (DRES) which provides construction managers and hauling operators with efficient route information that can improve earthmoving productivity by reducing hauling time. The system is comprised of Network Analyst from Esri as a route exploring engine and a network data model. The network data model includes information on weight limit of bridges, height limit of pedestrian overpasses, and one way that impedes dump trucks' hauling efficiency. A construction manager is expected to input origin and destination point in the user interface, and the system generates an efficient route that avoids bridges with weight limit or pedestrian overpasses with height limit. The system was applied to a real earthmoving project to test its applicability, and it was found that the system functions as intended.

A Routing Algorithm based on Deep Reinforcement Learning in SDN (SDN에서 심층강화학습 기반 라우팅 알고리즘)

  • Lee, Sung-Keun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.6
    • /
    • pp.1153-1160
    • /
    • 2021
  • This paper proposes a routing algorithm that determines the optimal path using deep reinforcement learning in software-defined networks. The deep reinforcement learning model for learning is based on DQN, the inputs are the current network state, source, and destination nodes, and the output returns a list of routes from source to destination. The routing task is defined as a discrete control problem, and the quality of service parameters for routing consider delay, bandwidth, and loss rate. The routing agent classifies the appropriate service class according to the user's quality of service profile, and converts the service class that can be provided for each link from the current network state collected from the SDN. Based on this converted information, it learns to select a route that satisfies the required service level from the source to the destination. The simulation results indicated that if the proposed algorithm proceeds with a certain episode, the correct path is selected and the learning is successfully performed.

Classification of Security Checklist Items based on Machine Learning to Manage Security Checklists Efficiently (보안 점검 목록을 효율적으로 관리하기 위한 머신러닝 기반의 보안 점검 항목 분류)

  • Hyun Kyung Park;Hyo Beom Ahn
    • Smart Media Journal
    • /
    • v.11 no.11
    • /
    • pp.75-83
    • /
    • 2022
  • NIST in the United States has developed SCAP, a protocol that enables automated inspection and management of security vulnerability using existing standards such as CVE and CPE. SCAP operates by creating a checklist using the XCCDF and OVAL languages and running the prepared checklist with the SCAP tool such as the SCAP Workbench made by OpenSCAP to return the check result. SCAP checklist files for various operating systems are shared through the NCP community, and the checklist files include ID, title, description, and inspection method for each item. However, since the inspection items are simply listed in the order in which they are written, so it is necessary to classify and manage the items by type so that the security manager can systematically manage them using the SCAP checklist file. In this study, we propose a method of extracting the description of each inspection item from the SCAP checklist file written in OVAL language, classifying the categories through a machine learning model, and outputting the SCAP check results for each classified item.

Development of a Model for Dynamic Station Assignmentto Optimize Demand Responsive Transit Operation (수요대응형 모빌리티 최적 운영을 위한 동적정류장 배정 모형 개발)

  • Kim, Jinju;Bang, Soohyuk
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.21 no.1
    • /
    • pp.17-34
    • /
    • 2022
  • This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

Development and Application of Satellite Orbit Simulator for Analysis of Optimal Satellite Images by Disaster Type : Case of Typhoon MITAG (2019) (재난유형별 최적 위성영상 분석을 위한 위성 궤도 시뮬레이터 개발 및 적용 : 태풍 미탁(2019) 사례)

  • Lim, SoMang;Kang, Ki-mook;Yu, WanSik;Hwang, EuiHo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2022.05a
    • /
    • pp.439-439
    • /
    • 2022
  • 인공위성은 위성통신, 기상 등 다양한 분야에서 활용되고 있지만 재난과 위성영상 특성 매칭의 제약으로 재난 상황에서는 제한적으로 사용되었다. 국내외 위성 갯수의 증가로 위성영상을 준-실시간으로 확보 가능함에 따라 활용할 수 있는 범위가 증가하여 최근에는 재난·재해에 신속하게 대비하기 위한 연구가 활발히 진행되고 있다. 본 연구는 재난 발생 지역의 위성 영상 확보를 위해 촬영된 영상과 미래시점의 촬영 예정인 영상의 촬영 예정 시간 및 영역을 빠른 시간 내 분석하여 최적 위성영상 확보에 기반이 되고자 한다. 행정안전부에서 분류한 재난·재해 유형에 따라 재난 예측, 탐지, 사후처리를 위한 위성자료의 확보를 위하여 다양한 위성과 탑재된 센서들의 궤도, 공간 해상도, 파장대 등의 위성영상의 적시성을 분석하여 최적 위성을 정의하였다. 위성 궤도 시뮬레이션은 TLE(Two Line Element) 정보를 이용하는 SGP4(Simplified General Perturbations version 4) 모델에 적용하여 개발하였다. 최신 TLE 정보를 이용하여 위성 궤도 정보 및 센서 정보(공간 해상도, Swath width, incidence angle IFOV 등)을 적용하였다. 수집된 위성 궤도 정보를 기반으로 위성의 궤도를 예측하여 예측된 위치에서의 촬영 영역을 산정하는 분석 기능을 수행하여 최종 시뮬레이션 데이터를 생성한다. 개발된 위성 궤도 시뮬레이션 알고리즘을 토대로 태풍 미탁 사례에 적용하였다. 위성 궤도 시뮬레이션 알고리즘을 태풍 미탁 사례에 적용한 결과 다종 위성리스트 중 위성 궤도 분석을 통해 최단기간 획득 가능한 위성 중 정지 궤도 기상위성인 Himawari-8, GK-2A는 태풍 경로 모니터링, 광학 위성인 Sentinel-2, PlanetScope는 건물 피해 지역, SAR 위성인 Sentinel-1, ICEYE는 홍수 지역을 탐지하는데 최적 위성 영상으로 분석되었다.

  • PDF