Power-saving routing algorithms in wireless mesh networks: A survey

Abstract

In Wireless Mesh Networks, nodes often have a limited battery supply to use for the sending and reception of transmissions. By allowing nodes to relay messages for other nodes, the distance that needs to be bridged can be reduced, thus limiting the energy needed for a transmission. However, the number of transmissions a node needs to perform increases costing more energy. Power-aware routing refers to the mechanism of taking into account the remaining battery capacity of the node in order to decide on whether or not to relay traffic. The usage of nodes having low capacity should be avoided for relaying traffic. Efficient routing algorithm is used to find out cheapest route ie, based on number of hops within a mesh network. This refers to high load on some nodes, that in turn refer to uneven battery discharge over the nodes. So power aware routing is based on the amount of battery a node is having. In this paper, we present the related works on lowest consumption of energy, Tools used to simulate, we provide a comparative analysis. Finally we present the challenges in power-save routing algorithms in Wireless Mesh Networks.