• The Journal of Korea Robotics Society
• /
• v.7 no.2
• /
• pp.150-159
• /
• 2012

In this paper, we propose a cost-aware Rapidly-exploring Random Tree (RRT) path planning algorithm for mobile robots. A mobile robot is presented with a cost map of the field of interest and assigned to move from one location to another. As a robot moves, the robot is penalized by the cost at its current location according to the cost map. The overall cost of the robot is determined by the trajectory of the robot. The goal of the proposed cost-aware RRT algorithm is to find a trajectory with the minimal cost. The cost map of the field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware RRT algorithm extends the basic RRT algorithm by considering the cost map when extending a motion segment. We show that the proposed algorithm gives an outstanding performance compared to the basic RRT method. We also demonstrate that the use of rejection sampling can give better results through extensive simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.1
• /
• pp.135-158
• /
• 2018

High-Speed vehicles can be considered as multiple mobile nodes that move together in a large-scale mobile network. High-speed makes the time allowed for a mobile node to complete a handover procedure shorter and more frequently. Hence, several protocols are used to manage the mobility of mobile nodes such as Network Mobility (NEMO). However, there are still some problems such as high handover latency and packet loss. So efficient handover management is needed to meet Quality of Service (QoS) requirements for real-time applications. This paper utilizes the cross-layer seamless handover technique for network mobility presented in cellular networks. It extends this technique to propose QoS-aware NEMO protocol which considers QoS requirements for real-time applications. A novel analytical framework is developed to compare the performance of the proposed protocol with basic NEMO using cost functions for realistic city mobility model. The numerical results show that QoS-aware NEMO protocol improves the performance in terms of handover latency, packet delivery cost, location update cost, and total cost.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.2 no.2
• /
• pp.11-18
• /
• 1979

The purpose of this study is to establish a purchasing cost reduction program for the management practical use. The research method of this study is a bibliographical search of the materials available in the library at Keimyung University and the writer's private study, and the case analysis. The body of this study is divided into three sections. The first section deals with the purchasing management systems in terms of the nature and characters of purchasing management and purchasing cost in total management system. The second section includes purchasing cost reduction program through value analysis technique and the third section covers summary and the following conclusions : 1) Top management should be aware of the important position of purchasing activities from the cost point of view, and they should be aware that a good purchasing cost reduction program could be established through value analysis technique. 2) For such a purchasing cost reduction program to be carried out. effectively the management should support and back up the program. 3) There should be a training program to educate and develop the personnel who can manage and operate the purchasing cost reduction program through valuean analysis technique. 4) And cooperative system should be established in management and operative organization system from the total management systems, view for the effective use of the program.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.11
• /
• pp.5465-5480
• /
• 2018

Energy-efficient task scheduling on multi-core server is a fundamental issue in green cloud computing. Multi-core processors are widely used in mobile devices, personal computers, and servers. Existing energy efficient task scheduling methods chiefly focus on reducing the energy consumption of the processor itself, and assume that the cores of the processor are controlled independently. However, the cores of some processors in the market are divided into several voltage islands, in each of which the cores must operate on the same status, and the cost of the server includes not only energy cost of the processor but also the energy of other components of the server and the cost of user waiting time. In this paper, we propose a cost-aware scheduling algorithm ICAS for computation intensive tasks on multi-core server. Tasks are first allocated to cores, and optimal frequency of each core is computed, and the frequency of each voltage island is finally determined. The experiments' results show the cost of ICAS is much lower than the existing method.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.3
• /
• pp.127-135
• /
• 2015

Context-aware mobile cloud computing is a new promising paradigm that allows to improve user experience by analyzing contextual information such as user location, time of the day, neighboring devices and current activity. In this paper we provide performance study of context-aware mobile cloud computing system with Volare middleware. Volare monitors the resources and context of the device. and dynamically adapts cloud service requests accordingly, at discovery time or at runtime. This approach allows for more resource-efficient and reliable cloud service discovery, as well as significant cost savings at runtime. We also have studied the performance of context-aware mobile cloud computing for different quality of service (QoS) adaptation policies. Our simulations results show that when battery level is low and CPU usage is high and user cannot maintain the initial QoS, service cost is decreased according to current adaptation policy. In conclusion, the current adaptation policy suggested in this paper may improve user experience by providing a dynamically adapted service cost according to a situation.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.75-85
• /
• 2008

The DBMS are widely used in embedded systems. The flash memory is used as a storage device of a embedded system. The optimizer of existing database system assumes that the storage device is disk. There is overhead to overwrite on flash memory unlike disk. The block of flash memory should be erased before write. Due to this reason, query optimization model based on disk does not adequate for flash-aware database. Especially embedded system should minimize the consumption of energy, but consumes more energy because of excessive erase operations. This paper proposes new energy based cost model of embedded database and shows the comparison between disk based cost model and energy based cost model.

• Journal of Korea Multimedia Society
• /
• v.8 no.8
• /
• pp.1088-1098
• /
• 2005

Context-Aware is a one of the important researches in ubiquitous computing for providing optimal service to users by acquiring user's intentions and environmental information. Diverse researches are focused on the users and its environment facts for Context-Aware base and introduce a sensing based middleware which engages sever/sensor that operates identifier information to provide services. Context-Aware service which is limited by users and environment facts has the problem of overlapping sensing, unnecessary searching and anonymity of users. Also Server-Centric Context-Aware system requires very high cost to manage and operate the services. On this paper, We introduce Autogenous Context service model to simplify the Context-Aware process and design the middleware which performs decentralize management for Context-Aware information of user's portable devices to minimize problems which is occurred during the management and operation of existing Context-Aware system.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.1-8
• /
• 2020

In order to reach Ultra-Reliable Low-Latency communication, one of 5G aims, Multi-access Edge Computing paradigm was born. The idea of this paradigm is to bring cloud computing technologies closer to the network edge. User services are hosted in multiple Edge Clouds, deployed at the edge of the network distributedly, to reduce the service latency. For mobile users, migrating their services to the most proper Edge Clouds for maintaining a Quality of Service is a non-convex problem. The service migration problem becomes more complex in high mobility scenarios. The goal of the study is to observe how user mobility affects the selection of Edge Cloud during a fixed mobility path. Mobility-Aware Service Migration (MASM) is proposed to optimize service migration based on two main parameters: routing cost and service migration cost, during a high mobility scenario. The performance of the proposed algorithm is compared with an existing greedy algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.183-191
• /
• 2004

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• The KIPS Transactions:PartC
• /
• v.15C no.4
• /
• pp.289-296
• /
• 2008

In wireless mesh network, studies on routing protocols have been actively carried out recently, and hop count is used as a major routing metric in destination-sequenced distance-vector (DSDV) routing protocol, which is a representative proactive routing protocol. Although hop-by-hop multi-path (HMP) DSDV and enhanced HMP (EHMP) DSDV routing protocols perform routing by considering both hop count and residual bandwidth within one hop distance nodes, it has a shortcoming that routing is carried out via non-optimal path from the aspect of end-to-end routing. In order to overcome the shortcoming, a cost-aware multi-path (CAMP) DSDV routing protocol is proposed in this paper, which considers hop count and end-to-end minimum residual bandwidth. Simulation results based on NS-2 show that the proposed routing protocol performs better than DSDV, HMP DSDV, and EHMP DSDV protocols from the aspect of throughput and packet delivery ratio, by appropriately using hop count and end-to-end minimum residual bandwidth information and has the same number of management messages with HMP DSDV and EHMP DSDV protocols.