Research On Event-driven Clustering Routing Algorithms In Cognitive Wireless Sensor Networks

Cognitive Radio Sensor Networks(CRSN)is a new type of communication network formed by the combination of Wireless Sensor Network(WSN)and Cognitive Radio(CR)technology.The emergence of CRSN has effectively alleviated the problem of spectrum shortage in WSN.Traditional WSN and CR network routing protocols cannot be directly applied to CRSN,so it is necessary to design a routing protocol suitable for CRSN.In response to the energy and dynamic spectrum challenges in CRSN,this paper has done the following work:First,in response to the uneven energy consumption of the nodes in CRSN,to balance energy consumption between nodes and prolong the life of the network,an event-driven clustering routing algorithm based on fuzzy logic(FLECR)is proposed.The algorithm will have the advantages of self-organization.More common channel nodes are aggregated into clusters.Using the fuzzy logic mechanism,cluster heads are determined according to node residual energy,node neighbor degree,and node relay degree,and efficient inter-cluster routing is performed through cluster heads and gateway nodes in a multi-hop manner.Improved connectivity between clusters.The simulation results show that the FLECR algorithm performs well in terms of energy consumption,network load balancing,packet transmission rate,and network life cycle in multi-round event triggering CRSN.Secondly,for the problem of frequent clustering due to PU activity in CRSN,to improve clustering stability and routing link stability,a bipartite graph clustering routing algorithm based on channel stability(CSBGCR)is proposed.The algorithm will be based on the historical state of the channel,the stability of the channel is calculated,the channel with high channel stability is preferentially assigned as the transmission channel,and the clustering is performed on-demand through the bipartite graph to ensure that there is a set of available channels in the cluster and the number of nodes that need to be re-clustered to minimize,the optimal link is determined by considering the channel stability on the two-hop link,which reduces the energy consumption and routing interruption problems caused by channel switching.The simulation results show that the CSBGCR algorithm performs well in terms of average node energy consumption,throughput,packet transmission rate,and end-to-end delay.Finally,the full text is summarized,and some optimization schemes and future development directions are proposed.