• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.2
• /
• pp.45-53
• /
• 2020

Blockchain can control transactions in a decentralized way and is already being considered for manufacturing, finance, banking, logistics, and medical industries due to its advantages such as transparency, security, and flexibility. And it is predicted to have a great economic effect. However, Blockchain has a Trilemma that is difficult to simultaneously improve scalability, decentralization and security characteristics. Among them, the biggest limitation of blockchain is scalability, which is very difficult to cope with the constantly increasing number of transactions and nodes. To make the blockchain scalable, higher performance should be achieved by modifying existing consensus methods or by improving the characteristics and network efficiency that affect many ways of scaling. Therefore, in this paper, we propose a cluster-based scalable PBFT consensus algorithm called CBS-PBFT which reduces the message complexity O(n²) of PBFT to O(n), which is a representative consensus algorithm of blockchain, and the validity is verified through simulation experiments.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.7C
• /
• pp.611-617
• /
• 2010

In this paper, we investigate the performances of the serial concatenated convolutional codes (SCCC) and low-density parity-check (LDPC) codes on perpendicular magnetic recording (PMR) channels. We discuss the performance of two systems when user bit-densities are 1.7, 2.0, 2.4 and 2.8, respectively. The SCCC system is less complex than LDPC system. The SCCC system consists of recursive systematic convolutional (RSC) codes encoder/decoder, precoder and random interleaver. The decoding algorithm of the SCCC system is the soft message-passing algorithm and the decoding algorithm of the LDPC system is the log domain sum-product algorithm (SPA). When we apply the iterative decoding between channel detector and the error control codes (ECC) decoder, the SCCC system is compatible with the LDPC system even at the high user bit density.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.2
• /
• pp.445-466
• /
• 2022

As everything linking to the internet, people can subscribe to various services from a service provider to facilitate their lives through the Internet of Things (IoT). An obligatory thing for the service provider is that they should push the service data safely and timely to multiple IoT terminal devices regularly after the IoT devices accomplishing the service subscription. In order to control the service message received by the legal devices as while as keep the confidentiality of the data, the public key encryption algorithm is utilized. While the existing public encryption algorithms for push service are too complicated for IoT devices, and almost of the current subscription schemes based on push mode are relying on centralized organization which may suffer from centralized entity corruption or single point of failure. To address these issues, we design a secure subscription-push service scheme based on blockchain and edge computing in this article, which is decentralized with secure architecture for the subscription and push of service. Furthermore, inspired by broadcast encryption and multicast encryption, a new encryption algorithm is designed to manage the permissions of IoT devices together with smart contract, and to protect the confidentiality of push messages, which is suitable for IoT devices. The edge computing nodes, in the new system architecture, maintain the blockchain to ensure the impartiality and traceability of service subscriptions and push messages, meanwhile undertake some calculations for IoT devices with limited computing power. The legalities of subscription services are guaranteed by verifying subscription tags on the smart contract. Lastly, the analysis indicates that the scheme is reliable, and the proposed encryption algorithm is safe and efficient.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.722-730
• /
• 2008

This paper proposes two novel algorithms enabling mobile robots to cooperate with each other in a reliability-based system and a time-critical system. In the reliability-based cooperative system, the concepts of a mobile ad hoc network (MANET) and an object entropy are adopted in order to coordinate a specific task. A logical robot group is created based on the exchange of request and reply messages in a robot communication group whose organization depends on transmission range. In the time-critical cooperative system, relational entropy is used to define the relationship between mobile robots. A group leader is selected based on optimizing power consumption. The proposed algorithm has been verified based on the computer-based simulation and soccer robot experiment. The performance metrics are defined. The metrics include the number of messages needed to make a logical robot group and to obtain the relationship of robots and the power consumption to select a group leader. They are verified by simulation and experiment.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.11
• /
• pp.99-107
• /
• 2013

Controller area network (CAN) was designed for multiplexing communication between electronic control units (ECUs) in vehicles and thus for decreasing the overall wire harness. The increasing number of ECUs causes the CAN bus overloaded and consequently the error probability of data transmission increases. Since the time duration for the data transmission is proportional to CAN frame length, it is desirable to reduce the frame length. In this paper, a CAN message compression method is proposed using Data Length Code (DLC) and compression area selection algorithm to reduce the CAN frame length and the error probability during the transmission of CAN messages. By the proposed method, it is not needed to predict the maximum value of the difference in successive CAN messages as opposed to other compression methods. Also, by the use of DLC, we can determine whether the received CAN message has been compressed or not without using two ID's as in conventional methods. By simulations using actual CAN data, it is shown that the CAN transmission data is reduced up to 52 % by the proposed method, compared with conventional methods. By using an embedded test board, it is shown that 64bit EMS CAN data compression can be performed within 0.16ms and consequently the proposed algorithm can be used in automobile applications without any problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1480-1484
• /
• 2003

This paper presents the design and development of network for housing estate security system. The system can cover up to 961 houses which can be up to 1,200 meters long transfer rate of 9,600 bps. This system uses checking and warning the abnormal situation. More over this system has ability to control switch on/off the electrical equipment in the house via AC line control system. The system consists of 4 parts. The first part is a security system of each house using MCS-51 microcontroller as a central processing unit scan 32 sensors and control 8 appliances and send alarm. The MCS-51 microcontroller received control signal via telephone used DTMF circuit. The second part is distributed two levels master/slave network implementing after RS-485 serial communication standard. The protocol its base on the OSI (Open Systems Interconnection) 7 layers protocol model design focus on speed, reliability and security of data that is transferred. The network security using encrypt by DES algorithm, message sequence, time stamp checking and authentication system when user to access and when connect new device to this system. Flow control in system is Poll/Select and Stop-and-Wait method. The third part is central server that using microcomputer which its main function are storing event data into database and can check history event. The final part is internet system which users can access their own homes via the Internet. This web service is based on a combination of SOAP, HTTP and TCP/IP protocols. Messages are exchanged using XML format [6]. In order to save the number of IP address, the system uses 1 IP address for the whole village in which all homes and appliance in this village are addressed using internal identification numbers. This proposed system gives the data transfer accuracy over 99.8% and maximum polling time is 1,120 ms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.2
• /
• pp.214-227
• /
• 2003

Developing an application, it is difficult to catch an exact requirement with the conventional text-based method. It has also problems in verification and analysis at each developing stage. Therefore, if an adjustment is required with an error and change of requirement, a bad effect happen in the whole system. In this case, it also affect adversely on the developing cost and period. Meanwhile, if an analysis or verification is performed, the possibility of an error frequency reduces. Thus, not only is it easier to correct the error but also add an new requirement. This thesis embody a TCP/IP congestion control algorithm with SDL which provides automatically graphic interface, verification and analysis to each developing stage. Using SDL gave a clear representation embodiment in each developing stage and easiness of adjustment due to changing requirements or correcting errors. In addition, the stages of protocol have been certified in a simulation by verification of MSC and the results showed a possibility of developing a better TCP/IP protocol.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3C
• /
• pp.201-210
• /
• 2002

A number or MPLS ATM switching system have been proposed to increase the access speed or current routers, but they cannot satisfy the Internet users who use diverse applications. So they are required to support the so-called differential service, which discriminates service behaviors according to the service class. In this paper, to support this differential service we suggest an LSP control method, which uses the extended LDP message and establishes several different LSPs for each FEC according to the service class. Also, we propose an marking algorithm using the cell loss priority field or ATM cells in order to process the differential service according to application categories. In addition, we present a forwarding procedure based on the LSP control method and the marking algorithm. A forwarding model applied this forwarding procedure can be easily implemented with a minimum modification of existing MPLS ATM switching systems. Therefore, we can save cost and time needed to implement the proposed model. Finally, we estimate the performance behaviors of the proposed application-based forwarding model by the AweSim simulation package.

• Journal of Sensor Science and Technology
• /
• v.22 no.1
• /
• pp.54-64
• /
• 2013

In this study, we developed a falling recognition system to transmit SMS data through CDMA communication using a three axises acceleration sensor and a two axises gyro sensor. 5 healthy men were selected into a control group, and the fall recognition system using the three axises acceleration sensor and the two axises gyro sensor was devised to conduct an experiment. The system was attached to the upper of their sternum. According to the experiment protocol, the experiment was carried out 3 times repeatedly divided into 3 specific protocols: falling during gait, falling in stopped state, and falling in everyday life. Data obtained in the falling recognition system and LabVIEW 8.5 were used to decide if falling corresponds to that regulated in an analysis program applying an algorithm proposed in this study. In addition, results from falling recognition were transmitted to designated cellular phone in a SMS (Shot Message Service) form. These research results show that an erroneous detection rate of falling reached 19% in applying an acceleration signal only; 6% in applying an angular velocity; and 2% in applying a proposed algorithm. Such finding suggests that an erroneous detection rate of falling is improved when the proposed algorithm is applied incorporated with acceleration and angular velocity. In this study therefore, we proposed that a falling recognition system implemented in this study can make a contribution to the recognition of falling of the aged or the disabled.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.2
• /
• pp.37-43
• /
• 2008

The performance and hardware complexity of LDPC decoders depend on the design parameters of quantization, the clipping threshold $c_{th}$ and the number of quantization bits q, and also on the maximum number of decoding iterations. In this paper, the BER performances of LDPC codes are evaluated according to the clipping threshold $c_{th}$ and the number of quantization bits q through the simulation studies. By comparing the quantized Min-Sum algorithm with the ideal Min-Sum algorithm, it is shown that the quantized case with $c_{th}=2.5$ and q=6 has the best performance, which approaches the idea case. The decoding complexities are calculated and the word error rates(WER) are estimated by using the pdf which is obtained through the statistical analyses on the iteration numbers. These results can be utilized to tradeoff between the decoding performance and the complexity in LDPC decoder design.