A T-Based Lifetime Maximization Algorithm for Ad-Hoc Networks

This paper introduces a t-weighted routing algorithm to maximize the lifetime of ad-hoc networks. We consider the weight t of an edge as two parts: the time remaining for the transmission node to transmit data, and the time remaining for the receiving node to receive and forward data. To get the value of t, we apply a method called one node look-ahead (ONL). Then we bring forward a power-aware routing algorithm based on t to maximize the lifetime of networks. Simulation results show that our t-based lifetime maximization algorithm has a great effect on the improvement of ad-hoc networks´ lifetime.