• Title/Summary/Keyword: message protocol

Search Result 944, Processing Time 0.023 seconds

Design and Implementation of DHCP Supporting Network Attack Prevention (네트워크 공격 방지를 지원하는 DHCP의 설계 및 구현에 관한 연구)

  • Yoo, Kwon-joeong;Kim, Eun-gi
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.4
    • /
    • pp.747-754
    • /
    • 2016
  • DHCP(Dynamic Host Configuration Protocol) is a protocol for efficiency and convenience of the IP address management. DHCP automatically assigns an IP address and configuration information needed to run the TCP/IP communication to individual host in the network. However, existing DHCP is vulnerable for network attack such as DHCP spoofing, release attack because there is no mutual authentication systems between server and client. To solve this problem, we have designed a new DHCP protocol supporting the following features: First, ECDH(Elliptic Curve Diffie-Hellman) is used to create session key and ECDSA(Elliptic Curve Digital Signature Algorithm) is used for mutual authentication between server and client. Also this protocol ensures integrity of message by adding a HMAC(Hash-based Message Authentication Code) on the message. And replay attacks can be prevented by using a Nonce. As a result, The receiver can prevent the network attack by discarding the received message from unauthorized host.

Hop Based Gossiping Protocol (HoGoP) for Broadcasting Message Services in Wireless Sensor Networks (무선 센서 망에서 브로드캐스팅 메시지 서비스를 위한 홉 기반 가십 프로토콜)

  • So, Won-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1B
    • /
    • pp.144-153
    • /
    • 2010
  • Flooding based routing protocols are usually used to disseminate information in wireless sensor networks. Those approaches, however, require message retransmissions to all nodes and induce huge collision rate and high energy consumption. In this paper, HoGoP (Hop based Gossiping Protocol) in which all nodes consider the number of hops from sink node to them, and decide own gossiping probabilities, is introduced. A node can decide its gossiping probability according to the required average reception percentage and the number of parent nodes which is counted with the difference between its hop and neighbors' ones. Therefore the decision of gossiping probability for network topology is adaptive and this approach achieves higher message reception percentage with low message retransmission than the flooding scheme. Through simulation, we compare the proposed protocol with some previous ones and evaluate its performance in terms of average reception percentage, average forwarding percentage, and forwarding efficiency. In addition, average reception percentage is analyzed according to the application requirement.

A Study on the Design of KVMF 2.0 Protocol for Ensuring Backward/Forward Compatibility between Different KVMF Message Standard Versions

  • Jeong-Min, Lee;Won-Gi, Lim;Won-Jun, Cho;Yong-Cheol, Kim;Jeung-Sub, Lee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.3
    • /
    • pp.45-58
    • /
    • 2023
  • KVMF(Korean Variable Message Format) 1.0 protocol is the Army's standard tactical datalink protocol that defines standard messages and communication methods to enable data communication between various weapon systems through bitwise variable message processing. The protocol has been applied to a variety of Army weapon systems over the past decade and has contributed to upgrade the Army's operational capabilities by enabling the implementation of Network Centric Warfare (NCW), the core of modern warfare. Since the KVMF 1.0 protocol was applied, new weapon systems with new technologies have been introduced over time, and new weapon systems have new messages based on the characteristics of the weapon system. As a result, compatibility problems arose due to different message versions with existing weapon systems, and it was expected that these problems would continue to emerge in the future, considering the need for continuous message revisions. Therefore, it became necessary to solve this problem, so this paper proposed a KVMF 2.0 protocol design that guarantees compatibility between forward and backward versions. In this paper, we implemented the design as SW, and confirmed that the design worked successfully by test between forward and backward versions on test environment. Therefore, when the KVMF 2.0 protocol design is applied to a weapon system, we can expect that the weapon system can be compatible with the forward and backward versions working with the existing weapon systems as well as with the future weapon systems.

Scalable Ordered Broadcast Protocol in the Distributed System (분산 시스템에서 확장성 있는 순서화 방송통신 프로토콜)

  • Han, In;Hong, Young-Sik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.3
    • /
    • pp.125-133
    • /
    • 2002
  • In this paper, we present an efficient broadcast protocol, called Btoken, that ensures total ordering of messages and atomicity of delivery in the large scaled distributed systems. Unlike the existing token-passing based protocol, Btoken does not circulate a token around the ring, instead, it uses three kinds of control messages for token transmission. The token has a sequence number field for broadcasting message, and the only site having the token can broadcast a message. When a site wishes to broadcast, It must send a message to the token site requesting the token. The token site sends a message with the token to the requester When the requester receives the token, it becomes the current token site and broadcasts a new message after setting sequence number derived from a field of the token into its message. Upon reception of it, any operating member is informed the position of the token site and will send token requesting message to the new token site. However, the other site may request the token to the old token site prior to receiving the broadcast message from the new token site. To resolve this problem, Btoken uses a message which is sent to the current token site by the old token site notifying who is the next token requester. Results of our simulation of the protocol show that Btoken is more efficient in the large scaled distributed system compared to existing broadcast protocols.

Implementation of Message Service for TCN Protocol (전동차용 네트웍 프로토콜의 메세지 서비스의 구현)

  • Park, Hong-Sung;Jin, Chang-Ki;Park, Geun-Pyo;Kim, Hyung-Yuk;Yoon, Gun
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.133-133
    • /
    • 2000
  • This paper implements Message Service of TCN or IEC 61375-1. TCN is divided into two services, Variable and Message Service. Variable Service uses the broadcasting method with Source Address, but Message Service uses peer-to-peer method with Destination Address and has OSI 7 Layer. In TCN, interface between Transport and Network Layer has not been defined and Meaning of Packet Pool has not been defined exactly. Therefore, this paper proposes the Implementation method for both the interface between Transport and Network Layer and the packet pool for Message Service of TCN.

  • PDF

Analysis of Link Error Effects in MANET Address Autoconfiguration Protocols

  • Kim, Sang-Chul;Chung, Jong-Moon
    • Journal of Communications and Networks
    • /
    • v.11 no.1
    • /
    • pp.84-93
    • /
    • 2009
  • This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

BL-CAST:Beacon-Less Broadcast Protocol for Vehicular Ad Hoc Networks

  • Khan, Ajmal;Cho, You-Ze
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.4
    • /
    • pp.1223-1236
    • /
    • 2014
  • With the extension of wireless technology, vehicular ad hoc networks provide important services for the dissemination of general data and emergency warnings. However, since, the vehicle topology frequently changes from a dense to a sparse network depending on the speed of the moving vehicles and the time of day, vehicular ad hoc networks require a protocol that can facilitate the efficient and reliable dissemination of emergency messages in a highly mobile environment under dense or intermittent vehicular connectivity. Therefore, this paper proposes a new vehicular broadcast protocol, called BL-CAST, that can operate effectively in both dense and sparse network scenarios. As a low overhead multi-hop broadcast protocol, BL-CAST does not rely on the periodic exchange of beacons for updating location information. Instead, the location information of a vehicle is included in a broadcast message to identify the last rebroadcasting vehicle in an intermittently connected network. Simulation results show that BL-CAST outperforms the DV-CAST protocol in terms of the end-to-end delay, message delivery ratio and network overhead.

Security Analysis of Cryptographic Protocols Based on Trusted Freshness

  • Chen, Kefei;Dong, Ling;Lai, Xuejia
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.18 no.6B
    • /
    • pp.219-232
    • /
    • 2008
  • A novel idea of protocol security analysis is presented based on trusted freshness. The idea has been implemented not only by hand but also by a belief muitisets formalism for automation. The key of the security analysis based on trusted freshness is a freshness principle: for each participant of a cryptographic protocol, the security of the protocol depends only on the sent or received one-way transformation of a message, which includes a trusted freshness. The manual security analysis method and the belief multisets formalism are all established on the basis of the freshness principle. Security analysis based on trusted freshness can efficiently distinguish whether a message is fresh or not, and the analysis results suggest the correctness of a protocol convincingly or the way to construct attacks intuitively from the absence of security properties. Furthermore, the security analysis based on trusted freshness is independent of the idealization of a protocol, the concrete formalization of attackers' possible behaviors, and the formalization of concurrent runs of protocols.

MRFR - Multipath-based Routing Protocol with Fast-Recovery of Failures on MANETs

  • Ngo, Hoai Phong;Kim, Myung Kyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.2
    • /
    • pp.271-287
    • /
    • 2013
  • We propose a new multipath-based reliable routing protocol on MANETs, Multipath-based Reliable routing protocol with Fast-Recovery of failures (MRFR). For reliable message transmission, MRFR tries to find the most reliable path between a source and a destination considering the end-to-end packet reception reliability of the routes. The established path consists of a primary path that is used to transmit messages, and the secondary paths that are used to recover the path when detecting failures on the primary path. After establishing the path, the source transmits messages through the primary path. If a node detects a link failure during message transmission, it can recover the path locally by switching from the primary to the secondary path. By allowing the intermediate nodes to locally recover the route failure, the proposed protocol can handle the dynamic topological change of the MANETs efficiently. The simulation result using the QualNet simulator shows that the MRFR protocol performs better than other protocols in terms of the end-to-end message delivery ratio and fault-tolerance capability.

Android mobile phone information push system based on the XMPP protocol (XMPP 프로토콜기반 안드로이드 휴대폰 정보 푸쉬 시스템)

  • Pyoun, Do-Kil;Hao, Liu;Jung, Hoe-Kyung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.561-566
    • /
    • 2013
  • In this paper, android phone information push system based on the XMPP protocol is proposed. For this, we implement a XMPP(eXtensible Message and Presence Protocol) based instant message system in C/S network environment by using Java language and eclipse device. This system not only allows sending and receiving messages from the PC server to mobile phone client, but also enables the expansion into the smack package of an android phone. Thus, this system shown, in this paper has the better performance in transmission and transfer speed than those of the basic XMPP protocol system.