Energy-Efficient Modified Bellman Ford Algorithm for Grid and Random Network Topologies

Abstract

Energy-efficient routing techniques are required for mobile ad hoc Networks (MANETs) to improve the lifetime of the network. The lifetime of the network depends on the battery capacity of nodes. The link failure due to the battery discharge of node can be avoided by considering the nodes having good residual energy (RE) with less change in their battery capacity. In this paper, the Bellman–Ford algorithm (BFA) is considered to find the shortest path for routing. Bellman–Ford algorithm is modified and the nodes whose change in battery capacity is less than a predefined threshold value are considered for routing to avoid the link failures and to enhance the lifetime of the network. In the proposed modified Bellman–Ford algorithm (MBFA), residual energy (RE) is considered as a metric to find the shortest path. IEEE 802.11 a/g standards using orthogonal frequency division multiplexing (OFDM) are considered for simulation. Energy consumed by the radio transceiver, processor, losses in the battery, and DC–DC converter are taken into consideration for energy calculation. The performance of BFA and MBFA for the grid and random network topologies is simulated by considering the network with multiple sources and destinations are compared with and without mobility by assuming various densities, i.e., 15, 30, 45, and 60. The mobility of the node increases the loss of orthogonality among the OFDM subcarriers and results inter carrier interference (ICI). The effect of mobility and network size on throughput, delay, jitters for the grid, and random network topologies using BFA and MBFA are compared. Simulation results show that the performance of proposed MBFA is better compared to BFA.