Energy efficient hierarchical routing algorithm in MANETs

Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile nodes forming a self configuring network. It does not use any existing infrastructure. The dynamic nature of MANETs and memory and energy constraints of mobile nodes require an effective routing algorithm. This paper proposes HEEMCORP routing algorithm. It is a hierarchical, energy efficient on demand routing algorithm. The simulation results prove that the proposed hierarchical routing algorithm provides better packet delivery ratio (in Kbits) and consumes less power than DSR and MTPR with the increase in number of nodes.

I. Introduction

In recent years, MANET field has attracted a lot of attention of researchers from academic side and industry. Mobile adhoc network is infrastructure less and ever changing topology network. The wireless communicating devices are small and inexpensive. The mobile devices are memory constrained. So they are not able to store all the routing information in it. They have to find their routes on-demand and on the fly. Hence, the on-demand routing protocols are designed for such memory constrained devices in mobile ad-hoc networks. It quickly determines the needed route information. The on-demand routing protocol is a multihop, reactive and unicast routing protocol. They are memory concerned routing protocols and they store minimum routing information. To cope up with the dynamic nature of MANETs and memory and energy constraints of mobile nodes, we need an effective routing algorithm. The proposed HEEMCORP (Hierarchical Energy Efficient Memory Constrained On-Demand Routing Protocol) routing algorithm is a hierarchical energy efficient on demand routing algorithm. The following sections are organized as follows: section II discusses about the routing in HEEMCORP protocol. Section III reveals about the hierarchical routing algorithm, section IV evaluates its performance and section V concludes the paper.