I-PAR: Improved Petal Ant Routing Algorithm for Mobile Ad-Hoc Networks
B P Sathyaprakash, M. Jayaprasad, M Manjunath · 2017
Mobile Ad-hoc Network (MANET) is an infrastructureless, self-configuring, dynamic changing wireless ad-hoc network in which, each node forward packets in multi-hop fashion. Each node in MANET possess minimal transmission range, minimal energy and minimal computational capacity. Thus, each attributes of MANET escalating attention of researchers. In MANET, various exicting and serious issues emerges due to limited resources. The limited resources of wireless network combined with the highly dynamic routing infrastructure need additional attention because packets may traverse with longer path and can get lost in a network. Therefore, the lost packet needs to be retransmitted which results in doubling the overall delay in the network. In this research article, we present an improved version of Petal Ant Routing (PAR) which makes data packets traverse within the petal region and achieve lesser delay of the packets. The simulation results shows that, the proposed method achieve better performance by reducing the overall delay of the packet and provide better throughput than actual PAR algorithm.