In cognitive wireless networks, multi-node cooperative spectrum sensing can effectively improve the accuracy of spectrum sensing, but there is a non-linear relationship between the number of nodes and sensing accuracy. Nodes with low reliability participate in cooperative sensing, which is not conducive to the improvement of sensing accuracy, and reduces the energy efficiency of spectrum sensing, which poses challenges to the normal operation of cognitive wireless networks. In order to improve energy efficiency and sensing performance, this paper proposes the node evaluation and scheduling (NES) algorithm and the Secure Spectrum Sensing based on Blockchain (SSSB) algorithm, which can evaluate the reliability of sensing nodes in real time, and obtain the trust value of the node. The nodes information is stored in the management center of blockchain. Blockchain encrypts nodes information to ensure that a node corresponds to its own trust value without confusion. Fusion Center of cognitive wireless networks select good performance nodes to participate in cooperative spectrum sensing. Which can reduce energy consumption while improving the sensing performance. The simulation experiment results show that the new algorithm in this paper is far superior to the traditional algorithm. Under the same other conditions, the detection probability is increased by 5%, and the energy consumption is reduced by 10%, and the safety index has also been greatly improved.

This study presents a novel integration of two advanced deep learning models, U-Net and EfficientNetV2, to achieve high-precision segmentation and rapid classification of pathological images. A key innovation is the development of a new heatmap generation algorithm, which leverages meticulous image preprocessing, data enhancement strategies, ensemble learning, attention mechanisms, and deep feature fusion techniques. This algorithm not only produces highly accurate and interpretatively rich heatmaps but also significantly improves the accuracy and efficiency of pathological image analysis. Unlike existing methods, our approach integrates these advanced techniques into a cohesive framework, enhancing its ability to reveal critical features in pathological images. Rigorous experimental validation demonstrated that our algorithm excels in key performance indicators such as accuracy, recall rate, and processing speed, underscoring its potential for broader applications in pathological image analysis and beyond.

Green communication is the demand of current and future wireless communication. As the next-generation communication network, cognitive radio network also needs to meet the requirements of green communication. Therefore, improving energy efficiency is an inevitable requirement for the development of cognitive radio networks. However, there is a need to compromise sensing performance while improving energy efficiency. To take into account the two important indicators of sensing performance and energy efficiency, a grouping algorithm is proposed in this article, which can effectively improve the energy efficiency while improving the spectrum sensing performance. The algorithm obtains the initial value of the reliability of the nodes through training, and sorts them according to the highest reliability value, then selects an even number of nodes with the highest reliability value, and divides the selected nodes into two groups, and the two groups of nodes take turns in Alternate work. At this time, other nodes not participating in cooperative spectrum sensing are in a silent state, waiting for the instruction of the fusion center. The experimental results show that compared with the traditional algorithm, the proposed algorithm has a great improvement in the two indicators of sensing performance and energy efficiency.

Multi-node cooperative sensing can effectively improve the performance of spectrum sensing. Multi-node cooperation will generate a large number of local data, and each node will send its own sensing data to the fusion center. The fusion center will fuse the local sensing results and make a global decision. Therefore, the more nodes, the more data, when the number of nodes is large, the global decision will be delayed. In order to achieve the real-time spectrum sensing, the fusion center needs to quickly fuse the data of each node. In this article, a fast algorithm of big data fusion is proposed to improve the real-time performance of the global decision. The algorithm improves the computing speed by reducing repeated computation. The reinforcement learning mechanism is used to mark the processed data. When the same environment parameter appears, the fusion center can directly call the nodes under the parameter environment, without having to conduct the sensing operation again. This greatly reduces the amount of data processed and improves the data processing efficiency of the fusion center. Experimental results show that the algorithm in this article can reduce the computation time while improving the sensing performance.

In multi-node cooperative sensing of cognitive networks, as the number of nodes increases, and the energy consumption must increase, but the sensing performance does not necessarily improve. The nodes with less information are not helpful for the sensing performance but will increase the unnecessary energy consumption. To improve the sensing performance and reduce the energy consumption of nodes, a dynamic node selection algorithm based on reinforcement learning is proposed in this paper. The algorithm can evaluate the reliability of sensing nodes in real-time, select the nodes with the highest reliability to participate in cooperative sensing, and update the reliability of nodes in real-time through the method of combining feedback energy consumption and sensing performance. In a real-time environment, nodes with high reliability are selected to participate in cooperative sensing, and the optimal balance between sensing performance and energy consumption is achieved. The experimental results show that the proposed algorithm can reduce energy consumption and improve the perception performance at the same time. Under the same conditions, the detection probability is 5% higher than that of the traditional method, while the energy consumption is only 16.7% of that of the traditional method.

In the process of learning and reasoning knowledge graph, the existing tensor decomposition technology only considers the direct relationship between entities in knowledge graph. However, it ignores the characteristics of the graph structure of knowledge graph. To solve this problem, a knowledge graph reasoning algorithm based on multihop relational paths learning (MHRP-learning) and tensor decomposition is proposed in this paper. Firstly, MHRP-learning is adopted to obtain the relationship path between entity pairs in the knowledge graph. Then, the tensor decomposition is performed to get a novel learning framework. Finally, experiments show that the proposed method achieves advanced results, and it is applicable to knowledge graph reasoning.