• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권4호
• /
• pp.1845-1865
• /
• 2019

Current Internet is designed by lots of service providers with different objects and policies which make the direct deployment of radically new architecture and protocols on Internet nearly impossible without reaching a consensus among almost all of them. Network virtualization is proposed to fend off this ossification of Internet architecture and add diversity to the future Internet. As an important part of network virtualization, virtual network embedding (VNE) problem has received more and more attention. In order to solve the problems of large embedding cost, low acceptance ratio (AR) and environmental adaptability in VNE algorithms, cognitive method is introduced to improve the adaptability to the changing environment and a cognitive virtual network embedding algorithm based on weighted relative entropy (WRE-CVNE) is proposed in this paper. At first, the weighted relative entropy (WRE) method is proposed to select the suitable substrate nodes and paths in VNE. In WRE method, the ranking indicators and their weighting coefficients are selected to calculate the node importance and path importance. It is the basic of the WRE-CVNE. In virtual node embedding stage, the WRE method and breadth first search (BFS) algorithm are both used, and the node proximity is introduced into substrate node ranking to achieve the joint topology awareness. Finally, in virtual link embedding stage, the CPU resource balance degree, bandwidth resource balance degree and path hop counts are taken into account. The path importance is calculated based on the WRE method and the suitable substrate path is selected to reduce the resource fragmentation. Simulation results show that the proposed algorithm can significantly improve AR and the long-term average revenue to cost ratio (LTAR/CR) by adjusting the weighting coefficients in VNE stage according to the network environment. We also analyze the impact of weighting coefficient on the performance of the WRE-CVNE. In addition, the adaptability of the WRE-CVNE is researched in three different scenarios and the effectiveness and efficiency of the WRE-CVNE are demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권4호
• /
• pp.1594-1617
• /
• 2018

In this paper, we consider a spectrum access scenario which consists of two groups of users, namely Primary Users (PUs) and Secondary Users (SUs) in Cooperative Cognitive Radio Networks (CCRNs). SUs cooperatively relay PUs messages based on Amplify-and-Forward (AF) and Decode-and-Forward (DF) cooperative techniques, in exchange for accessing some of the spectrum for their secondary communications. From the literatures, we found that the Conventional Distributed Algorithm (CDA) and Pragmatic Distributed Algorithm (PDA) aim to maximize the PU sum-rate resulting in a lower sum-rate for the SU. In this contribution, we have investigated a suit of distributed matching algorithms. More specifically, we investigated SU-based CDA (CDA-SU) and SU-based PDA (PDA-SU) that maximize the SU sum-rate. We have also proposed the All User-based PDA (PDA-ALL), for maximizing the sum-rates of both PU and SU groups. A comparative study of CDA, PDA, CDA-SU, PDA-SU and PDA-ALL is conducted, and the strength of each scheme is highlighted. Different schemes may be suitable for different applications. All schemes are investigated under the idealistic scenario involving perfect coding and perfect modulation, as well as under practical scenario involving actual coding and actual modulation. Explicitly, our practical scenario considers the adaptive coded modulation based DF schemes for transmission flexibility and efficiency. More specifically, we have considered the Self-Concatenated Convolutional Code (SECCC), which exhibits low complexity, since it invokes only a single encoder and a single decoder. Furthermore, puncturing has been employed for enhancing the bandwidth efficiency of SECCC. As another enhancement, physical layer security has been applied to our system by introducing a unique Advanced Encryption Standard (AES) based puncturing to our SECCC scheme.

• 인지과학
• /
• 제7권1호
• /
• pp.37-56
• /
• 1996

본 논문에서는 구조적 특징분석을 이용한 무제약 필기 숫자의 검증기를 개발하고 이를 다중 인식기의 결합 알고리즘으로 사용하는 방법을 제안한다.일반적인 다중 인식기 결합은 학습이나 확률적 방법을 주로 사용하고 입력 영상의 구조적 특징에 대해서는 전혀 고려하지 않기 때문에 인간이 명백히 판단할 수 있는 숫자임에도 불구하고 인식기의 특성에 따라 오인식을 할 수 있다.이런 약점을 보완하기 위하여 자주 혼동되는 숫자쌍에 대하여 구조적 특징을 비교 분석하여 판단하는 일대일 검증기를 구현하고 이를 인식기의 결합에 적용한다.검증을 위한 구조적 특징으로는 윤곽선,방향코드,다각형 근사와 수직/수평 영교차 횟수 등이 있다.제안하는 방법의 성능 평가를 위한 실험은 CENPARMI숫자 데이터를 사용하였으며, 실험 결과 전체 신뢰도는 97.95%를 얻었고 또한 일반적인 결합 알고리즘에서 발생할 수 있는 오인식 요소들이 제거됨을 확인할 수있었다.

• 디지털산업정보학회논문지
• /
• 제9권2호
• /
• pp.81-87
• /
• 2013

In this paper, we present an implementation of Long Term Evolution (LTE) Uplink (UL) system on a Software Defined Radio (SDR) platform using a conventional Personal Computer (PC), which adopts Graphic Processing Units (GPU) and Universal Software Radio Peripheral2 (USRP2) with URSP Hardware Driver (UHD) for SDR software modem and Radio Frequency (RF) transceiver, respectively. We have adopted UHD because UHD provides flexibility in the design of transceiver chain. Also, Cognitive Radio (CR) engine have been implemented by using libraries from UHD. Meanwhile, we have implemented the software modem in our system on GPU which is suitable for parallel computing due to its powerful Arithmetic and Logic Units (ALUs). From our experiment tests, we have measured the total processing time for a single frame of both transmit and receive LTE UL data to find that it takes about 5.00ms and 6.78ms for transmit and receive, respectively. It particularly means that the implemented system is capable of real-time processing of all the baseband signal processing algorithms required for LTE UL system.

• 인지과학
• /
• 제4권1호
• /
• pp.261-294
• /
• 1993

대부분의 규칙 기반 전문가 시스템에서 규칙의 갱신과 새로운 규칙의 추가가 다른 규칙에 영향을 주어서는 안된다. 이러한 원리를 규칙의 모듈성이라고 한다. 전문가 시스템에서 증거간의 관계를 알려고 할때, 기존의 전문가 시스템은 정보의 근원이 다른것으로 가정하고 믿음값을 갱신한다. 이러한 가정은 규칙의 모듈성을 위반하게 된다. 본 논문에서는 이러한 문제점을 해결하기 위해 규칙의 모듈성을 보장하는 베이지안 네트워크에 기반을 둔 Fuzzy Belief Network 를 제안한다. Fuzzy Belief Network을 구축하기 위해 노드와 링크 등을 정의하고, 각 노드에서 발생하는 자료의 융합 알고리즘과 자료를 융합한 결과인 믿음값을 모든 노드에 전달하는 확산 알고리즘을 제안한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1042-1062
• /
• 2010

Cooperative spectrum sensing (CSS) is an effective technology for alleviating the unreliability of local spectrum sensing due to fading/shadowing effects. Unlike most existing solutions, this paper considers the use of CSS technology in decentralized networks where a fusion center is not available. In such a decentralized network, some attackers may sneak into the ranks of cooperative users. On the basis of recent advances in bio-inspired consensus algorithms, an attack-proof, decentralized CSS scheme is proposed in which all secondary users can maintain cooperative sensing by exchanging information locally instead of requiring centralized control or data fusion. Users no longer need any prior knowledge of the network. To counter three potential categories of spectrum sensing data falsification (SSDF) attacks, some anti-attack strategies are applied to the iterative process of information exchange. This enables most authentic users to exclude potentially malicious users from their neighborhood. As represented by simulation results, the proposed scheme can generally ensure that most authentic users reach a consensus within the given number of iterations, and it also demonstrates much better robustness against different SSDF attacks than several existing schemes.

• ETRI Journal
• /
• 제38권5호
• /
• pp.941-951
• /
• 2016

In this paper, cognitive radio and simultaneous wireless information and power transfer (SWIPT) are effectively combined to design a spectrum-efficient and energy-efficient transmission paradigm. Specifically, a novel SWIPT-based primary-secondary cooperation model is proposed to increase the transmission rate of energy/spectrum constrained users. In the proposed model, a multi-antenna secondary user conducts simultaneous energy harvesting and information forwarding by means of power splitting (PS), and tries to maximize its own transmission rate under the premise of successfully assisting the data delivery of the primary user. After the problem formulation, joint power splitting and beamforming optimization algorithms for decode-and-forward and amplify-and-forward modes are presented, in which we obtain the optimal PS factor and beamforming vectors using a golden search method and dual methods. Simulation results show that the proposed SWIPTbased primary-secondary cooperation schemes can obtain a much higher level of performance than that of non-SWIPT cooperation and non-cooperation schemes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권12호
• /
• pp.4664-4681
• /
• 2020

Modulation recognition (MR) plays a key role in cognitive radar, cognitive radio, and some other civilian and military fields. While existing methods can identify the signal modulation type by extracting the signal characteristics, the quality of feature extraction has a serious impact on the recognition results. In this paper, an end-to-end MR method based on long short-term memory (LSTM) and the gated recurrent unit (GRU) is put forward, which can directly predict the modulation type from a sampled signal. Additionally, the sliding window method is applied to fast-changing mixed-modulation signals for which the signal modulation type changes over time. The recognition accuracy on training datasets in different SNR ranges and the proportion of each modulation method in misclassified samples are analyzed, and it is found to be reasonable to select the evenly-distributed and full range of SNR data as the training data. With the improvement of the SNR, the recognition accuracy increases rapidly. When the length of the training dataset increases, the neural network recognition effect is better. The loss function value of the neural network decreases with the increase of the training dataset length, and then tends to be stable. Moreover, when the fast-changing period is less than 20ms, the error rate is as high as 50%. As the fast-changing period is increased to 30ms, the error rates of the GRU and LSTM neural networks are less than 5%.

• Journal of Multimedia Information System
• /
• 제9권1호
• /
• pp.21-32
• /
• 2022

Early-stage diagnosis of Alzheimer's Disease (AD) from Cognitively Normal (CN) patients is crucial because treatment at an early stage of AD can prevent further progress in the AD's severity in the future. Recently, computer-aided diagnosis using magnetic resonance image (MRI) has shown better performance in the classification of AD. However, these methods use a traditional machine learning algorithm that requires supervision and uses a combination of many complicated processes. In recent research, the performance of deep neural networks has outperformed the traditional machine learning algorithms. The ability to learn from the data and extract features on its own makes the neural networks less prone to errors. In this paper, a dense neural network is designed for binary classification of Alzheimer's disease. To create a classifier with better results, we studied result of different activation functions in the prediction. We obtained results from 5-folds validations with combinations of different activation functions and compared with each other, and the one with the best validation score is used to classify the test data. In this experiment, features used to train the model are obtained from the ADNI database after processing them using FreeSurfer software. For 5-folds validation, two groups: AD and CN are classified. The proposed DNN obtained better accuracy than the traditional machine learning algorithms and the compared previous studies for AD vs. CN, AD vs. Mild Cognitive Impairment (MCI), and MCI vs. CN classifications, respectively. This neural network is robust and better.

• 한국통신학회논문지
• /
• 제38B권9호
• /
• pp.765-774
• /
• 2013

본 논문에서는 분산된 광대역 인지 무선 네트워크 환경에서 상관관계를 갖는 다중 신호를 위한 협력 압축 스펙트럼 센싱 기법을 제안한다. 압축 센싱 (Compressed Sensing)은 나이퀴스트율 (Nyquist Rate) 이하로 샘플링된 신호를 높은 확률로 복구할 수 있는 신호처리 기법으로 기존의 광대역 스펙트럼 센싱을 위해서 필요로 했던 고속의 아날로그-디지털 변환기 구현 문제를 해결할 수 있다. 압축 센싱에서는 압축된 신호를 원본 신호로 정확하게 복구하는 복구 알고리즘을 설계하는 것이 하나의 핵심 문제이다. 본 논문에서는 나이퀴스트율 이하로 압축된 신호의 복구 성능을 높이기 위하여 연속된 다중 입력 신호로 구성된 Multiple Measurement Vector 모델을 이용하였고, 입력 신호 사이의 시간적 상관관계를 이용하는 협력 베이지안 복구 알고리즘을 제안한다.