Location aware and energy efficient routing protocol for long distance MANETs

Mobile ad-hoc networks (MANETs) comprise a set of power-constrained mobile nodes. They enable multi-hop peer-to-peer routing without any requirement of predefined infrastructure for its deployment. The topology of MANETs change dynamically which necessitates development of efficient routing protocols for message packets that reduce energy consumption, congestion and propagation delays. Existing routing protocols such as BRAWN, AODV and DSDV improve the quality of service (QoS) in MANETs only when there are less number of hops and nodes close to each other. Determining an efficient route for packets considering the current location of nodes is a challenging task, especially when the distance between the nodes is too long in a MANET. In this paper, we present an efficient protocol to maintain higher QoS in MANETS. In addition to bandwidth and data rate, additional parameters namely queuing delay, distance and energy are incorporated in order to dynamically compute the paths for a specific communication with minimum delay. We provide a theoretical approach to determine multiple efficient paths and to rank them. We also use information of node position that is captured periodically for computing the latest direct distance between any two nodes. We illustrate the effectiveness of our proposed protocol with examples.