• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.2755-2773
• /
• 2015

Cooperative spectrum sensing increases the detection performance in a cognitive radio network, based on the number of sensing nodes. However, as the number of sensing nodes increases, the reporting overhead linearly increases. This paper proposes two kinds of cooperative spectrum sensing with limited reporting in a centralized cognitive radio network, a soft combination with threshold-based reporting (SC-TR) and a soft combination with contention-based reporting (SC-CR). In the proposed SC-TR scheme, each sensing node reports its sensing result to the fusion center through its own reporting channel only if the observed energy value is higher than a decision threshold. In the proposed SC-CR scheme, sensing nodes compete to report their sensing results via shared reporting channels. The simulation results show that the proposed schemes significantly reduce the reporting overhead without sacrificing the detection performance too much.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.1
• /
• pp.58-78
• /
• 2016

Compressed sensing (CS) possesses the potential benefits for spectrum sensing of wideband signal in cognitive radio. The sparsity of signal in frequency domain denotes the number of occupied channels for spectrum sensing. This paper presents a scheme of adaptively adjusting the number of compressed measurements to reduce the unnecessary computational complexity when priori information about the sparsity of signal cannot be acquired. Firstly, a method of sparsity estimation is introduced because the sparsity of signal is not available in some cognitive radio environments, and the relationship between the amount of used data and estimation accuracy is discussed. Then the SNR of the compressed signal is derived in the closed form. Based on the SNR of the compressed signal and estimated sparsity, an adaptive algorithm of adjusting the number of compressed measurements is proposed. Finally, some simulations are performed, and the results illustrate that the simulations agree with theoretical analysis, which prove the effectiveness of the proposed adaptive adjusting of compressed measurements.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.63-68
• /
• 2015

In this paper, we propose a new energy efficient scheme which can prolong the life of sensor networks, it should be able to reduce the number of sensing. We use the concept of safe zone for manage the appropriate range of properties. We measure the distance between the sensed temperature value and the center of the zone, and calculate the next sensing interval based on this distance. We name our proposed scheme "VIS". To assess the performance of the proposed scheme the actual temperature data was collected using the sensor node. The algorithm was implemented through the programming and was evaluated in a variety of settings. Experimental results show that the proposed algorithm is to significantly reduce the number of sensing in terms of energy efficiency while having the ability to know the state of the sensor nodes periodically. Our VIS algorithm can be useful in applications which will require the ability of control to the temperature within a proper range.

• The Magazine of the IEIE
• /
• v.38 no.1
• /
• pp.31-43
• /
• 2011

The mathematical foundations of the compressive sensing which goes against the common wisdom of data acquisition (the Nyquist-Shannon theorem) is reviewed. The compressive sensing asserts that one can reconstruct images or signals of interest accurately from a number of samples far smaller than the desired resolution of the image (e.g., the number of pixels in the image). The compressive sensing has far reaching implications. It suggests the new data acquisition protocols that translates analog information to digital form with fewer sensors considered necessary.

• Journal of Communications and Networks
• /
• v.16 no.2
• /
• pp.172-182
• /
• 2014

In this paper, we investigate the fundamental performance limits of the cooperative sensing using energy detection by considering the unlimited number of sensing nodes. Although a lot of cognitive radio research so far proposed various uses of energy detection because of its simplicity, the performance limits of energy detection have not been studied when a large number of sensing nodes exist. First, we show that when the sensing nodes see the independent and identically distributed channel conditions, then as the number of sensing nodes N goes to infinity, the OR rule of hard decision achieves zero of false alarm Pf for any given target probability of detection $\bar{P_d}$ irrespective of the non-zero received primary user signal to noise ratio ${\gamma}$. Second, we show that under the same condition, when the AND rule of hard decision is used, there exists a lower bound of $P_f$. Interestingly, however, for given $\bar{P_d}$, $P_f$ goes to 1 as N goes to infinity. Third, we show that when the soft decision is used, there exists a way of achieving 100% utilization of secondary user, i.e., the sensing time overhead ratio goes to zero so does $P_f$.We verify our analyses by performing extensive simulations of the proposed unlimited cooperative sensing. Finally, we suggest a way of incorporating the unlimited cooperative sensing into a practical cellular system such as long term evolutionadvanced by exploiting the existing frame structure of absolute blank subframe to implement the in-band sensing.

• Korean Journal of Remote Sensing
• /
• v.26 no.6
• /
• pp.681-691
• /
• 2010

LiDAR waveform decomposition plays an important role in LiDAR data processing since the resulting decomposed components are assumed to represent reflection surfaces within waveform footprints and the decomposition results ultimately affect the interpretation of LiDAR waveform data. Decomposing the waveform into a mixture of Gaussians involves two related problems; 1) determining the number of Gaussian components in the waveform, and 2) estimating the parameters of each Gaussian component of the mixture. Previous studies estimated the number of components in the mixture before the parameter optimization step, and it tended to suggest a larger number of components than is required due to the inherent noise embedded in the waveform data. In order to tackle these issues, a new LiDAR waveform decomposition algorithm based on the sequential approach has been proposed in this study and applied to the ICESat waveform data. Experimental results indicated that the proposed algorithm utilized a smaller number of components to decompose waveforms, while resulting IMP value is higher than the GLA14 products.

• Journal of Information Processing Systems
• /
• v.15 no.6
• /
• pp.1335-1349
• /
• 2019

Crowdsensing technologies can improve the efficiency of smart parking system in comparison with present sensor based smart parking system because of low install price and no restriction caused by sensor installation. A lot of sensing data is necessary to predict parking lot saturation in real-time. However in real world, it is hard to reach the required number of sensing data. In this paper, we model a saturation predication combining a time-based prediction model and a sensing data-based prediction model. The time-based model predicts saturation in aspects of parking lot location and time. The sensing data-based model predicts the degree of saturation of the parking lot with high accuracy based on the degree of saturation predicted from the first model, the saturation information in the sensing data, and the number of parking spaces in the sensing data. We perform prediction model learning with real sensing data gathered from a specific parking lot. We also evaluate the performance of the predictive model and show its efficiency and feasibility.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.58-73
• /
• 2014

As is well known, cooperative sensing can significantly improve the sensing accuracy as compared to local sensing in cognitive radio networks (CRNs). However, a large number of cooperative secondary users (SUs) reporting their local detection results to the fusion center (FC) would cause much overhead, such as sensing delay and energy consumption. In this paper, we propose a fast cooperative sensing scheme, called double threshold fusion (DTF), to reduce the sensing overhead while satisfying a given sensing accuracy requirement. In DTF, FC respectively compares the number of successfully received local decisions and that of failed receptions with two different thresholds to make a final decision in each reporting sub-slot during a sensing process, where cooperative SUs sequentially report their local decisions in a selective fashion to reduce the reporting overhead. By jointly considering sequential detection and selective reporting techniques in DTF, the overhead of cooperative sensing can be significantly reduced. Besides, we study the performance optimization problems with different objectives for DTF and develop three optimum fusion rules accordingly. Simulation results reveal that DTF shows evident performance gains over an existing scheme.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.2
• /
• pp.676-682
• /
• 2018

As the IoT world including WSNs develops, the number of sensor systems that sense information according to the environment based on the principle of IoT is increasing. In order to perform security for each sensor system in such a complicated environment, the security modules must be varied. These problems make hardware/software implementation difficult when considering the system efficiency and hacking/cracking. Therefore, to solve this problem, this paper proposes a pseudorandom number generator (FLT: Pseudo-random Number Generator with Fixed Length Tap unrelated to the variable sensing nodes) with a fixed-length tap that generates a pseudorandom number with a constant period, irrespective of the number of sensing nodes, and has the purpose of detecting anomalies. The proposed FLT-LFSR architecture allows the security level and overall data formatting to be kept constant for hardware/software implementations in an IoT environment. Therefore, the proposed FLT-LFSR architecture emphasizes the scalability of the network, regardless of the ease of implementation of the sensor system and the number of sensing nodes.

• Journal of electromagnetic engineering and science
• /
• v.12 no.3
• /
• pp.203-209
• /
• 2012

In order to improve sensing performance when the noise variance is not known, this paper considers a so-called blind spectrum sensing technique that is based on eigenvalue models. In this paper, we employed the spiked population models in order to identify the miss detection probability. At first, we try to estimate the unknown noise variance based on the blind measurements at a secondary location. We then investigate the performance of detection, in terms of both theoretical and empirical aspects, after applying this estimated noise variance result. In addition, we study the effects of the number of SUs and the number of samples on the spectrum sensing performance.