• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.296-305
• /
• 2010

Secondary users should sense the licensed spectrum bands in order to protect the primary users from interference. However, periodic and frequent sensing for immediate detection of primary users usually gives rise to much sensing overhead, and thus will quickly drain the battery as well as deteriorate the performance of a secondary user. To overcome such problems, we focus on the method reducing sensing overhead of each secondary user and propose a distributed fair sensing scheme that the multiple users within a certain area, so-called sensing zone, sense the spectrum bands in a fairly distributed manner and share the results among the users within respective sensing zone. The design of the frame structure for the proposal is also demonstrated while considering the sensing requirements for protecting primary users. The performance results by numerical analyses and computer simulations show that our proposed sensing scheme significantly reduces the sensing overhead of each user compared to the conventional sensing scheme and also satisfies the given sensing requirements for primary user protection.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.11
• /
• pp.1566-1573
• /
• 2021

Rendezvous is a process that assists nodes in a Cognitive Radio Networks (CRNs) to discover each other. In CRNs where a common control channel is unknown and a number of channels are given, it is important how two nodes find each other in a known search region. In this paper, I have proposed and analyzed a channel hopping sequence using Sidel'nikov sequence by which each node visits an available number of channels. I analyze the expected time to-rendezvous (TTR) mathematically. I also verify the Rendezvous performance of proposed sequence in the view of TTR under 2 user environment compared with JS algorithm and GOS algorithm. The Rendezvous performance of proposed sequence is much better than GOS algorithm and similar with JS algorithm. But when M is much smaller than p, the performance of proposed sequence is better than JS algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.8A
• /
• pp.633-639
• /
• 2009

For operation of IEEE 802.22 WRAN system, spectrum sensing is a essential function. However, due to strict sensing requirement of WRAN system, spectrum sensing process of CR nodes require long quiet period. In addition, CR nodes sometimes fail to detect licensed users due to shadowing effect of wireless communication environment. To overcome this problem, CR nodes collaborate with each other for increasing the sensing reliability or mitigating the sensitivity requirement. A general approach for decision fusion, the "k out of N" rule is often taken as the decision fusion rule for its simplicity. However, since k out of N rules can not achieve better performance than the highest SNR node when SNR is largely different among CR nodes, the local SNR of each node should be considered to achieve better performance. In this paper, we propose two novel data fusion methods by utilizing confidence vector which represents the confidence level of individual sensing result. The simulation results show that the proposed schemes improve the signal detection performance than the conventional data fusion algorithms.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.375-378
• /
• 2009

The Spectrum Sensing Technology is the core technology of the Cognitive Radio (CR) System that is one of the future wireless communication technologies. This is the technology that temporarily allocates the frequency bandwidth by scanning surrounding wireless environments to keep licensed terminals and search the unused frequency bandwidth. In this paper, we proposed the efficient Spectrum Sensing Method using the Short Time Fourier Transform (STFT). The Cosine and DVB-H signal with the 6MHz bandwidth is used as the Input Signal. And we confirm the Spectrum Sensing result using Modified Periodogram Method, Welch's Method for compared with Short Time Fourier Transform Algorithm.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.35-39
• /
• 2007

The cognitive radio communication is taking the attentions because the development of the technique came to be possible to analyze wireless signals. In the IEEE 802.22 WRAN Systems[1], how to detect a spectrum and signals is continuously studied. In this paper, we propose the efficient signal detection method using SCF (Spectral Correlation Function). It is easy to detect the signal feature when we are using the SCF. Because most modulated signals have the cyclo-stationarity which is unique for each signal. But the fading channel effected serious influence even though it detects the feature of the signal. We applied LMS(Least Mean Square) filter for the compensation of the signal which is effected the serious influence in the fading channel. And we analyze some signal patterns through the SCF. And we show the unique signal feature of each signal through the SCF method. It is robust for low SNR(Signal to Noise Ratio) environment and we can distinguish it in the fading channel using LMS Filter.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.846-858
• /
• 2020

The non-orthogonal multiple access (NOMA) technique offers throughput improvement to meet the demands of the future generation of wireless communication networks. The objective of this work is to further improve the throughput by including an underlay cognitive radio network with an existing multi-carrier NOMA network, using cooperative communication. The throughput is maximized by optimal resource allocation, namely, power allocation, subcarrier assignment, relay selection, user pairing, and subcarrier pairing. Optimal power allocation to the primary and secondary users is accomplished in a way that target rate constraints of the primary users are not affected. The throughput maximization is a combinatorial optimization problem, and the computational complexity increases as the number of users and/or subcarriers in the network increases. To this end, to reduce the computational complexity, a dynamic network resource allocation algorithm is proposed for combinatorial optimization. The simulation results show that the proposed network improves the throughput.

• 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.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.280-288
• /
• 2019

In the CR-enabled MANET, routing paths can be easily destroyed due to node mobility and channel unavailability (due to the emergence of the PU of a channel), resulting in significant overhead to maintain/recover the routing path. In this paper, network caching is actively used for route maintenance, taking into account the properties of the CR. In the proposed scheme, even if a node detects that a path becomes unavailable, it does not generate control messages to establish an alternative path. Instead, the node stores the packets in its local cache and 1) waits for a certain amount of time for the PU to disappear; 2) waits for a little longer while overhearing messages from other flow; 3) after that, the node applies local route recovery process or delay tolerant forwarding strategy. According to the simulation study using the OPNET simulator, it is shown that the proposed scheme successfully reduces the amount of control messages for path recovery and the service latency for the time-sensitive traffic by 13.8% and 45.4%, respectively, compared to the existing scheme. Nevertheless, the delivery ratio of the time-insensitive traffic is improved 14.5% in the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.87-94
• /
• 2010

It is widely known that cooperative spectrum sensing in which secondary users scattered in some region collaborate to detect primary users can significantly reduce the performance degradation due to the fading phenomenon. Most of previous works on cooperative spectrum sensing are based on the assumption that the local spectrum sensing decisions of secondary users are statistically independent. However, there can be practically some statistical correlation between the local decisions of any two secondary users in close proximity, which is caused by shadowing effect. In order to evaluate the effect of this correlation on the performance of collaborative spectrum sensing, we assumed that, for the case that a primary user are active in the spectrum of interest, any two local decisions are statistically correlated to each other with some level of constant correlation and independent otherwise, and analyzed the achievable throughput with the degree of correlation varying. The results showed that, as the degree of correlation gets higher, the throughput increases for the case of the AND fusion rule and decreases for the OR fusion rule.

• Journal of Communications and Networks
• /
• v.17 no.6
• /
• pp.622-633
• /
• 2015

The coexistence among different systems is a major problem in communications. Mutual interference between different systems should be analyzed and mitigated before their deployment. The paper focuses on two aspects that have an impact on the system performance. First, the coexistence analysis, i.e. evaluating the mutual interference. Second aspect is the coexistence techniques, i.e. appropriate system modifications that guarantee the simultaneous use of the spectrum by different technologies. In particular, the coexistence problem is analyzed between ultra-wide bandwidth (UWB) and narrow bandwidth (NB) systems emphasizing the role of spectrum sensing to identify and classify the NB interferers that mostly affect the performance of UWB system. A direct sequence (DS)-time hopping (TH) code design technique is used to mitigate the identified NB interference. Due to the severe effect of Narrowband Interference on UWB communications, we propose an UWB transceiver that utilizes spectrum-sensing techniques together with mitigation techniques. The proposed transceiver improves both the UWB and NB systems performance by adaptively reducing the mutual interference. Detection and avoidance method is used where spectrum is sensed every time duration to detect the NB interferer's frequency location and power avoiding it's effect by using the appropriate mitigation technique. Two scenarios are presented to identify, classify, and mitigate NB interferers.