Bird Flight-Inspired Routing Protocol for Mobile Ad Hoc Networks
One of the major challenges in the research of mobile ad hoc networks is designing dynamic, scalable, and low cost (in terms of utilization of resources) routing protocols usable in real-world applications. Routing in ad hoc networks has been explored to a large extent over the past decade and different protocols have been proposed. They are based on a two-dimensional view of the ad hoc network geographical region, and are not always realistic. In this article, we propose a bird flight-inspired, highly scalable, dynamic, energy-efficient, and position-based routing protocol called Bird Flight-Inspired Routing Protocol (BFIRP). The proposed protocol is inspired by the navigation of birds over long distances following the great circle arc, the shortest arc connecting two points on the surface of a sphere. This sheds light on how birds save their energy while navigating over thousands of miles. The proposed algorithm can be readily applied in many real-world applications, as it is designed with a realistic three-dimensional view of the network's geographic region. In the proposed algorithm, each node obtains its location coordinates (X, Y, Z), and speed from the GPS (Global Positioning System); whereas, the destination's location coordinates (X, Y, Z), and speed are obtained from any other distributed localized service. Based on the location information, the source and each intermediate node choose their immediate neighbor as the next hop that has the maximum priority. The priority is calculated by taking into consideration the energy of the node, the distance between the node and the destination and the degree of closeness of the node to the trajectory of the great circle arc between the current node and the destination. The proposed algorithm is simulated in J-SIM and compared with the algorithms of Ad Hoc On Demand Distance Vector (AODV), and Most Forward Within Distance R (MFR) routing protocols. The results of the simulations show that the proposed BFIRP algorithm is highly scalable, and has low end-to-end delay compared to AODV. The algorithm is also simulated in various scenarios, and the results demonstrate that BFIRP is more efficient than AODV in energy and throughput by 20% and 15% respectively. It also shows satisfactory improvement over MFR in terms of throughput and routing overhead.
mobile ad hoc networks design great circle j-sim throughput performance bird flight energy-efficiency bandwidth