• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.2
• /
• pp.629-648
• /
• 2012

Given a video stream delivering system deployed on a multicast tree, which is embedded in a multi-channel multi-radio wireless mesh network, our problem is concerned about how to allocate interference-free channels to tree links and maximize the number of serviced mesh clients at the same time. In this paper, we propose a channel allocation heuristic algorithm based on best-first search and backtracking techniques. The experimental results show that our BFB based CA algorithm outperforms previous methods such as DFS and BFS based CA methods. This superiority is due to the backtracking technique used in BFB approach. It allows previous channel-allocated links to have feasibility to select the other eligible channels when no conflict-free channel can be found for the current link during the CA process. In addition to that, we also propose a tree refinement method to enhance the quality of channel-allocated trees by adding uncovered destinations at the cost of deletion of some covered destinations. Our aim of this refinement is to increase the number of serviced mesh clients. According to our simulation results, it is proved to be an effective method for improving multicast trees produced by BFB, BFS and DFS CA algorithms.

• Journal of the Korea Computer Graphics Society
• /
• v.17 no.3
• /
• pp.43-50
• /
• 2011

We present a trade-off technique for fast but qualitative planar shape deformation using a layered mesh. We construct a layered mesh that is embedding a planar input shape; the upper-layer is denoted as a control mesh and the other lower-layer as a shape mesh that is defined by mean value coordinates relative to the control mesh. First, we try to preserve some shape properties including user constraints for the control mesh by means of a known existing nonlinear least square optimization technique, which produces deformed positions of the control mesh vertices. Then, we compute the deformed positions of the shape mesh vertices indirectly from the deformed control mesh by means of simple coordinates computation. The control mesh consists of a small number of vertices while the shape layer contains relatively a large number of vertices in order to embed the input shape as tightly as possible. Since the time-consuming optimization technique is applied only to the control mesh, the overall execution is extremely fast; however, the quality of deformation is sacrificed due to the sacrificed quality of the control mesh and its relativity to the shape mesh. In order to change the deformation behavior and consequently to compensate the quality sacrifice, we present a method to control the deformation stiffness by incorporating the orientation into the user constraints. According to our experiments, the proposed technique produces a planar shape deformation fast enough for real-time applications on limited embedded systems such as cell phones and tablet PCs.

• International Journal of Contents
• /
• v.5 no.4
• /
• pp.55-61
• /
• 2009

In this paper, we propose a hierarchical method for segmenting a given 3D mesh, which hierarchically clusters sharp vertices of the mesh using the metric of geodesic distance among them. Sharp vertices are extracted from the mesh by analyzing convexity that reflects global geometry. As well as speeding up the computing time, the sharp vertices of this kind avoid the problem of local optima that may occur when feature points are extracted by analyzing the convexity that reflects local geometry. For obtaining more effective results, the sharp vertices are categorized according to the priority from the viewpoint of cognitive science, and the reasonable number of clusters is automatically determined by analyzing the geometric features of the mesh.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.04a
• /
• pp.60-67
• /
• 1998

This paper deals with the development of a variable-node element and its application to the adaptive h-version mesh refinement-recovery for the incompressible viscous flow analysis. The element which has variable mid-side nodes can be used in generating the transition zone between the refined and unrefined elements and efficiently used for construction of a refined mesh without generating distorted elements. A modified Gaussian quadrature is needed to evaluate the element matrices due to the discontinuity of derivatives of the shape functions used for the element. The penalty function method which can reduce the number of independent variables is adopted for the purpose of computational efficiency and the selective reduced integration is carried out for the convection and pressure terms to preserve the stability of solution. For the economical analysis of transient problems, not only the mesh refinement but also the mesh recovery is needed. The numerical examples show that the optimal mesh for the finite element analysis of a wind around the structures can be obtained automatically by the proposed scheme.

• Journal of Soil and Groundwater Environment
• /
• v.11 no.1
• /
• pp.37-44
• /
• 2006

This study summarizes advantages and disadvantages of numerical methods and compares ELLAM and LEZOOMPC to develop an efficient numerical modeling technique on contaminant transport. Eulerian-Lagrangian method and Eulerian method are commonly used numerical techniques. However Eulerian-Lagrangian method does not conserve mass globally and fails to treat boundary in a straightforward manner. Also, Eulerian method has restrictions on the size of Courant number and mesh Peclet number because of time truncation error. ELLAM (Eulerian Lagrangian Localized Adjoint Method) which has been popularly used for past 10 years in numerical modeling, is known for overcoming these numerical problems of Eulerian-Lagrangian method and Eulerian method. However, this study investigates advantages and disadvantages of ELLAM and suggests a change for the better. To figure out the disadvantages of ELLAM, the results of ELLAM, LEZOOMPC (Lagrangian-Eulerian ZOOMing Peak and valley Capturing), and visual MODFLOW are compared for four examples having different mesh Peclet numbers. The result of ELLAM generates numerical oscillation at infinite of mesh Peclet number, but that of LEZOOMPC yields accurate simulations. The simulation results suggest that the numerical error of ELLAM could be alleviated by adopting some schemes in LEZOOMPC. In other words, the numerical model which combines ELLAM with backward particle tracking, forward particle tracking, adaptively local zooming, and peak/valley capturing of LEZOOMPC can be developed for not only overcoming the numerical error of ELLAM, but also keeping the numerical advantage of ELLAM.

• Journal of the Korea Society for Simulation
• /
• v.18 no.1
• /
• pp.1-7
• /
• 2009

In this paper, we obtain the optimal number of interfaces/channels in wireless mesh networks by simulation. The simulation study is done in static multi-channel multi-interface environment. When many nodes use a single interface and channel and contend for the channel, collisions of RTS/CTS results in network performance degradation. To avoid such degradation and reduce interferences between the adjacent nodes, use of multi-interface/channel is considered. 802.11a and 802.11b systems offer 12 and 3 orthogonal channels respectively and multi-interface/channel scheme could be applied. But rare research about the optimal number of interfaces/channels has been studied. Therefore, in this paper, simulation study for the optimal number of interfaces/channels in wireless mesh network is made.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.48 no.4
• /
• pp.301-309
• /
• 2012

A net-assembling company for gill net fishing gears makes a design based on the size of nets provided and determines floats, types of weights, and numbers. In addition, through the accurate examination of net weights in the process of fishing gear designing, it can prevent an excessive use of designing costs. The weight of twine can be easily calculated by its thickness differences, but the weight of netting has errors to be calibrated since the weight of netting is not changing exponentially with the changes of number and size of meshes. This study aims to suggest and empirically analyze the methods for estimating the weights of netting in accordance with the changes of number, size and thickness of meshes for a sound management of netting and net-assembling companies. Results indicated that the method using the knots and legs of netting was not practically usable because the errors were increased as the number of mesh increased. However, the method using netting area shown its usage potentiality with the calibration of the increasing ratio of mesh numbers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11B
• /
• pp.1607-1617
• /
• 2010

In this paper we propose MA-CBRP, mesh adaptive algorithm for wireless mesh networks. MA-CBRP is a hybrid algorithm based on ad-hoc CBRP protocol. In MA-CBRP, the mesh router periodically sends the ANN message as like Hello-message in CBRP. ANN message allows to all clients periodically store a route towards the mesh-router and renewal information in their routing cache. While CBRP periodically reply Hello-message, MA-CBRP does not reply to achieve less overhead. After receiving ANN message, mesh client send JOIN message to mesh router when the route towards mesh router changed. at the same time Register the entry to mesh router, it can achieve to reduce overhead of control the route and shorten the time to find route. consequently, MA-CBRP shows 7% reduced overhead and shortened time to find route than CBRP with regardless of clients number.

• Journal of electromagnetic engineering and science
• /
• v.1 no.1
• /
• pp.78-82
• /
• 2001

For fast capacitance computation, a simple mesh refinement technique on MLFMA(Multi-Level Fast Multipole Algorithm) is proposed The triangular meshes are refined mainly in the area which has heavy charge density. The technique is applied to the capacitance extraction of three dimensional conductors. The results show good convergence with comparable accuracy. An adaptive technique concerned with MLFMA is useful to reduce computation time and the number of elements without additional computational efforts in large three dimensional problems.

• International Journal of Aeronautical and Space Sciences
• /
• v.10 no.1
• /
• pp.104-111
• /
• 2009

An unstructured overset mesh method has been developed for the simulation of unsteady flow fields around isolated rotors and rotor-fuselage configurations. The flow solver was parallelized for the efficient calculation of complicated flows requiring a large number of cells. A quasi-unsteady mesh adaptation technique was adopted to enhance the spatial accuracy of the solution and to better resolve the rotor wake. The method has been applied to calculate the flow fields around rotor-alone and rotor-fuselage configurations in forward flight. Validations were made by comparing the predicted results with those of measurements. It was demonstrated that the present method is efficient and robust for the prediction of unsteady time-accurate flow fields involving multiple bodies in relative motion.