2023
DOI: 10.1007/s11042-023-15932-7
|View full text |Cite
|
Sign up to set email alerts
|

Hedge transfer learning routing for dynamic searching and reconnoitering applications in 3D multimedia FANETs

Abstract: With the fast development of unmanned aerial vehicles (UAVs) and the user increasing demand of UAV video transmission, UAV video service is widely used in dynamic searching and reconnoitering applications. Video transmissions not only consider the complexity and instability of 3D UAV network topology but also ensure reliable quality of service (QoS) in flying ad hoc networks (FANETs). We propose hedge transfer learning routing (HTLR) for dynamic searching and reconnoitering applications to address this problem… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 52 publications
0
2
0
Order By: Relevance
“…These protocols cannot make effective communications in FANETs and must be improved to obtain good performance in these networks because they ignore the specific features of FANET such as the high dynamic topology, highly mobile nodes, and limited energy resources. Hence, it is very challenging to develop a routing protocol that provides reliable communication in FANETs [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…These protocols cannot make effective communications in FANETs and must be improved to obtain good performance in these networks because they ignore the specific features of FANET such as the high dynamic topology, highly mobile nodes, and limited energy resources. Hence, it is very challenging to develop a routing protocol that provides reliable communication in FANETs [13][14][15].…”
Section: Introductionmentioning
confidence: 99%
“…⃗ V max is the maximum relative velocity of one-hop neighbors in N is known as an unstable node, and vice versa. θ ip is calculated based on Equation (14).…”
mentioning
confidence: 99%