• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.7-16
• /
• 2005

Resource Reservation Protocol(RSVP) can provide Quality-of-Service(QoS) guarantees for real-time services in wired networks. However, RSVP suffers from mobility problem in the mobile Internet. Therefore, to provide seamless QoS services, it is needed that a mobile node makes a reservation everywhere it visits. Recently, many protocols have been proposed to provide QoS guarantees through advance resource reservation. But, these proposals have problems with a waste of bandwidth and the signaling overhead due to advance resource reservation. In this paper, we propose new advance resevation protocol, Proportional Aggregate RSVP(PA-RSVP) to minimize the resource reservation bandwidth and the signaling overhead in the mobile Intemet while providing QoS guarantees. Based on the performance evaluation, we show that the proposed protocol provides an improved performance over existing protocols under various system conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.5
• /
• pp.486-496
• /
• 2013

Time synchronization in underwater environment is challenging due to high propagation delay and mobility of sensor nodes. Previous researches do not consider practical issues affecting on the accuracy of time synchronization such as high-channel access delay and relative position between sensor nodes. Also, those protocols using bidirectional message exchange shorten the network lifetime and decrease the network throughput because numerous transmission, reception and unnecessary overhearing can be occurred. Therefore, in our research, we suggest enhanced time synchronization based on features of underwater environment. It controls the instant of transmission by exploiting the feature of an oceanic movement and node deployment. Moreover, the protocol uses more accurate time information by removing channel access delay from the timestamp. The proposed scheme is also practical on the underwater sensor network requiring low-power consumption because the scheme conducts time-synchronization with smaller transmission and reception compared with previous works. Finally, simulation results show that the proposed protocol deceases time error by 2.5ms and 0.56ms compared with TSHL and MU-Sync respectively, reducing energy consumption by 68.4%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.4B
• /
• pp.191-199
• /
• 2007

Mobile node has to register its current location to Home Agent when it moves to another network while away from home. However, the registration procedure cannot be completed successfully when Home Agent is protected by the VPN gateway which guards MN's home network and discards the unauthorized packets incoming from outside as a lack of security association(SA) between the Care-of address and security policy of the home network so that the binding registration message without SA is discarded smoothly by the VPN gateway. This paper presents the authentication and key exchange scheme using the AAA infrastructure for a user in Internet to access the home network behind the VPN gateway. By defining the role of authentication and tunnel processing for each agent or relay entity, this paper presents the procedure to register the current location to its Home Agent with secure manner. Performance result shows cost improvement up to 40% comparing with existing scheme in terms of the packet loss cost, the property of mobility and traffic.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.12
• /
• pp.2843-2852
• /
• 2013

In the nested mobile network environment, the mobile node selects one of multiple mobile routers. The MR(Mobile Router) by existing top-down or bottom-up methods may not be the optimal MR if the numbers of mobile nodes and routers are substantially increased, and the scale of the network is increased drastically. Since an inappropriate MR decision causes handover or binding renewal to mobile nodes, determining of the optimal MR is important for efficiency. In this paper, we propose an algorithm that decides on the optimal MR using MR QoS(Quality of Service) information, and we describe how to understand the various structured MLP(Multi-Layered Perceptron) based on the algorithm. In conclusion, we prove the ability of the suggested neural network for a nesting mobile network through the performance analysis of each learned MLP.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.14 no.1
• /
• pp.57-67
• /
• 2015

A large amount of work has been done in the areas of routing, MAC, QoS, capacity, location service, cooperative communication, fault tolerance, mobility models and various applications of mesh networks thanks to their merits of cost-effective way of deployment and flexibility in extending wireline services. Although multi-path routing protocols have been proposed to be used to provide QoS and fault-tolerance, there has not been any significant results discussed that support both in the literature to our best knowledge as they are often required in military and public safety applications. In this paper, we present a novel routing protocol for a mesh network based on the OFDM-TDMA collision-free MAC that discovers and maintains multiple paths that allows retransmitting and forwarding packets that have been blocked due to a link failure using an alternative next-hop node such that the delay-capacity tradeoff is reduced and the reliability is enhanced. Simulation results show that the proposed protocol performs well in terms of both the QoS and delivery ratio.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.20 no.11
• /
• pp.67-73
• /
• 2021

Tanks are key weapons of ground combat that are equipped with powerful weapons and have strong protective bodies. One tank component, the engine clutch flange, is located in the part of the tank where the engine and transmission are installed, and it is a key part of the power transfer and shutoff. The engine clutch flange transmits high power to secure the mobility of the tank; thus, it must have high strength and hardness. In addition, high durability and safety must be ensured because tank operations must exclude concerns about damage. In this study, an engine clutch female flange for tanks made of SNCM439 was developed. The 2D design used AutoCAD programs, and the 3D shape design used CATIA programs. The structural analysis was conducted using ANSYS. The mesh grid has a tetrahedron shape and is created by adding a mid-side node. After the mechanical properties and constraints of SNCM439 were entered, the changes in the safety factor, total deformation, and Von-Mises stress were identified according to the increase in torque. Prototype processing was performed to verify the engine clutch female flange for the tank. To determine the productivity of the product, the cutting processing time was measured when processing the prototypes. Based on the results of measuring the cutting processing time, it is concluded that research is needed to improve productivity because MCT slot cutting processing is time consuming.

• The KIPS Transactions:PartC
• /
• v.11C no.7 s.96
• /
• pp.889-894
• /
• 2004

Most ad-hoc routing protocols such as AODV(Ad Hoc On-Demand Distance Vector) and DSR(Dynamic Source Routing) do not try to search for new routes if the network topology does not change. Hence, with low node mobility, traffic may be concentrated on several nodes, which results in long end-to-end delay due to congestion at the nodes. Furthermore, since some specific nodes are continuously used for long duration, their battery power may be rapidly exhausted. Expiration of nodes causes connections traversing the nodes to be disrupted and makes many routing requests be generated at the same time. Therefore, we propose a load balancing approach called Simple Load-balancing Approach (SLA), which resolves the traffic concentration problem by allowing each node to drop RREQ (Route Request Packet) or to give up packet forwarding depending on its own traffic load. Meanwhile, mobile nodes nay deliberately give up forwarding packets to save their own energy. To make nodes volunteer in packet forwarding. we also suggest a payment scheme called Protocol-Independent Fairness Algorithm (PIEA) for packet forwarding. To evaluate the performance of SLA, we compare two cases where AODV employs SLA or not. Simulation results show that SLA can distribute traffic load well and improve performance of entire ad-hoc networks.

• Journal of KIISE:Information Networking
• /
• v.30 no.4
• /
• pp.474-483
• /
• 2003

The secret sharing is the basic concept of the threshold cryptosystem and has an important position in the modern cryptography. At 1995, Jarecki proposed the proactive secret sharing to be a solution of existing the mobile adversary and also proposed the share renewal scheme for (k, n) threshold scheme. For n participants in the protocol, his method needs O($n^2$) modular exponentiation per one participant. It is very high computational cost and is not fit for the scalable cryptosystem. In this paper, we propose the efficient share renewal scheme that need only O(n) modular exponentiation per participant. And we prove our scheme is secure if less that ${\frac}\frac{1}{2}n-1$ adversaries exist and they static adversary.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6C
• /
• pp.544-561
• /
• 2002

In this paper, we propose a new hybrid type of the routing protocol (Virtual Cluster-based Routing Protocol: VCRP) for mobile ad-hoc networks, based on a virtual cluster, which is defined as a narrow-sense network to exchange the basic information related to the routing among the adjacent nodes. This particular approach combines advantage of proactive routing protocol (PRP), which immediately provides the route collecting the network-wide topological and metric information, with that of reactive routing protocol, which relies on the route query packet to collect the route information on its way to the destination without exchanging any information between nodes. Furthermore, it also provides the back-up route as a byproduct, along with the optimal route, which leads to the VCBRP (Virtual Cluster-based Routing Protocol with Backup Route) establishing the alternative route immediately after a network topology is changed due to degradation of link quality and terminal mobility, Our simulation studies have shown that the proposed routing protocols are robust against dynamics of network topology while improving the performances of packet transfer delay, link failure ratio, and throughput over those of the existing routing protocols without much compromising the control overhead efficiency.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.2
• /
• pp.91-101
• /
• 2006

Researches on services of vehicles have been mainly focused on how to provide useful information and entertainment for an in-vehicle driver. However, the needs are appreciably increased for more advanced services that help drivers to check and manage their vehicles conveniently, without requiring drivers to attach to their vehicles. It is a sort of ubiquitous computing, providing an intelligent interactive services for human at any time and any where. In this paper, we present an intelligent vehicle information system to enable a driver to remotely diagnose and control a vehicle via CDMA communication network connected to the Internet. The system improves mobility for diagnosis and control of vehicle by implementing a cut and call back mechanism, which allows the vehicle terminal to have access to the information server on the Internet via CDMA call. No matter where the driver is, he can obtain the remote diagnosis and control services on the web browser without any additional application installation. Design methodology is introduced and evaluation results are analyzed for the CDMA-based intelligent vehicle information system. The experimental results show that the response time of the vehicle terminal to a web client request is 10.302 seconds at the beginning and 646.44ms thereafter. The average response time of CAN sensor node to a vehicle terminal request is 6.669ms.