Histogram partitioning algorithms for adaptive and autonomous threshold estimation in cognitive radio–based industrial wireless sensor networks


Journal article


A. Onumanyi, A. Abu-Mahfouz, G. Hancke
Trans. Emerg. Telecommun. Technol., 2019

Semantic Scholar DBLP DOI
Cite

Cite

APA   Click to copy
Onumanyi, A., Abu-Mahfouz, A., & Hancke, G. (2019). Histogram partitioning algorithms for adaptive and autonomous threshold estimation in cognitive radio–based industrial wireless sensor networks. Trans. Emerg. Telecommun. Technol.


Chicago/Turabian   Click to copy
Onumanyi, A., A. Abu-Mahfouz, and G. Hancke. “Histogram Partitioning Algorithms for Adaptive and Autonomous Threshold Estimation in Cognitive Radio–Based Industrial Wireless Sensor Networks.” Trans. Emerg. Telecommun. Technol. (2019).


MLA   Click to copy
Onumanyi, A., et al. “Histogram Partitioning Algorithms for Adaptive and Autonomous Threshold Estimation in Cognitive Radio–Based Industrial Wireless Sensor Networks.” Trans. Emerg. Telecommun. Technol., 2019.


BibTeX   Click to copy

@article{a2019a,
  title = {Histogram partitioning algorithms for adaptive and autonomous threshold estimation in cognitive radio–based industrial wireless sensor networks},
  year = {2019},
  journal = {Trans. Emerg. Telecommun. Technol.},
  author = {Onumanyi, A. and Abu-Mahfouz, A. and Hancke, G.}
}

Abstract

Modern energy detectors typically use adaptive threshold estimation algorithms to improve signal detection in cognitive radio–based industrial wireless sensor networks (CR‐IWSNs). However, a number of adaptive threshold estimation algorithms often perform poorly under noise uncertainty conditions since they are typically unable to auto‐adapt their parameter values per changing spectra conditions. Consequently, in this paper, we have developed two new algorithms to accurately and autonomously estimate threshold values in CR‐IWSNs under dynamic spectra conditions. The first algorithm is a parametric‐based technique termed the histogram partitioning algorithm, whereas the second algorithm is a fully autonomous variant termed the mean‐based histogram partitioning algorithm. We have evaluated and compared both algorithms with some well‐known methods under different CR sensing conditions. Our findings indicate that both algorithms maintained over 90% probability of detection in both narrow and wideband sensing conditions and less than 10% probability of false alarm under noise‐only conditions. Both algorithms are quick and highly scalable with a time complexity of O(V), where V is the total number of input samples. The simplicity, effectiveness, and viability of both algorithms make them typically suited for use in CR‐IWSN applications.


Share



Follow this website


You need to create an Owlstown account to follow this website.


Sign up

Already an Owlstown member?

Log in