연구성과로 돌아가기
2020 연구성과 (121 / 270)
※ 컨트롤 + 클릭으로 열별 다중 정렬 가능합니다.
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 | Fast and Cycle-Accurate Simulation of RTL NoC Designs Using Test-Driven Cellular Automata | Speeding up the register-transfer level (RTL) simulation of network-on-chip (NoC) is essential for design optimization under various use scenarios and parameters. One of the promising approaches for RTL NoC speedup is high-level modeling. Conventional high-level modeling approaches lead to an accuracy problem or modeling efforts that are caused by the absence of modeling framework or requiring in-depth knowledge of specific behaviors of target NoCs. To support cycle-accurate and formal high-level modeling framework, we propose a cellular automata (CA) modeling framework for RTL NoC. The CA abstracts detailed RTL NoC dynamics into the proposed high-level state transitions, which support flit transmission among CA components through dynamically changing flit paths based on the target RTL routing and arbitration algorithms. To prevent the meaningless execution of stable CA, the CA are designed to be triggered by state-change events. The proposed simulation engine asynchronously invokes CA to update their states and perform actions of flit transmissions or flit-path changes based on the state-decision result. To reduce the modeling difficulty, we provide a test environment that generates the state-transition rules for CA after monitoring the relationships between high-level states and leading actions under randomly injected packets during target RTL NoC simulations. Experiments demonstrate cycle-level functional homogeneity between RTL and the abstracted CA NoC models and significant simulation speedup. | Seok, Moon Gi; Sarjoughian, Hessam S.; Choi, Changbeom; Park, Daejin | Nanyang Technol Univ, Singapore 639798, Singapore; Arizona State Univ, ACIMS, Tempe, AZ 85281 USA; Handong Global Univ, Sch Entrepreneurship & ICT, Gyeongsangbuk Do 37554, South Korea; Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea | 36683242700; 6701570994; 36700976500; 55463943600 | boltanut@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.16 | 2025-06-25 | 2 | 2 | Network on chip; cellular automata; RTL design; test-driven rule generation; event-based simulation | cellular automata; event-based simulation; Network on chip; RTL design; test-driven rule generation | Abstracting; Cellular automata; Servers; Arbitration algorithm; Cycle-accurate simulation; Event based simulation; Functional homogeneity; Register transfer level; RTL designs; Rule generation; State transition rule; Network-on-chip | English | 2020 | 2020 | 10.1109/access.2019.2962253 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||||
| ○ | ○ | Article | Feature Extraction Based on the Non-Negative Matrix Factorization of Convolutional Neural Networks for Monitoring Domestic Activity With Acoustic Signals | In this paper, a feature extraction method is proposed based on the non-negative matrix factorization (NMF) for classifiers for monitoring domestic activities with acoustic signals. Most of the classifiers of the acoustic signals use data-independent spectral features (e.g., log-Mel spectrum and Mel-frequency cepstral coefficients). Recently, some novel feature extraction methods have been researched, including convolution-NMF-based features combined with K-means clustering. This study proposes an enhanced NMF-based feature extraction method that is inspired by the NMF-based noise reduction algorithm. The proposed method independently estimates the frequency basis matrix for each class, and then cascades the basis matrices to form the entire frequency bases, where the acoustic signal is transformed to the proposed feature by estimating the temporal basis matrix with the trained frequency bases. In addition, this study proposes a data augmentation method for the proposed feature that is inspired by the "mix and shuffle" method for audio waveforms. In order to evaluate the proposed system, which consists of the proposed NMF-based feature and the convolutional-neural-network-based classifier, some evaluations were performed using the Detection and Classification of Acoustic Scenes and Events (DCASE) 2018 Task 5 - Monitoring of Domestic Activities Based on Multi-channel Acoustics - Database. The results showed that the proposed system has comparable performance to that of state-of-the-art algorithms and that it has enhanced the F1-score performance of 6%-12% in comparison with the conventional NMF-based feature extraction method that is based on convolutional NMF and K-means clustering. | Lee, Seokjin; Pang, Hee-Suk | Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea; Sejong Univ, Dept Elect Engn, Seoul 05006, South Korea | 36174416200; 35099284400 | hspang@sejong.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 1.4 | 2025-06-25 | 18 | 25 | Acoustic scene classification; convolutional neural networks; feature extraction; non-negative matrix factorization | SPEECH; COEFFICIENTS; SEPARATION | Acoustic scene classification; convolutional neural networks; feature extraction; non-negative matrix factorization | Acoustic waves; Classification (of information); Convolution; Convolutional neural networks; Extraction; Factorization; Feature extraction; K-means clustering; Data augmentation; Domestic activity; Feature extraction methods; Mel frequency cepstral co-efficient; Noise reduction algorithms; Nonnegative matrix factorization; Spectral feature; State-of-the-art algorithms; Matrix algebra | English | 2020 | 2020 | 10.1109/access.2020.3007199 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | Field Current Control Strategy for Wound-Rotor Synchronous Motors Considering Coupled Stator Flux Linkage | The direct axis (d-axis) stator winding and field winding of a wound-rotor synchronous motor (WRSM) are mutually coupled much like the primary and secondary windings in a transformer are. As the field winding has a large number of turns, small variations of the stator d-axis current can induce a great electromotive force (EMF) in the field windings. This induced EMF voltage disturbs field current regulation, invokes an unwanted field current response, and distorts the stator d-axis flux. In this work, a novel field current control strategy for the WRSM is proposed for compensating the disturbance by d-axis current in field winding. The coupling effect between the stator d-axis winding and field winding is analyzed by using a polynomial regression of the stator d-axis flux linkage. Based on an analysis of the coupling effect, the proposed strategy combines two control methods. First, feedforward control is applied to decouple the field current response from the coupled change in the stator d-axis current flux. Second, a method is used to adjust the d-axis current to ensure that the field inverter voltage is not saturated. Simulations and experiments are presented to verify the proposed control method, proving that the proposed field current control strategy successfully compensates for the field current ripples caused by variations in the coupled stator d-axis current flux. | Hwang, Daeyeon; Gu, Bon-Gwan | Kyungpook Natl Univ, Sch Energy Engn, Daegu 41566, South Korea | 59821035900; 50061273700 | bggu@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.58 | 2025-06-25 | 10 | 16 | Feedforward control; incremental inductance; magnetic saturation; wound-rotor synchronous motor | Feedforward control; incremental inductance; magnetic saturation; wound-rotor synchronous motor | Electric current control; Electric machine control; Electromotive force; Feedforward control; Polynomial regression; Stators; Synchronous motors; Transformer windings; Winding; Control methods; Coupling effect; Electromotive force (EMF); Field currents; Secondary windings; Small variations; Stator flux linkage; Stator winding; Rotors (windings) | English | 2020 | 2020 | 10.1109/access.2020.3001866 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||||
| ○ | ○ | Article | Fine-Tuned Residual Network-Based Features With Latent Variable Support Vector Machine-Based Optimal Scene Classification Model for Unmanned Aerial Vehicles | In recent days, unmanned aerial vehicles (UAVs) becomes more familiar because of its versatility, automation abilities, and low cost. Dynamic scene classification gained significant interest among the UAV-based surveillance systems, e.g., high-voltage power line and forest fire monitoring, which facilitate the object detection, tracking process and drastically enhances the outcome of visual surveillance. This paper proposes a new optimal deep learning-based scene classification model captured by UAVs. The proposed model involves a residual network-based features extraction (RNBFE) which extracts features from the diverse convolution layers of a deep residual network. In addition, the several parameters in RNBFE lead to many configuration errors due to manual parameter tuning. So, self-adaptive global best harmony search (SGHS) algorithm is employed for tuning the parameters of the RNBFE. The resultant feature vectors undergo classification by the use of latent variable support vector machine (LVSVM) model. The presented optimal RNBFE (ORNBFE) model has been tested using two open access datasets namely UC Merced (UCM) Land Use Dataset and WHU-RS Dataset. The presented technique attains maximum scene classification accuracy over the other recently proposed methods. | Rajagopal, Aghila; Ramachandran, A.; Shankar, K.; Khari, Manju; Jha, Sudan; Lee, Yongju; Joshi, Gyanendra Prasad | Sethu Inst Technol, Dept IT, Virudunagar 626115, India; Univ Coll Engn Panruti, Dept Comp Sci & Engn, Panruti 607106, India; Alagappa Univ, Dept Comp Applicat, Karaikkudi 630003, Tamil Nadu, India; Ambedkar Inst Technol, Comp Sci Dept, New Delhi 110092, India; Lovely Profess Univ, Sch Comp Sci & Engn, Phagwara 144411, India; Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea; Sejong Univ, Dept Comp Sci & Engn, Seoul 05006, South Korea | Khari, Manju/B-6040-2017; Joshi, Gyanendra Prasad/I-3767-2019; Kathiresan, Shankar/Y-9178-2018; Jha, Sudan/P-9823-2018 | 57218290061; 57196465917; 56884031900; 45060953400; 59307702300; 57207015176; 25927226900 | yongju@knu.ac.kr;joshi@sejong.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 1.73 | 2025-06-25 | 18 | 30 | CNN; Harmony Search; LVSVM; residual network-based features extraction; RNBFE; scene classification; unmanned aerial vehicles | CONVOLUTIONAL NEURAL-NETWORKS | CNN; Harmony Search; LVSVM; residual network-based features extraction; RNBFE; scene classification; unmanned aerial vehicles | Aircraft detection; Antennas; Deep learning; Deforestation; Land use; Object detection; Object tracking; Support vector machines; Configuration errors; Features extraction; Forest fire monitoring; High-voltage power line; Scene classification; Surveillance systems; Tracking process; Visual surveillance; Unmanned aerial vehicles (UAV) | English | 2020 | 2020 | 10.1109/access.2020.3004233 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Green Fog Planning for Optimal Internet-of-Thing Task Scheduling | The incoming 5G technology is expected to proliferate tremendous internet-of-thing (IoT) services with real-time and mobility requirements, which are quite different from the legacy cloud services. Due to the centralized management relying on distant datacenters, cloud computing is short of satisfying the stringent IoT requirements, such as ultra-low latency, mobility, etc. Instead, distributed edge computing, such as fog computing has been coined as a promising approach and has received enormous attention in recent years. In this paper, to optimally provision the huge volume of IoT services with significant diversity, we propose to efficiently organize the leisure network devices in the network edge to form fog networks (fogs), which are then integrated with the cloud to provide storage and computing resources. Specifically, we propose two Integer Linear Programming (ILP) models to solve the fog planning issue under the integrated Cloud-Fog (iCloudFog) framework. In the first ILP model, the objective is to minimize the CAPEX cost caused by planning fogs and the OPEX cost caused by utilizing the planned fogs. In the second ILP model, the objective is to minimize the power consumption while maximizing the number of successfully provisioned IoT tasks on the planned fogs. The proposed ILP models are numerically evaluated by considering different IoT task requirements, such as real-time and mobility. The numerical results show that efficiently planned fogs can help to reduce the planning overhead while satisfying diverse IoT task requirements. | He, Zhiming; Zhang, Yin; Tak, Byungchul; Peng, Limei | Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea; Zhongnan Univ Econ & Law, Sch Informat & Safety Engn, Wuhan, Peoples R China | ; Zhang, Yin/O-2149-2015 | 57212659172; 56298640900; 6506911621; 7201574271 | auroraplm@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 1.32 | 2025-06-25 | 16 | 21 | Fog computing; cloud computing; IoT; network planning; energy efficiency | EDGE; MANAGEMENT; SECURITY; SERVICE | cloud computing; energy efficiency; Fog computing; IoT; network planning | 5G mobile communication systems; Cloud computing; Energy efficiency; Fog; Fog computing; Green computing; Integer programming; Centralized management; Computing resource; Integer linear programming models; Internet of Things (IOT); Network devices; Network planning; Numerical results; Task-scheduling; Internet of things | English | 2020 | 2020 | 10.1109/access.2019.2961952 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Group Processing of Multiple k-Farthest Neighbor Queries in Road Networks | Advances in mobile technologies and map-based applications enables users to utilize sophisticated spatial queries, including k-nearest neighbor and shortest path queries. Often, location-based servers are used to handle multiple simultaneous queries because of the popularity of map-based applications. This study focuses on the efficient processing of multiple concurrent k-farthest neighbor (kFN) queries in road networks. For a positive integer k, query point q, and set of data points P, a kFN query returns k data points farthest from the query point q. For addressing multiple concurrent spatial queries, traditional location-based servers based on one-query-at-a-time processing are unsuitable owing to high redundant computation costs. Therefore, we propose a group processing of multiple kFN (GMP) algorithm to process multiple kFN queries in road networks. The proposed GMP algorithm uses group computation to avoid the redundant computation of network distances between the query and data points. The experiments using real-world roadmaps demonstrate the proposed solution's effectiveness and efficiency. | Cho, Hyung-Ju; Attique, Muhammad | Kyungpook Natl Univ, Dept Software, Sangju 37224, South Korea; Sejong Univ, Dept Software, Seoul 05006, South Korea | 55177091600; 55755354900 | hyungju@knu.ac.kr;attique@sejong.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.41 | 2025-06-25 | 5 | 6 | Spatial databases; group processing; multiple k-farthest neighbor query; road network | EFFICIENT SHARED EXECUTION; REVERSE FURTHEST NEIGHBORS; SHORTEST-PATH QUERIES; NEAREST; JOINS | group processing; multiple k-farthest neighbor query; road network; Spatial databases | Roads and streets; Effectiveness and efficiencies; Group processing; Mobile Technology; Nearest neighbors; Network distance; Positive integers; Redundant computation; Shortest path queries; Query processing | English | 2020 | 2020 | 10.1109/access.2020.3002263 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | Hole-Filling of RealSense Depth Images Using a Color Edge Map | The RealSense camera frequently includes hole regions-unfilled regions where depth information are missing in the depth image. The holes cause serious problems in applications that use depth sensors and often straddle the background and object simultaneously. Accordingly, a hole must be filled by considering the boundary of the object. Fortunately, the object boundary inside the hole can be estimated by the RealSense color image. This paper proposes a hole-filling method in which filling converges to the object boundary from both border pixels. However, the color edge elements of the object boundary are often missing. Because the missing edge highly influences the hole-filling procedure, the boundary of the object close to the camera should be filled as completely as possible. Consequently, we introduce a simple method of filling the gap between two edge endpoints. Furthermore, we can address the situation in which there are one or more edge pixels between two border pixels. We repeatedly change the filling direction by alternating between the horizontal and vertical directions until no hole remains. Our experiment reveals that the proposed method outperforms other filling methods when numerically comparing the hole-filled depth image with the ground truth image for four methods: root-mean-square error (RMSE), peak signal-to-noise ratio (PSNR), structural similarity index map (SSIM), and correlation coefficient (CC). The proposed method also produces a superior visual when we observe the 3D stereo image pair constructed using an original color image and a left-view color image generated with depth-image-based rendering (DIBR). | Cho, Ji-Min; Park, Soon-Yong; Chien, Sung-Il | Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea | Park, Soon-Yong/HGV-2374-2022 | 57215294434; 7501834063; 7201952405 | sypark@knu.ac.kr;sichien@ee.knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.91 | 2025-06-25 | 10 | 13 | Hole-filling method; inpainting; Intel RealSense camera D435; depth image; multiview generation | LOCALIZATION; QUALITY | depth image; Hole-filling method; inpainting; Intel RealSense camera D435; multiview generation | Cameras; Color; Filling; Image segmentation; Image understanding; Maps; Mean square error; Pixels; Signal to noise ratio; Three dimensional computer graphics; Depth image; Hole filling; Inpainting; Intel RealSense camera D435; Multi-views; Stereo image processing | English | 2020 | 2020 | 10.1109/access.2020.2981378 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Editorial Material | IEEE Access Special Section Editorial: Artificial Intelligence and Cognitive Computing for Communication and Network | Zhang, Yin; Fortino, Giancarlo; Peng, Limei; Humar, Iztok; Sun, Jianshan | Univ Elect Sci & Technol China, Sch Informat & Commun Engn, Chengdu 611731, Sichuan, Peoples R China; Univ Calabria, Dept Informat Modeling Elect & Syst, I-89135 Calabria, Italy; Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea; Univ Ljubljana, Fac Elect Engn, Ljubljana 1000, Slovenia; Hefei Univ Technol, Sch Management, Hefei 230009, Anhui, Peoples R China | Fortino, Giancarlo/J-2950-2017; Zhang, Yin/O-2149-2015 | 56298640900; 6602895297; 7201574271; 6603264573; 55634319700 | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 1.29 | 2025-06-25 | 1 | 1 | English | 2020 | 2020 | 10.1109/access.2020.3014475 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||||||||
| ○ | ○ | Article | iGG-MBS: Iterative Guided-Gaussian Multi-Baseline Stereo Matching | This paper presents an improved dense disparity estimating technique for a collection of multi-baseline stereo (referred to as MBS in the text) images. The flow of the proposed system consists of two main frameworks: a preliminary cost calculation and initial disparity estimating framework, and an iterative cost refinement framework. The first framework implements an accurate multi-baseline stereo cost (referred to as MBSC in the text) calculation method, and a scan line optimization inspired by the Semi Global Matching (SGM) algorithm. Cost volumes of each two-view camera pair are calculated by fusing two pixel dissimilarity measures: i) weighted Census transformation and ii) sum of absolute difference color consistency term (SAD-Census). The initial disparity map between reference and the matching view with the largest baseline displacement is calculated by summing-and-interpolating SAD-Census costs of the current and all neighboring camera pairs in-between, and taking the minimum after aggregating for sixteen directions. The second framework refines the aggregated MBSC volume recursively. In each iteration, individual pair-wise disparity maps are used to warp matching views towards the reference to create binary masks that resemble overlapping differences. White locations in the mask represent incorrect correspondence matches, thus a penalty is added for costs associated with, adapting a Gaussian modulating function. This significantly reduces the selection probability of incorrect disparity minima in proceeding iterations. A Guided filter-based Rolling Guidance filter is applied to further up-vote the probability of pixels with the lowest costs, which are similar or close enough to ground truth readings. Through experimental results evaluated on the Middlebury dataset, we show that our method leads to effective and efficient multi-baseline disparity estimations. | Rathnayaka, Pathum; Park, Soon-Yong | Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea; Kyungpook Natl Univ, Coll IT Engn, Sch Elect Engn, Daegu 41566, South Korea | Park, Soon-Yong/HGV-2374-2022 | 56523226300; 7501834063 | sypark@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.25 | 2025-06-25 | 5 | 6 | Cameras; Three-dimensional displays; Estimation; Image reconstruction; Image color analysis; Government; Real-time systems; Stereo vision; multi-baseline; stereo matching; iterative; refinement; disparity mapping | DENSE; ACCURATE | disparity mapping; iterative; multi-baseline; refinement; stereo matching; Stereo vision | Cameras; Image coding; Image enhancement; Iterative methods; Pixels; Surveys; Disparity estimations; Dissimilarity measures; Middlebury dataset; Modulating functions; Multi-baseline stereo; Selection probabilities; Semi-global matching; Sum of absolute differences; Stereo image processing | English | 2020 | 2020 | 10.1109/access.2020.2997073 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Immediate Presence of Handwritten Annotation on Moving Picture in Real-Time Collaborative System | Collaborative annotation system allows a remote user to add handwritten annotation directly on local user's view. However, previous systems cannot present handwritten annotation in real-time until all annotations have been drawn. This paper proposes a technique for collaborative annotation system that enables the immediate presence of handwritten annotation on moving picture during collaboration. This technique extracts coordinates data from handwritten annotation and reorganizes theses data in the order of strokes. Then it transmits these data to local user side in sequence. The local side receives the annotation data and presents the world-stabilized handwritten annotation in the environment. Two major optimizations are carried out in this study. One is the handwritten annotations can accurately and immediately be presented on the local side. The other is the data usage in collaboration is reduced. This research facilitates the communication between geographically dispersed users to achieve efficient collaboration. The proposed system can be applied in various fields. | Cao, Dongxing; Kim, Sangwook | Kyungpook Natl Univ, Sch Comp Sci & Engn, Daegu 41566, South Korea | 57218489240; 57169169400 | kimsw@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.16 | 2025-06-25 | 1 | 2 | Collaboration; Real-time systems; Cameras; Streaming media; Licenses; Augmented reality; Three-dimensional displays; Handwritten annotation; immediate presence; remote collaboration | REMOTE COLLABORATION | Handwritten annotation; immediate presence; remote collaboration | Real time systems; Annotation systems; Data usage; Moving pictures; Real time; Real-time collaborative; Remote users; Character recognition | English | 2020 | 2020 | 10.1109/access.2020.3010639 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | ○ | Article | Intrusion Detection Protocols in Wireless Sensor Networks Integrated to Internet of Things Deployment: Survey and Future Challenges | As we all know that the technology is projected to be next to humans very soon because of its holistic growth. Now-a-days, we see a lot of applications that are making our lives comfortable such as smart cars, smart homes, smart traffic management, smart offices, smart medical consultation, smart cities, etc. All such facilities are in the reach of a common man because of the advancement in Information and Communications Technology (ICT). Because of this advancement, new computing and communication environment such as Internet of Things (IoT) came into picture. Lot of research work is in progress in IoT domain which helps for the overall development of the society and makes the lives easy and comfortable. But in the resource constrained environment of Wireless Sensor Network (WSN) and IoT, it is almost inconceivable to establish a fully secure system. As we are moving forward very fast, technology is becoming more and more vulnerable to the security threats. In future, the number of Internet connected people will be less than the smart objects so we need to prepare a robust system for keeping the above mentioned environments safe and standardized it for the smooth conduction of communication among IoT objects. In this survey paper, we provide the details of threat model applicable for the security of WSN and IoT based communications. We also discuss the security requirements and various attacks possible in WSN and IoT based communication environments. The emerging projects of WSNs integrated to IoT are also briefed. We then provide the details of different architectures of WSN and IoT based communication environments. Next, we discuss the current issues and challenges related to WSN and IoT. We also provide a critical literature survey of recent intrusion detection protocols for IoT and WSN environments along with their comparative analysis. A taxonomy of security and privacy-preservation protocols in WSN and IoT is also highlighted. Finally, we discuss some research challenges which need to be addressed in the coming future. | Pundir, Sumit; Wazid, Mohammad; Singh, Devesh Pratap; Das, Ashok Kumar; Rodrigues, Joel J. P. C.; Park, Youngho | Graph Era Deemed Be Univ, Dept Comp Sci & Engn, Dehra Dun 248002, Uttarakhand, India; Int Inst Informat Technol, Ctr Secur Theory & Algorithm Res, Hyderabad 500032, India; Fed Univ Piaui UFPI, PPGEE, BR-64049550 Teresina, Brazil; Inst Telecomunicacoes, P-1049001 Lisbon, Portugal; Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea | wazid, mohammad/X-4211-2018; Singh, Devesh/KIC-3651-2024; Rodrigues, Joel/A-8103-2013; WAZID, MOHAMMAD/X-4211-2018; Das, Ashok Kumar/U-2790-2019 | 56046765500; 55480987400; 55639324300; 55450732800; 25930566300; 56962990300 | parkyh@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 2.76 | 2025-06-25 | 93 | 177 | Wireless sensor network (WSN); Internet of Things (IoT); intrusion detection; cloud computing; fog computing; edge computing; security | USER AUTHENTICATION SCHEME; KEY MANAGEMENT PROTOCOL; DETECTION SYSTEM; ESTABLISHMENT SCHEME; TIME SYNCHRONIZATION; SECURITY PROTOCOLS; IOT; DESIGN; ATTACKS; PERFORMANCE | cloud computing; edge computing; fog computing; Internet of Things (IoT); intrusion detection; security; Wireless sensor network (WSN) | Automation; Cloud computing; Edge computing; Fog computing; Intelligent buildings; Intrusion detection; Network security; Surveys; Wireless sensor networks; Communication environments; Comparative analysis; Information and communications technology; Internet of Things (IOT); Issues and challenges; security; Security and privacy; Security requirements; Internet of things | English | 2020 | 2020 | 10.1109/access.2019.2962829 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | Article | IOV-SMAP: Secure and efficient message authentication protocol for IoV in smart city environment | With the emergence of the concept of smart city and the increasing demands for a range of vehicles, Internet of Vehicles (IoV) has achieved a lot of attention by providing multiple benefits, including vehicle emergence, accidents, levels of pollution, and traffic congestion. Moreover, IoV provides various services by combining vehicular ad-hoc networks (VANET) with the Internet of Things (IoT) in smart cities. However, the communication among vehicles is susceptible to various security threats because the sensitive message is transmitted via a insecure channel in the IoV-based smart city environment. Thus, a secure message authentication protocol is indispensable to ensure various services for IoV in a smart city environment. In 2020, a secure message authentication protocol for IoV communication in smart cities has been proposed. However, we discover that the analyzed scheme suffers from various potential attacks such as impersonation, secret key disclosure, and off-line guessing attacks, and also does not ensure authentication. To solve the security threats of the analyzed scheme, we design a secure and efficient message authentication protocol for IoV in a smart city environment, called IoV-SMAP. The proposed IoV-SMAP can resist security drawbacks and provide user anonymity, and mutual authentication. We demonstrate the security of IoV-SMAP by performing informal and formal analyses such as the Real-or-Random (ROR) model, and Automated Validation of Internet Security Protocols and Application (AVISPA) simulations. In addition, we compare the performance of IoV-SMAP with related existing competing authentication schemes. We demonstrate that IoV-SMAP provides better security along with efficiency than related competing schemes and is suitable for the IoV-based smart city environment. © 2020 Institute of Electrical and Electronics Engineers Inc.. All rights reserved. | Yu, Sungjin; Lee, Joonyoung; Park, Kisung; Das, Ashok Kumar; Park, Youngho | School of Electronics Engineering, Kyungpook National University, Daegu, 41566, South Korea; School of Electronics Engineering, Kyungpook National University, Daegu, 41566, South Korea; Blockchain Technology Research Center, Electronics and Telecommunications Research Institute, Daejeon, 34129, South Korea; Center for Security, Theory, and Algorithmic Research, International Institute of Information Technology Hyderabad, Hyderabad, 500032, India; School of Electronics Engineering, Kyungpook National University, Daegu, 41566, South Korea | 57203974524; 57203970123; 57194833768; 55450732800; 56962990300 | parkyh@knu.ac.kr; | IEEE Access | IEEE ACCESS | 2169-3536 | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 4.42 | 2025-06-25 | 86 | AVISPA simulation; IoV; Message authentication; ROR model; Smart city | Accidents; Authentication; Cryptography; Internet of things; Network security; Security systems; Smart city; Traffic congestion; Vehicle to vehicle communications; Vehicles; Authentication scheme; Guessing attacks; Internet of thing (IOT); Internet security; Message authentication protocols; Mutual authentication; Potential attack; Security threats; Vehicular ad hoc networks | English | Final | 2020 | 10.1109/access.2020.3022778 | 바로가기 | 바로가기 | 바로가기 | ||||||||
| ○ | ○ | Article | LAKS-NVT: Provably Secure and Lightweight Authentication and Key Agreement Scheme Without Verification Table in Medical Internet of Things | Wireless body area networks (WBANs) and wireless sensor networks (WSNs) are important concepts for the Internet of Things (IoT). They have been applied to various healthcare services to ensure that users can access convenient medical services by exchanging physiological data between user and medical server. User physiological data is collected by sensor nodes and sent to medical service providers, doctors, etc. using public channels. However, these channels are vulnerable to various potential attacks, and hence, it is essential to design provably secure and lightweight mutual authentication (MA) schemes for medical IoT to protect user privacy and achieve secure communication. A lightweight mutual authentication and key agreement (MAKA) scheme was designed in 2019 to guarantee user privacy, but we found that the scheme does not withstand impersonation, stolen senor node and leaking verification table attacks, and it does not also ensure anonymity, untraceability and secure mutual authentication. This paper proposes a provably secure and lightweight MAKA scheme for medical IoT, called LAKS Non-verification table (NVT), that does not require a server verification table. We assess LAKS-NVT's security against various potential attacks and demonstrate that it achieves secure MA between sensor node and server using Burrows-Abadi-Needham logic. We employ the well-known Real-Or-Random which is random oracle model to prove that LAKS-NVT provides a session key security. In addition, the formal security verification using the widely-accepted Automated Validation of Internet Security Protocols and Applications (AVISPA) software tool has been performed and the results show that LAKS-NVT is also secure. We compare LAKS-NVT's performance against contemporary authentication schemes, and verify that it achieves better security and comparable efficiency. The practical perspective of LAKS-NVT is also carried out via the Network Simulator 2 (NS2) simulation study. | Park, Kisung; Noh, Sungkee; Lee, Hyunjin; Das, Ashok Kumar; Kim, Myeonghyun; Park, Youngho; Wazid, Mohammad | Elect & Telecommun Res Inst, Blockchain Technol Res Ctr, Daejeon 34129, South Korea; Int Inst Informat Technol, Ctr Secur Theory & Algorithm Res, Hyderabad 500032, India; Kyungpook Natl Univ, Sch Elect Engn, Daegu 41566, South Korea; Graph Era Deemed Be Univ, Dept Comp Sci & Engn, Dehra Dun 248002, Uttarakhand, India | wazid, mohammad/X-4211-2018; Das, Ashok Kumar/U-2790-2019; WAZID, MOHAMMAD/X-4211-2018; Park, Kisung/KIG-3849-2024 | 57194833768; 56207592700; 57218209243; 55450732800; 57210278739; 56962990300; 55480987400 | parkyh@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 3.71 | 2025-06-25 | 52 | 61 | Authentication; key agreement; medical Internet of Things; NS2 simulation; ROR model; session key security | ANONYMOUS MUTUAL AUTHENTICATION; USER AUTHENTICATION; MANAGEMENT PROTOCOL; ACCESS-CONTROL; ESTABLISHMENT; NETWORKS; DESIGN | Authentication; key agreement; medical Internet of Things; NS2 simulation; ROR model; session key security | Application programs; Authentication; Computer aided software engineering; Cryptography; Network protocols; Network security; Physiology; Sensor nodes; Verification; Wireless local area networks (WLAN); Authentication and key agreements; Authentication scheme; Internet of thing (IOT); Mutual authentication; Network Simulator2 (NS2); Verification tables; Wireless body area network; Wireless sensor network (WSNs); Internet of things | English | 2020 | 2020 | 10.1109/access.2020.3005592 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | |||
| ○ | ○ | Article | Linear Frequency Modulated Reverberation Suppression Using Non-Negative Matrix Factorization Methods, Dechirping Transformation and Modulo Operation | In this study, we propose a reverberation suppression algorithm for linear frequency-modulated (LFM) pulse sonar systems using a non-negative matrix factorization (NMF) method. Because conventional NMF-based reverberation suppression algorithms are only applicable to continuous wave reverberation, we propose two pre-processing methods, namely dechirping transformation and modulo operation, to facilitate application of the NMF method to LFM reverberation. Moreover, we impose additional sparse constraints on the NMF method to improve its performance. To evaluate the proposed algorithm, an experiment involving simulated LFM reverberation is performed. The results thereof show improved detection performance at several signal-to-reverberation ratios and false alarm conditions. Moreover, the proposed algorithm is also applied to sea experiment data. According to the sea experiment analysis, the algorithm is able to suppress the LFM reverberation effectively and improve detection performance in practical LFM pulse sonar systems. | Kim, Geunhwan; Lee, Kyunkyung; Lee, Seokjin | Kyungpook Natl Univ, Sch Elect Engn, Coll IT Engn, Daegu 41566, South Korea | 57214800540; 7501515784; 36174416200 | sjlee6@knu.ac.kr; | IEEE ACCESS | IEEE ACCESS | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.66 | 2025-06-25 | 6 | 13 | Reverberation; Sonar; Time-frequency analysis; Spectrogram; Doppler effect; Matrix decomposition; Sparse matrices; Active sonar; dechirping transformation; modulo operation; non-negative matrix factorization; reverberation suppression; sparse constraints | FORM | Active sonar; dechirping transformation; modulo operation; non-negative matrix factorization; reverberation suppression; sparse constraints | Chirp modulation; Factorization; Frequency modulation; Linear transformations; Reverberation; Sonar; Detection performance; Experiment analysis; Linear frequency modulated; Modulo operation; Nonnegative matrix factorization; Pre-processing method; Reverberation suppressions; Signal to reverberation ratios; Matrix algebra | English | 2020 | 2020 | 10.1109/access.2020.3001865 | 바로가기 | 바로가기 | 바로가기 | 바로가기 | ||||
| ○ | Article | Many-Tier Vertical GAAFET (V-FET) for Ultra-Miniaturized Standard Cell Designs beyond 5 nm | The GAAFET (gate-all-around FET) is expected to replace FinFETs in future nodes due to its excellent channel controllability. It is also expected to be an impressive device due to its horizontal or vertical transistor structures. Vertical GAAFETs (V-FETs) are expected to be a promising device compared to horizontal GAAFETs (H-FETs) due to their structure, which allows area reduction and significant parasitic reduction. Besides, V-FETs are positioned on top of each other and thus allow more significant size reductions. Therefore, this paper studies the overall potential of many-tier V-FETs by investigating the essential design factors from the layout perspective. First, we study the factors that should be considered for designing many-tier V-FETs. Second, we propose an interconnect structure that maximizes the advantages of many-tier V-FETs. Third, we compare 2-tier V-FET standard cells to one-tier V-FET cells and visualize the advantages that many-tier V-FET cells provide. Our study shows that 2-tier V-FET standard cells provide a -35.6% area reduction with a cost of +16.5% wirelength and +13.2% parasitic capacitance increase compared to 1-tier V-FET cells. Compared to H-FETs and FinFETs, our cells show -50.1% area reductions with -0.3% wirelength reductions and -18.9% parasitic capacitance reductions. We emphasize that the design freedom to place transistors on top of each other and proper interconnect structures lead to ultra-scale miniaturized standard cell designs. We note that the increase in wirelength and capacitance is due to the vertical size increases and detours that must exist in the designs. Thus, careful circuit design is required to obtain the maximum advantages from V-FETs. © 2013 IEEE. | Song, Taigon | School of Electronics Engineering, Kyungpook National University (KNU), Daegu, 41566, South Korea | 36005021000 | tsong@knu.ac.kr; | IEEE Access | IEEE ACCESS | 2169-3536 | 2169-3536 | 8 | SCIE | COMPUTER SCIENCE, INFORMATION SYSTEMS;ENGINEERING, ELECTRICAL & ELECTRONIC;TELECOMMUNICATIONS | 2020 | 3.367 | 34.3 | 0.58 | 2025-06-25 | 12 | design automation; Gate-all-around FET (GAAFET); parasitics; standard cells; vertical GAAFET (V-FET) | Capacitance; Cells; FinFET; Circuit designs; Gate-all-around; Interconnect structures; Parasitic capacitance; Parasitic reduction; Size reductions; Standard cell design; Vertical transistors; Cytology | English | Final | 2020 | 10.1109/access.2020.3015596 | 바로가기 | 바로가기 | 바로가기 |
페이지 이동: