• Journal of Communications and Networks
• /
• 제13권1호
• /
• pp.50-55
• /
• 2011

Spectrum leasing for cognitive radio (CR) networks is an effective way to improve the spectrum utilization. This paper presents an opportunistic relaying based spectrum leasing for CR networks where the primary users lease their frequency band to the cognitive users. The cognitive users act as relays for the primary users to improve the channel capacity, and this improved capacity is used for the transmission of secondary users' data. We show that the cognitive users can use a significant portion of the communication resource of primary networks while maintaining a fixed target data rate for the primary users. Moreover, the primary network is also benefited by the cooperating cognitive users in terms of outage probability. Information theoretic analysis and simulation results are presented to evaluate the performances of both primary and cognitive networks.

• 대한교통학회지
• /
• 제13권1호
• /
• pp.125-152
• /
• 1995

The purposes of this study are twofold ; (1) to investigate the accuracy of estimation power of the individual models. such as those of Highway Capacity Nanual (HCM), Korea Highway Capacity Manual (KHCM), and NationalCooperative Highway Research Program(NCHRP) Report339 ; and (2) to develop an adjusted delay model which can be applied to the signal control system in urban areas. The study is mainly focused on four subjects related to the research purposes, which are as follows ; (1) characteristecs of exsisting delay models ; (2) inherent problems in exsisting delay models : (3) validation of the proposed model by the comparison of observed delay with estimated delay :and (4) a method which can be applied to develop an appropriate delay model for actrual signal control systems by the adjusted fact of the proposed model.

• 수산경영론집
• /
• 제5권1호
• /
• pp.9-42
• /
• 1974

Korea is a peninsular country surrounded by seas on three sides, and the fishing industry has carried out the service of suppling to the people with important anima protein. The distribution of fishery products has very complicated structures, because the production is in charge of small producers scattering along the coast all over the country, while consumpstion is made by separate homes in areas away from producing district. The relation between these two factors the structures make very complicated. The most typical and special structures of fishery distridution are distinguished in two, that is, one is landing market, the other is inland market. Landing markets have been monopolized by fishermen's cooperatives, providing with landing facilities and building sites. Fish markets played not only an important role in the landing, but distribution and price determination of catches by auction or tender. Inland markets are two types of wholesale market in consuming center, one is the terminal market for urban consumers, the other type is the local market for rural consumers. Fundamental functions of landing markets are gathering, assessment, and distribution functions. Gathering function is in charge of wholesaler in fishery cooperative. Gathering amounts are equal to gathering capacity of wholesaler and transact ability of licensed dealers as shown below model. Gathering amount=f.gathering capacity(=pre price.landing facility.account of wholesaler.distance of fishing ground.conveniency purchasing.home port)=fㆍ transact ability of licensed dealers≒f.population or port, and table 1 indicates these relationship. Assessment and distribution functions are in charge of licensed dealers in consumption side. Assessment function should bring the value in production activity through the auction between the cooperative seller and the licensed dealer as buyer. For fair trade transaction in auction, the free competition is supposed to be a prerequisite among the licensed dealers. The ideal condition for free competition is sameness in the scale of buying amount by licensed delaers, but it is almost impossible to attain its goal in actual marketing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권11호
• /
• pp.4623-4643
• /
• 2015

This paper considers physical-layer security protocols in multicast cognitive radio (CR) networks. In particular, we propose dual-hop cooperative decode-and-forward (DF) and randomize-and-forward (RF) schemes using partial relay selection method to enhance secrecy performance for secondary networks. In the DF protocol, the secondary relay would use same codebook with the secondary source to forward the source's signals to the secondary destination. Hence, the secondary eavesdropper can employ either maximal-ratio combining (MRC) or selection combining (SC) to combine signals received from the source and the selected relay. In RF protocol, different codebooks are used by the source and the relay to forward the source message secretly. For each scheme, we derive exact and asymptotic closed-form expressions of secrecy outage probability (SOP), non-zero secrecy capacity probability (NzSCP) in both independent and identically distributed (i.i.d.) and independent but non-identically distributed (i.n.i.d.) networks. Moreover, we also give a unified formula in an integral form for average secrecy capacity (ASC). Finally, our derivations are then validated by Monte-Carlo simulations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권5호
• /
• pp.1654-1675
• /
• 2014

In practical wireless systems, the erroneous channel state information (CSI) sometimes deteriorates the performance drastically. This paper focuses on robust design of coordinated set planning of coordinated multi-point (CoMP) transmission, with respect to the feedback delay and link error. The non-ideal channel models involving various uncertainty conditions are given. After defining a penalty factor, the robust net ergodic capacity optimization problem is derived, whose variables to be optimized are the number of coordinated base stations (BSs) and the divided area's radius. By the maximum minimum criterion, upper and lower bounds of the robust capacity are investigated. A practical scheme is proposed to determine the optimal number of cooperative BSs. The simulation results indicate that the robust design based on maxmin principle is better than other precoding schemes. The gap between two bounds gets smaller as transmission power increases. Besides, as the large scale fading is higher or the channel is less reliable, the number of the cooperated BSs shall be greater.

• 한국인터넷방송통신학회논문지
• /
• 제14권4호
• /
• pp.45-50
• /
• 2014

본 논문에서는 사용자 모바일 장치를 중계기로 사용할 경우 발생할 수 있는 간섭 제약에 대해 정의하였다. 또한, 사용자 모바일 장치에서 발생하는 간섭을 완화하기위해 장치 선택 및 전력 할당 기법을 적용하였다. 제안된 전송 알고리즘을 적용할 경우 간섭을 완화시킬 수 있다. 또한, 간섭이 약한 채널에 적용할 경우 통신망 과부하 문제를 해결 할 수 있다. 따라서 추가적인 중계기 설치 없이 사용자 모바일 장치만으로 네트워크 용량을 증가시킬 수 있다. 마지막 으로, 제안한 프로토콜을 레일리 페이딩 환경에서 비트오류율(Bit Error Rate)과 아웃티지 확률(Outage Probability)을 통해 시스템의 성능을 평가한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5253-5270
• /
• 2016

With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.

• 한국정보처리학회논문지
• /
• 제7권1호
• /
• pp.126-134
• /
• 2000

버전관리 시스템은 한 개의 문서에 대한 여러 인스턴스들 사이의 일관성을 유지하기 위하여 버전의 탐색, 충돌 인지, 병합기능 등을 제공하는 어플리케이션이다. 하지만 기존의 버전관리 시스템에서는 협동작업 환경하에서 요구되는 개인별 히스토리 관리 및 저장, 텍스트 객체를 포함한 다양한 문서 제작 행위 객체들 간의 충돌 인지 및 병합, 그레인 크기 및 협동작업자의 역할에 기반한 문서 접근관리 기능 등은 지원하지 못한다. 본 연구에서 제시된 AID 태그 기법은 유일주소 지정기법을 사용하여 협동작업 환경하에서의 다양한 행위 객체들간의 충돌 인지 및 버전 병합을 용이하게 하고, 접근권한 테이블과 역할부여 기능을 AID 태그와 연계함으로써 작업 참여자의 역할 및 그레인 크기에 따른 문서 접근관리가 가능하도록 하였다. 또한 AID 태그 기법은 버전정보의 저장 및 관리를 위해 소요되는 파일의 크기를 줄이는 효과를 가져다 준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2128-2147
• /
• 2021

Cognitive radio systems are being implemented recently to tackle spectrum underutilization problems and aid efficient data traffic. Spectrum sensing is the crucial step in cognitive applications in which cognitive user detects the presence of primary user (PU) in a particular channel thereby switching to another channel for continuous transmission. In cognitive radio systems, the capacity to precisely identify the primary user's signal is essential to secondary user so as to use idle licensed spectrum. Based on the inherent capability, a new spectrum sensing technique is proposed in this paper to identify all types of primary user signals in a cognitive radio condition. Hence, a spectrum sensing algorithm using improved convolutional neural network and long short-term memory (CNN-LSTM) is presented. The principle used in our approach is simulated annealing that discovers reasonable number of neurons for each layer of a completely associated deep neural network to tackle the streamlining issue. The probability of detection is considered as the determining parameter to find the efficiency of the proposed algorithm. Experiments are carried under different signal to noise ratio to indicate better performance of the proposed algorithm. The PU signal will have an associated modulation format and hence identifying the presence of a modulation format itself establishes the presence of PU signal.

• 대한안전경영과학회지
• /
• 제23권4호
• /
• pp.93-104
• /
• 2021

In this paper, we propose a method for diagnosing overload and working load of collaborative robots through performance analysis of machine learning algorithms. To this end, an experiment was conducted to perform pick & place operation while changing the payload weight of a cooperative robot with a payload capacity of 10 kg. In this experiment, motor torque, position, and speed data generated from the robot controller were collected, and as a result of t-test and f-test, different characteristics were found for each weight based on a payload of 10 kg. In addition, to predict overload and working load from the collected data, machine learning algorithms such as Neural Network, Decision Tree, Random Forest, and Gradient Boosting models were used for experiments. As a result of the experiment, the neural network with more than 99.6% of explanatory power showed the best performance in prediction and classification. The practical contribution of the proposed study is that it suggests a method to collect data required for analysis from the robot without attaching additional sensors to the collaborative robot and the usefulness of a machine learning algorithm for diagnosing robot overload and working load.