Multi-objective Geographic Routing Protocol for Wireless Ad-hoc Networks
Narayanan Arjun, Shilpa Shashikant Chaudhari · 2018
In a network, communication between nodes is implemented through packets being sent and received with rates as high as hundreds per second over a distance ranging from a few meters to thousands of kilometers. When dealing with such high values it becomes necessary to conduct cost-effective route selection while ensuring timely delivery of packets. The objective of the route selection includes less traffic congestion, route stability, efficient power consumption and lesser number of intermediate hops. This paper proposes “Multi-Objective Geographic Routing Protocol“(MGRP) wherein next forwarder node is selected based on a cost function taking into account not only the amount of forward progress that can be achieved and least energy spent by a node to forward a packet but also the congestion levels of the nodes and availability of potential forwarders in the range of the one-hop neighbors of the current packet holder so that unnecessary queuing delays, re-routing and delivery failure are avoided. Since the protocol also considers congestion levels at neighboring nodes queuing delays at congested nodes are avoided with improvement in energy-economic, end-to-end transmission delay and a high success packet delivery rate. The simulation of the proposed protocol is done in NS-3. The results of the propsed model's algorithm is generated and compared with that of Congestion-Aware-Forwarder-Selection-Protocol(Cafs).It is seen that the hop count for packet delivery in the same topology is lesser for MGRP than CAFS. It is also seen that the success rate for MGRP is higher than CAFS under same conditions and simulation topologies. Therefore, MGRP is superior to its predecessor CAFS in terms of success rate and hop count.