• The Journal of the Korea Contents Association
• /
• v.7 no.4
• /
• pp.49-55
• /
• 2007

Recently, with the IPTV services, e-learning, real-time broadcasting and e-contents, many application services need the multicasting routing protocol. In this paper, the performance of the algorithm to assign the rendezvous router (RP: rendezvous point) in the center-based multicasting mesh network is analyzed. The estimated distance to select RP in the candidate nodes is calculated, and the node minimizing the distance is selected as the optimal RP. We estimate the distance by using the maximum distance, average distance, and mean of the maximum and average distance between the RP and members. The performance of the algorithm is compared with the optimal algorithm of all enumeration. With the assumptions of mesh network and randomly positioned for sources and members, the simulations for different parameters are studied. From the simulation results, the performance deviation between the algorithm with minimum cost and optimal method is evaluated as 6.2% average.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.513-518
• /
• 2016

This paper presents a fast 3D mesh generation method using projection for line laser-based 3D scanners. The well-known method for 3D mesh generation utilizes convex hulls for 4D vertices that is converted from the input 3D vertices. This 3D mesh generation for a large set of vertices requires a lot of time. To overcome this problem, the proposed method takes (${\theta}-y$) 2D depth map into account. The 2D depth map is a projection version of 3D data with a form of (${\theta}$, y, z) which are intermediately acquired by line laser-based 3D scanners. Thus, our 2D-based method is a very fast 3D mesh generation method. To evaluate our method, we conduct experiments with intermediate 3D vertex data from line-laser scanners. Experimental results show that the proposed method is superior to the existing method in terms of mesh generation speed.

• Proceedings of the Korea Contents Association Conference
• /
• 2009.05a
• /
• pp.816-821
• /
• 2009

In this paper, I would like to talk about a step by step detailed information browsing which is founded on hierarchical structure for offering suitable information about the mass 3D data of a national treasure building to user as a standard of the visual distance. A step by step detailed information of the national treasure building of gigantic proportions offers a process of detailed information browsing which decided suitable hierarchical structure as considering of the preprocessing procedure which produces hierarchical structure and a visual distance of user. In the preprocessing procedure, 3D data is divided and controlled by optimized spacial structures. The relevance connection between the inner spacial surface is then examined and reconfigured in order to prevent holes or distortions. Finally, relative information data is created. In detailed information browsing, by examining the visual distance between model and user, then by browsing proper step of data, suitable level model data can be provided to the users in accordance with the position of observation.

• Journal of Digital Contents Society
• /
• v.13 no.4
• /
• pp.567-574
• /
• 2012

In this paper, we propose a buffering scheme to improve the performance by adaptively adjusting the length of the buffering period according to the degree of data duplication among peers that belong to each specific playback period in P2P live streaming systems. To do so, we first assign all the peers into many groups depending on their playback time positions. We then determine the length of their buffering periods according to the number of peers belonging to each group. That is, we increase the length of the buffering periods when much buffered data are duplicated among peers within a group while we decrease it when few buffered data are duplicated. By simulation experiments, we show that our proposed buffering scheme can improve the performance significantly compared to the fixed length buffering scheme that have been employed in the existing mesh-based P2P systems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1483-1490
• /
• 2009

Orthogonal frequency division multiplexing (OFDM) has been investigated as an enabling technology for future wireless communications such as ad hoc, mesh and sensor networks. However, prior works on bit-loading lack consideration of the constraints on energy and computing facility in sensor networks. In this paper, we suggest an adaptive bit allocation algorithm for a frequency selective fading channel environment which exploits channel state information obtained through a feedback channel. The proposed algorithm significantly reduces computational complexity and satisfies the power budget. Also, its throughput is comparable to the optimum solution. Simulation results support the claim stated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.660-666
• /
• 2014

In this paper, we consider a classification criteria of sensor nodes based on equipment function, and propose a routing search algorithm between node when an IP-USN is applied inside a ship. whereas a tree-type routing algorithm is applied to the limited mobile enviroment, such as engine room or machine room, a mesh-type routing alogrithm is to free mobile enviroment, such as passager corridor liviing quarters or restanrats areas. For mesh-type routing, it is necessary to maintain a seamless route path between a sink node and sensor nodes for which we consider a novel message exchange periodically. We proposed a new message, RDES message, which is issued periodically to update the topology of sensor node and check a connectivity between nodes.

• Journal of the Korea Computer Graphics Society
• /
• v.16 no.2
• /
• pp.9-17
• /
• 2010

Minkowski sum of two polyedra is an operation to compute the sum of all pairs of points contained in the polyhedra. It has been a very useful tool to solve many geometric problems arising in the areas of robotics, NC machining, solid modeling, and so on. However, very few algorithms have been proposed to compute Minkowski sum of polyhedra, because computing Minkowski sum boundaries is susceptible to roundoff errors. We propose an algorithm to robustly compute the Minkowski sum boundaries by employing the controlled linear perturbation scheme to prevent numerically ambiguous and degenerate cases from occurring. According to our experiments, our algorithm computes the Minkowski sum boundaries with the precision of $10^{-14}$ by perturbing the vertices of the input polyhedra up to $10^{-10}$.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.41 no.6
• /
• pp.91-98
• /
• 2004

This paper proposes a PCB plane model for generic SPICE circuit simulators. The proposed model reflects two frequency-dependent losses, namely skin and dielectric losses. After power/ground plane pair is divided into arrays of unit-cells, each unit-cell is modeled using a transmission line and two loss models. The loss model is composed of a resistor for DC loss, series HL ladder circuit for skin loss and series RC ladder circuit for dielectric loss. To verify the validity of the proposed model, it is compared with SPICE ac analysis using frequency-dependent resistors. Also, we show that the estimation results using the proposed model have a good correlation with that of VNA measurement for the typical PCB stack-up structure of general desktop PCs. With the proposed model, not only ac analysis but also transient analysis can be easily done for circuits including various non-linear/linear devices since the model consists of passive elements onl.

• Journal of Digital Convergence
• /
• v.18 no.5
• /
• pp.249-256
• /
• 2020

The session initiation protocol (SIP) is a signaling protocol, which is used to controlling communication session creation, manage and finish over Internet protocol. Based on it, we can implement various services like voice based electronic commerce or instant messaging. Recently, Qiu et al. proposed an enhanced password authentication scheme for SIP. However, this paper withdraws that Qiu et al.'s scheme is weak against the off-line password guessing attack and has denial of service problem. Addition to this, we propose an improved password authentication scheme as a remedy scheme of Qiu et al.'s scheme. For this, the proposed scheme does not use server's verifier and is based on elliptic curve cryptography. Security validation is provided based on a formal validation tool ProVerif. Security analysis shows that the improved authentication scheme is strong against various attacks over SIP.

• Proceedings of the Optical Society of Korea Conference
• /
• 2007.07a
• /
• pp.243-244
• /
• 2007

본 연구에서는 성형용 코어 가공에서 초경합금(WC, Co 0.5%)의 초정밀 가공특성을 파악하기 위하여 다이아몬드 휠의 메시, 주축 회전속도, 터빈 회전속도, 이송속도 및 연삭깊이에 따른 표면거칠기를 측정하여 최적연삭조건을 규명하였다. 규명된 최적연삭가공조건을 활용하여 페러렐 연삭법으로 초정밀 연삭가공을 수행하였다. 연삭가공은 초정밀가공기(ASP01, Nachi-Fujikoshi Co., Japan)를 사용하였다. 최종 정삭가공을 수행한 비구면 성형용 코어의 형상측정결과 형상정도(PV; ${\varphi}$ 3.0mm) 0.15${\mu}m$(비구면), 0.10${\mu}m$(평면)으로 3M급 이상의 고화질 카메라폰에 채용되고 있는 비구면 Glass렌즈 양산용 성형용 코어 규격에 만족한 결과로서 본 연구에 수행된 초정밀 가공조건 및 측정방법이 매우 유효함을 알 수 있었다. 형상정도(PV) 및 표면조도(Ra) 측정은 초정밀 자유곡면 측정기(UA3P, Panasonic Co., Japan)와 3차원 표면조도 측정기(NewView5000, Zygo Co., USA)를 각각 사용하였다. 초정밀 가공된 성형용 코어면에 이온증착법을 활용하여 DLC 코팅을 수행하였다. 코팅 전후의 성형용코어를 활용하여 Glass소재(K-BK7, Sumita Co., Japan)를 최적의 성형조건(성형온도, 압력, 냉각속도)으로 성형하였다. DLC 코팅과 성형은 DLC 코팅기(NC400, Nanotech Co., Japan)와 Glass렌즈 성형기(Nano Press-S, Sumitomo Co., Japan)을 각각 사용하였다. Fig. 1은 초정밀 연삭가공, DLC 코팅막 구조, 코팅된 성형용 코어, 그리고, 성형된 비구면Glass렌즈를 각각 나타낸다.