• 제목/요약/키워드: 센싱 시간

Search Result 240, Processing Time 0.029 seconds

A Cooperative Spectrum Sensing Method based on Eigenvalue and Superposition for Cognitive Radio Networks (인지무선네트워크를 위한 고유값 및 중첩기반의 협력 스펙트럼 센싱 기법)

  • Miah, Md. Sipon;Koo, Insoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.4
    • /
    • pp.39-46
    • /
    • 2013
  • Cooperative spectrum sensing can improve sensing reliability, compared with single node spectrum sensing. In addition, Eigenvalue-based spectrum sensing has also drawn a great attention due to its performance improvement over the energy detection method in which the more smoothing factor, the better performance is achieved. However, the more smoothing factor in Eignevalue-based spectrum sensing requires the more sensing time. Furthermore, more reporting time in cooperative sensing will be required as the number of nodes increases. Subsequently, we in this paper propose an Eigenvalue and superposition-based spectrum sensing where the reporting time is utilized so as to increase the number of smoothing factors for autocorrelation calculation. Simulation result demonstrates that the proposed scheme has better detection probability in both local as well as global detection while requiring less sensing time as compared with conventional Eigenvalue-based detection scheme.

Efficient Spectrum Sensing for Cognitive Radio Sensor Networks via Optimization of Sensing Time (센싱 시간의 최적화를 통해 인지 무선 센서 네트워크를 위한 효율적인 스펙트럼 센싱)

  • Kong, Fanhua;Cho, Jinsung
    • Journal of KIISE
    • /
    • v.43 no.12
    • /
    • pp.1412-1419
    • /
    • 2016
  • In cognitive radio sensor networks (CRSNs), secondary users (SUs) can occupy licensed bands opportunistically without causing interferences to primary users (PUs). SUs perform spectrum sensing to detect the presence of PUs. Sensing time is a critical parameter for spectrum sensing that can yield a tradeoff between sensing performance and secondary throughput. In this study, we investigate new approaches for spectrum sensing by exploring the tradeoff from a) spectrum sensing for PU detection (SSPD) and b) spectrum sensing for secondary throughput (SSST). In the proposed scheme, the first sensing result of the current frame determines the dynamic performance of the second spectrum sensing. Energy constraint in CRSNs leads to maximized network energy efficiency via optimization of sensing time. Simulation results show that the proposed scheme of SSPD and SSST improves network performance in terms of energy efficiency and secondary throughput, respectively.

An Improved Cross Entropy-Based Frequency-Domain Spectrum Sensing (Cross Entropy 기반의 주파수 영역에서 스펙트럼 센싱 성능 개선)

  • Ahmed, Tasmia;Gu, Junrong;Jang, Sung-Jeen;Kim, Jae-Moung
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.3
    • /
    • pp.50-59
    • /
    • 2011
  • In this paper, we present a spectrum sensing method by exploiting the relationship of previous and current detected data sets in frequency domain. Most of the traditional spectrum sensing methods only consider the current detected data sets of Primary User (PU). Previous state of PU is a kind of conditional probability that strengthens the reliability of the detector. By considering the relationship of the previous and current spectrum sensing, cross entropy-based spectrum sensing is proposed to detect PU signal more effectively, which has a strengthened performance and is robust. When previous detected signal is noise, the discriminating ability of cross entropy-based spectrum sensing is no better than conventional entropy-based spectrum sensing. To address this problem, we propose an improved cross entropy-based frequency-domain spectrum sensing. Regarding the spectrum sensing scheme, we have derived that the proposed method is superior to the cross entropy-based spectrum sensing. We proceed a comparison of the proposed method with the up-to-date entropy-based spectrum sensing in frequency-domain. The simulation results demonstrate the performance improvement of the proposed spectrum sensing method.

Histogram Bin Number Selection Method Robust to the Variations of Channel Occupancy for Cross Entropy (크로스 엔트로피 기반 스펙트럼 센싱에서 채널 점유 시간 변화에 따른 히스토그램 Bin 개수 선택 기법)

  • Yong, Seulbaro;Jang, Sung-Jeen;Kim, Jae-Moung
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.12 no.1
    • /
    • pp.88-97
    • /
    • 2013
  • Most of the traditional spectrum sensing methods consider only the current detected data sets of Primary User (PU). However previous state of PU is a kind of conditional probability that strengthens the reliability of the detector. Therefore, in the cross entropy spectrum sensing method, relationship of the previous and current spectrum sensing is considered to detect PU signal more effectively. But these cross entropy spectrum sensing methods only consider the ideal system. In other words, PU always occupy the channel during the same period. However, PU can occupy the channel either for a longer or a shorter period than the ideal case in the real system. For this reason, the spectrum sensing performance can be varied. In this paper, we propose the method that can maintain the performance of spectrum sensing in the real system and we confirm the results with the help of simulation.

Optimal cooperative sensing scheme in cognitive radio communication systems (무선인지통신 시스템에서 최적 협업 센싱 방식)

  • Lee, Dong-Jun;Lee, Myeong-Jin
    • Journal of Advanced Navigation Technology
    • /
    • v.12 no.5
    • /
    • pp.429-436
    • /
    • 2008
  • In this paper, we study an optimization which determines the optimal sensing time and the number of cooperative sensing cognitive users for cooperative spectrum sensing scheme in cognitive radio networks. In cooperative spectrum sensing, cognitive users originally in inactive status are activated and take part in spectrum sensing along with transmitting cognitive users resulting in a reduced sensing time. Tradeoff between transmission rate gain and energy consumption due to cooperative sensing is formulated as a mixed integer programming problem which is solved for the optimal values.

  • PDF

Effect of Sensing Time on the Spectrum Sensing Performance of Energy Detector with Verification in Cognitive Radio System (인지 무선 시스템에서 확인 과정을 가지는 에너지 검출기의 스펙트럼 센싱 성능에 센싱 시간이 미치는 영향)

  • Baek, Jun-Ho;Hwang, Seung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.1
    • /
    • pp.89-93
    • /
    • 2009
  • In this paper, we investigated effect of sensing time on the performance of enhanced spectrum sensing method, which is the energy detector with multiples of verification using time delay, under Suzuki channel. We assumed that SNR is 1dB, $P_{FA}=0.1$ and various mobile speed such as 3, 60, 110 km/h. The performance is investigated by simulation and compared to that of conventional energy detector.

Reconstructed Iimage Quality Improvement of Distributed Compressive Video Sensing Using Temporal Correlation (시간 상관관계를 이용한 분산 압축 비디오 센싱 기법의 복원 화질 개선)

  • Ryu, Joong-seon;Kim, Jin-soo
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.22 no.2
    • /
    • pp.27-34
    • /
    • 2017
  • For The Purpose of Pursuing the Simplest Sampling, a Motion Compensated Block Compressed Sensing with Smoothed Projected Landweber (MC-BCS-SPL) has been Studied for an Effective Scheme of Distributed Compressive Video Sensing with all Compressed Sensing (CS) Frames. However, Conventional MC-BCS-SPL Scheme is Very Simple and so it Does not Provide Good Visual Qualities in Reconstructed Wyner-Ziv (WZ) Frames. In this Paper, the Conventional Scheme of MC-BCS-SPL is Modified to Provide Better Visual Qualities in WZ Frames. That is, the Proposed Agorithm is Designed in such a way that the Reference Frame may be Adaptively Selected Based on the Temporal Correlation Between Successive Frames. Several Experimental Results show that the Proposed Algorithm Provides Better Visual Qualities than Conventional Algorithm.

Markov Chain Analysis of Opportunistic Cognitive Radio with Imperfect Sensing (불완전 센싱 기회적 인지 전파망의 Markov Chain 분석)

  • Ahn, Hong-Young
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.10 no.6
    • /
    • pp.1-8
    • /
    • 2010
  • Wireless multimedia service through the access to mobile telephone network or data network is a vital part of contemporary life, and the demand for frequency spectrum for new services is expected to explode as the ubiquitous computing proliferate. Cognitive radio is a technology, which automatically recognizes and searches for temporally and spatially unused frequency spectrum, then actively determines the communication method, bandwidth, etc. according to the environment, thus utilizing the limited spectrum resources efficiently. In this paper, we investigate the effects of imperfect sensing, misdetection and false alarm, on the primary and secondary users' spectrum usage through the analysis of continuous time Markov Chain. We analyzed the effects of the parameters such as sensing error, offered load on the system performance.

Policy-based Channel Sensing Architecture and Algorithms for Cognitive Radio Networks (지능형 무선 인지 기술 기반 네트워크 환경에서 정책기반 채널 센싱 구조 및 알고리즘)

  • Na, Do-Hyun;Hao, Nan;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.7B
    • /
    • pp.538-549
    • /
    • 2008
  • Recently IEEE 802.22 WG has considered Cognitive Radio (CR) technology to overcome shortage of communication channels. For using CR technology, accurate and rapid sensing method selection is extremely important. According to the channel sensing method, it is of the utmost importance because it can affect the incumbent system protection. So, optimum selection of channel sensing method is very important. IEEE 802.22 gives the solution, name of fine sensing, but the solution can not adapt to various networks. So in this paper we propose Policy-based Channel Sensing Architecture and Algorithms for Cognitive Radio Networks. The proposed channel sensing architecture and algorithms can reduce both primary system detection time and quiet time in our simulation. Among the proposed sensing algorithm, channel division round robin sensing reduce average detection time up to 70% compare to fine sensing method in IEEE 802.22.

Selection Based Cooperative Spectrum Sensing in Cognitive Radio (무선인지시스템을 위한 선택적 협력 스펙트럼 검출 기법)

  • Nhan, Nguyen Thanh;Kong, Hyung-Yun;Koo, In-Soo
    • Journal of Internet Computing and Services
    • /
    • v.12 no.2
    • /
    • pp.1-8
    • /
    • 2011
  • In this paper, we propose an effective method for cooperative spectrum sensing in cognitive radios where cognitive user(CR) with the highest reliability sensing data is only selected and allowed to report its local decision to FC as only decision making node. The proposed scheme enables CR users to implicitly compare their sensing data reliabilities based on their likelihood ratio, without any collaboration among cognitive radio users. Due to the mechanism, the proposed cooperative scheme can achieves a high spectrum sensing performance while only requiring extremely low cooperation resources such as signaling overhead and cooperative time in comparison with other existing methods such as maximum ratio combination (MRC) based, equal gain combination (EGC) based and conventional hard combination based cooperative sensing methods.