• Journal of Communications and Networks
• /
• 제14권5호
• /
• pp.554-565
• /
• 2012

In this paper, we study a cross-layer and end-to-end optimization problem for the integrated wireless and wireline network that consists of one wireline core network and multiple wireless access networks. We consider joint end-to-end flow control/distribution at the transport and network layers and opportunistic scheduling at the data link and physical layers. We formulate a single stochastic optimization problem and solve it by using a dual approach and a stochastic sub-gradient algorithm. The developed algorithm can be implemented in a distributed way, vertically among communication layers and horizontally among all entities in the network, clearly showing what should be done at each layer and each entity and what parameters should be exchanged between layers and between entities. Numerical results show that our cross-layer and end-to-end optimization approach provides more efficient resource allocation than the conventional layered and separated optimization approach.

• 반도체디스플레이기술학회지
• /
• 제16권2호
• /
• pp.79-84
• /
• 2017

This paper outlines the Taguchi optimization methodology, which is applied to optimize cutting parameters in end milling when machining STS304 with TiAlN coated SKH59 tool under up and down end milling conditions. The end milling parameters evaluated are depth of cut, spindle speed and feed rate. An orthogonal array, signal-to-noise (S/N) ratio and analysis of variance (ANOVA) are employed to analyze the effect of these end milling parameters. The Taguchi design is an efficient and effective experimental method in which a response variable can be optimized, given various control and noise factors, using fewer resources than a factorial design. An orthogonal array of $L_9(33)$ was used. The most important input parameter for cutting force, however, is the feed rate, and depending on the cutter rotation direction. Finally, confirmation tests verified that the Taguchi design was successful in optimizing end milling parameters for cutting force.

• 한국CDE학회논문집
• /
• 제17권1호
• /
• pp.1-6
• /
• 2012

The End Coupling is main component of the aluminum hot roll process. The End Coupling is used for transmission of rotational power with heavy-duty load. Fracture of the End Coupling cause serious economic losses because an End Coupling is a very expensive component and it takes a long time to repair it. Therefore, preventing the destruction of the End Coupling is essential for ensuring a long mechanical life cycle. In this paper, the parametric study on the End Coupling was performed in order to minimize maximum stress under operation loads. To verify the interference of spindle assembly with modified End Coupling, kinematics simulation was performed by applying the various combination type and dynamic boundary condition of the spindle assembly. The interference of optimized model was not occurred during combination process and driving process. As a result of an optimum design for life extension on End Coupling, the maximum stress of modified End Coupling was lower than that of the initial model by 26%.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2001년도 춘계학술대회 논문집
• /
• pp.895-898
• /
• 2001

This paper presents an optimization cutting speed(OCS) program developed to improve the machining precision and tool life in high speed machining using ball end milling. This program optimized the cutting speed that is changing at any time in free surface machining of an automobile part like a connecting load die. The technique of optimization cutting speed makes the CAD/CAM-generated NC code go through a reverse post process, conducts cutting simulation, and obtain the effective tool diameter of the ball end milling. Then it changes the spindle revolution to within the range of critical cutting speed fit for the material of the workpieces depending upon the effective tool diameter. In this study, the machining precision and tool life were compared for the two connecting load dies processed using the general cutting method and the proposed optimization cutting speed technique, respectively.

• 한국정보통신학회논문지
• /
• 제26권11호
• /
• pp.1679-1685
• /
• 2022

본 논문에서는 무선전력 통신 네트워크에서 소스에서 목적지 노드까지 종단간 데이터 전송률을 최대화하기 위한 최적의 멀티홉 전송 방식을 제안한다. 에너지 하베스팅을 하면서 멀티홉 전송을 위한 프레임 구조를 제시하고, 노드간 서로 다른 에너지 수확량과 링크 품질을 고려하여 종단간 전송률을 최대화하는 각 노드의 전송 시간을 수학적 분석을 통하여 도출한다. 아울러, 고려하는 무선전력기반 멀티홉 전송의 시스템 모델링을 통하여 최적화 문제를 도출하고, 이 최적화 문제가 convex 함을 보임으로써 전역 최적해가 존재함을 증명한다. 이를 통하여 최적화 문제를 계산 가능한 형태로 변형하여 손쉽게 최적해를 찾는다. 제안한 최적 멀티홉 전송 방식은 모든 링크의 전송률이 같아지도록 노드별 전송 시간을 최적으로 할당함으로써 종단간 전송률을 최대화한다.

• 한국기계가공학회지
• /
• 제20권1호
• /
• pp.57-65
• /
• 2021

With the increased utilization of CAM programs, end-mill processing is most commonly used for machining and metal processing. In particular, hole or shaft machining has high assembly precision, which inevitably leads to high utilization of end mills. However, the analysis of quality characteristics according to the process conditions of end mills is not performed systematically at the site, causing poor quality and productivity. The most influential factor of quality is the runout of the end mill. In this paper, the number of turns of the end mill, number of tool blades, cutting direction, and artificial runout volume were determined to identify the correlation between the epicenter, cylindricality, and surface roughness. Two types of end mills, three levels of runout, three levels of rotational speed, and two cutting directions were considered and 36 rounds of hole processing were conducted. For the analysis of shape characteristics according to the set process variables, the experimental planning method was applied to the measured specimen and the processing characteristics were analyzed according to the runout of the end mill through correlation analysis.

• International Journal of Control, Automation, and Systems
• /
• 제4권5호
• /
• pp.601-614
• /
• 2006

In this paper, a study on task assignment strategies for a complex real-time network system is presented. Firstly, two task assignment strategies are proposed to improve previous strategies. The proposed strategies assign tasks with meeting end-to-end real-time constraints, and also with optimizing system utilization through period modulation of the tasks. Consequently, the strategies aim at the optimizationto optimize of system performance with while still meeting real-time constraints. The proposed task assignment strategies are devised using the genetic algorithmswith heuristic real-time constraints in the generation of new populations. The strategies are differentiated by the optimization method of the two objectives-meeting end-to-end real-time constraints and optimizing system utilization: the first one has sequential genetic algorithm routines for the objectives, and the second one has one multiple objective genetic algorithm routine to find a Pareto solution. Secondly, the performances of the proposed strategies and a well-known existing task assignment strategy using the BnB(Branch and Bound) optimization are compared with one other through some simulation tests. Through the comparison of the simulation results, the most adequate task assignment strategies are proposed for some as system requirements-: the optimization of system utilization, the maximization of running tasktasks, and the minimization of the number of network node nodesnumber for a network system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권12호
• /
• pp.4451-4466
• /
• 2014

We present joint radio selection and relay scheme that delivers data from a source to a sink in heterogeneous stationary sensor networks consisting of various radio interfaces. The proposed scheme finds the optimal relay nodes and their corresponding radio interfaces that minimize energy consumption throughout the network while satisfying the end-to-end packet deadline requirement. We formulate the problem of routing through radio interface selection into binary integer programs, and obtain the optimal solution by solving with an optimization solver. We examine a trade-off relationship between energy consumption and packet delay based on network level simulations. We show that given the end-to-end deadline requirement, our routing algorithm finds the most energy-efficient routing path and radio interface across mesh hops. We demonstrate that the proposed routing scheme exploits the given packet delivery time to turn into network benefit of reducing energy consumption compared to routing based on single radio interface.

• Journal of Electrical Engineering and Technology
• /
• 제13권6호
• /
• pp.2456-2467
• /
• 2018

Wireless multimedia sensor networks (WMSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. The end-to-end delay is very critical metric for QoS guarantees in WMSNs. In WMSNs, due to the transmission errors incurred over wireless channels, it is difficult to obtain reliable delivery of data in conjunction with low end-to-end delay. In order to improve the end-to-end delay performance, the system has to drop few packets during network congestion. In this article, our proposal is based on optimization of end-to end delay for WMSNs. We optimize end-to-end delay constraint by assuming that each packet is allowed fixed number of retransmissions. To optimize the end-to-end delay, first, we compute the performance measures of the system, such as end-to-end delay and reliability for different network topologies (e.g., linear topology, tree topology) and against different choices of system parameters (e.g., data rate, number of nodes, number of retransmissions). Second, we study the impact of the end-to-end delay and packet delivery ratio on indoor and outdoor environments in WMSNs. All scenarios are simulated with multiple run-times by using network simulator-2 (NS-2) and results are evaluated and discussed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권9호
• /
• pp.3496-3514
• /
• 2015

One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.