Research On Clustering Routing Algorithm In Cognitive Wireless Sensor Network

Cognitive radio sensor networks(CRSN)is a new intelligent radio communication network derived from wireless sensor networks(WSN).In many fields,such as marine exploration,wildlife protection,transportation,and military war,mobile sensor nodes need to be deployed in the network.Because the traditional WSN is faced with the problem of spectrum management,the design of the clustering routing protocol that can be applied to mobile CRSN nodes has become one of the current research hotspots.Based on the background of CRSN,aiming at the problems of high energy consumption of mobile nodes and low energy efficiency of clustering routing protocol,the main research work of this paper is as follows:1.This paper introduces the characteristics of WSN and CRSN and the application of CRSN in different fields,and briefly describes the clustering algorithm in WSN and CRSN.2.An event-based EMC algorithm for mobile cognitive radio sensor network clustering.This algorithm mainly solves the problems of constantly changing network topology structure,the unbalanced energy consumption of nodes,and high cluster maintenance cost caused by node movement in the cognitive radio sensor network.The algorithm is used to estimate according to the communication of nodes in the area of the residence time and standby nodes are divided into the qualified node,a combination of node movement direction,speed,the residual energy of nodes in the cluster,the estimated connection time features,such as direct clustering method is used to build a cluster,improve the stability of the cluster to guarantee the routing hop count at least.Experiments show that the EMC algorithm is superior to other related algorithms in cluster time,connectivity,and energy consumption.3.An optimal energy-sensing clustering algorithm ORC for dividing ring region in mobile CRSN is proposed.The algorithm mainly solves the problems of short network survival time,unbalanced energy consumption,and low node capacity efficiency caused by the uneven distribution of nodes in the network.A new routing algorithm is proposed for the circular network structure.ORC divides the network into several rings around the sink node according to the optimal communication distance,calculates the optimal cluster number and the optimal cluster size in the network,and uses the sink to balance the node density within each cluster so that the node density can be balanced.The simulation results show that the ORC algorithm reduces the energy consumption in the network and improves the network lifetime and node coverage.