COMPARISON OF DIFFERENT ALGORITHMS TO COMPUTE THE CAPACITY OF WIRELESS NETWORK AND TO OPTIMIZE THE ENERGY CONSUMPTION

A mobile ad-hoc network is a kind of wireless ad-hoc network, and is a self-configuring network of mobile routers connected by wireless links - the union of which forms an arbitrary topology. The routers are free to move randomly and organize themselves arbitrarily; thus, the network's wireless topology may change rapidly and unpredictably. Such a network may operate in a standalone fashion, or may be connected to the larger Internet. Today wireless network has been evolved in a large number of applications, which rely on multi-hop. It is a self-organizing and rapidly deployable in which neither a wired backbone nor a centralized control exists. The node communicate message with others using wireless channels in a multi-hop fashion. A new paradigm of wireless wearable devices enabling instantaneous person-to-person, person-to-machine or machine-to-person communication. This paper examines and computes three different algorithms Minimum Energy Algorithm, An Expanding Ring Search Algorithms and New Power Routing Algorithm to compute the capacity of network for saving Energy.