Optimal relay path selection and cooperative communication protocol for a swarm of UAVs

Dac Tu Ho, Esten Ingar Grøtli, Shigeru Shimamoto, Tor Arne Johansen

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

Abstract

In many applications based on the use of unmanned aerial vehicles (UAVs), it is possible to establish a cluster of UAVs in which each UAV knows the other vehicle's position. Assuming that the common channel condition between any two nodes of UAVs is line-of-sight (LOS), the time and energy consumption for data transmission on each path that connecting two nodes may be estimated by a node itself. In this paper1, we use a modified Bellman-Ford algorithm to find the best selection of relay nodes in order to minimize the time and energy consumption for data transmission between any UAV node in the cluster and the UAV acting as the cluster head. This algorithm is applied with a proposed cooperative MAC protocol that is compatible with the IEEE 802.11 standard. The evaluations under data saturation conditions illustrate noticeable benefits in successful packet delivery ratio, average delay, and in particular the cost of time and energy.

Original languageEnglish
Title of host publication2012 IEEE Globecom Workshops, GC Wkshps 2012
Pages1585-1590
Number of pages6
DOIs
Publication statusPublished - 2012 Dec 1
Event2012 IEEE Globecom Workshops, GC Wkshps 2012 - Anaheim, CA, United States
Duration: 2012 Dec 32012 Dec 7

Publication series

Name2012 IEEE Globecom Workshops, GC Wkshps 2012

Conference

Conference2012 IEEE Globecom Workshops, GC Wkshps 2012
CountryUnited States
CityAnaheim, CA
Period12/12/312/12/7

Keywords

  • CSMA/CA 802.11
  • Cooperative UAVs
  • cooperative MAC protocol
  • data relay network

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Optimal relay path selection and cooperative communication protocol for a swarm of UAVs'. Together they form a unique fingerprint.

Cite this