The min-sum battery cost routing algorithm [12] minimizes the total cost of the route. More precisely, this algorithm
minimizes a summation of the inverse of remaining battery capacities for all nodes on the routing path. One drawback of
this algorithm is that it may select a rather short path containing mostly nodes with high remaining battery capacity but also
a few nodes with low remaining battery capacity. The cost of such a routing solution may be lower than that of a path with
a large number of nodes all having medium level of remaining battery capacity. However, the former routing solution is in
general less desirable from the network longevity point of view because such a path will become disconnected as soon as
the very first node on that path dies.