• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.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.

• Asia pacific journal of information systems
• /
• v.6 no.2
• /
• pp.19-52
• /
• 1996

It has been argued theoretically and empirically that the analysis of business processes requires the decomposition of an integrated system. However, in order to innovate a business process, cognitive integration activities that try to understand the decomposed features of the business process as an integrated system are essential. This research aims at 1) empirically investigating the cognitive process of integrating multiple diagrams while using object-oriented methodologies in process modeling ; 2) identifying a cognitive integration strategy that supports the successful comprehension of business processes with the use of multiple diagrams ; and 3) proposing guidelines for developing supporting tools for effective business process engineering by using object-oriented process modeling.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.6
• /
• pp.1133-1146
• /
• 2011

Cognitive radio (CR) is considered one of the most promising next-generation communication systems; it has the ability to sense and make use of vacant channels that are unused by licensed users. Reliable detection of the licensed users' signals is an essential element for a CR network. Cooperative spectrum sensing (CSS) is able to offer better sensing performance as compared to individual sensing. The presence of malicious users who falsify sensing data can severely degrade the sensing performance of the CSS scheme. In this paper, we investigate a secure CSS scheme, based on the Kullback-Leibler Divergence (KL-divergence) theory, in order to identify malicious users and mitigate their harmful effect on the sensing performance of CSS in a CR network. The simulation results prove the effectiveness of the proposed scheme.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4625-4641
• /
• 2016

The performances of two commonly used feature detectors for wireless energy-harvesting cognitive radio systems are compared with the energy detector under energy causality and collision constraints. The optimal sensing duration is obtained by analyzing the effect of the detection threshold on the average throughput and collision probability. Numerical examples show that the covariance detector has the optimal sensing duration depending on an appropriate choice of the detection threshold, but no optimal sensing duration exists for the ratio of average energy to minimum eigenvalue detector.

• IEIE Transactions on Smart Processing and Computing
• /
• v.3 no.4
• /
• pp.173-180
• /
• 2014

Random access protocols feature inherent sensing functionality and distributed coordination, making them suitable for cognitive radio communication environments, where secondary users must detect the white space of the primary spectrum and utilize the idle primary spectrum efficiently without centralized control. These characteristics have led to the adoption of carrier-sensing-multiple-access/collision-avoidance (CSMA/CA) in cognitive radio. This paper proposes a new analytical framework for evaluating the performance of a CSMA/CA protocol that considers the characteristics of idle periods based on the primary traffic behavior in cognitive radio systems. In particular, the CSMA/CA-based secondary network was analyzed in the terms of idle period utilization, which is the average effective data transmission time portion in an idle period. The use of the idle period was maximized by taking its statistical features into consideration.

• Journal of information and communication convergence engineering
• /
• v.13 no.4
• /
• pp.241-247
• /
• 2015

Cognitive radio has been attracting increased attention as an effective approach to improving spectrum efficiency. One component of cognitive radio, spectrum sensing, has an important relationship with the performance of cognitive radio. In this paper, after a summary and analysis of the existing spectrum-sensing algorithms, we report that the existing eigenvalue-based semi-blind detection algorithm and blind detection algorithm have not made full use of the eigenvalues of the received signals. Applying multi-antenna systems to cognitive users, we design a variety of spectrum-sensing algorithms based on the joint distribution of the eigenvalues of the received signal. Simulation results validate that the proposed algorithms in this paper are able to detect whether the signal of the primary user exists or not with high probability of detection in an environment with a low signal-to-noise ratio. Compared with traditional algorithms, the new algorithms have the advantages of high detection performance and strong robustness

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.355-370
• /
• 2014

Cooperative spectrum sensing has been considered as a promising approach to improve the sensing performance in distributed cognitive radio networks. However, there may exist some selfish secondary users (SUs) who are unwilling to cooperate. The presence of selfish SUs could cause catastrophic damage to the performance of cooperative spectrum sensing. Following the social perspective, we propose a Social Tie-based Incentive Scheme (STIS) to deal with the selfish problem for cooperative spectrum sensing in distributed cognitive radio networks. This scheme inspires SUs to contribute sensing information for the SUs who have social tie but not others, and such willingness varies with the strength of social tie value. The evaluation of each SU's social tie derives from its contribution for others. Finally, simulation results validate the effectiveness of the proposed scheme.

• Journal of information and communication convergence engineering
• /
• v.12 no.2
• /
• pp.97-103
• /
• 2014

In spectrum sensing, there is a tradeoff between the probability of missed detection and the probability of a false alarm according to the value of the sensing threshold. Therefore, it is important to determine the sensing threshold suitable to the environment of cognitive radio networks. In this study, we consider a cognitive radio-based ad hoc network where secondary users directly communicate by using the same frequency band as the primary system and control their transmit power on the basis of the distance between them. First, we investigate a condition in which the primary and the secondary users can share the same frequency band without harmful interference from each other, and then, propose an algorithm that controls the sensing threshold dynamically on the basis of the transmit power of the secondary user. The analysis and simulation results show that the proposed sensing threshold control algorithm has low probabilities of both missed detection and a false alarm and thus, enables optimized spectrum sharing between the primary and the secondary systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.1
• /
• pp.331-343
• /
• 2015

We propose a distributed medium access control protocol for cognitive radio networks to opportunistically utilize multiple channels. Under the proposed protocol, cognitive radio nodes forecast and rank channel availability observing primary users' activities on the channels for a period of time by time series analyzing using smoothing models for seasonal data by Winters' method. The proposed approach protects primary users, mitigates channel access delay, and increases network performance. We analyze the optimal time to sense channels to avoid conflict with the primary users. We simulate and compare the proposed protocol with the existing protocol. The results show that the proposed approach utilizes channels more efficiently.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2047-2066
• /
• 2016

In this paper, we investigate joint power allocation and relay selection (PARS) schemes in non-orthogonal cooperative protocol (NOCP) based cognitive relay networks. Generally, NOCP outperforms the orthogonal cooperative protocol (OCP), since it can provide more transmit diversity. However, most existing PARS schemes in cognitive relay networks focus on OCP, which are not suitable for NOCP. In the context of NOCP, we first derive the joint constraints of transmit power limit for secondary user (SU) and interference constraint for primary user (PU). Then we formulate optimization problems under the aforementioned constraints to maximize the capacity of SU in amplify-and-forward (AF) and decode-and-forward (DF) modes, respectively. Correspondingly, we derive the closed form solutions with respect to different parameters. Numerical results are provided to verify the performance improvement of the proposed PARS schemes.