연구성과로 돌아가기
2022 연구성과 (144 / 280)
※ 컨트롤 + 클릭으로 열별 다중 정렬 가능합니다.
Excel 다운로드
| WoS | SCOPUS | Document Type | Document Title | Abstract | Authors | Affiliation | ResearcherID (WoS) | AuthorsID (SCOPUS) | Author Email(s) | Journal Name | JCR Abbreviation | ISSN | eISSN | Volume | Issue | WoS Edition | WoS Category | JCR Year | IF | JCR (%) | FWCI | FWCI Update Date | WoS Citation | SCOPUS Citation | Keywords (WoS) | KeywordsPlus (WoS) | Keywords (SCOPUS) | KeywordsPlus (SCOPUS) | Language | Publication Stage | Publication Year | Publication Date | DOI | JCR Link | DOI Link | WOS Link | SCOPUS Link |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| ○ | ○ | Article | Healthcare 5.0 Security Framework: Applications, Issues and Future Research Directions | Healthcare 5.0 is a system that can be deployed to provide various healthcare services. It does these services by utilising a new generation of information technologies, such as Internet of Things (IoT), Artificial Intelligence (AI), Big data analytics, blockchain and cloud computing. Due to the introduction of healthcare 5.0, the paradigm has been now changed. It is disease-centered to patient-centered care where it provides healthcare services and supports to the people. However, there are several security issues and challenges in healthcare 5.0 which may cause the leakage or alteration of sensitive healthcare data. This demands that we need a robust framework in order to secure the data of healthcare 5.0, which can facilitate different security related procedures like authentication, access control, key management and intrusion detection. Therefore, in this review article, we propose the design of a secure generalized healthcare 5.0 framework. The details of various applications of healthcare 5.0 along with the security requirements and threat model of healthcare 5.0 are provided. Next, we discuss about the existing security mechanisms in healthcare 5.0 along with their performance comparison. Some future research directions are finally discussed for the researchers working in healthcare 5.0 domain. | Wazid, Mohammad; Das, Ashok Kumar; Mohd, Noor; Park, Youngho | Graph Era Deemed Univ, Dept Comp Sci & Engn, Dehra Dun 248002, India; Int Inst Informat Technol, Ctr Secur Theory & Algorithm Res, Hyderabad 500032, India; Old Dominion Univ, Virginia Modeling Anal & Simulat Ctr, Suffolk, VA 23435 USA; Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu 41566, South Korea | WAZID, MOHAMMAD/X-4211-2018; Mohd, Noor/GXG-5010-2022; Das, Ashok Kumar/U-2790-2019; wazid, mohammad/X-4211-2018 | 55480987400; 55450732800; 57202616297; 56962990300 | iitkgp.akdas@gmail.com;parkyh@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 3.97 | 2025-06-25 | 12 | 46 | Healthcare 50; Internet of Things (IoT); artificial intelligence; cyber security; blockchain | SCHEME; PROTOCOL; INTERNET | artificial intelligence; blockchain; cyber security; Healthcare 50; Internet of Things (IoT) | Artificial intelligence; Authentication; Big data; Cloud analytics; Cybersecurity; Data Analytics; Health care; Internet of things; Intrusion detection; Block-chain; Cyber security; Future research directions; Healthcare 5.0; Healthcare services; Internet of medical thing; Internet of thing; Medical services; Security frameworks; Blockchain | English | 2022 | 2022 | 10.1109/access.2022.3228505 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | In-Body Sequential Multidrug Delivery Scheme Using Molecular Communication | This study explores the application of molecular communication (MC) for the enhancement of the performance of sequential drug delivery in combination therapy-a multi-drug treatment procedure. To achieve high efficacy, it is essential to maintain a delivery time interval (DTI) between consecutive drug administrations. To this end, this study proposes a coordination scheme that enables the control of the release times of a network of drug-carrying nanomachines to ensure the maintenance of the DTI. Particularly, MC is employed to develop a centralized network, wherein the release times of the drugs from the drug-carrying nanomachines are managed by a controller nanomachine. This nanomachine is named the internal controller nanomachine, as it is placed within the human body. The performance of the proposed scheme is evaluated in terms of the DTI error. Furthermore, the analytical expression of the error is derived and its correctness is validated using simulations. | Islam, Tania; Shitiri, Ethungshan; Cho, Ho-Shin | Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu 41556, South Korea | ; Shitiri, Ph.D., Ethungshan/Z-5918-2019 | 59634744500; 57190818428; 35316924900 | hscho@ee.knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 0.26 | 2025-06-25 | 2 | 3 | Drugs; Diffusion tensor imaging; Nanobioscience; Propagation delay; Molecular communication (telecommunication); Receivers; Monitoring; Molecular communication; nanomedicine; nanonetworks; targeted drug delivery; combination therapy | TARGETED-DRUG-DELIVERY; OPPORTUNITIES; NANOMEDICINE; MODULATION; SYSTEM; MODEL; TIME | combination therapy; Molecular communication; nanomedicine; nanonetworks; targeted drug delivery | Controlled drug delivery; Diffusion tensor imaging; Medical nanotechnology; Targeted drug delivery; Tensors; Combination therapy; Drug; Molecular communication; Molecular communication (telecommunication); Nano-networks; Nanobiosciences; Nanomachines; Propagation delays; Receiver; Magnetic resonance imaging | English | 2022 | 2022 | 10.1109/access.2022.3166945 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | On the Design of a Privacy-Preserving Communication Scheme for Cloud-Based Digital Twin Environments Using Blockchain | Digital twin technology is recently in the spotlight because of its potential applicability in business and industry. In digital twin environments, data generated from physical assets are transmitted to a remote server, which performs simulations through digital twins in a virtual space. Then, the simulation results can be shared with the data owner or other users. However, several challenges exist in the application of digital twin technology in the real world. One of the main challenges involves determining how to share real-time data for the simulation and how to share the simulation data securely. The data generated from physical assets may include sensitive information from data owners, and the leakage of data to an adversary can cause serious privacy problems. Moreover, the sharing of data with other data users should also be considered to maximize the availability of digital twin data. To resolve these issues, we propose a system model for the secure sharing of digital twin data. The proposed system model uses cloud computing for efficient data sharing and blockchain for data verifiability. We also propose communication schemes for the proposed model to guarantee privacy preservation and data security in wireless channels. We analyze the security of the proposed protocol using informal methods and formal methods such as BAN logic and the AVISPA simulation tool. Furthermore, we compare the proposed protocol with related protocols and demonstrate that the proposed scheme is applicable to digital twin environments. | Son, Seunghwan; Kwon, Deokkyu; Lee, Joonyoung; Yu, Sungjin; Jho, Nam-Su; Park, Youngho | Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu 41566, South Korea; Elect & Telecommun Res Inst, Daejeon 34129, South Korea; Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea | 57221744477; 57221739597; 57203970123; 57203974524; 8976178000; 56962990300 | parkyh@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 5.21 | 2025-06-25 | 43 | 61 | Digital twins; Cloud computing; Blockchains; Servers; Data models; Protocols; Computational modeling; Digital twin; mutual authentication and key agreement; blockchain; cloud computing; BAN logic; AVISPA | KEY AGREEMENT PROTOCOL; AUTHENTICATION; SECURE | AVISPA; BAN logic; blockchain; cloud computing; Digital twin; mutual authentication and key agreement | Blockchain; Cloud security; Computation theory; Computer circuits; Data structures; Formal methods; Information theory; Authentication and key agreements; AVISPA; BAN logic; Block-chain; Cloud-computing; Computational modelling; Mutual authentication; Mutual authentication and key agreement; Data privacy | English | 2022 | 2022 | 10.1109/access.2022.3191414 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | Optimizing MapReduce Task Scheduling on Virtualized Heterogeneous Environments Using Ant Colony Optimization | Consuming Hadoop MapReduce via virtual infrastructure as a service is becoming common practice as cloud service providers (CSP) offers relevant applications and scalable resources. One of the predominant requirements of cloud users is to improve resource utilization in the virtual cluster during the service period. However, it may not be possible when MapReduce workloads and virtual machines (VM) are highly heterogeneous. Therefore, in this paper, we addressed these heterogeneities and proposed an efficient MapReduce scheduler to improve resource utilization by placing the right combination of the map and reduce tasks in each VM in the virtual cluster. To achieve this, we transformed the MapReduce task scheduling problem into a 2-Dimensional (2D) bin packing model and obtained an optimal schedule using the ant colony optimization (ACO) algorithm. As an added advantage, our proposed ACO based bin packing (ACO-BP) scheduler minimized the makespan for a batch of jobs. To showcase the performance improvement, we compared our proposed scheduler with three existing schedulers that work well in a heterogeneous environment. As expected, results show that ACO-BP significantly outperformed the existing schedulers while dealing with workload and VM level heterogeneities. | Jeyaraj, Rathinaraja; Paul, Anand | Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea | Jeyaraj, Rathinaraja/ABB-7781-2021; Paul, Anand/V-6724-2017 | 57203111601; 56650522400 | paul.editor@gmail.com; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 1.41 | 2025-06-25 | 8 | 16 | Task analysis; Resource management; Cloud computing; Containers; Dynamic scheduling; Quality of service; Optimal scheduling; Ant colony optimization; bin packing; heterogeneity; MapReduce; resource utilization; task scheduling | BIN PACKING PROBLEM; PERFORMANCE | Ant colony optimization; Bin packing; Heterogeneity; MapReduce; Resource utilization; Task scheduling | Ant colony optimization; Artificial intelligence; Infrastructure as a service (IaaS); Job analysis; Multitasking; Quality of service; Scheduling; Scheduling algorithms; Virtual machine; Bin packing; Cloud-computing; Dynamic scheduling; Heterogeneity; Map-reduce; Optimal scheduling; Quality-of-service; Resource management; Resources utilizations; Task analysis; MapReduce | English | 2022 | 2022 | 10.1109/access.2022.3176729 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Proactively Invalidating Dead Blocks to Enable Fast Writes in STT-MRAM Caches | Spin-Transfer Torque Magnetic Random Access Memory (STT-MRAM) is a promising emerging memory technology for on-chip caches. It has a low read access time and low leakage power. Unfortunately, however, STT-MRAM suffers from its long write latency and high write energy consumption. This paper proposes a cache management technique called Proactive Invalidation (PROI) that proactively invalidates dead blocks in advance to enable fast writes in the STT-MRAM caches. Experimental evaluation shows that the proposed technique improves performance by 14% on average compared to the baseline STT-MRAM cache. This paper also proposes two optimization techniques called Proactive Invalidation-aware Data Encoding (PIDE) and Narrowness-aware Partial Write (NPW) to minimize the energy overheads of Proactive Invalidation. Experimental results demonstrate that the total energy consumption of the STT-MRAM cache with PROI is only 1.8% higher than the baseline when PROI is applied with PIDE and NPW. | Kim, Yongjun; Chen, Yuze; Lee, Yongho; Peng, Limei; Hong, Seokin | Sungkyunkwan Univ, Dept Elect & Comp Engn, Suwon 16419, South Korea; Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea | 58845443900; 57222517447; 57199021794; 7201574271; 55597086808 | seokin@skku.edu; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 0.26 | 2025-06-25 | 3 | 3 | Switches; Random access memory; Magnetic tunneling; Energy consumption; Resistance; System-on-chip; Transistors; On-chip cache; non-volatile memory; STT-MRAM; dead block; narrow-width value | PERFORMANCE; ENERGY; MEMORY | dead block; narrow-width value; non-volatile memory; On-chip cache; STT-MRAM | Cache memory; Magnetic recording; MRAM devices; System-on-chip; Dead block; Energy-consumption; Magnetic random access memory; Magnetic tunneling; Narrow width; Narrow-width value; On-chip cache; Random access memory; Resistance; Spin transfer torque; Spin-transfer torque magnetic random access memory; Energy utilization | English | 2022 | 2022 | 10.1109/access.2022.3158493 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | Program Synthesis Through Learning the Input-Output Behavior of Commands | Program synthesis writes programs on behalf of humans, increasing software development productivity. Existing systems select a proper sequence of commands by assembling them in various ways and analyzing their meanings, which is accurate and fast when a detailed specification is given for each available command, including the syntax and semantics. However, preparing this specification is burdensome and must be repeated to add or modify available commands. We propose a synthesis system that requires moderate groundwork to achieve sufficient accuracy and speed. The proposed system receives the syntax of the available commands and learns their meanings independently by writing programs and observing their input-output behavior. Using the learned knowledge, the system selects a likely sequence of commands and gradually revises them to converge to a target program. We validated the system by synthesizing 1,000 integer-manipulation programs out of 245,410 possible programs. The system synthesized most of the programs within 1,000 revisions, which is 80% faster than the state-of-the-art system based on machine-learned input-output patterns. In addition, greater than 10% of the programs were synthesized within several revisions. We believe that the proposed system provides a basis for synthesis systems based on learning input-output behavior. | Lee, Sihyung; Nam, Seung Yeob; Kim, Jiyeon | Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea; Yeungnam Univ, Dept Informat & Commun Engn, Gyongsan 38541, South Korea; Daegu Univ, Dept Comp Engn, Gyongsan 38453, South Korea | Nam, Seung/Q-7486-2019 | 15623380100; 7402276352; 57762184600 | sihyunglee@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 0.09 | 2025-06-25 | 1 | 1 | Syntactics; Codes; Semantics; Behavioral sciences; Training data; Machine learning; Licenses; Input-output behavior; machine learning; neural networks; program synthesis; supervised learning | Input-output behavior; machine learning; neural networks; program synthesis; supervised learning | Behavioral research; Codes (symbols); Integer programming; Learning systems; Machine learning; Network coding; Neural networks; Semantic Segmentation; Software design; Specifications; Syntactics; Behavioral science; Code; Input/output behaviors; License; Machine-learning; Neural-networks; Program synthesis; Synthesised; Training data; Semantics | English | 2022 | 2022 | 10.1109/access.2022.3183091 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | Recycling of cotton clothing into activated carbon fibers | This study investigates the preparation of activated carbon fiber derived from waste cotton fabric for economical and eco-friendly recycling as well as its application to water purification. The activated carbon fiber was prepared by physical activation using steam and the adsorption property was then evaluated using methylene blue. When the activation temperature increased, the specific surface area and mesopore volume of the activated carbon fiber increased up to 2562 m(2)/g and 0.214 cm(3)/g, resulting in the increased adsorption of methylene blue. The results of the adsorption experiment for the activated carbon fiber were analyzed using the Langmuir and Freundlich equations. The Langmuir equation was more suitable than the Freundlich equation to explain the adsorption equilibrium. The maximum adsorption amount of methylene blue was 161.1-731.5 mg/g for fiber samples activated at temperatures ranging from 750 to 950 degrees C with sample labeled 750SA to 900SA according to the Langmuir equation. The kinetics of methylene blue adsorption by the activated carbon fiber were analyzed using non-linear pseudo-first-order and pseudo-second-order. Sample 750SA was suitable for the pseudo-first-order and 800SA, 850SA, and 900SA sample were suitable for the pseudo-second-order. Therefore, waste cotton fabric has the potential to be the precursor for activated carbon fiber with excellent adsorption properties. | Kim, Jiyun; Kwon, Woong; Bai, Byong Chol; Jeong, Euigyung | Kyungpook Natl Univ, Dept Text Syst Engn, Daegu 41566, South Korea; Daejin Univ, Div Energy Engn, Pochon 1007, South Korea | 57865580600; 57208867074; 59027518800; 35885596300 | baibc0820@daejin.ac.kr;wolfpack@knu.ac.kr; | CARBON LETTERS | CARBON LETT | 1976-4251 | 2233-4998 | 32 | 5 | SCIE | CHEMISTRY, MULTIDISCIPLINARY;MATERIALS SCIENCE, MULTIDISCIPLINARY | 2022 | 4.5 | 36.2 | 0.79 | 2025-06-25 | 9 | 10 | Cotton textile waste; Activated carbon fiber; Methylene blue; Adsorption; Isotherms; Kinetics | METHYLENE-BLUE; STEAM ACTIVATION; ADSORPTION; POROSITY; WASTE; SPECTROSCOPY; TEMPERATURE; KINETICS; REMOVAL | Activated carbon fiber; Adsorption; Cotton textile waste; Isotherms; Kinetics; Methylene blue | Activated carbon; Adsorption isotherms; Aromatic compounds; Carbon fibers; Chemical activation; Cotton; Cotton fabrics; Dyes; Water recycling; Activated carbon fibres; Adsorption properties; Cotton textile waste; Cotton textiles; Eco-friendly; Langmuir equation; Methylene Blue; Pseudo second order; Pseudo-first-order; Waste cotton fabrics; Adsorption | English | 2022 | 2022-08 | 10.1007/s42823-022-00366-2 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||
| ○ | ○ | Article | Reinforcement Learning-Based Power Control for MACA-Based Underwater MAC Protocol | A major amount of the energy of battery-powered sensors is spent during packet transmissions. This issue has led to the development of power-control-based multiple-access collision avoidance (MACA) protocols that can reduce the packet transmission power and conserve energy. However, the reduction in transmission power renders the packets susceptible to collisions. To reduce these collisions while maintaining high energy efficiency, we propose a power control protocol that utilizes reinforcement learning to choose the optimal transmission power. The total reward is determined by the occurrence of a collision, amount of transmission power used, frequency of DATA packet retransmissions, and update of the interference range. A key feature of the proposed protocol is that it enables sensors to prevent collisions without any prior knowledge of interferences, thus eliminating the need for additional signaling. Simulation results under varying average traffic loads indicate that the proposed protocol can improve network throughput by up to 20% compared to benchmark protocols, while minimizing network energy consumption with a similar gain and reducing collisions per packet by more than 35%. These results demonstrate that the proposed protocol is effective. | Ahmed, Faisal; Cho, Junho; Shitiri, Ethungshan; Cho, Ho-Shin | Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu 41566, South Korea; Korea Res Inst Def Technol Planning & Adv KRIT, Jinju Si 52851, South Korea | Ahmed, Faisal/MEO-3219-2025; Shitiri, Ph.D., Ethungshan/Z-5918-2019 | 57225696280; 55902333100; 57190818428; 35316924900 | hscho@ee.knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 0.26 | 2025-06-25 | 1 | 3 | Media Access Protocol; Sensors; Protocols; Interference; Power control; Receivers; Wireless sensor networks; Collisions; interference; medium access control; power control; Q-learning; underwater acoustic sensor networks | MEDIUM ACCESS-CONTROL; COLLISION-AVOIDANCE; NETWORKS; CAPACITY | Collisions; interference; medium access control; power control; Q-learning; underwater acoustic sensor networks | Collision avoidance; Energy efficiency; Energy utilization; Internet protocols; Power control; Power management (telecommunication); Reinforcement learning; Underwater acoustic communication; Underwater acoustics; Wave interference; Wireless sensor networks; Collision; Interference; Media access protocols; Power-control; Q-learning; Receiver; Transmission power; Underwater acoustic sensor networks; Medium access control | English | 2022 | 2022 | 10.1109/access.2022.3188705 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Resource Analysis of Blockchain Consensus Algorithms in Hyperledger Fabric | In the blockchain network, the consensus algorithm is used to tolerate node faults with data consistency and integrity, so it is vital in all blockchain services. Previous studies on the consensus algorithm have the following limitations: 1) no resource consumption analysis was done, 2) performance analysis was not comprehensive in terms of blockchain parameters (e.g., number of orderer nodes, number of fault nodes, batch size, payload size), and 3) practical fault scenarios were not evaluated. In other words, the resource provisioning of consensus algorithms in clouds has not been addressed adequately. As many blockchain services are deployed in the form of blockchain-as-a-service (BaaS), how to provision consensus algorithms becomes a key question to be answered. This study presents a kernel-level analysis for the resource consumption and comprehensive performance evaluations of three major consensus algorithms (i.e., Kafka, Raft, and PBFT). Our experiments reveal that resource consumption differs up to seven times, which demonstrates the importance of proper resource provisioning for BaaS. | Yang, Gyeongsik; Lee, Kwanhoon; Lee, Kyungwoon; Yoo, Yeonho; Lee, Hyowon; Yoo, Chuck | Korea Univ, Dept Comp Sci & Engn, Seoul 02841, South Korea; Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea | Lee, Kyungwoon/AGE-8826-2022; Yang, Gyeongsik/X-2843-2019; Yoo, Yeonho/LDF-2098-2024 | 57190761123; 57219799488; 57190025432; 57221232573; 57215325260; 7201746401 | chuckyoo@os.korea.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 3.44 | 2025-06-25 | 25 | 40 | Peer-to-peer computing; Consensus algorithm; Fabrics; Distributed ledger; Blockchains; Proposals; Throughput; Blockchain; blockchain-as-a-service; cloud; consensus algorithm; hyperledger fabric; performance analysis; Kafka; Raft; PBFT; Microsoft Azure; AWS | PERFORMANCE | AWS; Blockchain; blockchain-as-a-service; cloud; consensus algorithm; hyperledger fabric; Kafka; Microsoft Azure; PBFT; performance analysis; Raft | Blockchain; Distributed computer systems; Windows operating system; AWS; Block-chain; Blockchain-as-a-service; Consensus algorithms; Hyperledg fabric; Kafkum; MicroSoft; Microsoft azure; PBFT; Peer-to-peer computing; Performances analysis; Proposal; Raft; Distributed ledger | English | 2022 | 2022 | 10.1109/access.2022.3190979 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Row-Wise Product-Based Sparse Matrix Multiplication Hardware Accelerator With Optimal Load Balancing | Matrix multiplication is a main computation kernel of emerging workloads, such as deep neural networks and graph analytics. These workloads often exhibit high sparsity in data, which means a large portion of the elements in the data are zero-valued elements. Though systolic arrays have shown a significant performance and energy efficiency improvement over central processing units (CPUs) or graphic processing units (GPUs) when executing matrix multiplications, data sparsity is largely overlooked in the conventional systolic arrays. In this paper, we propose a row-wise product-based sparse matrix multiplication (SpMM) hardware accelerator for compressed sparse row (CSR)-formatted input matrices. Our hardware accelerator leverages row-wise product, which has advantages over inner-product or outer-product when executing the sparse matrix multiplications. As compared to the conventional systolic arrays, which cannot skip the ineffectual operations, our hardware accelerator only performs effectual operations with non-zero elements, improving the performance when executing SpMM. In addition, we also propose an optimal load balancing scheme when using multiple processing elements (PEs). Our load balancing scheme utilizes an operation count-based matrix tiling for parallel execution of the PEs and resource contention avoidance. According to our evaluation, our 32PE-SpMM accelerator shows 13.6x -47.9x speedup over tensor processing unit (TPU)-like systolic arrays, on average. Furthermore, our operation count-based load balancing scheme shows better performance over the fixed tiling and non-zero element count-based tiling by up to 8.48% and 6.28%, respectively, with only up to 0.06% matrix tiling pre-processing latency overhead. | Lee, Jong Hun; Park, Beomjin; Kong, Joonho; Munir, Arslan | LX Semicon, Seoul 06763, South Korea; Samsung Elect, Hwaseong 18448, South Korea; Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu 41566, South Korea; Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea; Kansas State Univ, Dept Comp Sci, Manhattan, KS 66506 USA | 57226655958; 57761876100; 25927220400; 24587067400 | joonho.kong@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 0.26 | 2025-06-25 | 2 | 3 | Sparse matrix multiplication; row-wise product; load balancing; matrix tiling; speedup | load balancing; matrix tiling; row-wise product; Sparse matrix multiplication; speedup | Acceleration; Deep neural networks; Energy efficiency; Graphics processing unit; Matrix algebra; Program processors; Systolic arrays; Hardware acceleration; Index; Load management; Load-Balancing; matrix; MAtrix multiplication; Matrix tiling; Memory-management; Row-wise product; Sparse matrices; Sparse matrix multiplication; Speedup; Systems-on-Chip; System-on-chip | English | 2022 | 2022 | 10.1109/access.2022.3184116 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||||
| ○ | ○ | Article | SALS-TMIS: Secure, Anonymous, and Lightweight Privacy-Preserving Scheme for IoMT-Enabled TMIS Environments | With the Telecare Medical Information System (TMIS), patients and doctors can access various healthcare services through wireless communication technology without visiting the hospital in person. However, TMIS must have the necessary security requirements, including authentication and anonymity because information of legitimate patient is transmitted via an open channel. Therefore, secure privacy-preserving schemes are essential to ensure reliable healthcare services for legitimate patient in TMIS. Recently, the existing schemes proposed a secure healthcare authentication protocol with attack-resilience and anonymous key agreement in TMIS environments. However, we demonstrate that their scheme cannot prevent impersonation, session key disclosure, and man-in-the-middle attacks and cannot ensure secure mutual authentication. To improve the security flaws of the existing schemes, we design a secure, anonymous, and lightweight privacy-preserving scheme in internet of medical things (IoMT)-enabled TMIS environments, called SALS-TMIS. Our scheme withstands potential security threats and ensures the essential security functionalities. We evaluate the security of the SALS-TMIS using informal and formal security analyses, including ROR oracle model and AVISPA implementation. We then compare the computation and communication costs of SALS-TMIS with existing schemes. SALS-TMIS provides superior security and efficiency than related schemes for IoMT-enabled TMIS. | Yu, Sungjin; Park, Kisung | Elect & Telecommun Res Inst, Daejeon 34129, South Korea; Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu 41566, South Korea | Park, Kisung/KIG-3849-2024 | 57203974524; 57194833768 | ks.park@etri.re.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 1.41 | 2025-06-25 | 12 | 17 | Security; Medical services; Sensors; Authentication; Servers; Sensor phenomena and characterization; Scalability; Telecare medical information systems; Internet of Medical Things; healthcare; privacy-preserving; key agreement | ELLIPTIC CURVE CRYPTOGRAPHY; AUTHENTICATED KEY EXCHANGE; USER AUTHENTICATION; PROTOCOL; HEALTH; AGREEMENT; NETWORKS; INTERNET | healthcare; Internet of Medical Things; key agreement; privacy-preserving; Telecare medical information systems | Authentication; Health care; Information use; Medical computing; Network security; Privacy-preserving techniques; Security systems; Healthcare services; Internet of medical thing; Key agreement; Medical services; Privacy preserving; Security; Sensor phenomenon and characterizations; System environment; Telecare; Telecare medical information system; Medical information systems | English | 2022 | 2022 | 10.1109/access.2022.3181182 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Secure ECC-Based Three-Factor Mutual Authentication Protocol for Telecare Medical Information System | In the recent COVID-19 situation, Telecare Medical Information System (TMIS) is attracting attention. TMIS is one of the technologies used in Wireless Body Area Network (WBAN) and can provide patients with a variety of remote healthcare services. In TMIS environments, sensitive data of patients are communicated via an open channel. An adversary may attempt various security attacks including impersonation, replay, and forgery attacks. Therefore, numberous authentication schemes have been suggested to provide secure communication for TMIS. Sahoo et al. proposed a mutual authentication scheme based on biometrics and Elliptic Curve Cryptography (ECC) in 2020. However, we find out that Sahoo et al.'s scheme cannot resist insider and privileged insider attacks and cannot guarantee patient anonymity. In this paper, we propose a secure ECC-based three-factor mutual authentication protocol that guarantees the privacy of patients for TMIS. We conduct informal security analysis to prove that our protocol is secure from various security attacks. In addition, we perform formal security analyses using the Automated Validation of Internet Security Protocols and Applications (AVISPA), Burrows-Abadi-Needham (BAN) logic, and the Real-Or-Random (ROR) model. Furthermore, we assess our protocol's performance and compare it to other protocols. As a result, our protocol has lower communication costs, and better security features compared to related existing protocols. Therefore, our protocol is more appropriate for TMIS environments than other related protocols. | Ryu, Jongseok; Oh, Jihyeon; Kwon, Deokkyu; Son, Seunghwan; Lee, Joonyoung; Park, Yohan; Park, Youngho | Kyungpook Natl Univ, Sch Elect & Elect Engn, Daegu 41566, South Korea; Keimyung Univ, Sch Comp Engn, Daegu 42601, South Korea; Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea | ; Lee, JoonYoung/AAM-9838-2021 | 57431417300; 57222066296; 57221739597; 57221744477; 57203970123; 55660095600; 56962990300 | yhpark@kmu.ac.kr;parkyh@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 7.86 | 2025-06-25 | 62 | 89 | Protocols; Security; Authentication; Passwords; Servers; Elliptic curves; Elliptic curve cryptography; Telecare medical information system; authentication; elliptic curve cryptography; biohashing; BAN logic; ROR; AVISPA | KEY AGREEMENT SCHEME; USER AUTHENTICATION; LIGHTWEIGHT; EXCHANGE; DESIGN | authentication; AVISPA; BAN logic; biohashing; elliptic curve cryptography; ROR; Telecare medical information system | Bioinformatics; Computer circuits; Geometry; Information use; Medical information systems; Network security; Public key cryptography; Security systems; Wireless local area networks (WLAN); Automated validation of internet security protocol and application; BioHashing; Elliptic curve; Internet security; Real-or-random; Security; Security application; Security protocols; Telecare; Telecare medical information system; Authentication | English | 2022 | 2022 | 10.1109/access.2022.3145959 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Small Traffic Sign Detection in Big Images: Searching Needle in a Hay | Traffic sign detection is an essential module of self-driving cars and driver assistance system. The major challenge being, traffic sign appear relatively smaller in road view images. It covers only 1%-2% of the total image area. Hence, its challenging to detect very small traffic sign in a larger image covering huge background of similar shape objects. Thus, we propose YOLOv3 network layers pruning and patch wise training strategy for small sized traffic sign detection. This aids in improving recall percentage and mean Average Precision. We also propose anchor box selection algorithm that uses bounding box dimension density to obtain optimal anchor set for the dataset. This reduces false positives and log-average miss rate. The proposed approach is evaluated on German traffic sign detection benchmark and Swedish traffic sign dataset and proves that it achieved a good balance between mAP and inference time. | Rehman, Yawar; Amanullah, Hafsa; Shirazi, Muhammad Ayaz; Kim, Min Young | NED Univ Engn & Technol, Dept Elect Engn, Karachi 75270, Sindh, Pakistan; Habib Univ, Dhanani Sch Sci & Engn, Karachi 75290, Sindh, Pakistan; Kyungpook Natl Univ, IT Coll, Sch Elect Engn, Daegu 41566, South Korea; NED Univ Engn & Technol, Natl Ctr Robot & Automat, Hapt Human Robot & Condit Monitoring Lab, Karachi 75270, Sindh, Pakistan; Kyungpook Natl Univ, IT Coll, Res Ctr Neurosurg Robot Syst, Daegu 41566, South Korea | Rehman, Yawar/ACL-3068-2022; Amanullah, Hafsa/JDM-7270-2023 | 57190007475; 57365682900; 55935434300; 56739349100 | minykim@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 1.2 | 2025-06-25 | 9 | 14 | Detectors; Feature extraction; Roads; Convolutional neural networks; Proposals; Benchmark testing; Reliability; Anchor box algorithm; network pruning; small object detection; YOLOv3 | Anchor box algorithm; network pruning; small object detection; YOLOv3 | Automobile drivers; Network layers; Neural networks; Object detection; Search engines; Traffic signs; Benchmark testing; Convolutional neural network; Driver-assistance systems; Features extraction; Image searching; Network pruning; Proposal; Small object detection; Traffic sign detection; YOLOv3; Feature extraction | English | 2022 | 2022 | 10.1109/access.2022.3150882 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | State-Feedback-Critical Super Twisting Sliding Mode Control for a Half-Car Suspension System | A good suspension system is of paramount importance to the operating performance of a vehicle and, consequently, to the safety and driving comfort of the passengers. Nevertheless, suspension systems are commonly susceptible to nonlinearity, parameter uncertainty, and exogenous perturbation, which can easily impair their effectiveness. This study first employs a full state feedback super twisting control (FS-STC) to stabilize both vertical displacement and pitch angle of a half-car suspension system in the presence of disturbances. FS-STC inherits the robust property of sliding mode control (SMC) while effectively attenuating the chattering phenomenon as one of its attractive features. However, FS-STC strictly requires both direct displacement and velocity state feedback, which implies additional sensors have to be installed, thus increasing the complexity of the physical structure and being prone to measurement noises. Therefore, a higher order sliding mode observer (HOSMO) based STC (HOSMO-STC) and an unscented Kalman filter (UKF) based STC (UKF-STC) are subsequently proposed to tackle this state availability problem. HOSMO estimates velocity states, thus reducing the dependence on state feedback for STC design. Meanwhile, UKF implementation takes further actions by utilizing more common and easily accessible relative displacements such as suspension strokes to estimate all concerned system states. Comparative simulation results demonstrate that UKF-STC offers better performance in terms of both convergence accuracy and chattering alleviation compared to FS-STC and HOSMO-STC while requiring the least information of state feedback. | Nguyen, Duc Giap; Ji, Kyoungtae; Nguyen, Tam W.; Han, Kyoungseok | Kyungpook Natl Univ, Sch Mech Engn, Daegu 41566, South Korea; Univ Toyama, Dept Elect & Elect Engn, Toyama 9308555, Japan | 57221496576; 57222725974; 57191616168; 56465294700 | kyoungsh@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 0.09 | 2025-06-25 | 0 | 1 | Suspensions (mechanical systems); Mathematical models; Kalman filters; Observers; Vehicle dynamics; State feedback; Safety; Half-car suspension; higher-order sliding mode observer; super twisting control; state-feedback critical; unscented Kalman filter | UNSCENTED KALMAN FILTER; TRACKING CONTROL; DIFFERENTIATION | Half-car suspension; higher-order sliding mode observer; state-feedback critical; super twisting control; unscented Kalman filter | Automobile suspensions; Bandpass filters; Estimation; Kalman filters; Magnetic levitation vehicles; Sliding mode control; Full state feedback; Half-car suspension; High order sliding mode observers; Mechanical systems; Observer; State-feedback critical; Super twisting controls; Suspension (mechanical system); Unscented Kalman Filter; Vehicle's dynamics; State feedback | English | 2022 | 2022 | 10.1109/access.2022.3210123 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | Trajectory Generation of a Quadrotor Transporting a Bulky Payload in the Cluttered Environments | When an aerial robot carries a bulky and heavy payload, it suffers from a wavering effect because of the large inertia of the heavy mass of a payload, which can cause a serious crash or fall to the ground. We propose the path-planning algorithm for an aerial robot to pass a narrow space while transporting a bulky payload to resolve the issue. Unlike the existing conventional path-planning method that treats the payload as a point-mass, this paper generates the trajectory considering the shape of a payload and passage size of an Unmanned Aerial Vehicle (UAV). First, we design a map-generation algorithm with the Voronoi diagram by exploiting the fact that the UAV has an ellipsoidal shape in transport operation with a bulky object. The modified map data can be exploited for the global path generation such as A* path-planner. For the rotational motion of the UAV, the heading angle was determined by considering the lengths of the major and minor axes of the ellipse. The global path was optimized based on the elastic band optimization algorithm to solve the jerky motion on the trajectory. Through the simulations and experiments, we validate the efficiency of our algorithm in the environment with the narrow space. Experimental results showed that the proposed path-planning algorithm could be used for safe aerial transportation in realistic environments. | Lee, Seonil; Lee, Hyeonbeom | Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea | 57221045384; 55556473400 | hbeomlee@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 10 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2022 | 3.9 | 36.2 | 0.53 | 2025-06-25 | 7 | 6 | Payloads; Autonomous aerial vehicles; Trajectory; Shape; Planning; Drones; Three-dimensional displays; Trajectory optimization; collision-free path planning; constraints; multirotors | collision-free path planning; constraints; multirotors; Trajectory optimization | Aircraft accidents; Antennas; Drones; Motion planning; Robot programming; Three dimensional computer graphics; Three dimensional displays; Aerial robots; Collision-free path-planning; Constraint; Multirotors; Narrow spaces; Path-planning algorithm; Payload; Shape; Three-dimensional display; Trajectory optimization; Trajectories | English | 2022 | 2022 | 10.1109/access.2022.3160726 | 바로가기 | 바로가기 | 바로가기 | 바로가기 |
페이지 이동: