Dynamic Routing for Flying Ad Hoc Networks

This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive, and fast to deploy. This makes them a very attractive technology for many civilian and military applications. Due to the high mobility of the nodes, maintaining a communication link between the UAVs is a challenging task. The topology of these networks is more dynamic than that of typical mobile ad hoc networks (MANETs) and of typical vehicle ad hoc networks. As a consequence, the existing routing protocols designed for MANETs partly fail in tracking network topology changes. In this paper, the authors compare two different routing algorithms for ad hoc networks: optimized link-state routing (OLSR) and predictive OLSR (P-OLSR). The latter is an OLSR extension that the authors designed for FANETs; it takes advantage of the Global Positioning System (GPS) information available on board. To the best of the authors' knowledge, P-OLSR is currently the only FANET-specific routing technique that has an available Linux implementation. The authors present results obtained by both media-access-control (MAC) layer emulations and real-world experiments. In the experiments, the authors used a testbed composed of two autonomous fixed-wing UAVs and a node on the ground. The experiments evaluate the link performance and the communication range, as well as the routing performance. The emulation and experimental results show that P-OLSR significantly outperforms OLSR in routing in the presence of frequent network topology changes.


  • English

Media Info

Subject/Index Terms

Filing Info

  • Accession Number: 01598052
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Mar 15 2016 10:48AM