• Journal of Information Processing Systems
• /
• v.14 no.6
• /
• pp.1347-1360
• /
• 2018

Owing to limited energy in wireless devices power saving is very critical to prolong the lifetime of the networks. In this regard, we designed a cross-layer optimization mechanism based on power control in which source node broadcasts a Route Request Packet (RREQ) containing information such as node id, image size, end to end bit error rate (BER) and residual battery energy to its neighbor nodes to initiate a multimedia session. Each intermediate node appends its remaining battery energy, link gain, node id and average noise power to the RREQ packet. Upon receiving the RREQ packets, the sink node finds node disjoint paths and calculates the optimal power vectors for each disjoint path using cross layer optimization algorithm. Sink based cross-layer maximal minimal residual energy (MMRE) algorithm finds the number of image packets that can be sent on each path and sends the Route Reply Packet (RREP) to the source on each disjoint path which contains the information such as optimal power vector, remaining battery energy vector and number of packets that can be sent on the path by the source. Simulation results indicate that considerable energy saving can be accomplished with the proposed cross layer power control algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.40
• /
• pp.107-117
• /
• 1996

This paper considers the part assignment to workstations in flexible manufactuirng system (FMS). Parts are processed through several workstations according to processing order. The machines of each workstation can do multiple Processing functions. Therefore, a processing of a part can be processed in several workstations, which are non-identical in functional performance. Although a processing of a part can be processed in the multiple workstations, it has to be processed in only one among available several workstations, Parts are transported with unit load by automated guided vehicles (AGVs). The criteria of part assignment is to minimize the maximum value of the processing times of each workstation and the total transport times of vehicles. Model formulation is suggested, and numerical example is shown.

• Journal of Communications and Networks
• /
• v.13 no.4
• /
• pp.408-417
• /
• 2011

The stringent performance requirement for the high efficiency of routing protocols on the Internet can be satisfied by exploiting the threaded border gateway protocol (TBGP) on multi-cores, but the state-of-the-art TBGP performance is restricted by a mass of contentions when racing to access the routing table. To this end, the highly-efficient parallel access approach appears to be a promising solution to achieve ultra-high route processing speed. This study proposes a general routing table structure consisting of two-level tries for fast parallel access, and it presents a heuristic-based divide-and-recombine algorithm to solve a mass of contentions, thereby accelerating the parallel route updates of multi-threading and boosting the TBGP performance. As a projected TBGP, this study also modifies the table operations such as insert and lookup, and validates their correctness according to the behaviors of the traditional routing table. Our evaluations on a dual quad-core Xeon server show that the parallel access contentions decrease sharply by 92.5% versus the traditional routing table, and the maximal update time of a thread is reduced by 56.8 % on average with little overhead. The convergence time of update messages are improved by 49.7%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.9
• /
• pp.2037-2043
• /
• 2015

Proposed algorithm in this thesis introduced cells, units of router group, to conduct distributed processing of previous genetic algorithm. This thesis presented ways to reduce search delay time of overall network through cell-based genetic algorithm. Also, through this experiment, in case of a network was damaged in existing optimal path algorithm, Dijkstra algorithm, the proposed algorithm was designed to route an alternative path and also as it has a 2nd shortest path in cells of the damaged network so it is faster than Dijkstra algorithm, The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• KIISE Transactions on Computing Practices
• /
• v.20 no.12
• /
• pp.652-657
• /
• 2014

Given a starting point, destination point and various Points Of Interest (POIs), which contain a full or partial order, for a user to visit we wish to create, a sequenced route from the starting point to the destination point that includes one member of each POI type in a particular order. This paper proposes a method for finding the approximate shortest route between the start point, destination point and one member of each POI type. There are currently two algorithms that perform this task but they both have weaknesses. One of the algorithms only considers the distance between the visited POI (or starting point) and POI to visit next. The other algorithm chooses candidate points near the straight-line distance between the start point and destination but does not consider the order of visits on the corresponding network path. This paper outlines an algorithm that chooses the candidate points that are nearer to the network path between the start point and destination using network search. The algorithm looks for routes using the candidate points and finds the approximate shortest route by assigning an adaptive priority to the route that visits more POIs in a short amount of time.

• Journal of Powder Materials
• /
• v.16 no.6
• /
• pp.403-409
• /
• 2009

Plasma spray forming is recently explored as a near-net-shape fabrication route for ultra-high temperature metals and ceramics. In this study, monolithic tungsten has been produced using an atmospheric plasma spray forming and subsequent high temperature sintering. The spray-formed tungsten preform from different processing parameters has been evaluated in terms of metallurgical aspects, such as density, oxygen content and hardness. A well-defined lamellae structure was formed in the as-sprayed deposit by spreading of completely molten droplets, with incorporating small amounts of unmelted/partially-melted particles. Plasma sprayed tungsten deposit had 84-87% theoretical density and 0.2-0.3 wt.% oxygen content. Subsequent sintering at 2500$^{\circ}C$ promoted the formation of equiaxed grain structure and the production of dense preform up to 98% theoretical density.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.1
• /
• pp.64-73
• /
• 2004

This paper addresses a problem of machining determination of input quantity in a multi-stage flexible flow system with non-identical parallel machines considers a subcontracting, machining restraint, and machine yield. We develop a nonlinear programing with the objective of minimizing the sum of in-house processing cost and subcontracting cost. To solve this model, we introduce a single-processor parallel genetic algorithm(SPGA) to improve a weak point for the declined robustness of simple algorithm(SGA). The efficiency of the SPGA is examined in comparison with the SGA for the same problem. In of examination the SPGA is to provide the excellent solution than the solution of the SGA.

• Korean Management Science Review
• /
• v.17 no.2
• /
• pp.55-65
• /
• 2000

This paper addresses a problem of machining route selection in multi-stage process with machine group. This problem is considered the subcontracting and the production in-house such as regular and overtime work. the proposed model is formulated as a 0-1 integer programming constraining the avaliable time of each machine for planning period and total overtimes. The objective of the model is to minimize the sum of processing cost, overtime cost, and subcontracting cost. To solve this model, a genetic algorithm(GA) approach is developed. The effectiveness of the proposed GA approach is evaluated through comparisons with the optimal solution obtained from the branch and bound. In results, the same optimal solution is obtained from two methods at small size problem, and the consistent solution is provided by the GA approach at large size problem. The advantage of the GA approach is the flexibility into decision-making process because of providing multiple machining routes.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2008.11a
• /
• pp.282-282
• /
• 2008

Quasi-ordered arrays of hollow $SnO_2$ hemispheres were prepared by utilizing the colloidal templating route and RF-sputtering methods. Hollow $SnO_2$ hemispheres with shell thickness of 20nm exhibited an uniform continuity and open porosity, resulting in high gas sensitivity due to enhanced surface area as well as reduced interfacial effects. Multilayered hollow $SnO_2$ hemispheres and hollow $SnO_2$ hemispheres with controlled wall thickness were fabricated by controlling processing steps.

• The Korean Journal of Ceramics
• /
• v.6 no.3
• /
• pp.245-249
• /
• 2000

Consolidation of amorphous powders is emerging as a route for synthesis of high strength composite materials. Diffusion processes necessary for consolidation are expected to be more rapid in amorphous state(SRO) than in the crystalline state(LRO). A new synthesis technique of exploiting polymeric ceramic precursors(polysilazane and polyborosilazane) is derived for Si$_3$N$_4$/SiC and boron-modified nanocomposites for extremely high temperature applications up to 200$0^{\circ}C$. The characterization methods include thermal analysis of DTA, and XRD, NMR, TEM, after pyrolysis, as a function of time and temperature.