• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.12
• /
• pp.1224-1228
• /
• 2010

The existing cluster-based routing protocols have some problems. Firstly, because of selecting cluster head at random, they occur a node concentration problem. Secondly, they have a low reliability for data communication due to the less consideration of node communication range. Finally, data communication overhead is greatly increased because of sending all sensor node information to sink node for constructing clusters. To solve these problems, we in this paper, propose a cluster-based routing protocol using message reception success rate. Firstly, to solve the node concentration problem, we design a cluster head selection algorithm based on node connectivity and devise cluster spliting/merging algorithms. Secondly, to guarantee data communication reliability, we use message reception success rate. Finally, to reduce data communication overhead, we use only neighbor nodes information at both cluster construction and cluster head selection.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.215-221
• /
• 2011

Communication infrastructure of wireless sensor networks significantly tends to depend on application requirements. Gossip communication is becoming one of the promising solutions for addressing its scalability problems in providing information propagation functionality based on the P (publish)/S (subscribe) paradigm. In particular, despite the importance of both guaranteeing message delivery order required and supporting overlapping groups in sensor networks, there exist little research works on development of gossip-style dissemination protocols to satisfy all these requirements. In this paper, we present the latest causal information transmission protocol between publishers and subscribers for overlapping groups. In this protocol, sensor leaders as publishers might guarantee consistently causally ordered message delivery among themselves by aggregating causality information. On the other hand, only the latest causal information piggybacked on each multicast message is transmitted from publishers to subscribers through gossip-style dissemination. Its scalability feature might be highly suitable for the area of the applications requiring only the minimum meaningful information.

• Journal of Convergence for Information Technology
• /
• v.11 no.7
• /
• pp.21-30
• /
• 2021

With the development of IoT technology, various cloud computing-based services such as smart cars, smart healthcare, smart homes, and smart farms are expanding. With the advent of a new environment, various problems continue to occur, such as the possibility of exposure of important information such as personal information or company secrets, financial damage cases due to hacking, and human casualties due to malicious attack techniques. In this paper, we propose a message communication protocol for smart home-based secure communication and user data protection. As a detailed process, secure device registration, message authentication protocol, and renewal protocol were newly designed in the smart home environment. By referring to the security requirements related to the smart home service, the stability of the representative attack technique was verified, and as a result of performing a comparative analysis of the performance, the efficiency of about 50% in the communication aspect and 25% in the signature verification aspect was confirmed.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.5
• /
• pp.701-708
• /
• 2021

In this paper, I investigate the performances of the discovery and the message transmission of the DDS (Data Distribution Service) included the security function. The DDS serves the communication protocol, a publication- subscription method, for the real-time communication in the distributed system. The publication-subscription method is used in the various area in terms of defence, traffic and medical due to the strength such as a performance, scailability and availability. Nowadays, many communication standard has included and re-defined the security function to prepare from dramatically increased a threat of the security, the DDS also publishes the standard included the security function. But it had been not researched that the effect of increased a overhead for legacy systems due to the using of the security DDS function. The experimental results show that the comparative performance of legacy DDS and security DDS in terms of the discovery and the message transmission.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.668-678
• /
• 2023

FlexRay is an in-vehicle network with maximum two channels and maximum transmission speed of 10Mbps per channel. FlexRay exploits TDMA (Time Division Multiple Access) and FTDMA (Flexible Time division Multiple Access) to ensure real-time communication with efficient transmission, so it is used for real-time electronic control of safety-critical vehicular modules such as powertrain. This paper explains FlexRay protocol, time hierarchy, message frame, communication controller, and conformance test in detail based on ISO 17458 standard and FlexRay consortium documents.

• International journal of advanced smart convergence
• /
• v.10 no.2
• /
• pp.64-72
• /
• 2021

XML message brokers have a lot of importance because XML has become a practical standard for data exchange in many applications. Message brokers covered in this document store many users. This paper is a study of the processing of twig pattern queries in XML documents using branching node streams in XML message broker structures. This work is about query processing in XML documents, especially for query processing with XML twig patterns in the XML message broker structure and proposed a method to reduce query processing time when parsing documents with XML twig patterns by processing information. In this paper, the twig pattern query processing method of documents using the branching node stream removes the twigging value of the branch node that does not include the labeling value of the branch node stream when it receives a twig query from the client. In this paper, the leaf node discovery time can be reduced by reducing the navigation time of nodes in XML documents that are matched to leaf nodes in twig queries for client twig queries. Overall, the overall processing time to respond to queries is reduced, allowing for rapid question-answer processing.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.285-291
• /
• 2022

With the growing exchange of data between individuals and institutions through various electronic communication, valuable data protection is in high demand to ensure that it is not hacked and that privacy is protected. Many security techniques, such as encryption and steganography, have emerged to prevent security breaches. The purpose of this research is to integrate cryptographic and steganography techniques to secure text message sending. The Rijndael algorithm was used to encrypt the text message, and the Least Significant Bit algorithm was also used to hide the encrypted message in a color image. Experiments on the suggested method have proven that it can improve the security of sent messages due to the human eye's inability to identify the original image from the image after it has been covered, as well as the encryption of the message using a password.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.3
• /
• pp.11-21
• /
• 2014

In this paper, concerning the various advertising and policy advertising of the election with respect to whether to deliver a message to a large number of people, we design and implement an automative system what enables sending the text messages directly from the server to the client and also fast feedback is enabled by utilizing a number of operational programs to connect to the server. Therefore, we design and implement the automative communication system which enables delivering message to each user mobile terminal from a plurality of relay mobile terminals by utilizing the mobile instant messenger, not to deliver a message from the server to the mobile instant messenger user directly. In result of comparative analysis on the number of times of data transmission, this automative communication system utilizing mobile instant messenger shows the result that it enables transmitting five times per minute as it can copy and paste in the automation system regardless of the size of the data loading, otherwise in case of transmitting manually it show the result that the number of times of data transmission is reduced if the size of the data is larger.

• Journal of Digital Convergence
• /
• v.10 no.7
• /
• pp.161-166
• /
• 2012

When a car accident happened on a highway, the accident vehicle should broadcast a safe message to its neighbors in order to prevent a chain-reaction collision. Also, there is a problem that the estimation accuracy is low because of the memory limit from increasing the sampling count. In this paper, we proposes a HVC systems using a back-off algorithm applied to a gaussian model. And we proposes a MAC protocol preventing the communication delay by separating the neighbor count collection channel, data channel, and RSU communication channel. As a result, we show the frame reception success rate of our protocol improved about 10% than the previous protocol.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.137-144
• /
• 2005

Many reliable group communication algorithms were presented to satisfy predetermined message ordering properties in small or medium-scale distributed systems. However, the previous algorithms with their strong reliability properties may be unappropriate for large-scale systems. To address this issue, some epidemic-style group communication algorithms were proposed for considerably improving scalability while guaranteeing the reasonably weaker reliability property than the existing ones. The algorithms are all designed for ensuring the atomic order message delivery property. But, some distributed applications such as multimedia systems and collaborative work, may require only the weaker message ordering property, i.e., causal order delivery. This paper proposes an efficient epidemic-style group communication algorithm ensuring causal order delivery to provide the indigenous scalability of the epidemic-style approach.