Lifetime Maximization Algorithm Of Ad-hoc Networks

This paper mainly studies the lifetime maximization routing algorithm in ad-hoc networks. In most ad-hoc networks, nodes are supplied by batteries, the study of power saving problem thus becomes a hot field. Communication is the main power consumption of ad-hoc networks, and energy aware routing is the most efficient way to save power of communication.This paper begins with the related knowledge of grid and ad-hoc networks, introduces some ad-hoc routing algorithm, and refers to the importance of power aware routing algorithm of ad-hoc networks. Then, we discuss the power saving method of the whole ad-hoc system. In an ad-hoc system, the power is either consumed by local computing or used by communication between nodes. Dynamic CPU frequency setting can partly save the power in local computing. For the communication between nodes, power aware routing is the most efficient way. In addition, switch the nodes that are not used for current communication to sleep can also save power consumption significantly. There also exists a balance between local computing and communication, some tasks may be low power consumption when computed locally, but others suits to compute remotely. To the point of power aware routing, we bring forward a lifetime maximization algorithm with one node look-ahead. This algorithm is weighted by the time that a node can keep working, such time metric can reflect the remaining energy of nodes obviously. When we choose a route, the node with maximum left power will be chosen, so as to balance the load of networks, implement the aim of network lifetime maximization. We discuss the one node look-ahead algorithm under unicast, broadcast and multicast, and properly solve the problem of route overlap under multicast. At last, we use NS-2 to simulate our algorithm, and get a satisfactory result.One node look-ahead network lifetime maximization algorithm brings forward a new thought in the field of power aware routing. Because of the juvenility in some aspects of the algorithm, we can't surpass some most advanced algorithm in performance in the world, but our algorithm will be maturity gradually, we believe our algorithm will advance the research of power aware routing of ad-hoc networks.