Abstract
In wireless Ad-hoc networks, where mobile hosts are powered by batteries, the entire network may be partitioned because of the drainage of a small set of batteries. Therefore, the crucial issue is to improve the energy efficiency, with an objective of balancing energy consumption. A greedy algorithm called weighted minimum spanning tree (WMST) has been proposed, in which time complexity is O( n 2). This algorithm takes into account the initial energy of each node and energy consumption of each communication. Simulation has demonstrated that the performance of the proposed algorithm improves the load balance and prolongs the lifetime.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call