An Improved Lifetime and Energy Consumption with Enhanced Clustering in WSNs

Awireless sensor network(WSN)is made up of sensor nodes that communicate via radio waves in order to conduct sensing functions.In WSN,the location of the base station is critical.Although base stations are fixed,they may move in response to data received from sensor nodes under specific conditions.Clustering is a highly efficient approach of minimising energy use.The issues of extending the life of WSNs and optimising their energy consumption have been addressed in this paper.It has been established that integrating mobile sinks into wireless sensor networks extends their longevity.Thus,this research proposes an optimal clustering and routing technique for optimising the energy usage and lifetime of WSNs.To minimise energy consumption,this research employs movable and stationary sink nodes.The K-Medoid clustering model is used to generate the initial number of nodes in the various clusters.After that,the cluster head is chosen using a hybrid Interval Type-2 Fuzzy technique that takes three aspects into account:residual energy,node centrality,and neighbourhood.A highly efficient backup cluster head(CH)collecting system can provide in significant energy savings while also prolonging the system’s life.Finally,better Reinforcement learning combined with a Genetic algorithm routing protocol is used to ensure effective data delivery.The suggested approach’s efficacy is evaluated in comparison to earlier approaches utilising residual node energy,delay or average delay,packet delivery ratio,throughput,network longevity,average energy consumption,and multiple alive nodes.In experiments,the proposed strategy outperforms existing strategies.

Ideal-Based k-Zero-Divisor Hypergraph of Commutative Rings

Let R be a commutative ring,I an ideal of R and k≥2 a fixed integer.The ideal-based k-zero-divisor hypergraph HkI(R)of R has vertex set ZI(R,k),the set of all ideal-based k-zero-divisors of R,and for distinct elements x1,x2,…,xk in ZI(R,k),the set{x1,x2,…,xk}is an edge in HkI(R)if and only if x1x2…xk∈I and the product of the elements of any(k-1)-subset of{x1,x2,…,xk}is not in I.In this paper,we show that H3I(R)is connected with diameter at most 4 provided that x^(2)(∈)I for all ideal-based 3-zero-divisor hypergraphs.Moreover,we find the chromatic number of H3(R)when R is a product of finite fields.Finally,we find some necessary conditions for a finite ring R and a nonzero ideal I of R to have H3I(R)planar.