Power Saving Mechanism in Clustered Ad-Hoc Networks

Abstract

In wireless Ad-Hoc networks, multihop transmission breaks the single hop path from a mobile node to another, into two or more hops, in a manner that the distances between transmitter and receiver are smaller than that in the direct transmission, which reduces the transmission power significantly. We have proposed the use of graph search algorithms to increase the power remaining at the destination node and to enhance the performance of clustering algorithms in mobile ad-hoc networks. Where we have organized the nodes of a cluster in a tree rooted by the leader in a manner that, instead of making a direct communication between two nodes distant to each other a distance x, we make a communication by multihop with many nodes in the path between the sender and the destination with distance shorter than x. Our simulation results have confirmed the proposed idea, where it was concluded that the power remaining at the destination will increase with the decreasing of the distance. Consecutively, the power consumption was reduced.