• Title/Summary/Keyword: overlay network

Search Result 242, Processing Time 0.02 seconds

Dynamic AOI Management for P2P MMOGs (P2P MMOGs에 대한 동적 AOI 관리기법)

  • Lim, Chae-Gyun;Rho, Kyung-Taeg
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.269-273
    • /
    • 2010
  • Massively Multiplayer Online Game (MMOG) is one of diverse applications where more than hundreds of users enjoy experiencing virtual worlds. Voronoi-based Overlay Network (VON) is proposed to reduce a bandwidth consumption in P2P MMOGs and Vorocast also is made using message forwarding in VON. We propose a dynamic area of interest (AOI) management method that solves problems such as less consistency and high latency due to sending position updates to more neighbor nodes from the message originator in forwarding scheme. Our scheme provides the higher consistency and reduces latency by combining direct connection scheme and Vorocast scheme compared to existing schemes. The proposed model is evaluated through simulations.

Self-localization of a Mobile Robot for Decreasing the Error and VRML Image Overlay (오차 감소를 위한 이동로봇 Self-Localization과 VRML 영상오버레이 기법)

  • Kwon Bang-Hyun;Shon Eun-Ho;Kim Young-Chul;Chong Kil-To
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.4
    • /
    • pp.389-394
    • /
    • 2006
  • Inaccurate localization exposes a robot to many dangerous conditions. It could make a robot be moved to wrong direction or damaged by collision with surrounding obstacles. There are numerous approaches to self-localization, and there are different modalities as well (vision, laser range finders, ultrasonic sonars). Since sensor information is generally uncertain and contains noise, there are many researches to reduce the noise. But, the correctness is limited because most researches are based on statistical approach. The goal of our research is to measure more exact robot location by matching between built VRML 3D model and real vision image. To determine the position of mobile robot, landmark-localization technique has been applied. Landmarks are any detectable structure in the physical environment. Some use vertical lines, others use specially designed markers, In this paper, specially designed markers are used as landmarks. Given known focal length and a single image of three landmarks it is possible to compute the angular separation between the lines of sight of the landmarks. The image-processing and neural network pattern matching techniques are employed to recognize landmarks placed in a robot working environment. After self-localization, the 2D scene of the vision is overlaid with the VRML scene.

Landslide Susceptibility Analysis in Baekdu Mountain Area Using ANN and AHP Method

  • Quan, Hechun;Moon, Hongduk;Jin, Guangri;Park, Sungsik
    • Journal of the Korean GEO-environmental Society
    • /
    • v.15 no.12
    • /
    • pp.79-85
    • /
    • 2014
  • To analyze the landslide susceptibility in Baekdu mountain area in china, we get two susceptibility maps using AcrView software through weighted overlay GIS (Geographic Information System) method in this paper. To assess the landslide susceptibility, five factors which affect the landslide occurrence were selected as: slope, aspect, soil type, geological type, and land use. The weight value and rating value of each factor were calculated by the two different methods of AHP (Analytic Hierarchy Process) and ANN (Artificial Neural Network). Then, the weight and rating value was used to obtain the susceptibility maps. Finally, the susceptibility map shows that the very dangerous areas (0.9 or higher) were mainly distributed in the mountainous areas around JiAnShi, LinJiangShi, and HeLongShi near the china-north Korea border and in the mountainous area between the WangQingXian and AnTuXian. From the contrast two susceptibility map, we also Knew that The accuracy of landslide susceptibility map drew by ANN method was better than AHP method.

Scalable P2P Botnet Detection with Threshold Setting in Hadoop Framework (하둡 프레임워크에서 한계점 가변으로 확장성이 가능한 P2P 봇넷 탐지 기법)

  • Huseynov, Khalid;Yoo, Paul D.;Kim, Kwangjo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.25 no.4
    • /
    • pp.807-816
    • /
    • 2015
  • During the last decade most of coordinated security breaches are performed by the means of botnets, which is a large overlay network of compromised computers being controlled by remote botmaster. Due to high volumes of traffic to be analyzed, the challenge is posed by managing tradeoff between system scalability and accuracy. We propose a novel Hadoop-based P2P botnet detection method solving the problem of scalability and having high accuracy. Moreover, our approach is characterized not to require labeled data and applicable to encrypted traffic as well.

Distributed Hash Table based Service Discovery in Mobile Ad Hoc Network (모바일 애드 혹 네트워크에서 분산 해쉬 테이블 기반의 서비스 탐색 기법)

  • Jung, Jae-Hoon;Lee, Seung-Hak;Kim, Nam-Gi;Yoon, Hyn-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.1
    • /
    • pp.91-97
    • /
    • 2008
  • In order to get a desired service in such environments, we need a service discovery method for discovering a device providing that service. In this paper, we propose a service discovery protocol which is based on DHTs (Distributed Hash Tables) to solve these problems. Our protocol is scalable since it does not require a central lookup server and does not rely on multicast or flooding. Simulation results show that our protocol is scalable and outperforms existing service discovery protocols.

Application Layer Multicast Tree Constructing Algorithm for Real-time Media Delivery (실시간 미디어 전송을 위한 응용계층 멀티캐스트 트리 구성 알고리즘)

  • Song Hwangjun;Lee Dong Sup
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.11B
    • /
    • pp.991-1000
    • /
    • 2004
  • This paper presents an application layer multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems for the effective real-time media delivery. Simultaneously, the proposed algorithm takes into account the computing power and the network condition of each end-system as a control variable and thus avoids the undesirable case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.

A Method to Measure Damage Areas on Railway Accidents by the HAZMATs types using GIS Spatial Analysis (GIS 공간 분석기법을 활용한 위험물질별 철도사고 피해규모 자동추출방안에 관한 연구)

  • Park, Min-Kyu;Kim, Si-Gon;Lee, Won-Tae
    • Journal of the Korea Safety Management & Science
    • /
    • v.12 no.1
    • /
    • pp.35-42
    • /
    • 2010
  • Due to the industrialization and urbanization, the transport of hazardous materials increases, which rises possibilities in occurring prospective accidents in terms of hazardous material transport as well. This study applied the model developed from the previous research to analyze the scale of damage areas from the accidents related to hazardous material accidents, as well as suggested a method to measure automatically the scale of accident including casualties and environmental damage based on the guideline which suggests the quantities of hazardous materials exposed from an accident and was defined in the study of standardization for hazardous material classification. A buffering analysis technique of Geographic Information System (GIS) was applied for that. To apply the model which evaluates the scale of population and exposure to environment on each link, rail network, zones, rail accident data, rail freight trips, and locations of rivers etc were complied as a database for GIS analysis. In conclusion, a method to measure damage areas by the types of hazardous materials was introduced using a Clip and a Special Join technique for overlay analysis.

Performance Modeling of STTC-based Dual Virtual Cell System under the Overlay Convergent Networks of Cognitive Networking (중첩 융합 네트워크 환경을 고려한 STTC기반 이중 셀 시스템 분석 모델)

  • Choi, YuMi;Kim, Jeong-Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.20-26
    • /
    • 2012
  • The newly introduced model of a STTC-based Distributed Wireless Communication System (DWCS) can provide the capability of joint control of the signals at multiple cells. This paper has considered the virtual cell systems: the Dual Virtual Cell (DVC), and also proposes DVC employment strategy based on DWCS network. The considered system constructs DVC by using antenna selection method. Also, for multi-user high-rate data transmission, the proposed system introduces multiple antenna technology to get a spatial and temporal diversity gain and exploits space-time trellis codes known as STTC to increase a spectral efficiency.

VRML image overlay method for Robot's Self-Localization (VRML 영상오버레이기법을 이용한 로봇의 Self-Localization)

  • Sohn, Eun-Ho;Kwon, Bang-Hyun;Kim, Young-Chul;Chong, Kil-To
    • Proceedings of the KIEE Conference
    • /
    • 2006.04a
    • /
    • pp.318-320
    • /
    • 2006
  • Inaccurate localization exposes a robot to many dangerous conditions. It could make a robot be moved to wrong direction or damaged by collision with surrounding obstacles. There are numerous approaches to self-localization, and there are different modalities as well (vision, laser range finders, ultrasonic sonars). Since sensor information is generally uncertain and contains noise, there are many researches to reduce the noise. But, the correctness is limited because most researches are based on statistical approach. The goal of our research is to measure more exact robot location by matching between built VRML 3D model and real vision image. To determine the position of mobile robot, landmark-localitzation technique has been applied. Landmarks are any detectable structure in the physical environment. Some use vertical lines, others use specially designed markers, In this paper, specially designed markers are used as landmarks. Given known focal length and a single image of three landmarks it is possible to compute the angular separation between the lines of sight of the landmarks. The image-processing and neural network pattern matching techniques are employed to recognize landmarks placed in a robot working environment. After self-localization, the 2D scene of the vision is overlaid with the VRML scene.

  • PDF

Acquisition of Evidential Information to Control Total Volume of Road Density per Tributary Watershed (도로밀도에 대한 소하천 유역 기반의 총량규제 기초자료 확보 방안)

  • Um, Jung-Sup
    • Journal of Environmental Impact Assessment
    • /
    • v.14 no.5
    • /
    • pp.317-335
    • /
    • 2005
  • This paper is primarily intended to propose a new concept of "aggregate control of road density" which is defined as the area-wide road surface per watershed area. An empirical study for experimental sites was conducted to confirm how a standard GIS technology can be used to assist in estimating the road density in terms of total volume threshold control. Guidelines for a replicable methodology are presented to provide a strong theoretical basis for the standardization of factors involved in the estimation of the road space threshold; the meaningful classification of road types, delination of watershed boundary, interpretation for distribution trends of road density etc. A variety of visual maps using overlay analysis can be generated over large areas quickly and easily to show the fact that some degree of road space already exists in the experimental sites. They could be used as an evidence to limit further construction of road network in comparison with other tributary watershed. It is anticipated that this research output could be used as a valuable reference to confirm the potential of introducing the new concept of "site specific road density" to support more scientific and objective decision-making in the process of road construction project.