• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.1
• /
• pp.64-76
• /
• 2017

Routing in mobile ad hoc networks (MANETs) is highly challenging because of the dynamic nature of network topology. AntHocNet is a bio-inspired routing protocol for MANETs that mimics the foraging behavior of ants. However, unlike many other MANET routing protocols, the paths constructed in AntHocNet are unidirectional, which requires a separate path setup if a route in the reverse direction is also required. Because most communication sessions are bidirectional, this unidirectional path setup approach is often inefficient. Moreover, AntHocNet suffers from looping problems because of its property of multiple paths and stochastic data routing. In this paper, we propose a modified path setup procedure that constructs bidirectional paths. We also propose solutions to some of the looping problems in AntHocNet. Simulation results show that performance is significantly enhanced in terms of overhead, end-to-end delay, and delivery ratio when loops are prevented. Performance is further improved, in terms of overhead, when bidirectional paths setup is employed.

• Journal of Navigation and Port Research
• /
• v.32 no.6
• /
• pp.465-471
• /
• 2008

As the excessive competition between container terminals has been deepening, not only productivity, but also cost economic of the terminals has been raised. With regard to this, the competitiveness of the terminals is limited because of inefficiency operation of transfer crane(T/C) which needs large amount of energy consumption. Therefore, it is possible that the improvement in the T/C operation leads to saving cost for resources and energy as well as increasing the productivity of the terminals. This study provides 'the K-Means Clustering based Optimized Decision Model for Transfer Crane Operation', referring to 'RFID & RTLS based Port Logistics Initiative' of Ministry of Land, Transportation and Maritime Affairs and estimates the efficiency through simulating.

• Proceedings of the Korean Vacuum Society Conference
• /
• 2013.02a
• /
• pp.652-652
• /
• 2013

The conventional thermal chemical vapor deposition (CVD) setup for the graphene synthesis has mainly used convective heat transfer in order to heat a catalyst (e.g. Cu) up to $1,000^{\circ}C$. Although the conventional CVD has been so far widely accepted as the most appropriate candidate enabling mass-production of high-quality graphene, this method has stillremained under the standard for the commercialization largely due to the poor productivity arisen out of the required long processing time. Here, we introduced a fast and efficient synthetic route toward CVD-graphene. Unlike the conventional CVD using convection heat transfer, we adopted a CVD setup utilizing conduction heat transfer between Cu catalyst and rapid heating source. The high thermal conductive nature of Cu and the employed rapid heating source led to the remarkable reduction in processing timeas compared to the conventional convection based CVD (Fig. 1A), moreover, the synthesized graphene was turned out to have comparable quality to that synthesized by the conventional CVD (Fig. 1B). For the optimization of the conduction based CVD process, the parametric studies were thoroughly performed using through Raman spectroscopy and electrical sheet resistance measurement. Our approach is thought to be worth considerable in order to enhance productivity of the CVD graphene in the industry.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4C
• /
• pp.353-364
• /
• 2002

To prevent the performance degradation of TCP due to packet loss in the smooth handoff by the route optimization extension of Mobile If protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers the packets dropped during the handoff by forwarding the buffered packets at the old base station to the mobile user. But, when the mobile user moves to a new foreign network which is connected to a congested router, the buffered packets forwarded by the old base station are dropped and the link utilization performance degraded due to increased congestion by the forwarded packets. In this paper, when the mobile user moves to a new foreign network which is connected to a congested router, Ive propose a packet forwarding control scheme required far the old base station to improve TCP performance in mobile networks. The old base station forwards or discards the buffered packets during handoff by proposed packet forwarding control scheme based on congestion states of RED(Random Early Detection) at the congested router. Simulation results slow that link utilization performance can be improved by applying proposed packet forwarding control scheme.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.49-56
• /
• 2004

An Internet draft, named RR(Return Routability) protocol, proposed to IETF mobileip WG, in order to establish an optimal path to MN(Mobile Node) by securely sending the BU(Binding Update) message to CN(Correspondent Node). However, it has some problems with initiating the protocol by the MN: it causes to increases in communication load in the home network, to increases communication delay between MN and CN, and increases in communication load due to unnecessary message exchanges. To resolve the problems, this paper proposes an alternative scheme for the RR protocol in MIPv6. The proposed scheme is devised to start the protocol by HA on receiving the first packet from CN. It decreases the route optimization overhead by reducing the number of BU messages as well as the communication time. Beside these advantages, this scheme provides the same security grade as the original RR protocol.

• Journal of Intelligence and Information Systems
• /
• v.29 no.2
• /
• pp.101-114
• /
• 2023

In the wartime, aircraft carrying out a mission to strike the enemy deep in the depth are exposed to the risk of being shoot down. As a key combat force in mordern warfare, it takes a lot of time, effot and national budget to train military flight personnel who operate high-tech weapon systems. Therefore, this study studied the path problem of predicting the route of emergency escape from enemy territory to the target point to avoid obstacles, and through this, the possibility of safe recovery of emergency escape military flight personnel was increased. based problem, transforming the problem into a TSP, VRP, and Dijkstra algorithm, and approaching it with an optimization technique. However, if this problem is approached in a network problem, it is difficult to reflect the dynamic factors and uncertainties of the battlefield environment that military flight personnel in distress will face. So, MDP suitable for modeling dynamic environments was applied and studied. In addition, GIS was used to obtain topographic information data, and in the process of designing the reward structure of MDP, topographic information was reflected in more detail so that the model could be more realistic than previous studies. In this study, value iteration algorithms and deterministic methods were used to derive a path that allows the military flight personnel in distress to move to the shortest distance while making the most of the topographical advantages. In addition, it was intended to add the reality of the model by adding actual topographic information and obstacles that the military flight personnel in distress can meet in the process of escape and escape. Through this, it was possible to predict through which route the military flight personnel would escape and escape in the actual situation. The model presented in this study can be applied to various operational situations through redesign of the reward structure. In actual situations, decision support based on scientific techniques that reflect various factors in predicting the escape route of the military flight personnel in distress and conducting combat search and rescue operations will be possible.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.417-428
• /
• 2005

Today, IT organizations perform projects with vision related to marketing and financial profit. The objective of realizing the vision is to improve the project performing ability in terms of QCD. Organizations have made a lot of efforts to achieve this objective through process improvement. Large companies such as IBM, Ford, and GE have made over $80\%$ of success through business process re-engineering using information technology instead of business improvement effect by computers. It is important to collect, analyze and manage the data on performed projects to achieve the objective, but quantitative measurement is difficult as software is invisible and the effect and efficiency caused by process change are not visibly identified. Therefore, it is not easy to extract the strategy of improvement. This paper measures and analyzes the project performance, focusing on organizations' external effectiveness and internal efficiency (Qualify, Delivery, Cycle time, and Waste). Based on the measured project performance scores, an OT (Opportunity Tree) model was designed for optimizing the project performance. The process of design is as follows. First, meta data are derived from projects and analyzed by quantitative GQM(Goal-Question-Metric) questionnaire. Then, the project performance model is designed with the data obtained from the quantitative GQM questionnaire and organization's performance score for each area is calculated. The value is revised by integrating the measured scores by area vision weights from all stakeholders (CEO, middle-class managers, developer, investor, and custom). Through this, routes for improvement are presented and an optimized improvement method is suggested. Existing methods to improve software process have been highly effective in division of processes' but somewhat unsatisfactory in structural function to develop and systemically manage strategies by applying the processes to Projects. The proposed OT model provides a solution to this problem. The OT model is useful to provide an optimal improvement method in line with organization's goals and can reduce risks which may occur in the course of improving process if it is applied with proposed methods. In addition, satisfaction about the improvement strategy can be improved by obtaining input about vision weight from all stakeholders through the qualitative questionnaire and by reflecting it to the calculation. The OT is also useful to optimize the expansion of market and financial performance by controlling the ability of Quality, Delivery, Cycle time, and Waste.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.29 no.1D
• /
• pp.17-23
• /
• 2009

Due to the rapid increase of vehicles on the street, Korean society is facing worsening traffic congestions and air pollutions. Also, the oil price pickup has led to increasing need for the use of public transportation. In particular, transfering among public transportation may be a main factor for riders who are commuting for a long distance journey. In order to ensure such connectivity, transfer stations have been actively built in Korea. However, it would be necessary to shift those vehicles, from cars to public transportations by enhancing the users' satisfaction with public transportation through strategies for minimizing the users' waiting cost by building an efficient connective system between transportation modes as well as the preparation of aforementioned transfer stations. Therefore, this study aimed to develop an algorithm for minimizing transferring passengers' waiting costs based on service intervals of linked buses within the transfer facilities. In order to adjust the service interval, we calculated the total costs, involving the wait cost of transfer passengers and bus operation costs, and produced an allocation interval, that would minimize the costs. We selected a KTX departing from Seoul station, and a No. 6014 bus route in Gwangmyeong city where it starts from the Gwangmyeong station in order to for verifying the model. Then, the transfer passengers' total waitting cost was reduced equivalent to the maximum of 212 minutes, and it revealed that the model performed very effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5B
• /
• pp.475-488
• /
• 2003

To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and TCP transmission performance of a mobile user in the congested base station degrades due to increased congestion by those forwarded burst packets. In this paper, considering the general case that a mobile user moves to a congested base station, we analyze the influence of packet buffering on TCP performance according to handoff arrival distribution for Drop-tail and RED (Random Early Detection) buffer management schemes. Simulation results show that RED scheme can reduce the congestion increased by those forwarded burst packets comparing Drop-Tail, but RED scheme cannot avoid Global Synchronization due to forwarded burst packets by the old base station and new buffer management scheme to avoid it is needed in Mobile IP based networks.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.8B
• /
• pp.661-673
• /
• 2003

To prevent performance degradation of TCP due to packet losses in the smooth handoff by the route optimization extension of Mobile IP protocol, a buffering of packets at a base station is needed. A buffering of packets at a base station recovers those packets dropped during handoff by forwarding buffered packets at the old base station to the mobile user. But, when the mobile user moves to a congested base station in a new foreign subnetwork, those buffered packets forwarded by the old base station are dropped and TCP transmission performance of a mobile user in the congested base station degrades due to increased congestion by those forwarded burst packets. In this paper, considering the general case that a mobile user moves to a congested base station, we propose a Priority Packet Forwarding to improve TCP performance in mobile networks. In the proposed scheme, without modification to Mobile IP protocol, the old base station marks a buffered packet as a priority packet during handoff. And priority queue at the new congested base station schedules the priority packet firstly. Simulation results show that proposed Priority Packet Forwarding can improve TCP transmission performance more than Implicit Priority Packet Forwarding and RED (Random Early Detection) schemes.