摘要：An optimal control advance is used to solve the problem of routing in sensor networks where the goal is to maximize the network’s lifetime. In our analysis, the energy sources (batteries) at nodes are not assumed to be “ideal” but quite behaving according to a dynamic energy use model, which captures the nonlinear behavior of actual batteries. We show that in a permanent topology case there exists an optimal policy consisting of time-invariant routing probabilities, which may be obtained by solving a set of relatively simple nonlinear programming (NLP) problems. We also show that this optimal policy is, under very mild conditions, robust with admiration to the battery model used. Further, we consider a joint routing and initial energy allocation problem over the network nodes with the same network lifetime maximization objective. We show that the solution to this problem is given by a policy that depletes all node energies at the same time and that the Equivalent energy allocation and routing probabilities are obtained by solving an NLP problem. Numerical examples are included to display the optimality of the time-invariant policy and its robustness with admiration to the battery model used.
