Hop Adjusted Multi-chain Routing for Energy Efficiency in Wireless Sensor Networks

Abstract

This paper presents two new chain formation based routing protocols: Multi Chain Energy Efficient Greedy (MCEEG) routing and Hop Adjusted MCEEG (HA-MCEEG). The MCEEG protocol divides network area into rectangular subareas of equal size, such that each one contains equal number of randomly deployed nodes. In each rectangular subarea, minimum distance based next hop (Greedy algorithm) for data transmission is used and the sojourn locations are adjusted in a way that, at a time when data reaches to the terminator node, BS moves to sojourn location in that rectangular subregion. Thus, data is transmitted through shorter parallel routes instead of single lengthy route. HA-MCEEG protocol exploits the radio parameters for energy efficiency i.e., closely inspects the energy costs (transmission, reception, aggregation and amplification), avoids unnecessary data hopping and selects route with minimum energy cost. Simulation results show that the newly proposed protocols perform better than the selected existing protocol in terms of stability period, network lifetime, packet sending rate and scalability.