• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.127-134
• /
• 2012

Four river project in the South Korea contributes to solve flood damages and water shortages. Also, it has purpose for creating water ecosystem and improving the level of people' cultural leisure and quality of life through inducing water quality improvement and river restoration. It is necessary to monitor a variety of observing data in river areas among dozens to hundreds of kilometer for safe river administration. The 20th construction area of the four river project is located on Hapcheon areas, where wireless mesh network was installed to manage the basin. In the process of network construction, the characteristic of surrounding areas is considered about embodying secure service by investing the least expense. Besides, transmission environment analysis is performed such as LOS tests and reception level analysis, and transmission speed measurement to create safe service. Reception level in all places is confirmed among -55 dBm ~ -70 dBm, and data transmission speed proves more than 20 Mbps.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.1
• /
• pp.57-67
• /
• 2015

A large amount of work has been done in the areas of routing, MAC, QoS, capacity, location service, cooperative communication, fault tolerance, mobility models and various applications of mesh networks thanks to their merits of cost-effective way of deployment and flexibility in extending wireline services. Although multi-path routing protocols have been proposed to be used to provide QoS and fault-tolerance, there has not been any significant results discussed that support both in the literature to our best knowledge as they are often required in military and public safety applications. In this paper, we present a novel routing protocol for a mesh network based on the OFDM-TDMA collision-free MAC that discovers and maintains multiple paths that allows retransmitting and forwarding packets that have been blocked due to a link failure using an alternative next-hop node such that the delay-capacity tradeoff is reduced and the reliability is enhanced. Simulation results show that the proposed protocol performs well in terms of both the QoS and delivery ratio.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.05a
• /
• pp.125-125
• /
• 2001

실 지형정보를 이용한 3D 가상환경은 사용자에게 좀 더 현실에 가까운 교육환경을 제공한다. 3D 가상환경에 사용되는 지형정보는 mesh를 생성하기 위한 고도 data와 mapping을 위한 위성영상이나 항공사진 등이 사용된다. 고도 데이터는 DEM,DTED와 같은 데이터 포맷이 있는데 해상도에 따라 초단위 또는 M 단위로 다양하게 분류되어 있으며 위성영상이나 항공사진도 해상도에 따라 50M∼10Cm 까지 다양하여 사용목적에 맞는 데이터 선택이 필요하다. 고도데이터와 mapping 데이터를 이용하여 기본적인 3D 지형을 생성한 후에 안개나 비, 눈, 빛, 구름과 같은 기상환경을 시뮬레이션하거나 건물이나 이정표, 또는 텍스트 같은 사용자 정보를 Vector overlay 하여 좀 더 현실감 있는 3D 가상환경을 만들 수 있다. 최근에는 인터넷이 일반화되면서 네트웍을 통해 지명데이터를 전송하고 렌더링 하고자 하는 요구가 발생하고 있다. 그러나 3차원 가상환경을 위한 지형 데이터는 2D 데이터에 비해 크기가 크고 고사양의 하드웨어사양을 필요로 하여 네트웍을 통해 전송하고 랜더링 하기에는 여러 가지 제약이 따른다. 이러한 재약을 극복하기 위해 데이터를 한꺼번에 전송하지 않고 점진적으로 전송하고자 하는 연구가 많이 있어 왔으며 점진적 메쉬나 딜로니 규칙에 기반한 TIN 압축 점진적 시각화 기법, DEM 웨이블릿 변환을 적용한 저장, 전송 렌더링 하고자 하는 연구가 시도되어 왔다.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.1
• /
• pp.19-27
• /
• 2000

This paper proposes a non-self-intersecting multiresolution deformable model to extract and reconstruct three-dimensional boundaries of objects from volumetric data. Deformable models offer an attractive method for extracting and reconstructing the boundary surfaces. However, convensional deformable models have three limitations- sensitivity to model initialization, difficulties in dealing with severe object concavities, and model self-intersections. We address the initialization problem by multiresolution model representation, which progressively refines the deformable model based on multiresolution volumetric data in order to extract the boundaries of the objects in a coarse-to-fine fashion. The concavity problem is addressed by mesh size regularization, which matches its size to the unit voxel of the volumetric data. We solve the model self-intersection problem by including a non-self-intersecting force among the customary internal and external forces in the physics-based formulation. This paper presents results of applying our new deformable model to extracting a sphere surface with concavities from a computer-generated volume data and a brain cortical surface from a MR volume data.

• The Journal of the Korea Contents Association
• /
• v.9 no.10
• /
• pp.110-121
• /
• 2009

In this paper, we propose the new method that offer detailed-information through relax the system memory limitation about 3D model to user. That method based on making LOD(Level of Detail) model from huge 3D data of structure cultural assets. In our method as transformed AOSP algorithm, first of all it create the hierarchical structure space about 3D data, and create the LOD model by surface simplification. Then it extract the ROI(Region of Interest) of user in simplified LOD model, and then do rendering by original model and same surface detailed-information after process the local detailed in extracted region. To evaluate the proposed method, we have some experiment by using the precise 3D scan data of structure cultural assets. Our method can offer the detailed-information same as exist method, and moreover 45% reduced consumption of memory experimentally by forming mesh structure same as ROI of simplified LOD model. So we can check the huge structure cultural assets particularly in general computer environment.

• Journal of Digital Contents Society
• /
• v.8 no.3
• /
• pp.323-328
• /
• 2007

Communication systems beyond 3G should provide more than 100 Mbps for wireless access. In addition to smart antennas, wireless multi-hop networks are proposed to increase the cell size and throughput. For example, Zigbee technology is expected to provide low cost and low power connectivity and can be implemented in wireless mesh networks larger than is possible with Bluetooth. Also, home embedded system using wireless mesh network is one of the key market areas for Zigbee applications. If the line-of-sight path is shadowed by home obstacles, a direct connection between the access point (AP) and the node is not possible at high frequencies. Therefore, by using multi-hop relay scheme the end node can be reached to AP. In this paper, the relaying of data between the AP and the end node is investigated and the throughput and PER(Packet Error Rate) are evaluated in multi-hop wireless mesh networks by using DSSS/BPSK system.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.976-985
• /
• 2017

Wireless mesh network (WMN) is a promising technology for building a cost-effective and easily-deployed wireless networking infrastructure. To efficiently utilize limited radio resources in WMNs, packet transmissions (particularly, redundant packet transmissions) should be carefully managed. We therefore propose a lightweight traffic redundancy elimination (LTRE) scheme to reduce redundant packet transmissions in software-defined wireless mesh networks (SD-WMNs). In LTRE, the controller determines the optimal path of each packet to maximize the amount of traffic reduction. In addition, LTRE employs three novel techniques: 1) machine learning (ML)-based information request, 2) ID-based source routing, and 3) popularity-aware cache update. Simulation results show that LTRE can significantly reduce the traffic overhead by 18.34% to 48.89%.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.6
• /
• pp.41-50
• /
• 2003

For copyright protection of digital contents, we employ watermarking techniques to embed watermark signals into digital host data. In this paper we propose an adaptive watermarking algorithm for three-dimensional (3-D) mesh models. Watermark signals are inserted into vertex coordinates adaptively according to changes of their position values. While we embed strong watermarks in the areas of large variations, watermarks are weakly inserted in other areas. After we generate triangle strips by traversing the 3-D model and convert the Cartesian coordinates to the spherical coordinate system, we calculate variations of vertex positions along the traversed strips. Then, we insert watermark signals into the vertex coordinates adaptively according to the calculated variations. We demonstrate that imperceptibility of the inserted watermark is significantly improved and show the bit error rate (BER) for robustness.

• Proceedings of the KAIS Fall Conference
• /
• 2011.05a
• /
• pp.428-432
• /
• 2011

차량 통신 네트워크(VANET, Vehicle Ad hoc NETwork)는 ITS(Intelligent Transport System)의 발전과 함께 운전자의 안전 및 교통 정보, 긴급 메시지 등과 같은 서비스를 실시간으로 가능하게 할 수 있는 차세대 네트워크 기술이다. 이러한 차량 통신 네트워크는 현재 IEEE P1609에서 정의하고 있으며, WAVE(Wireless Access Vehicular Environment)로 알려져 있다. WAVE는 차량에 설치된 OBU(Onboard Unit)와 주변시설에 설치된 RSU(Road Side Unit)을 통하여 통신하며, 차량 간 통신을 지원하는 V2V(Vehicle to Vehicle)와 차량과 주변시설과의 통신을 지원하는 V2I(Vehicle to Infrastructure)로 나뉘어져 있다. 하지만 WAVE에서 정의하고 있는 네트워크 서비스(IEEE P1609.4)는 OBU와 RSU 간의 네트워크 서비스에 초점을 맞추고 있기 때문에 전체 네트워크의 QoS를 보장하기에는 미흡한 상태이다. 따라서 본 논문에서는 차량 통신 네트워크에서 End-to-End 간의 QoS 보장을 위한 무선 메쉬 네트워크 기반의 라우팅 알고리즘을 제안한다. 제안하는 알고리즘은 무선 메쉬 네트워크 노드의 호스트 라우터 기능을 통하여 차량 노드와 이기종 간의 네트워크 서비스를 가능하게 하며, 무선 메쉬 네트워크의 다중 채널을 이용하여 데이터의 중요도에 따른 차등 서비스를 지원한다. ns-2를 이용한 시뮬레이션 결과 제안하는 알고리즘이 QoS를 보장함으로써 차량 통신 네트워크의 성능을 향상시킬 수 있음을 입증하였다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.7
• /
• pp.507-517
• /
• 2003

A single fiber failure in mesh-based WDM networks may result in the loss of a large number of data. To remedy this problem, an efficient restoration algorithm for a single fiber failure in the mesh- based WDM network is necessary. We propose a new algorithm for restoration scheme in WDM networks and compare it with previous schemes. Path restoration and link restoration are two representative restoration schemes which deal with only a single link failure. In this paper, we propose two kinds of efficient restoration scheme. In the proposed schemes the restoration path for each link failure is not secured. The mesh network is decomposed into a number of small loops. In one algorithm, any link failure in a certain loop is regarded as the failure of the loop and the restoration lightpath is selected by detouring the failed loop. In another scheme any link failure in a certain loop is restored within the loop. We compare performance of the proposed schemes with conventional path restoration scheme and link restoration scheme. Simulation results show that CPU time in the proposed schemes decreases compared with that in path restoration scheme and link restoration scheme, although total wavelength mileage usage increases by 10% to 50%.