• IEIE Transactions on Smart Processing and Computing
• /
• 제3권5호
• /
• pp.313-318
• /
• 2014

Recently, Ethernet-based Diagnostic Over Internet Protocol (DoIP) was applied to automotive systems, and in-vehicle gateways have been introduced to integrate Ethernet with traditional in-vehicle networks, such as the local interconnect network (LIN), controller area network (CAN) and FlexRay. The introduction of in-vehicle gateways and of Ethernet based diagnostic protocols not only decreases the complexity of the networks, but also reduces the update time for ECU software reprogramming while enabling the use of a range of services, including remote diagnostics. In this paper, a diagnostic gateway was implement for an automotive system, and the performance measurements are presented. In addition, a range of applications provided by the diagnostic gateway are proposed.

• Proceedings of the IEEK Conference
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.165-169
• /
• 2004

This paper proposes a packet-based channel access scheme in Distributed-Queuing Request Update Multiple Access(DQRUMA) MAC(Media Access Control) protocol. To increase a channel access ratio, we eliminate the wait-to-transmit state that does not transmit Xmt_Req(Transmission Request) although the mobile terminal(MS) has new arrival packets in buffer.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• 제12권2호
• /
• pp.153-172
• /
• 2002

In this paper, we propose an architecture and a protocol fur Secure Mobile Multicast(SMM) offering efficient and secure multicast services to many mobile nodes. In this framework, we use Indirect and Direct Service Mode adaptively, according to the movement of mobile nodes around the overlapped service area, to provide reliably secure multicast with low latency, minimum key update, and minimum data loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제36권4A호
• /
• pp.388-398
• /
• 2011

In this paper, we introduce an EMSP(Efficient Mobility Support Protocol) for mobile sensor network with mobility-aware. We propose virtual cluster and node split scheme considering movements of mobile nodes. The existing M-LEACH protocol suffers from communication cost spent on JOIN request information during invitation phase. To address this issue, the large boundary of the cluster in LUR-tree can reduce superfluous update cost. In addition to the expansion of the cluster, the proposed approach exploits node split algorithms used in R-tree in order to uniformly form a cluster. The simulated results show that energy-consumption has less up to about 40% than LEACH-C and 8% than M-LEACH protocol. Finally, we show that the proposed scheme outperforms those of other in terms of lifetime of sensor fields and scalability in wireless sensor network.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• 제8권4호
• /
• pp.781-787
• /
• 2007

Network Mobility (NEMO) basic support protocol doesn't execute the process of route optimization and has not presented the particular security mechanism in other blocks except hi-directional tunnel between Mobile Router (MR) and its Home Agent (HA). Therefore in this paper we process secure route optimization courses through authenticated binding update protocol between MR and its Correspondent Node (CN) and the protocol of the competency of mandate between MR and its Mobile Network Node (MNN); its block also uses an bi-directional tunnel as the block between MR and its HA. The address of each node are generated by the way of Cryptographically Generated Address (CGA) for proving the ownership of address. Finally we analyze the robustness of proposed protocol using security requirements of MIPv6 and existing attacks and the efficiency of this protocol using the connectivity recovery and end-to-end packet transmission delay time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권4호
• /
• pp.878-894
• /
• 2013

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

• The KIPS Transactions:PartD
• /
• 제10D권3호
• /
• pp.439-446
• /
• 2003

A crucial limitation in environments where data is broadcast to very large client populations is the low bandwidth available for clients to communicate with servers. Many advanced applications are developed in mobile computing environments, but conventional concurrency controls are not suitable because of the low bandwidth of wireless network. In this paper, we propose a new optimistic concurrency control protocol for mobile transactions. In this protocol, mobile read-only transactions can be completed locally at the clients without additional communication, only mobile update transactions are sent to the server for global validation. Our protocol reduces unnecessary aborts occurred in the previous study using only conflict information. In addition to, our algorithm can detect and resolve non-serializable execution using by data table maintained in a server.

• Journal of the Korean Society for information Management
• /
• 제14권1호
• /
• pp.183-206
• /
• 1997

The information Retrieval Protocol, Z39.50 is applied to the shared cataloging gateway. The history and functions of the Z39.50 are reviewed and the characteristics and the database update service of Z39.50 are taken into account in the notion of the shared cataloging. And for the test, one of the domestic on-line shared cataloging systems is adopted and newly remodelled using Z39.50 protocol. Two kinds of Z39.50 shared cataloging gateway models (th centralized shared cataloging gateway model and the distributed shared cataloging gateway model) are operated in Web server.

• Journal of Auto-vehicle Safety Association
• /
• 제9권1호
• /
• pp.13-18
• /
• 2017

In recent years, NCAP regulations of many countries have induced automaker to improve the vehicle crashworthiness. But, the current NCAP regulations don't cover all types of traffic accidents. And rapid-increasing market share of compact cars and SUVs has brought for both consumer and automaker to pay more attention on crash compatibility. So, many countries have tried to develop the new crash test mode and update the present crash test mode. Especially, Euro NCAP has been developing a new impact protocol of the car-to-car frontal offset impact including the crash compatibility assessment. There are plans to introduce this new protocol in 2020, and it will be replaced the current Euro NCAP frontal offset impact. The test dummy in the front seats of this new test mode will be changed from 50% Hybrid-III male to 50% THOR male. This paper will address the vehicle responses, the occupant responses and the vehicle compatibility performance from a full vehicle crash test using the new car-to-car frontal offset test protocol of Euro NCAP.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• 제41권12호
• /
• pp.9-14
• /
• 2004

As the internet traffic type and size have bun diversified in recent years, the GMPLS-based distributed control and management protocol have surfaced as a serious issue for dynamic optical lightpath setup. In this reason, we investigated and analyzed network performance and protocols using global information-based link state approach and local information based link state approach. We calculated connection setup time, required control bandwidth and setup blocking probability that made from network update period and threshold metrics according to traffic arrival rate. The evaluated results will be used in broadband network and adopted for high speed network in the future widely.