• 제목/요약/키워드: Message transmission

Search Result 611, Processing Time 0.029 seconds

A Mechanism for the Secure IV Transmission in IPSec (IPSec에서 안전한 IV 전송을 위한 메커니즘)

  • Lee, Young-Ji;Park, Nam-Sup;Kim, Tai-Yun
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.2
    • /
    • pp.156-164
    • /
    • 2002
  • IPSec is a protocol which provides data encryption, message authentication and data integrity on public and open network transmission. In IPSec, ESP protocol is used when it needs to provide data encryption, authentication and Integrity In real transmission packets. ESP protocol uses DES-CBC encryption mode when sender encrypts packets and receiver decrypts data through this mode IV is used at that time. This value has many tasks of attack during transmission by attacker because it is transferred clean and opened. If IV value is modified, then decryption of ESP data is impossible and higher level information is changed. In this paper we propose a new algorithm that it encrypts IV values using DES-ECB mode for preventing IV attack and checks integrity of whole ESP data using message authentication function. Therefore, we will protect attacks of IV and data, and guarantee core safe transmission on the public network.

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.

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

An Error Control Scheme for Variable Length Traffic on Round Robin Style Real-Time Networks (라운드 로빈 실시간 네트워크에서의 가변 길이 트래픽을 위한 오류제어 기법)

  • Lee, Jung-Hoon
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.3
    • /
    • pp.277-285
    • /
    • 2002
  • This paper proposes and analyzes an error control scheme for the transmission control based real-time communication, such as FDDI, TDMA, and wireless LAN, which delivers the message according to the round robin fashion after the off-line bandwidth allocation. Taking into account the time constraint of each message, the proposed error control scheme makes the receiver transmit the error report via asynchronous traffic while the sender resend the requested message via overallocated access time which is inevitably introduced by the bandwidth allocation procedure for hard real -time guarantee. The error control procedure does not interfere other real -time message transmissions. In addition, as each frame contains the size of the message it belongs, the receiver can recognize the end of completion of message transmission. This enables earlier error report to the receiver so that the sender can cope with more network errors. The analysis results along with simulation performed via SMPL show that the proposed scheme is able to enhance the deadline meet ratio of messages by overcoming the network errors. Using the proposed error control scheme, the hard real -time network can be built at cost lower than, but performance comparable to the expensive dual link network.

Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network

  • Ayub, Qaisar;Mohd Zahid, M. Soperi;Abdullah, Abdul Hanan;Rashid, Sulma
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.3
    • /
    • pp.649-657
    • /
    • 2013
  • DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.

Design and Implementation of Internet-based Message Transfer Agent via INMARSAT-C (INMARSAT-C를 통한 인터넷 기탄의 메시지 전송 에이전트 설계 및 구현)

  • 박연식;이태오;임재홍
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.3 no.1
    • /
    • pp.141-153
    • /
    • 1999
  • This paper presents the design and implementation of Internet-based message transfer agent via INMARSAT-C between the land and ship for the convenient message transfer service using the Internet mail or Web. In order to achieve these purpose, overall system configuration for communication between the land and ship, agent modules and database for managing transmission and receiving data are described. For the validity evaluation of this paper, message parsing, database, message format and X.25 interface modules are implemented and tested. Based on the result, the capabilities of ship automation system and ownship database access are discussed.

  • PDF

Low Cost Hardware Engine of Atomic Pipeline Broadcast Based on Processing Node Status (프로세서 노드 상황을 고려하는 저비용 파이프라인 브로드캐스트 하드웨어 엔진)

  • Park, Jongsu
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.8
    • /
    • pp.1109-1112
    • /
    • 2020
  • This paper presents a low cost hardware message passing engine of enhanced atomic pipelined broadcast based on processing node status. In this algorithm, the previous atomic pipelined broadcast algorithm is modified to reduce the waiting time until next broadcast communication. For this, the processor change the transmission order of processing nodes based on the nodes' communication channel. Also, the hardware message passing engine architecture of the proposed algorithm is modified to be adopted to multi-core processor. The synthesized logic area of the proposed hardware message passing engine was reduced by about 16%, compared by the pre-existing hardware message passing engine.

Reliable Message Routing Protocol for Periodic Messages on Wireless Sensor Networks (무선센서 네트워크에서 주기적 메시지에 대해 신뢰성 있는 메시지 전송을 위한 라우팅 프로토콜)

  • Ngo, Hoai Phong;Kim, Myung-Kyun
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.2
    • /
    • pp.190-197
    • /
    • 2011
  • In industrial distributed control systems, sensors collect data from the physical environment periodically and transmit them to the actuators, which process the control operations based on the received data. For the effective operation of the control systems, the data transmitted by the sensors has to be delivered to the actuators reliably within the deadline, and if the message reception rate of the actuators becomes lower than a threshold, then the performance of the control systems drops greatly. This paper suggests a message routing protocol to transmit periodic messages reliably in a distributed control system based on wireless sensor networks. For reliable message transmission, the proposed protocol selects a routing path whose end-to-end message reception rate is the highest before transmitting data messages. The proposed protocol has the capability of maintaining a target message reception rate for each flow. To maintain the required target reception rate, each destination monitors the actual message reception rate periodically and transmits a feedback message to the source if it drops below the target reception rate. On receiving the feedback message, the source tries to find a new path which can satisfy the target rate. The performance of the proposed protocol has been evaluated using simulation and compared with other protocols in terms of the message reception rate, the message delay and delay jitter, and so on. The simulation results show that the proposed protocol has a higher message reception rate and comparable message delay and delay jitter to other protocols. The simulation results also show that the proposed protocol has an ability to adapt well to the dynamic network traffic change.

Reference Interpolation Protocol for Reducing the Synchronization Messages in Wireless Sensor Network (무선 센서 네트워크에서 동기화 메시지 감소를 위한 참조 보간 프로토콜)

  • Park, Chong-Myung;Lim, Dong-Sun;Lee, Joa-hyoung;Jung, In-Bum
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.6
    • /
    • pp.446-457
    • /
    • 2007
  • In wireless sensor network, to provide the proper responses quickly for diverse events, wireless sensor nodes have to cooperate with each other. For successful cooperation, the time synchronization among sensor nodes is an important requirement for application execution. In the wireless sensor network, the message packets including time information are used for the time synchronization. However, the transmission of many message packets will exhaust the battery of wireless sensor nodes. Since wireless sensor nodes works on the limited battery capacity, the excessive transmission of message packets has an negative impact upon their lifetime. In this paper, the Reference Interpolation Protocol (RIP) is proposed to reduce the number of message packets for the time synchronization. The proposed method performs the time interpolation between the reference packet's time and the global time of the base station. The proposed method completes the synchronization operation with only 2 message packets when compared to the previous Reference Broadcast Synchronization (RBS) technique. Due to the simple synchronization procedure, our method greatly reduces the number of synchronization messages and showed the 12.7 times less power consumption than the RBS method. From the decrease in the transmission of message packets, the convergence time among wireless sensor nodes is shortened and the lifetime of wireless sensor nodes is also prolonged as much as the amount of saved battery energy.

Transmission Time Analysis of WAP Packet Considering RLP Layer in CDMA Wireless Channel (CDMA 무선채널에서 RLP 계층을 고려한 WAP 패킷의 전송시간 분석)

  • 문일영;노재성;조성준
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.57-60
    • /
    • 2001
  • This paper has studied the WAP packet transmission time, using WTP SAR algorithm. One method that is improved transfer ability, SAR fragmented WTP total message down from upper layer and then packet is transmitted to RLP frame time slot. In this paper, we analysis the transmission time of WAP packet with variable HLP layer size on the CDMA wireless channel for next generation systems as well as PCS, DCS. From the results, we can obtain the WAP packet transmission time and optimal WTP packet size.

  • PDF