(This article proves that the number of hops that the source data packet takes to reach the base station under EB-SPR is at most 2 times that of the shortest path routing algorithm, so the network delay generated by the algorithm in this article has a clear upper bound. Simulation experiments show that EB-SPR It effectively prolongs the network life cycle and can generate small network delays.)
收藏
