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

    15 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
    Event2012 IEEE Globecom Workshops, GC Wkshps 2012 - Anaheim, CA
    Duration: 2012 Dec 32012 Dec 7

    Other

    Other2012 IEEE Globecom Workshops, GC Wkshps 2012
    CityAnaheim, CA
    Period12/12/312/12/7

    Fingerprint

    Cooperative communication
    Unmanned aerial vehicles (UAV)
    Network protocols
    Data communication systems
    Energy utilization
    Costs

    Keywords

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

    ASJC Scopus subject areas

    • Computer Networks and Communications

    Cite this

    Ho, D. T., Grøtli, E. I., Shimamoto, S., & Johansen, T. A. (2012). Optimal relay path selection and cooperative communication protocol for a swarm of UAVs. In 2012 IEEE Globecom Workshops, GC Wkshps 2012 (pp. 1585-1590). [6477822] https://doi.org/10.1109/GLOCOMW.2012.6477822

    Optimal relay path selection and cooperative communication protocol for a swarm of UAVs. / Ho, Dac Tu; Grøtli, Esten Ingar; Shimamoto, Shigeru; Johansen, Tor Arne.

    2012 IEEE Globecom Workshops, GC Wkshps 2012. 2012. p. 1585-1590 6477822.

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

    Ho, DT, Grøtli, EI, Shimamoto, S & Johansen, TA 2012, Optimal relay path selection and cooperative communication protocol for a swarm of UAVs. in 2012 IEEE Globecom Workshops, GC Wkshps 2012., 6477822, pp. 1585-1590, 2012 IEEE Globecom Workshops, GC Wkshps 2012, Anaheim, CA, 12/12/3. https://doi.org/10.1109/GLOCOMW.2012.6477822
    Ho DT, Grøtli EI, Shimamoto S, Johansen TA. Optimal relay path selection and cooperative communication protocol for a swarm of UAVs. In 2012 IEEE Globecom Workshops, GC Wkshps 2012. 2012. p. 1585-1590. 6477822 https://doi.org/10.1109/GLOCOMW.2012.6477822
    Ho, Dac Tu ; Grøtli, Esten Ingar ; Shimamoto, Shigeru ; Johansen, Tor Arne. / Optimal relay path selection and cooperative communication protocol for a swarm of UAVs. 2012 IEEE Globecom Workshops, GC Wkshps 2012. 2012. pp. 1585-1590
    @inproceedings{8c2b236fe61c4b4ea3c8d1a47fd69b5b,
    title = "Optimal relay path selection and cooperative communication protocol for a swarm of UAVs",
    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.",
    keywords = "cooperative MAC protocol, Cooperative UAVs, CSMA/CA 802.11, data relay network",
    author = "Ho, {Dac Tu} and Gr{\o}tli, {Esten Ingar} and Shigeru Shimamoto and Johansen, {Tor Arne}",
    year = "2012",
    doi = "10.1109/GLOCOMW.2012.6477822",
    language = "English",
    isbn = "9781467349413",
    pages = "1585--1590",
    booktitle = "2012 IEEE Globecom Workshops, GC Wkshps 2012",

    }

    TY - GEN

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

    AU - Ho, Dac Tu

    AU - Grøtli, Esten Ingar

    AU - Shimamoto, Shigeru

    AU - Johansen, Tor Arne

    PY - 2012

    Y1 - 2012

    N2 - 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.

    AB - 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.

    KW - cooperative MAC protocol

    KW - Cooperative UAVs

    KW - CSMA/CA 802.11

    KW - data relay network

    UR - http://www.scopus.com/inward/record.url?scp=84875666574&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84875666574&partnerID=8YFLogxK

    U2 - 10.1109/GLOCOMW.2012.6477822

    DO - 10.1109/GLOCOMW.2012.6477822

    M3 - Conference contribution

    SN - 9781467349413

    SP - 1585

    EP - 1590

    BT - 2012 IEEE Globecom Workshops, GC Wkshps 2012

    ER -