Abstract

In three-dimensional wireless sensor networks, a topology with higher node degrees usually has many routes that consume less energy, but it increases the traffic load of the whole network. Therefore, the trade-off is between the node degree and the energy efficiency. In view of this question, this paper presents the definition and property of 3D r-neighbourhood graph, and uses the graph to balance the node degree and the energy efficiency of the whole network. This algorithm named NGTC, and it can adjust the structure of the networks to be a perfect state. Finally, the simulation results prove the advantage of this algorithm.

Full Text
Published version (Free)

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