This paper presents a new routing algorithm for maximizing the lifetime of a wireless ad hoc network. Our approach is to reduce the energy consumption at routing discovery phase and to establish suitable routing paths with respect to energy-saving. At the routing discovery phase, we use a dynamic flood filtering algorithm to eliminate the nodes that are predicted not to participate in the final routing paths. The prediction rules are based on energy requirement by each connection, energy availability at each node, and neighbor nodes' status. Finally, at the destination node, by using an energy-efficient route selection algorithm, the selected routing path would have small energy consumption with an ample residual energy capacity.
|Number of pages||12|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Publication status||Published - 2003|
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)