CoChat

QMR:Q-learning based Multi-objective optimization Routing protocol for Flying Ad Hoc Networks

Open access
Liu, Jianmin, Wang, Qi, He, ChenTao, Jaffrès-Runser, Katia, Xu, Yida, Li, Zhenyu, Xu, YongJun · 2020 · Computer Communications
Cited by 177

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Abstract

A network with reliable and rapid communication is critical for Unmanned Aerial Vehicles (UAVs). Flying Ad Hoc Networks (FANETs) consisting of UAVs is a new paradigm of wireless communication . However, the highly dynamic topology of FANETs and limited energy of UAVs have brought great challenges to the routing design of FANETs. It is difficult for existing routing protocols for Mobile Ad Hoc Networks (MANETs) and Vehicular Ad Hoc Networks (VANETs) to adapt the high dynamics of FANETs. Moreover, few of existing routing protocols simultaneously meet the requirement of low delay and low energy consumption of FANETs. This paper proposes a novel Q-learning based Multi-objective optimization Routing protocol for FANETs to provide low-delay and low-energy service guarantees. Most of existing Q-learning based protocols use a fixed value for the Q-learning parameters. In contrast, Q-learning parameters can be adaptively adjusted in the proposed protocol to adapt to the high dynamics of FANETs. In addition, a new exploration and exploitation mechanism is also proposed to explore some undiscovered potential optimal routing path while exploiting the acquired knowledge. Instead of using past neighbor relationships, the proposed method re-estimates neighbor relationships in the routing decision process to select the more reliable next hop. Simulation results show that the proposed method can provide higher packet arrival ratio, lower delay and energy consumption than existing good performing Q-learning based routing method.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.comcom.2019.11.011

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 1 references

Cited by

See all 177

Metadata

Authors
Liu, J., Wang, Q., He, C., Jaffrès-Runser, K., Xu, Y., Li, Z., & Xu, Y.
Venue
Computer Communications
Publisher
Elsevier BV
Published
2020-01
Volume
150
Pages
304-316
ISSN
0140-3664 (ISSN-L)
OpenAlex
W2990310893
Cited by
177
References
1
FWCI
7.99
Type
journal article
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: QMR:Q-learning based Multi-objective optimization Routing protocol for Flying Ad Hoc Networks. https://app.cochat.ai/papers/10.1016/j.comcom.2019.11.011
The paper
Liu, J., Wang, Q., He, C., Jaffrès-Runser, K., Xu, Y., Li, Z., & Xu, Y. (2020). QMR:Q-learning based Multi-objective optimization Routing protocol for Flying Ad Hoc Networks. Computer Communications. https://doi.org/10.1016/j.comcom.2019.11.011

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.