Skip to content
naulon
Not checkedNot checked for notices yet.

Method of Geometric Connected Disk Cover Problem for UAV realy network deployment

Chuang Liu, Na Lv, Ke-fan Chen and 2 more

MATEC Web of Conferences · 2017

doi:10.1051/matecconf/201713900165 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

Aiming at the problem of the effective connectivity of a large number of mobile combat units in the future aeronautic swarm operation, this paper proposes an idea of using UAV(Unmanned Aerial Vehicle) to build, and studies the deployment of the network. User coverage and network connectivity are important for a relay network planning which are studied separately in traditional ways. In order to effectively combine these two factors while the network’s survivability is taken into account. Firstly, the concept of node aggregation degree is proposed. Secondly, a performance evaluation parameter for UAV relay network is proposed based on node aggregation degree, then analyzes the lack of deterministic deployment and presents one a PSO (VFA-PSO) deployment algorithm based on virtual force. Finally, compared with the existing algorithms, the validity and stability of the algorithm are verified. The experimental results show that the VFA-PSO algorithm can effectively improve the network coverage and the survivability of the network under the premise of ensuring the network connectivity, and has better deployment effect.

Abstract licence: CC BY

References4

    4 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.