A new fast k-nearest neighbor classification algorithm in cognitive radio networks based on parallel computing

摘要

The field of telecommunication has undergone a very rapid technological evolution, which has forced researchers to find techniques that allow better exploitation of hardware and software. Among the proposed technologies, cognitive radio, a concept that was designed after several technologies such as software radio. Cognitive radio has been widely used for opportunistic access of the shared spectrum and has defined the cognitive nodes by their ability to intelligently adapt the environment to achieve specific objectives through advanced techniques. In this context, clustering techniques were adopted in cognitive radio networks (CRNs) due to their great advantages especially for routing. In this article, we propose a parallel mode of the k-NN algorithm. The aim is to make a fast assignment of radio nodes in CRNs organized in the form of clusters. The obtained results are very satisfactory because we have been able to reduce to about 50% the execution time of the basic algorithm (sequential).