Traffic Allocation in Delay-Tolerant Wireless Ad Hoc Networks

We analyze the problem of minimizing the energy required to send a faced amount of data subject to delay constraints on portable networks. We develop a traffic allocation algorithm based on dynamic programming using a finite time horizon, and assuming that the network topology is uncertain. We demonstrate that portability reduces the energy consumption of wireless networks compared with stationary configurations. The proposed traffic allocation algorithm adaptively finds the optimal allocation strategy for the delay-constrained traffic by exploiting the statistics of portability in wireless networks. The quantitative results show that the proposed algorithm saves a total energy of up to 55% over a strategy which allocates a constant amount of traffic per stage