Clustering Optimization Algorithm for Unmanned Aerial Vehicle Formation Based on Ultraviolet Security Communication

Taifei Zhao; Kaixin Rong; Dandan Cao; Shuang Zhang

doi:10.3788/LOP202259.1306004

Journals >Laser & Optoelectronics Progress >Volume 59 >Issue 13 >Page 1306004 > Article

Laser & Optoelectronics Progress
Vol. 59, Issue 13, 1306004 (2022)

Clustering Optimization Algorithm for Unmanned Aerial Vehicle Formation Based on Ultraviolet Security Communication

Taifei Zhao^1、2、*, Kaixin Rong¹, Dandan Cao¹, and Shuang Zhang^1、2

Author Affiliations

¹Faculty of Automation and Information Engineering, Xi’an University of Technology, Xi’an 710048, Shaanxi , China

²Shaanxi Civil-Military Integration Key Laboratory of Intelligence Collaborative Networks, Xi’an 710000, Shaanxi , China

show less

DOI: 10.3788/LOP202259.1306004 Cite this Article Set citation alerts

Taifei Zhao, Kaixin Rong, Dandan Cao, Shuang Zhang. Clustering Optimization Algorithm for Unmanned Aerial Vehicle Formation Based on Ultraviolet Security Communication[J]. Laser & Optoelectronics Progress, 2022, 59(13): 1306004 Copy Citation Text

show less

Fig. 1. Rigid and deformable graphs. (a) Deformable graph; (b) rigid graph; (c) minimum rigid graph

Download full size

Fig. 2. Single scattering link model of ultraviolet light

Download full size

Fig. 3. Energy consumption model of inter-machine ultraviolet communication

Download full size

Fig. 4. Clustering model of the UAV formation

Download full size

Fig. 5. Communication link graph of different algorithms. (a) LEACH algorithm; (b) COAORG algorithm

Download full size

Fig. 6. Comparison of performance of different algorithms. (a) Number of survival nodes; (b) remaining energy; (c) data transfer amount

Download full size

Fig. 7. Number of cycles when the first node dies

Download full size

Fig. 8. Comparison of network lifetime

Download full size

Fig. 9. COAORG algorithm performance. (a) Survival nodes; (b) remaining energy

Download full size

Fig. 10. Time of death of the first node at different packet length

Download full size

Fig. 11. Network lifetime of different packet lengths

Download full size

Algorithm 1：generate the optimal rigidity graph between cluster heads
Input：location of the cluster head node $p$ ，number of cluster head nodes $n$ ，maximum UV LED communication radius $R$
Output：final set of communication links，the final UV LED communication radius communication radius
1 calculate the weight of communication links between all cluster head nodes
2 all links are listed in ascending order by weight
3 stiffness matrix is established according to the sorting results $M$
4 initialize $M^{'}$ ，that is $M^{'} = M (1)$
5 for $1 : n (n - 1) / 2$ search all links
6 while $r a n k (M^{'}) \leq 2 n - 3$
7 add the next row of $M$ to $M^{'}$ form a new matrix $M_{j}$
8 if $M_{j}$ is nonsingular
9 $M^{'} = M_{j}$
10 record the link corresponding to the row
11 else delete the row
12 end
13 end
14 end

Table 1. Generation process of optimal rigid graph

Parameter	Numerical value
Number of nodes $n$	100
Node initial energy $E_{0}$ /J	300
Send the energy consumption $E_{T}$ /μJ	80
Receive the energy consumption $E_{R}$ /μJ	80
Fusion energy consumption $E_{D A}$ /μJ	8
$β_{T}$ ， $β_{R}$ /（°）	40
$θ_{T}$ ， $θ_{R}$ /（°）	15
Weight coefficient	0.5

Table 2. Simulation parameter setting

Download Citation

Set citation alerts for the article

Tools

Set citation alerts for the article

Save the article for my favorites

Paper Information