• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38B no.9
• /
• pp.751-764
• /
• 2013

In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

• Journal of KIISE:Information Networking
• /
• v.37 no.4
• /
• pp.301-306
• /
• 2010

We propose the control channel access scheme for multi-interface multi-hop cognitive radio (CR) environment having a cluster structure. Due to the difficulty of obtaining common channels across the entire CR network, most multi-interface multi-hop CR networks put the control channel outside the CR bandwidth and dedicate one network interface to it in order to exchange the control information such as the activation of licensed users. However, this will be the waste of the network interface. Our focus is how to alternate between the control and the data channel without multichannel hidden node problem under the cluster structure where CR nodes connect with neighbors through multiple data channels. By using simulation, we evaluate the performance of the proposed scheme. The results show that the proposed scheme achieves higher network throughput than the dedicated scheme where one network interface card should dedicate to the control channel and cannot be used for data transmission.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8B
• /
• pp.780-786
• /
• 2002

In this paper several access schemes for voice and data packet over CPCH with waiting time signalling are proposed. Waiting time signalling is used for reducing the excessive attempt of UE when all the CPCH channel resources is being used by other UEs. The proposed schemes in this paper are better than other schemes in view of the voice/data packets? dropping probability, average access attempt to transmit voice/data packets successfully and the average throughput.

• Smart Media Journal
• /
• v.1 no.1
• /
• pp.17-26
• /
• 2012

In cognitive radio networks (CRNs), unlicensed users sense the licensed spectrum bands and opportunistically access them without interfering operations of licensed users. Especially, in ad hoc networks, the MAC layer plays an important role in coordinating unlicensed users access to the spectrum and, thus, a number of MAC protocols have been studied recently. In this paper, we comparatively examine MAC protocols in cognitive radio ad hoc networks (CRAHNs). First, we categorize the protocols on the basis of common control channel (CCC) requirements and further review major implementations for each category. Then, we make a qualitative comparison of the protocols in terms of inherent characteristics and performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.05a
• /
• pp.753-757
• /
• 2003

In this paper, We propose an efficient iteration decoding control method with variable iteration decoding for iteration codes decoding. As the number of iterations increases, the bit error rate and frame error rate of the decoder decrease and the incremental improvement gradually diminishes. However, as the iteration decoding number is increase, it require much delay and amount of processing for decoding. Thus we propose variable iteration control method to adapt variation of channel using Frame Error-Check indicator. Therefore, the CRC method requires the fewest iterations and less computation than the CE method and the SCR methods.

• The Bulletin of The Korean Astronomical Society
• /
• v.37 no.2
• /
• pp.184.1-184.1
• /
• 2012

위성은 위성의 상태제어를 위한 명령부와 해당 명령이 기능대로 수행된 것을 확인하기 위한 상태정보 획득부로 구성된다. 명령부는 위성의 버스 플랫폼에 따라서 다양한 구조 (전압, 전류, 펄스폭, 형태등)를 갖지만, 상태정보획득은 명령부에 비해서 공통적인 특성을 갖게 된다. 또한 명령부는 +17V 또는 +28V등의 고전압, 고전류의 요구조건이 필요하지만, 상태정보 획득은 아날로그용 (+15V or +12V)또는 디지털용 (+5V)로 전압과 전류조건이 명령부에 비해서 요구조건이 완화된다. 상태정보획득은 relay 상태를 획득하는 matrix 구조로된 TM matrix와 아날로그 전압 상태정보를 단일채널을 통해 획득하는 Analog 단일 채널부와 정밀한 아날로그 정보 획득을 위한 차등 Analog 채널부, 기준전압과의 비교를 통한 이진상태부와 정전류를 통한 Thermistor 상태정보 획득부로 구성이 된다. 본 논문에서는 $16{\times}8$ matrix로 구성된 TM matrix 획득부와 300채널의 단일채널 아날로그 전압 획득부, 64채널 차등 아날로그 전압획득부 및 64채널 이진상태 획득부와 16채널로 구성된 정전류 thermistor 아날로그 상태정보 획득부의 구현 방법 및 프로세서보드와의 접속을 위한 UART 접속구조등에 대한 내용과 보드 사이즈 제약사항등의 구현에 대한 개발에 대해서 평가하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.3
• /
• pp.247-254
• /
• 2014

For wireless multimedia sensor network (WMSN), it is crucial to select appropriate channels to deliver multimedia data stream generated by image and voice sensors periodically or continuously. Although most of previous researches assume that fixed channels are used for wireless sensor networks, they causes limit to support various application areas. In this paper, we apply link-setup algorithms developed for wireless cognitive radio networks for searching common channels between two nodes without common control channels. We also show the algorithm causes serious performance degradation as the total number of used channels increases, and then propose a new link-setup algorithm to resolve the problem. Therefore, the proposed algorithm shows 30 % higher performance compared to existing algorithms.

• Journal of KIISE
• /
• v.44 no.9
• /
• pp.887-892
• /
• 2017

Brain-computer interface (BCI) is a technology that controls computer and transmits intention by measuring and analyzing electroencephalogram (EEG) signals generated in multi-channel during mental work. At this time, optimal EEG channel selection is necessary not only for convenience and speed of BCI but also for improvement in accuracy. The optimal channel is obtained by removing duplicate(redundant) channels or noisy channels. This paper propose a dual filter-based channel selection method to select the optimal EEG channel. The proposed method first removes duplicate channels using Spearman's rank correlation to eliminate redundancy between channels. Then, using F score, the relevance between channels and class labels is obtained, and only the top m channels are then selected. The proposed method can provide good classification accuracy by using features obtained from channels that are associated with class labels and have no duplicates. The proposed channel selection method greatly reduces the number of channels required while improving the average classification accuracy.

• The Magazine of the IEIE
• /
• v.25 no.10
• /
• pp.73-94
• /
• 1998

본 논문에서는 한국이 ITU-R에 제출한 DS-CDMA 방식의 TTA proposal I과 II의 특징 및 제안된 기술 중 역방향 변조방법인 OCQPSK(orthogonal complex QPSK), 역방향 공통패킷채널 전송방법인 AISMA(acquisition indication sense multiple access), 그리고 순방향 고속전력제어 알고리즘을 살펴본다.