• Title/Summary/Keyword: message protocol

Search Result 944, Processing Time 0.026 seconds

Design and evaluation of an alert message dissemination algorithm using fuzzy logic for VANETs

  • Bae, Ihn-Han
    • Journal of the Korean Data and Information Science Society
    • /
    • v.21 no.4
    • /
    • pp.783-793
    • /
    • 2010
  • Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or propagate useful traffic information to other vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collisions at the link layer due to an excessive number of broadcast packets. We present a fuzzy alert message dissemination algorithm to improve performance for road safety alert application in Vehicular Ad-hoc Network (VANET). In the proposed algorithm, when a vehicle receives an alert message for the first time, the vehicle rebroadcasts the alert message according to the fuzzy control rules for rebroadcast degree, where the rebroadcast degree depends on the current traffic density of the road and the distance between source vehicle and destination vehicle. Also, the proposed algorithm is the hybrid algorithm that uses broadcast protocol together with token protocol according to traffic density. The performance of the proposed algorithm is evaluated through simulation and compared with that of other alert message dissemination algorithms.

Protocol supporting Variable-length Message using Reservation Slots in WDM Local Network (WDM Local Network에서 예약슬롯을 이용한 가변길이 메시지 지원 프로토콜)

  • 진교홍
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.2
    • /
    • pp.257-262
    • /
    • 2001
  • A new WDM-based protocol for scheduling a variable-length message is proposed in this paper Two control channels, reservation slot and control slot, are used to coordinate transmission and diminish the collisions of packet to minimize the across delay. When an idle control slot is available, control packet is transmitted on that slot and message is transferred. And the node continues to transmit its control packet through the corresponding slot every cycle, until the message is completely transmitted. If any control slot is not available, the node schedules the transmission time of message in earliest available time using reservation slots. The proposed scheduling algorithm shows better performance and lower access delay.

  • PDF

A TDMA-based MAC protocol in hybrid-vehicular communication systems for preventing a chain-reaction collision on a highway (하이브리드 차량 통신 시스템에서 연쇄 추돌 사고 방지를 위한 TDMA 기반 MAC 프로토콜)

  • Oh, Sang-Yeob
    • Journal of Digital Convergence
    • /
    • v.10 no.8
    • /
    • pp.179-184
    • /
    • 2012
  • A car accident on a highway occurs a chain-reaction collision because of a vehicle's fast velocity. In order to prevent it, the accident vehicle should broadcast a safe message to its neighbors. If there are many neighbor nodes, a frame collision probability is high. To solve this, it was proposed for a system as a previous study to send a safe message without frame-collision using separating channels. However, the separation of multiple channels make feasibility low because of increasing hardware's development cost and complexity. In this paper, we proposes a TDMA-based MAC protocol using a single channel. As a result, we show the frame reception success rate of our protocol was almost the same as the previous protocol.

A Design of Protocol Management System for Aggregating Messages based on Certification between Vehicles (차량간 인증 기반 메시지 집계 프로토콜 관리시스템 설계)

  • Lee, ByungKwan;Jeong, EunHee
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.18 no.4
    • /
    • pp.43-51
    • /
    • 2013
  • This paper proposes the design of protocol management system for aggregationg messages based on certification between vehicles which not only prevents the messages between vehicles from being forged and altered by Sybil attack by authenticating the them, and but also provides the efficient communication by aggregating the redundant vehicle messages which frequently happens when communicating. For this, the proposed system proposes the SKLC(Session Key Local Certificate) design which is a local certificate based on a session key, and the MAP(Message Aggregation Protocol) design which aggregates the redundant vehicle messages. Therefore, when the proposed system checks the certificate of vehicle, it provides the reliable information securely by verifying the integrity of vehicle with a hash function operation, and improves communication efficiency by reducing the processing time.

XML-based Message Transmission Protocol for Mobile Emergency Medical Service in the Pre-Hospital Phase (병원 전단계 모바일 응급의료 서비스를 위한 XML 기반 메시지 전송 프로토콜)

  • Kim, Heung Shik
    • Smart Media Journal
    • /
    • v.4 no.3
    • /
    • pp.24-30
    • /
    • 2015
  • For suddenly encountered emergencies, most people embarrass, and can not often deliver the correct message when they report. Recently in the commonplace smart software environment, it is important that they can transmit the correct individual emergency situation efficiently and can receive the best service, and can provide the efficient emergency medical services to real-time around the other emergencies. In this paper, we design a standard protocol for the rapid and accurate technology for transmitting XML-based structured messages to provide an efficient emergency medical services, and offers a emergency medical services protocol to make them available more efficiently.

Authenticated Quantum Secret Sharing using GHZ state swapping (GHZ 상태 교환을 이용한 인증된 양자 비밀 공유)

  • Lee, Duk-Jin;Lee, Hwa-Yean;Hong, Chang-Ho;Lim, Jong-In;Yang, Hyoung-Jin
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.16 no.6
    • /
    • pp.123-134
    • /
    • 2006
  • We propose a quantum secret sharing protocol which can authenticate more than half of members using GHZ state swapping. The Trusted Third Party, Trent can authenticate all members using previously shared ID among Trent distributing his message and the members wanting to reconstruct the message. Authenticated members can reconstruct a secret message through GHZ swapping. Moreover, this protocol is efficient to expand the number of members to arbitrary number n, so it is a close quantum secret sharing protocol to classical secret sharing protocol.

An Efficient Processing of Multimedia Message in SIP-Based Instant Messaging Service (SIP 기반 인스턴트 메시징 서비스에서의 효율적인 멀티미디어 메시지 처리)

  • Jo, Hyun-Gyu;Lee, Ki-Soo;Jang, Choon-Seo
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.152-159
    • /
    • 2008
  • In this paper, we have studied a new method in which multimedia message can be processed effectively in SIP(Session Initiation Protocol)-based Instant Messaging service. Total system is composed of multimedia message server, presence server and user system. To provide effectively message informations such as number of messages stored in the multimedia message server, waiting status and message types to users, we have proposed a new method which can be a substitute for message waiting indication event package. In our proposed method, when changes of messages status informations occur, these informations are sent to the presence server, and can be transferred as a separate tag within notification message. The presence server processes subscription requests and notifications, and efficiency can be improved as it provides both message status informations and several communication status informations such as on-line status to service users. Partial publication is used in our system to improve data transfer efficiency more between user system and the presence server. The performance of our proposed model is evaluated by experiments measuring multimedia message transfer speed and server processing time.

Non-Blocking Two Phase Commit Protocol Reducing the Blocking Problem (봉쇄문제를 축소한 비봉쇄 이단계 완료규약)

  • An, In-Sun;Kim, Gyeong-Chang
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.523-532
    • /
    • 2001
  • An atomic commitment protocol ensures that distributed transcations terminate consistently at participating sites. An atomic commitment protocol is said to be non-blocking if it permits transaction termination to proceed at correct participants despite of failure in the coordinator site and communication. It is well known that the famous two phase commit(2PC) is a blocking protocol, whereas the three phase commit(3PC) protocol is a non-blocking. In this paper, we propose a non-blocking two phase commit(NB-2PC) protocol reducing the blocking problem than propose non-blocking protocols. The NB-2PC protocol can be obtained through modifications of the 2PC protocol. After receiving Prepare message from coordinator in the NB-2PC protocol, participants respond to the coordinator and several participants in voting phase. While participants wait for decision message from the coordinator, the blocking occurs due to the failure of the coordinator site, participants elect new coordinator among several participants receive response message. Despite of the coordinator site failures, participants consult new coordinator and follow termination protocols and achieve non-blocking property. We propose a basic structure of NB-2PC protocol and termination protocol and new coordinator election protocol. The NB-2PC protocol has non-blocking property and reduces processing time of commit protocol than the 3PC protocol. Also, through simulation experiments, we propose the NB-2PC protocol exhibits better performance of processing time of commit protocol than 3PC protocol.

  • PDF

The Profibus Timed Token MAC Protocol for Real-Time Communications

  • Lee, Hong-Hee;Kim, Gwan-Su;Jung, Eui-Heon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.691-694
    • /
    • 2003
  • This paper describes how to use Profibus networks to support real-time industrial communications, that is, how to ensure the transmission of real-time messages within a maximum bound time. Profibus is based on a simplified timed token protocol, which is a well-proved solution for the real-time communication systems. However, Profibus differs from the timed token protocol, thus the usual timed token protocol has to be modified in order to be applied in Profibus. In fact, the real-time solutions for networks based on the timed token protocol rely on the possibility of allocating specific bandwidth for the real-time traffic. This means that a minimum amount of time to transmit the real-time messages is always guaranteed whenever each token is arrived. In other words, with the Profibus protocol, at least, one real-time message should be transmitted per every token visit in the worst case. It is required to control medium access properly to satisfy the message deadlines. In this paper, we have presented how to obtain the optimal network parameter for the Profibus protocol. The selected network parameter is valid regardless of the behavior of asynchronous messages.

  • PDF

Protocol supporting Variable-length Message using Pre-reservation Slots in WDM Local Network (WDM Local Network에서 선예약슬롯을 이용한 가변길이 메시지 지원 프로토콜)

  • Hwang, In-hwan;Shuin, Eui-jung;Jin, Kyo-hong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2001.05a
    • /
    • pp.119-124
    • /
    • 2001
  • A new WDM-based protocol for scheduling a variable-length message is proposed in this paper. Two control slots, Pre-reservation slot and Reservation Slot, are used to coordinate transmission and diminish the collisions of packet to minimize the access delay. When there is an idle reservation slot, a control packet is transmitted on that slot and message is transferred. And the node continues to transmit its control packet through the corresponding slot every cycle, until the message is completely transmitted. If an idle reservation slot is not available, the node schedules the transmission time of message in earliest available time using Pre-reservation slots. The proposed scheduling protocol has several advantages; any new node can join the network anytime without network re-initialization. Moreover, with the pre-reservation slots, we can avoid the packet collisions and destination conflicts, and we can improve the access delay time for message transmissions.

  • PDF