Abstract
In this paper, an algorithm is proposed to optimize the network connectivity efficiency of a network with nodes of different energy harvesting rates by using the fewest RNs while ensuring a high success rate of data transmission. The algorithm calculates the weight of each node based on the energy harvesting capacity and then uses it to calculate the edge weight. Next, based on the edge weight, the Kruskal algorithm is used to create a minimum spanning tree (MST). Finally, the quantity of non-leaf nodes of the MST is inspected to verify that it meets the transmission requirements for data flow. If not, such nodes will be deemed as nodes with a low energy capacity. The support of RNs is required for these nodes to guarantee network connectivity. As shown by experimental data, the algorithm can be used to maintain network connectivity with the fewest RNs, which reduces the cost and increases the transmission success rate of data packages.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
