The synchronization of periodic routing messages
IEEE/ACM Transactions on Networking (TON)
Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Trajectory based forwarding and its applications
Proceedings of the 9th annual international conference on Mobile computing and networking
GLR: a novel geographic routing scheme for large wireless ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Navigation and Guidance Planning for Air Vehicles
ICTAI '08 Proceedings of the 2008 20th IEEE International Conference on Tools with Artificial Intelligence - Volume 02
BLR: beacon-less routing algorithm for mobile ad hoc networks
Computer Communications
Position-based routing in ad hoc networks
IEEE Communications Magazine
IEEE Communications Magazine
A survey on position-based routing in mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
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.