• Title/Summary/Keyword: message protocol

Search Result 944, Processing Time 0.034 seconds

A Display Method of Image Information and URL Using the Message Structures of Emergency Alert Broadcasts for 5G Cellular Communications (5G 이동통신 용 재난경보 방송의 메시지 구조를 이용한 이미지 정보 및 URL 표출기법)

  • Chang, Sekchin
    • Journal of Broadcast Engineering
    • /
    • v.26 no.5
    • /
    • pp.592-598
    • /
    • 2021
  • Current cellular systems rely on a CBS protocol for emergency alert broadcast services. However, the CBS protocol just specifies the delivery of a limited text message. Therefore, foreigners, who are unfamiliar with local characters, may have some difficulties in understanding the received CBS text message. The CBS protocol also reveals a distinct restriction in delivering abundant information because of a limited number of text characters. In order to overcome the weak points of the current CBS protocol, we propose a display method of image information and URL on the screens of mobile terminals for the received CBS text message in this paper. The presented approach effectively utilizes the message structure of CBS for 5G cellular systems.

A MAC Protocol Using Delay Information Feedback for High-Speed MAN (지연정보 되먹임을 이용하는 고속 MAN용 MAC 프로토콜)

  • 김성원;정동근;최종호
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.29B no.5
    • /
    • pp.21-29
    • /
    • 1992
  • This paper proposes a new MAC propocol for high-speed MAN. The proposed protocol is based on the P$_1$-persistent tranmission scheme and each node calculates the transmission probability periodically by using delay information(DI). A window mechanism for the calculation of message delay in each node is proposed to improve the adaptability of the proposed protocol to traffic changes. The capactiy of the proposed protocol is analyzed. The simulation results show that the proposed protocol gives fair message delay under heavy load conditions and, when the transmission speed or distance is increased, the message delay variation of the proposed protocol is less than that of IEEE 802.6 DQDB.

  • PDF

Analysis of Application Message Protocol for Control Network in Green Power Systems (차세대 그린 에너지 발전 시설을 위한 응용 메시지 프로토콜의 분석 및 응용)

  • Kwon, Ki-Hyup;Kim, Dong-Sung
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.12
    • /
    • pp.1209-1215
    • /
    • 2009
  • This paper discusses a common message protocol for green power systems such as tidal, wind, photovoltaic, and solar systems. For this investigations and analysis, existing protocols such as ELCOM-90, TASE.1, ICCP/TASE.2 and SCADA were analyzed for the application of green power systems in view of real-time property and reliability. For the analysis, the practical example of green power system using SACADA and ICCP are investigated and discussed. As a future direction of this investigations, the feasibility analysis of manufacturing message specification(ISO-9560) for green power system is discussed.

Designing and Implementing Message Broker System based on SOAP (SOAP 기반의 메시지 Broker 시스템 설계 및 구현)

  • 김용수;주경수
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.6
    • /
    • pp.1071-1078
    • /
    • 2003
  • SOAP is a protocol used for information exchange in distributed computing environment and SOAP defines mechanisms for message transferring between distributed system and remote procedure call/response process. This SOAP is able to be used independently on operating systems and program languages because it uses only a text-based XML for protocol. Therefor ebXML that is a standard for E-Commerce adopts SOAP for message exchange. In this paper, we developed Message Broker System based on SOAP. By this Message Broker System we can more easily exchange messages for B2B. Accordingly we can manage and integrate a lots of business partners.

  • PDF

Design Considerations for KPS Navigation Message

  • Noh, Jae Hee;Lim, Deok Won;Heo, Moon Beom;Jo, Gwang Hee;Lee, Sang Jeong
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.9 no.4
    • /
    • pp.305-317
    • /
    • 2020
  • The navigation message is composed of the information contained in the message and the structure for transmitting this information. In order to design a navigation message, considerations in terms of message content and message structure must be elicited. For designing a Korea Positioning System (KPS) navigation message, this paper explains performance indicators in terms of message structure and message content. Most of the performance analysis of GNSS navigation messages already in operation was performed only for Time-to-first-fix-Data (TTFFD). However, in the navigation message, the message content is composed of Clock-Ephemeris Data (CED) and additional information. So, this paper proposes a new performance indicator R_(Non-CED) that can be analyzed from the viewpoint of receiving additional information along with an explanation of TTFFD focusing on the CED reception time. This paper analyze the performance in terms of message structure using these two performance indicators. The message structures used for analysis are the packetized message protocol like GPS CNAV and the packetized and fixed pattern message protocol like GPS CNAV-2. From the results, it is possible to proffer how KPS navigation messages can have better performance than GPS navigation messages. And, these two performance indicators, TTFFD and RNon-CED, can help to design the minimum TTFF required performance of KPS navigation messages.

Scalability Analysis of MANET IPv6 Address Auto-configuration Protocols based on Link Error Modeling (링크 에러 모델링을 이용한 MANET 환경에서의 IPv6 자동주소 설정 방식의 확장성 분석)

  • Kim, Sang-Chul
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.4
    • /
    • pp.282-291
    • /
    • 2008
  • This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

Performance Evaluation of WSP with Capability Extension using Compression Techniques (압축 기법을 이용한 WSP의 기능 확장과 성능 평가)

  • Kim, Ki-Jo;Lee, Dong-Gun;Lim, Kyung-Shik
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.543-552
    • /
    • 2002
  • Wireless Session Protocol(WSP) which was updated and supplemented based on HyperText Transfer Protocol(HTTP) was designed by Wireless Application Protocol(WAP) forum regarding the characteristics of wireless environment. WSP improved the performance in wireless network, and introduced various facilities considering wireless environment. In this paper, we more improve the performance of WSP adding protocol message compression capability; we cail improved WSP protocol as WSP+. And, we analysis the performance of each protocol with WSP and WSP+ implementation. As a result of experiment, the capability which proposed in this paper reduced a response traffic about 45%. In $10^{-4}$ bit error rate, we also found the packet loss rate and time delay per transaction of WSP+ was improved over 40%. Finally, we found that the protocol message compression capability reduces message retransmission count in transaction layer and shorten the delay time per transaction by reducing a message size.

Lazy Garbage Collection of Coordinated Checkpointing Protocol for Avoiding Sympathetic Rollback (동기적 검사점 기법에서 불필요한 복귀를 회피하기 위한 쓰레기 처리 기법)

  • Chung, Kwang-Sik;Yu, Heon-Chang;Lee, Won-Gyu;Lee, Seong-Hoon;Hwang, Chong-Sun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.6
    • /
    • pp.331-339
    • /
    • 2002
  • This paper presents a garbage collection protocol for checkpoints and message logs which are staved on the stable storage or volatile storage for fault tolerancy. The previous works of garbage collections in coordinated checkpointing protocol delete all the checkpoints except for the last checkpoints on earth processes. But implemented in top of reliable communication protocol like as TCP/IP, rollback recovery protocol based on only last checkpoints makes sympathetic rollback. We show that the old checkpoints or message logs except for the last checkpoints have to be preserved in order to replay the lost message. And we define the conditions for garbage collection of checkpoints and message logs for lost messages and present the garbage collection algorithm for checkpoints and message logs in coordinated checkpointing protocol. Since the proposed algorithm uses process information for lost message piggybacked with messages, the additional messages for garbage collection is not required The proposed garbage collection algorithm makes 'the lazy garbage collectioneffect', because relying on the piggybacked checked checkpoint information in send/receive message. But 'the lazy garbage collection effect'does not break the consistency of the whole systems.

CoAP-based Reliable Message Transmission Scheme in IoT Environments

  • Youn, Joosang;Choi, Hun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.1
    • /
    • pp.79-84
    • /
    • 2016
  • In this paper, we propose reliable message transmission scheme based on CoAP, considering the constrained feature of IoT device, such as low power, the limited memory size and low computing capacity. Recently, the various kinds of application protocol has been studied to support IoT environments. In particular, CoAP protocol was developed as application protocol for IoT at the IETF core WG. However, because CoAP protocol is deigned to be used in constrained node, this protocol uses UDP at transport layer. Thus, data loss may occur frequently in network congestion environments. The proposed scheme, in this paper, is to overcome the problem of frequent data loss with low overhead. Also it includes the function which is to minimize the data loss in sleep mode of IoT device.

Contention-based Reservation Protocol Using a Counter for Detecting a Source Conflict in WDM Single-hop Optical Network with Non-equivalent Distance

  • Sakuta, Makoto;Nishino, Yoshiyuki;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.3 no.4
    • /
    • pp.365-373
    • /
    • 2001
  • We propose a new channel reservation protocol which can reduce message delay by using a counter for detection of d source conflict in a WDM single-hop network with non-equivalent propagation delay. A source convict occurs when a source node has the right to transmit more than or equal to two messages simultaneously, which are transmitted using different wavelengths. In such a case, the source node has to newly obtain the right to transmit the message. In the proposed protocol, by using a source conflict counter a source node can detect a source conflict before a wave-length assignment is performed. Therefore, the source node can start a procedure to newly obtain the right to transmit the message which cannot be transmitted due to a source conflict. We analyse the throughput performance by taking the effect of a source conflict into account, and show that the approximate analysis and the computer simulated results are close. Also, from computer simulated results, we show that our proposed protocol can reduce mean message delay dramatically without degrading throughput performance as the offered load becomes large.

  • PDF