Performance Evaluation of Minimum Power Assignments Algorithms for Wireless Ad Hoc Networks
Festus K. Ojo, Josephine O. Ojelabi, Damilare O. Akande, Robert O. Abolade

Abstract
Energy consumption is a crucial issue in wireless ad hoc networks. Since many hosts in wireless ad hoc networks are usually powered by batteries, this makes the lifetime of a network to depend on the battery life of each individual host present. Minimizing the total energy consumption of each host is one of the major ways of improving the energy efficiency of a network. Therefore, a suitable minimum transmission power is assigned to wireless ad hoc communication station, such that single transmission of a node can be received by any node within its coverage area without affecting the performance of the system, thus reducing the total power consumed. This paper focuses on the performance evaluation of minimum power assignment Algorithms in wireless ad hoc network modeled in Matlab environment. The total power consumed by all the nodes in the network was minimized using the two min- total power assignment algorithms: greedy and Yao; and also the Minimum Spanning Tree (MST) based method. The performances of the three algorithms were evaluated and compared so as to determine the algorithm with the best reducing power. The simulation results show that the spanning ratios of communication graphs induced by using greedy- based and Yao-based power assignment methods are not as large as the MST-based method. Thus, the larger spanning ratio value of MST based method makes it to be less efficient in using it to solve minimum power assignments problem. It was observed that the Greedy and Yao based power assignment methods are suitable for power assignment tasks for wireless ad hoc networks due to their ability to have a bounded spanning ratio.

Full Text: PDF