Joint Energy Predication and Gathering Data in Wireless Rechargeable Sensor Network

Wireless Sensor Network(WSNs)is an infrastructure-less wireless net-work deployed in an increasing number of wireless sensors in an ad-hoc manner.As the sensor nodes could be powered using batteries,the development of WSN energy constraints is considered to be a key issue.In wireless sensor networks(WSNs),wireless mobile chargers(MCs)conquer such issues mainly,energy shortages.The proposed work is to produce an energy-efficient recharge method for Wireless Rechargeable Sensor Network(WRSN),which results in a longer lifespan of the network by reducing charging delay and maintaining the residual energy of the sensor.In this algorithm,each node gets sorted using the K-means technique,in which the data gets distributed into various clusters.The mobile charges execute a Short Hamiltonian cycle opposite direction to reach each cluster’s anchor point.The position of the anchor points is calculated based on the energy distribution using the base station.In this case,the network will act as a spare MC,so that one of the two MCs will run out of energy before reaching the BS.After the current tours of the two MCs terminate,regression analysis for energy prediction initiates,enabling the updating of anchor points in the upcoming round.Based on thefindings of the regression-based energy prediction model,the recommended algorithm could effectively refill network energy.

The Cycle's Structure of Embedded Graphs in Surfaces

In this paper, the cycle＇s structure of embedded graphs in surfaces are studied. According to the method of fundamental cycles, the set C （C contains all shortest） is found. A undirected graph G with n vertices has at most O（N5） many shortest cycles; If the shortest cycle of G is odd cycle, then G has at most O（N3） many shortest cycles; If G has been embedded in a surface 8g （Ng, g is a constant）, then it has at most O（N3） shortest cycles, moreover, if the shortest cycle of G is odd cycle, then, G has at most O（N2） many shortest cycles. We can find a cycle base of G, the number of odd cycles of G, the number of even cycles of G, the number of contractible cycles of G, the number of non-contractible cycles of G, are all decided. If the ∏-embedded graph G has ∏-twosided cycles, then, C contains a shortest ∏-twosided cycle of G, there is a polynomially bounded algorithm that finds a shortest ∏-twosided cycle of a ∏-embedded graph G, the new and simple solutions about the open problem of Bojan Mohar and Carsten Thomassen are obtained.