• Title/Summary/Keyword: CAN message

Search Result 1,905, Processing Time 0.027 seconds

The Auto Generation Scheme of Message Frame for Testing of the Information Service Devices (정보 서비스 장치 테스트를 위한 메시지 프레임 자동 생성 기법)

  • Kim, Jung-Sook;Kim, Jaehyeong;Jeong, Junho;Jung, Eunmi
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.24 no.4
    • /
    • pp.418-423
    • /
    • 2014
  • Intelligent Transportation Systems (ITS) are advanced applications which, without embodying intelligence as such, aim to provide innovative services relating to different modes of transport and traffic management and enable various users to be better informed and make safer, more coordinated, and 'smarter' use of transport networks. However, ITS has the different size and shapes according to the city environment policy to adjust the city scene and it has to be displayed by different message on the information display device in real-time. And the information service providers must make the information display system which has the different information and data each time. That is very time and workers consuming and auto message frame generation system is necessary. In this paper, we design and develop the message frame generation system which can set several parameters easily for the generation of the message frame automatically on the windows environment and we do not need to go the field to get the test data.

A Techniques for Information Hiding in the Steganography using LSB and Genetic Algorithm (유전적 알고리즘과 LSB를 이용한 스테가노그래피의 정보은닉 기법)

  • Ji, Seon-Su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.3
    • /
    • pp.277-282
    • /
    • 2018
  • The goal of the secret message communication on the internet is to maintain invisibility and confidentiality. Digital steganography is a technique in which a secret message is inserted in a cover medium and transmitted to a destination so that a third party can not perceive the existence of the message itself. Steganography is an efficient method for ensuring confidentiality and integrity together with encryption techniques. In order to insert a secret (Hangul) message, I propose a image steganography method that the secret character is separated and converted into binary code with reference to the encryption table, the cover image is divided into two areas, and the secret message and the right l-LSB information of the second area are encrypted and crossed, concealing the k-LSB of the first region. The experimental results of the proposed method show that the PSNR value is 52.62 and the acceptable image quality level.

Recovering Network Joining State for Normal/Abnormal Termination of Battlefield Management System (전장관리시스템의 정상/비정상 종료 시 망 가입상태 복원)

  • Choi, YoonChang;Kwon, DongHo
    • Journal of KIISE
    • /
    • v.44 no.8
    • /
    • pp.749-759
    • /
    • 2017
  • The weapon system based on voice call can cause delay, error or damage to the message during the exchange of information. Furthermore, since the weapon system has a unique message format, it has limited data distribution. Therefore, a Korea Variable Message Format(KVMF) has been developed in this study to utilize a standard sized data format to guarantee the transmission quality and minimize the transmission amount. The ground tactical data link system quickly and accurately shares tactical information by incorporating a field management system that utilizes the KVMF standard message in the mobile weapon system. In this study, we examine the possibility of performing the mission immediately by recovering the state of network joining when a normal/abnormal termination situation of the battlefield management system occurs.

Distributed processing for the Load Minimization of an SIP Proxy Server (SIP 프록시 서버의 부하 최소화를 위한 분산 처리)

  • Lee, Young-Min;Roh, Young-Sup;Cho, Yong-Karp;Oh, Sam-Kweon;Hwang, Hee-Yeung
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.4
    • /
    • pp.929-935
    • /
    • 2008
  • As internet telephony services based on Session initiation Protocol (SIP) enter the spotlight as marketable technology, many products based on SIPs have been developed and utilized for home and office telephony services. The call connection of an internet phone is classified into specific call connections and group call connections. Group call connections have a forking function which delivers the message to all of the group members. This function requires excessive message control for a call connection and creates heavy traffic in the network. In the internet cail system model. most of the call-setup messages are directed to the proxy server during a short time period. This heavy message load brings an unwanted delay in message processing and. as a result, call setup can not be made. To solve the delay problem, we simplified the analysis of the call-setup message in the proxy server, and processed the forking function distributed for the group call-setup message. In this thesis, a new system model to minimize the load is proposed and the subsequent implementation of this model demonstrates the performance improvement.

Analysis of the AMQP for Data Message Queueing of Korean e-Navigation Operation System (한국형 e-Navigation 운영 시스템의 데이터 메시지 큐잉을 위한 AMQP 분석)

  • Jang, Won-Seok;Kim, Beom-Jun;Kang, Moon-Seog
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 2017.11a
    • /
    • pp.22-24
    • /
    • 2017
  • The Korean e-Navigation operating system is designed to provide various services related to marine safety. These services are not configured to be provided in one software, but are made in separate software. In order to integrate the service software installed in the e-Navigation operating system, it is necessary to define the data message which can exchange data between the service software, Depending on the operating concept of the service, many messages are expected to be transmitted over the network in a short time. There is a need for a buffer or message queue to store messages as a way to manage messages efficiently. Therefore, in this paper, we analyze the types and characteristics of Advanced Message Queuing Protocol(AMQP) suitable for Korean e-Navigation operating system and shows that's result.

  • PDF

Cryptanalysis of an Identity-Based Message Authentication Scheme in VANETs (신원기반의 차량통신망 메시지 인증 스킴에 대한 안전성 분석)

  • Ryu, Eun-Kyung;Lee, Sung-Woon;Yoo, Kee-Young
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.167-172
    • /
    • 2013
  • In a paper recently published in the International Journal of Parallel, Emergent and Distributed Systems, Biswas et al. proposed a VANET message authentication scheme which uses an identity-based proxy signature mechanism as an underlying primitive. The authors claimed that their scheme supports various security features including the security of proxy-key, the security against message forgery and the security against replay attack, with non-repudiation and resistance to proxy-key compromise. Here, we show how an active attacker, who has no knowledge of an original message sender's private key, can compute the proxy-signature key of the corresponding message sender, meaning that the scheme is completely insecure. We also suggest an enhanced version of the protocol capable of solving such serious security holes.

An Estimation for VMS Message Reading Time Considering Traffic Condition and Human Factor (교통상황 및 인적요소를 고려한 도로전광표지 판독소요시간 추정)

  • Hyun, Moon-Kook;Kim, Seung-Ji;Kim, Byoung-Jong;Kim, Won-Kyu
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.11 no.1
    • /
    • pp.13-27
    • /
    • 2012
  • According to the development of Intelligent Transportation System technology, VMS(Variable Message Signs) are operating on highway. But, VMS display information which don't reflect traffic condition and driver's human factor. So driver can't read VMS message during limited time, it makes to reduce VMS's reliability. This paper presents a model for VMS message reading time and distance considering traffic condition and human factor. We built driving simulator by Winroad package which is able to copy real driving condition. Subjects were comprised of 20 people who reflect domestic driver's condition such as sex. We did regression analysis with experiment results and draw the model. The model could be possible to develop message- set considering traffic condition and human factor.

Message Scheduling Algorithm for Hard Real-time Communications of Periodic Messages on a Switched Ethernet (스위칭이더넷에서 주기적 메시지에 대한 경성 실시간 통신을 위한 메시지 스케쥴링 알고리즘)

  • Kim Myung-Kyun;Lee Hee-Chan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.9
    • /
    • pp.684-690
    • /
    • 2006
  • This paper proposes a message transmission model for hard real-time communications of periodic messages on a switched Ethernet and also proposes an algorithm to schedule the messages to be transmitted within their deadlines. The proposed scheduling algorithm is a distributed one and is peformed by the source and the destination nodes without the modification of the operational features of the standard Ethernet switch. When a new periodic message needs to be transmitted, it is first checked whether it can be scheduled on both the transmission and the reception links without affecting the already-scheduled messages, and a feasible schedule is made for the new message if it is schedulable. The proposed scheduling algorithm guarantees the transmission of periodic messages within their deadline and allows flexible message transmission on a hard real-time switched Ethernet through the dynamic addition of new periodic messages during run-time.

Race State Transition for Detecting Unaffected Race Conditions in Message-Passing Programs (메시지전달 프로그램의 영향받지 않은 경합조건 탐지를 위한 경합상태 전이기법)

  • Park Mi-Young;Kang Hyun-Syug;Jun Yong-Kee
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.8
    • /
    • pp.495-504
    • /
    • 2006
  • Detecting unaffected race conditions is important to debugging message-passing programs effectively, because such a message race can affect other races to occur or not. The previous technique to detect efficiently unaffected races detects racing messages by halting at the receive event of the first race to occur in each process. However this technique does not guarantee that all of the detected races are unaffected, because halting such processes does disconnect some chain of affects-relations among those races. In this paper, we present a novel technique that manages the state of the detected race by examining if every received message is affected until the execution terminates. Our technique therefore guarantees to detect efficiently the unaffected races, because it maintains affects-relations of the races all along the execution of program.

MA(Mesh Adaptive)-CBRP Algorithm for Wireless Mesh Network (Wireless Mesh Network를 위한 MA(Mesh Adaptive)-CBRP 알고리즘의 제안)

  • Kim, Sung-Joon;Cho, Gyu-Seob
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.11B
    • /
    • pp.1607-1617
    • /
    • 2010
  • In this paper we propose MA-CBRP, mesh adaptive algorithm for wireless mesh networks. MA-CBRP is a hybrid algorithm based on ad-hoc CBRP protocol. In MA-CBRP, the mesh router periodically sends the ANN message as like Hello-message in CBRP. ANN message allows to all clients periodically store a route towards the mesh-router and renewal information in their routing cache. While CBRP periodically reply Hello-message, MA-CBRP does not reply to achieve less overhead. After receiving ANN message, mesh client send JOIN message to mesh router when the route towards mesh router changed. at the same time Register the entry to mesh router, it can achieve to reduce overhead of control the route and shorten the time to find route. consequently, MA-CBRP shows 7% reduced overhead and shortened time to find route than CBRP with regardless of clients number.