• 제목/요약/키워드: Cognitive Network

검색결과 679건 처리시간 0.026초

Throughput and Delay Optimal Scheduling in Cognitive Radio Networks under Interference Temperature Constraints

  • Gozupek, Didem;Alagoz, Fatih
    • Journal of Communications and Networks
    • /
    • 제11권2호
    • /
    • pp.148-156
    • /
    • 2009
  • The fixed spectrum assignment policy in today's wireless networks leads to inefficient spectrum usage. Cognitive radio network is a new communication paradigm that enables the unlicensed users to opportunistically use the spatio-temporally unoccupied portions of the spectrum, and hence realizing a dynamic spectrum access (DSA) methodology. Interference temperature model proposed by Federal Communications Commission (FCC) permits the unlicensed users to utilize the licensed frequencies simultaneously with the primary users provided that they adhere to the interference temperature constraints. In this paper, we formulate two NP-hard optimal scheduling methods that meet the interference temperature constraints for cognitive radio networks. The first one maximizes the network throughput, whereas the second one minimizes the scheduling delay. Furthermore, we also propose suboptimal schedulers with linear complexity, referred to as maximum frequency selection (MFS) and probabilistic frequency selection (PFS). We simulate the throughput and delay performance of the optimal as well as the suboptimal schedulers for varying number of cognitive nodes, number of primary neighbors for each cognitive node, and interference temperature limits for the frequencies. We also evaluate the performance of our proposed schedulers under both additive white gaussian noise (AWGN) channels and Gilbert-Elliot fading channels.

FTCARP: A Fault-Tolerant Routing Protocol for Cognitive Radio Ad Hoc Networks

  • Che-aron, Zamree;Abdalla, Aisha Hassan;Abdullah, Khaizuran;Rahman, Md. Arafatur
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권2호
    • /
    • pp.371-388
    • /
    • 2014
  • Cognitive Radio (CR) has been recently proposed as a promising technology to remedy the problems of spectrum scarcity and spectrum underutilization by enabling unlicensed users to opportunistically utilize temporally unused licensed spectrums in a cautious manner. In Cognitive Radio Ad Hoc Networks (CRAHNs), data routing is one of the most challenging tasks since the channel availability and node mobility are unpredictable. Moreover, the network performance is severely degraded due to large numbers of path failures. In this paper, we propose the Fault-Tolerant Cognitive Ad-hoc Routing Protocol (FTCARP) to provide fast and efficient route recovery in presence of path failures during data delivery in CRAHNs. The protocol exploits the joint path and spectrum diversity to offer reliable communication and efficient spectrum usage over the networks. In the proposed protocol, a backup path is utilized in case a failure occurs over a primary transmission route. Different cause of a path failure will be handled by different route recovery mechanism. The protocol performance is compared with that of the Dual Diversity Cognitive Ad-hoc Routing Protocol (D2CARP). The simulation results obviously prove that FTCARP outperforms D2CARP in terms of throughput, packet loss, end-to-end delay and jitter in the high path-failure rate CRAHNs.

Joint Beamforming and Power Allocation for Multiple Primary Users and Secondary Users in Cognitive MIMO Systems via Game Theory

  • Zhao, Feng;Zhang, Jiayi;Chen, Hongbin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제7권6호
    • /
    • pp.1379-1397
    • /
    • 2013
  • We consider a system where a licensed radio spectrum is shared by multiple primary users(PUs) and secondary users(SUs). As the spectrum of interest is licensed to primary network, power and channel allocation must be carried out within the cognitive radio network so that no excessive interference is caused to PUs. For this system, we study the joint beamforming and power allocation problem via game theory in this paper. The problem is formulated as a non-cooperative beamforming and power allocation game, subject to the interference constraints of PUs as well as the peak transmission power constraints of SUs. We design a joint beamforming and power allocation algorithm for maximizing the total throughput of SUs, which is implemented by alternating iteration of minimum mean square error based decision feedback beamforming and a best response based iterative power allocation algorithm. Simulation results show that the algorithm has better performance than an existing algorithm and can converge to a locally optimal sum utility.

인지적 계산가능성에 대한 메타수학적 연구 (A Metamathematical Study of Cognitive Computability with G del's Incompleteness Theorems)

  • 현우식
    • 한국인지과학회:학술대회논문집
    • /
    • 한국인지과학회 2000년도 춘계 학술대회
    • /
    • pp.322-328
    • /
    • 2000
  • This study discusses cognition as a computable mapping in cognitive system and relates G del's Incompleteness Theorems to the computability of cognition from a metamathematical perspective. Understanding cognition as a from of computation requires not only Turing machine models but also neural network models. In previous studies of computation by cognitive systems, it is remarkable to note how little serious attention has been given to the issue of computation by neural networks with respect to G del's Incompleteness Theorems. To address this problem, first, we introduce a definition of cognition and cognitive science. Second, we deal with G del's view of computability, incompleteness and speed-up theorems, and then we interpret G del's disjunction on the mind and the machine. Third, we discuss cognition as a Turing computable function and its relation to G del's incompleteness. Finally, we investigate cognition as a neural computable function and its relation to G del's incompleteness. The results show that a second-order representing system can be implemented by a finite recurrent neural network. Hence one cannot prove the consistency of such neural networks in terms of first-order theories. Neural computability, theoretically, is beyond the computational incompleteness of Turing machines. If cognition is a neural computable function, then G del's incompleteness result does not limit the compytational capability of cognition in humans or in artifacts.

  • PDF

시맨틱 베이지안 네트워크를 이용한 적응형 사이버 에이전트의 복합인지처리 (Complex Cognitive Information Processing for Adaptive Cyber Agents using Semantic Bayesian Network)

  • 김경민;홍진혁;조성배
    • 한국인지과학회:학술대회논문집
    • /
    • 한국인지과학회 2005년도 춘계학술대회
    • /
    • pp.145-150
    • /
    • 2005
  • 최근 전자상거래에 대한 관심과 투자가 집중되면서 효과적인 사용자 인터페이스인 대화형 에이전트에 대한 연구가 활발히 진행되고 있다. 기존의 대화형 에이전트는 사용자의 질의에 미리 준비된 답변을 제공하기 때문에 복잡한 대화 상황을 처리하지 못한다. 이런 한계를 극복하기 위해 베이지안 네트워크 등의 기법을 이용한 사용자 의도 추론 기술이 연구되고 있다. 본 논문에서는 기존의 정보검색을 위한 대화형 에이전트에서 사용자 의도 추론의 성능을 높이기 위해 노드간의 의미 관계를 표현하는 정보를 결합한 시맨틱 베이지안 네트워크(Semantic Bayesian Network; SeBN) 모델을 제안한다. 단발적인 질의 분석이 아닌 점증적 질의 분석 방법을 바탕으로 불충분한 정보로 적절한 답변을 추론하지 못할 경우에MII(mixed-initiative interaction)를 수행하여 주어진 문제를 해결한다. 실제 모바일 검색 사이트에 제안하는 방법을 적용하여 유용성을 확인하였다.

  • PDF

Intelligent Automated Cognitive-Maturity Recognition System for Confidence Based E-Learning

  • Usman, Imran;Alhomoud, Adeeb M.
    • International Journal of Computer Science & Network Security
    • /
    • 제21권4호
    • /
    • pp.223-228
    • /
    • 2021
  • As a consequence of sudden outbreak of COVID-19 pandemic worldwide, educational institutes around the globe are forced to switch from traditional learning systems to e-learning systems. This has led to a variety of technology-driven pedagogies in e-teaching as well as e-learning. In order to take the best advantage, an appropriate understanding of the cognitive capability is of prime importance. This paper presents an intelligent cognitive maturity recognition system for confidence-based e-learning. We gather the data from actual test environment by involving a number of students and academicians to act as experts. Then a Genetic Programming based simulation and modeling is applied to generate a generalized classifier in the form of a mathematical expression. The simulation is derived towards an optimal space by carefully designed fitness function and assigning a range to each of the class labels. Experimental results validate that the proposed method yields comparative and superior results which makes it feasible to be used in real world scenarios.

Learning Automata Based Multipath Multicasting in Cognitive Radio Networks

  • Ali, Asad;Qadir, Junaid;Baig, Adeel
    • Journal of Communications and Networks
    • /
    • 제17권4호
    • /
    • pp.406-418
    • /
    • 2015
  • Cognitive radio networks (CRNs) have emerged as a promising solution to the problem of spectrum under utilization and artificial radio spectrum scarcity. The paradigm of dynamic spectrum access allows a secondary network comprising of secondary users (SUs) to coexist with a primary network comprising of licensed primary users (PUs) subject to the condition that SUs do not cause any interference to the primary network. Since it is necessary for SUs to avoid any interference to the primary network, PU activity precludes attempts of SUs to access the licensed spectrum and forces frequent channel switching for SUs. This dynamic nature of CRNs, coupled with the possibility that an SU may not share a common channel with all its neighbors, makes the task of multicast routing especially challenging. In this work, we have proposed a novel multipath on-demand multicast routing protocol for CRNs. The approach of multipath routing, although commonly used in unicast routing, has not been explored for multicasting earlier. Motivated by the fact that CRNs have highly dynamic conditions, whose parameters are often unknown, the multicast routing problem is modeled in the reinforcement learning based framework of learning automata. Simulation results demonstrate that the approach of multipath multicasting is feasible, with our proposed protocol showing a superior performance to a baseline state-of-the-art CRN multicasting protocol.

Optimal Price Strategy Selection for MVNOs in Spectrum Sharing: An Evolutionary Game Approach

  • Zhao, Shasha;Zhu, Qi;Zhu, Hongbo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제6권12호
    • /
    • pp.3133-3151
    • /
    • 2012
  • The optimal price strategy selection of two bounded rational cognitive mobile virtual network operators (MVNOs) in a duopoly spectrum sharing market is investigated. The bounded rational operators dynamically compete to sell the leased spectrum to secondary users in order to maximize their profits. Meanwhile, the secondary users' heterogeneous preferences to rate and price are taken into consideration. The evolutionary game theory (EGT) is employed to model the dynamic price strategy selection of the MVNOs taking into account the response of the secondary users. The behavior dynamics and the evolutionary stable strategy (ESS) of the operators are derived via replicated dynamics. Furthermore, a reward and punishment mechanism is developed to optimize the performance of the operators. Numerical results show that the proposed evolutionary algorithm is convergent to the ESS, and the incentive mechanism increases the profits of the operators. It may provide some insight about the optimal price strategy selection for MVNOs in the next generation cognitive wireless networks.

무선 인지 셀룰러 망에서 자원예측에 의한 가드채널 할당기법의 성능개선 (Performance Improvements in Guard Channel Scheme by Resource Prediction for Wireless Cognitive Radio-Based Cellular Networks)

  • 이진이
    • 한국항행학회논문지
    • /
    • 제16권5호
    • /
    • pp.794-800
    • /
    • 2012
  • 본 논문에서는 셀룰러 기반 무선 인지망에서 핸드오프 호를 위한 가드채널할당기법(guard channel scheme)의 자원이용률의 저하를 개선하기 위해 무선인지 기술을 사용하여 자원 이용률을 향상시키면서, 무선 인지망의 부 사용자(cognitive radio user) 손실률을 줄이는 방법을 제안한다. 제안한 방법에서는 핸드오프 호의 전용채널(guard channel)을 부 사용자가 이용하도록 하고, MMOSPRED(Multi-Media One Step Prediction)기법으로 핸드오프 호의 발생을 예측한 다음, 핸드오프 호가 발생하면 핸드오프 호의 전용채널을 넘겨주고, 부 사용자는 예약된 자원으로 스펙트럼 핸드오프를 하여 서비스를 완료 하도록 한다. 시뮬레이션을 통하여, 제안한 기법의 자원 이용률과 부 사용자의 손실률에 대한 성능이 기존의 가드채널 할당기법과 모바일의 이동성을 예측하지 않은 채널할당기법 보다 우수함을 보인다.

A Quest of Design Principles of Cognitive Artifacts through Case Analysis in e-Learning: A Learner-Centered Perspective

  • PARK, Seong Ik;LIM, Wan Chul
    • Educational Technology International
    • /
    • 제10권1호
    • /
    • pp.1-23
    • /
    • 2009
  • Learners are often posited in a paradoxical situation where they are not fully involved in decision making processes on how to learn, in designing their tools. Cognitive artifacts in e-learning are supposed to effectively support learner-centered e-learning. The purpose of the study is to analyze cases of cognitive artifacts and to inquire those design principles for facilitating the learner-centered e-learning. Four research questions are suggested: First, it will be analyzed the characteristics of learners with respect to design of cognitive artifacts for supporting the learner-centered e-learning. Second, characteristics of four cases to design cognitive artifacts in learner-centered e-learning environment are analyzed. Third, it will be suggested the appropriate design principles of cognitive artifacts to facilitating learner-centered learning in e-learning environment. Four cases of cognitive artifacts design in learner-centered e-learning was identified as follows: Wiki software as cognitive artifacts in computer-supported collaborative learning; 'Play Around Network (PAN)' as cognitive artifact to monitor learning activities in knowledge community; Knowledge Forum System (KFS) as a cognitive artifact in knowledge building; cognitive artifacts in Courses-as-seeds applied meta-design. Five design principles are concluded as follows: Promoting externalization of cognitive artifacts to private media; Helping learners to initiate their learning processes; Encouraging learners to make connections with other learners' knowledge building and their cognitive artifacts; Promoting monitoring of participants' contributions in collaborative knowledge building; Supporting learners to design their cognitive artifacts.