[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN111601355B - Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology - Google Patents

Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology Download PDF

Info

Publication number
CN111601355B
CN111601355B CN202010274949.6A CN202010274949A CN111601355B CN 111601355 B CN111601355 B CN 111601355B CN 202010274949 A CN202010274949 A CN 202010274949A CN 111601355 B CN111601355 B CN 111601355B
Authority
CN
China
Prior art keywords
unmanned aerial
aerial vehicle
uav
path
communication
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010274949.6A
Other languages
Chinese (zh)
Other versions
CN111601355A (en
Inventor
赵太飞
程敏花
张健伟
史少雄
薛蓉莉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shaoxing City Shangyu District Shunxing Electric Power Co ltd
Shenzhen Hongyue Information Technology Co ltd
State Grid Zhejiang Electric Power Co Ltd Shaoxing Shangyu District Power Supply Co
State Grid Zhejiang Electric Power Co Ltd Yuyao Power Supply Co
Original Assignee
State Grid Zhejiang Electric Power Co Ltd Shaoxing Shangyu District Power Supply Co
State Grid Zhejiang Electric Power Co Ltd Yuyao Power Supply Co
Shaoxing City Shangyu District Shunxing Electric Power Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by State Grid Zhejiang Electric Power Co Ltd Shaoxing Shangyu District Power Supply Co, State Grid Zhejiang Electric Power Co Ltd Yuyao Power Supply Co, Shaoxing City Shangyu District Shunxing Electric Power Co ltd filed Critical State Grid Zhejiang Electric Power Co Ltd Shaoxing Shangyu District Power Supply Co
Priority to CN202010274949.6A priority Critical patent/CN111601355B/en
Publication of CN111601355A publication Critical patent/CN111601355A/en
Application granted granted Critical
Publication of CN111601355B publication Critical patent/CN111601355B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B10/00Transmission systems employing electromagnetic waves other than radio-waves, e.g. infrared, visible or ultraviolet light, or employing corpuscular radiation, e.g. quantum communication
    • H04B10/11Arrangements specific to free-space transmission, i.e. transmission through air or vacuum
    • H04B10/112Line-of-sight transmission over an extended range
    • H04B10/1129Arrangements for outdoor wireless networking of information
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B7/00Radio transmission systems, i.e. using radiation field
    • H04B7/14Relay systems
    • H04B7/15Active relay systems
    • H04B7/185Space-based or airborne stations; Stations for satellite systems
    • H04B7/18502Airborne stations
    • H04B7/18506Communications with or from aircraft, i.e. aeronautical mobile service
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W40/00Communication routing or communication path finding
    • H04W40/02Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/12Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/02Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
    • H04W84/04Large scale networks; Deep hierarchical networks
    • H04W84/06Airborne or Satellite Networks
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Computing Systems (AREA)
  • Electromagnetism (AREA)
  • Astronomy & Astrophysics (AREA)
  • Aviation & Aerospace Engineering (AREA)
  • General Physics & Mathematics (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

The invention provides an optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology, which comprises the steps of firstly, utilizing an ultraviolet light non-direct vision single scattering model to establish an inter-machine communication path; setting a path weight by using the path loss of the communication link and the residual energy of the node; and finally, utilizing the path weight value to form an optimal communication path between any unmanned aerial vehicle nodes in the queue through a Floyd algorithm. The wireless ultraviolet light is adopted to cooperate with unmanned aerial vehicle bee colony formation flight, so that the unmanned aerial vehicle bee colony formation flight has the advantages of all weather, non-direct vision, no radio frequency interference, secret communication and the like, and can provide effective guarantee for unmanned aerial vehicle bee colony to successfully execute tasks in a strong electromagnetic interference environment. The path weight is set according to the path loss of the communication link and the residual energy of the node, so that the situation that the same path is selected for many times in the communication process and the energy of the node of the path is ignored can be avoided, the node is dead too early, and the life cycle of the network is prolonged.

Description

Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology
Technical Field
The invention belongs to the technical field of photoelectric information, and particularly relates to an optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology.
Background
In recent years, the emerging industry associated with unmanned aerial vehicles has come to a high-speed development stage. Unmanned aerial vehicles play an important role in civil and military fields. Because the single unmanned aerial vehicle has limited computing, detecting and operating capabilities, the capability of the unmanned aerial vehicle to execute tasks can be fully improved by using a multi-unmanned aerial vehicle cooperation form. The unmanned aerial vehicle 'bee colony' formation is formed by a group of miniature unmanned aerial vehicles which are networked independently to cooperatively work, has the excellent characteristics of low cost, high destruction resistance, good perceptibility, strong cooperation capability, distributed functions and the like, and can greatly improve the task completion efficiency.
The unmanned aerial vehicle communication network has self-organizing characteristic, and the electronic system is extremely easy to be influenced by electromagnetic pulse, radio frequency interference, high-intensity radiation field and the like, so that the adoption of an unmanned aerial vehicle cluster internal communication mode with high anti-interference capability is urgent. The unmanned aerial vehicle bee colony adopts a wireless ultraviolet communication technology in flight, and has the following advantages: the background noise is small; the anti-interference capability is strong; all-weather non-line-of-sight (NLOS) communication; low power consumption and easy integration. The wireless ultraviolet communication technology is applied to communication among unmanned aerial vehicle swarm machines, and can meet the reliable secret communication requirement of the unmanned aerial vehicle in a complex battlefield environment.
Unmanned aerial vehicle formation carries the energy limited in practical application, when unmanned aerial vehicle keeps the in-process at the formation, when certain unmanned aerial vehicle transmits the message or carries out the instruction to other arbitrary unmanned aerial vehicle, through setting up reasonable route weight and seek a minimum route of communication cost, can effectively reduce the transmission power and the total power of system of individual node, avoid selecting same route and neglecting the energy condition of node many times in communication process, the energy consumption of balanced unmanned aerial vehicle node, extension unmanned aerial vehicle network life cycle. Therefore, an optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology is provided. .
It is noted that this section is intended to provide a background or context for the embodiments of the invention that are recited in the claims. The description herein is not admitted to be prior art by inclusion in this section.
Disclosure of Invention
The invention aims to provide an optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology, which solves the problem of reliability of communication among unmanned aerial vehicle formation machines, balances energy consumption of unmanned aerial vehicle nodes and prolongs network life cycle.
The invention adopts the following technical scheme to realize the purposes:
the optimal path selection method in the wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology is characterized by comprising the following steps of:
s1: establishing an inter-machine communication path by using an ultraviolet light non-direct vision single scattering model;
s2: setting a path weight value by using the path loss of the communication link and the residual energy of the node;
s3: and utilizing the path weight value to obtain an optimal communication path between any unmanned aerial vehicle nodes in the formation through a Floyd algorithm.
Further, the step S2 specifically includes the following steps:
s201: calculating the path loss of the communication links of the two unmanned aerial vehicle nodes;
based on an ellipsoidal coordinate system, respectively placing an ultraviolet light emitting device and a receiving device on two focuses of the ellipsoidal coordinate system, wherein the path loss of ultraviolet light non-direct-view communication is as follows:
L=ξr α (1)
where r is the communication distance, ζ is the path loss factor, and α is the path loss index;
s202: calculating the residual energy of the unmanned aerial vehicle node;
after formation is completed, the residual energy of each unmanned aerial vehicle node is as follows:
wherein e 0 The initial energy of unmanned plane node, P is mobile energy consumption, m p Is the effective load mass, the unit is kg, m v Is the mass of the unmanned aerial vehicle, the unit is kg, r is lift-drag ratio, eta is energy transfer efficiency of a motor and a propeller, p is power consumption of an electronic device, the unit is kW, and v=d ii And/t is the average speed in the process of unmanned aerial vehicle aggregation, and the unit is km/h and d ii The distance from the initial position to the fixed position in the formation in the unmanned aerial vehicle gathering process is the gathering time;
s203: setting a path weight;
setting a path weight according to the calculated path loss and the residual energy of each node:
wherein alpha is 1 And alpha is 2 For the weight coefficient, L is the path loss of the communication link,as the average value of the path loss of the communication link,e is the energy average value of node surplus rest Energy is left for the node.
Further, the step S3 is specifically as follows:
s301: initializing unmanned aerial vehicle UAV i And UAV (unmanned aerial vehicle) j When the path weight between the unmanned aerial vehicle and the unmanned aerial vehicle can be directly communicated, the unmanned aerial vehicle UAV is calculated by utilizing the step S2 i And UAV (unmanned aerial vehicle) j Path weights between; when the communication between two unmanned aerial vehicles needs to be forwarded through other unmanned aerial vehicle nodes, the path weight is infinite;
s302: in unmanned aerial vehicle UAV i And UAV (unmanned aerial vehicle) j Inter-vertex added UAV 1 Comparing UAVs i ,UAV 1 With UAV j And UAV (unmanned aerial vehicle) i With UAV j Taking the path with small weight as UAV i To UAV (unmanned aerial vehicle) j An optimal path having a vertex number of not more than 1;
s303, in unmanned aerial vehicle UAV i To UAV (unmanned aerial vehicle) j Inter-vertex added UAV 2 Obtaining UAV i ,...,UAV 2 And UAV (unmanned aerial vehicle) 2 ,...,UAV j Wherein the UAV i ,...,UAV 2 Is a UAV (unmanned aerial vehicle) i To UAV (unmanned aerial vehicle) 2 An optimal path with a middle vertex number not greater than 1; UAV (unmanned aerial vehicle) 2 ,...,UAV j Is a UAV (unmanned aerial vehicle) 2 To UAV (unmanned aerial vehicle) j An optimal path with a middle vertex number not greater than 1; UAV (unmanned aerial vehicle) i ,...,UAV 2 ,...,UAV j Comparing with the optimal path obtained in step S302, taking the shorter path as UAV i To UAV (unmanned aerial vehicle) j An optimal path with a middle vertex number not greater than 2;
s304, by analogy, the UAV is obtained in the n-1 th step after n times of comparison and correction i To UAV (unmanned aerial vehicle) j And the number of the middle top point is not greater than n-1 is the optimal path of any two-node UAV in unmanned aerial vehicle formation i To UAV (unmanned aerial vehicle) j Is provided for the optimal communication path of (a).
The invention has the beneficial effects that:
1) The wireless ultraviolet light is adopted to cooperate with unmanned aerial vehicle bee colony formation flight, so that the unmanned aerial vehicle bee colony formation flight has the advantages of all weather, non-direct vision, no radio frequency interference, secret communication and the like, and can provide effective guarantee for unmanned aerial vehicle bee colony to successfully execute tasks in a strong electromagnetic interference environment.
2) The invention sets the path weight according to the path loss of the communication link and the residual energy of the node, and can avoid the condition that the same path is selected for many times in the communication process to ignore the energy of the path node, thereby leading to premature death of the node and prolonging the life cycle of the network.
Drawings
FIG. 1 is a flow chart of a method for selecting an optimal path in a wireless ultraviolet light cooperative unmanned aerial vehicle formation holding topology;
FIG. 2 is a diagram of an ultraviolet light non-direct view single scattering communication model of the present invention;
FIG. 3 is a diagram of the relationship between transmit and receive elevation and path loss in accordance with the present invention;
fig. 4 is a topology structure diagram of an unmanned aerial vehicle formation flight network according to the present invention.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. However, the exemplary embodiments may be embodied in many forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of the example embodiments to those skilled in the art. The described features or characteristics may be combined in any suitable manner in one or more embodiments.
As shown in fig. 1, assuming that the initial states of the nodes of the swarm unmanned aerial vehicle are equal before the nodes are gathered, the remaining energy of the nodes of the unmanned aerial vehicle is different after the unmanned aerial vehicle reaches the internal fixed position of the formation after the gathering is completed. And wireless ultraviolet light is used for assisting communication among the swarm unmanned aerial vehicles, and the path loss of a communication link is obtained according to the characteristics of ultraviolet light NLOS communication. The path weight is set according to the path loss and the residual energy of the nodes, and the Floyd algorithm is adopted to select the optimal communication path between any nodes in the unmanned aerial vehicle formation, so that the situation that the same node is selected for forwarding information for many times in the communication process, so that the node is insufficient in energy and dies can be avoided, and the life cycle of the unmanned aerial vehicle network is effectively prolonged.
The invention relates to an optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology, which is implemented according to the following steps:
and step 1, establishing an inter-machine communication path by using an ultraviolet light non-direct vision single scattering model.
As shown in fig. 2, the ultraviolet light emitting device and the receiving device are respectively placed on two focuses of an ellipsoidal coordinate system based on the ellipsoidal coordinate system. θ 1 To transmit elevation angle, θ 2 To receive elevation angle phi 1 To send the end divergence angle phi 2 For the receiving end view angle.
The path loss of the ultraviolet light non-direct vision communication is as follows:
L=ξr α (1)
where r is the communication distance, ζ is the path loss factor, and α is the path loss index. The values of alpha and xi depend on the divergence angle phi of the transmitting end 1 Elevation angle θ of transmission 1 Angle phi of view at receiving end 2 Receiving elevation angle theta 2 When the divergence angle of the transmitting end and the view angle of the receiving end are fixed, different values of alpha and zeta are corresponding to different receiving and transmitting elevation angles for communication, namely the path loss values of communication links among unmanned aerial vehicles are different.
And 2, setting a path weight value by using the path loss of the communication link and the residual energy of the node.
And 2.1, calculating the path loss of the communication links of the two unmanned aerial vehicle nodes.
As can be seen from step 1, when phi 1 And phi 2 When the unmanned aerial vehicle is fixed, the space angle parameter theta of the receiving and transmitting end between unmanned aerial vehicles is randomly given 1 And theta 2 The path loss between the two unmanned aerial vehicles can be determined. As shown in the diagram of the relation between the transmission and reception elevation angle and the path loss in FIG. 3, when phi 1 =17°,φ 2 =30°When the receiving and transmitting end space angle parameter theta between unmanned aerial vehicles is randomly given 1 And theta 2 The path loss of the two drone communication links may be determined.
And 2.2, calculating the residual energy of the unmanned aerial vehicle node.
The energy of each unmanned aerial vehicle node at the initial position is equal, each unmanned aerial vehicle moves to the internal fixed position of the formation from the initial position in the gathering process, the consumed communication energy is approximately equal, and the mobile energy consumption is far greater than the communication energy consumption, so that only the mobile energy consumption is considered in the gathering process. After formation is completed, the residual energy of each unmanned aerial vehicle node is as follows:
wherein e 0 For the initial energy of each unmanned plane node, P is mobile energy consumption, m p Is the payload mass (kg), m v Is the mass (kg) of the unmanned aerial vehicle, r is the lift-drag ratio, eta is the energy transfer efficiency of the motor and the propeller, p is the power consumption (kW) of the electronic device, v=d ii And/t is the average speed (km/h) in the process of unmanned plane aggregation, d ii The distance from the initial position to the fixed position in the formation in the unmanned aerial vehicle gathering process is the gathering time.
And 2.3, setting a path weight.
The topology structure of the communication network among the clusters of the unmanned aerial vehicle formation is shown in fig. 4, each unmanned aerial vehicle corresponds to a fixed ID number, the numbers 1-9 respectively represent nine unmanned aerial vehicles, a connecting line between the unmanned aerial vehicles represents a communication path, the path between two nodes represents that the two nodes are in a communication range of each other, direct communication can be carried out, and at least one path between any two unmanned aerial vehicles in the figure is communicated. The link for direct communication sets a path weight by the formula (3), and the path weight for which direct communication is impossible is set to infinity.
Wherein alpha is 1 And alpha is 2 For the weight coefficient, L is the path loss of the communication link,as the average value of the path loss of the communication link,e is the energy average value of node surplus rest Energy is left for the node.
And 3, utilizing a path weight value to form an optimal communication path between any unmanned aerial vehicle nodes in the team by using a Floyd algorithm.
Step 3.1, initializing UAV from step 2 i And UAV (unmanned aerial vehicle) j Path weights between.
Step 3.2, in UAV i ,UAV j Inter-vertex added UAV 1 Comparison (UAV) i ,UAV 1 ,UAV j ) Sum (UAV) i ,UAV j ) Taking the path with small weight as UAV i To UAV (unmanned aerial vehicle) j And the vertex number is not greater than 1.
Step 3.3, at UAV i To UAV (unmanned aerial vehicle) j Inter-vertex added UAV 2 Get (UAV) i ,...,UAV 2 ) Sum (UAV) 2 ,...,UAV j ). Wherein, (UAV) i ,...,UAV 2 ) Is a UAV (unmanned aerial vehicle) i To UAV (unmanned aerial vehicle) 2 An optimal path with a middle vertex number not greater than 1; (UAV (UAV) 2 ,...,UAV j ) Is a UAV (unmanned aerial vehicle) 2 To UAV (unmanned aerial vehicle) j The optimal path of the middle vertex number not greater than 1, both paths being found in step 3.2. Will (UAV) i ,...,UAV 2 ,...,UAV j ) Comparing with the optimal path obtained in step 3.2, taking the shorter path as UAV i To UAV (unmanned aerial vehicle) j Optimal path with intermediate vertex number not greater than 2
Step 3.4, and so on, after n comparisons and corrections, the UAV will be found in step (n-1) i To UAV (unmanned aerial vehicle) j The optimal path with the middle vertex number not larger than n-1 is the UAV of any two nodes in the unmanned aerial vehicle formation i To UAV (unmanned aerial vehicle) j Is provided for the optimal communication path of (a).
Examples:
step 1, each unmanned aerial vehicle is provided with an ultraviolet light receiving and transmitting device, the ultraviolet light wavelength emitted by an ultraviolet light emitting device is 260nm, and the luminous power is 0.6mw.
Step 2, fixing the divergence angle phi of the transmitting end and the view field angle phi of the receiving end 1 =17°, receiving end field angle Φ 2 =30°, randomly giving the spatial angle parameters of the transceiver end between the unmanned aerial vehicles, and the obtained relationship between the transmission and reception elevation angles and the path loss is shown in fig. 3. m is m p =2kg,m v =8kg,r=3,η=0.5,p=0.1kW,e 0 =300J,v=d ii And/t. From the formulaAnd calculating the residual energy of each unmanned aerial vehicle node after formation is completed.
From the path weight formulaAnd FIG. 4 is a structural diagram of unmanned aerial vehicle formation flight network topology, and a path weight matrix of the unmanned aerial vehicle network topology is obtained by calculation, wherein the path weight matrix is as follows:
A=[0 0.9950 1.2566 1.0788 inf inf inf inf inf;0.9950 0 1.2314 inf inf 0.9912 1.8027 inf inf;1.2566 1.2314 0 1.0314 0.9192 0.9811 inf inf inf;1.0788 inf 1.0314 0 1.0148 inf inf inf inf;inf inf 0.9192 1.0148 0 inf inf inf 1.0377;inf 0.9912 0.9811 inf inf 0 inf 0.8563 1.0583;inf 1.8027 inf inf inf inf 0 0.8353 inf;inf inf inf inf inf 0.8563 0.83530 0.9744;inf inf inf inf 1.0377 1.0583 inf 0.9744 0];
and 3, simulating according to the Floyd algorithm, inputting node IDs of any two unmanned aerial vehicles as a starting point and a finishing point, and outputting the node ID for obtaining the optimal communication path, namely the optimal communication path selected when any two nodes in unmanned aerial vehicle formation communicate.
(1) Input starting point: 1, a step of; input end point: 9, a step of performing the process;
optimal communication path: 1-2-6-9
(2) Input starting point: 3, a step of; input end point: 7, preparing a base material;
optimal communication path: 3-6-8-7
Other embodiments of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the invention and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the invention being indicated by the following claims.

Claims (2)

1. The optimal path selection method in the wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology is characterized by comprising the following steps of:
s1: establishing an inter-machine communication path by using an ultraviolet light non-direct vision single scattering model;
s2: setting a path weight value by using the path loss of the communication link and the residual energy of the node;
s201: calculating the path loss of the communication links of the two unmanned aerial vehicle nodes;
based on an ellipsoidal coordinate system, respectively placing an ultraviolet light emitting device and a receiving device on two focuses of the ellipsoidal coordinate system, wherein the path loss of ultraviolet light non-direct-view communication is as follows:
L=ξr α (1)
where r is the communication distance, ζ is the path loss factor, and α is the path loss index;
s202: calculating the residual energy of the unmanned aerial vehicle node;
after formation is completed, the residual energy of each unmanned aerial vehicle node is as follows:
wherein e 0 Is the beginning of unmanned plane nodeInitial energy, P is mobile energy consumption, m p Is the effective load mass, the unit is kg, m v Is the mass of the unmanned aerial vehicle, the unit is kg, r is lift-drag ratio, eta is energy transfer efficiency of a motor and a propeller, p is power consumption of an electronic device, the unit is kW, and v=d ii And/t is the average speed in the process of unmanned aerial vehicle aggregation, and the unit is km/h and d ii The distance from the initial position to the fixed position in the formation in the unmanned aerial vehicle gathering process is the gathering time;
s203: setting a path weight;
setting a path weight according to the calculated path loss and the residual energy of each node:
wherein alpha is 1 And alpha is 2 As the weight coefficient, alpha 12 =1, l is the path loss of the communication link,for the communication link path loss mean +.>E is the energy average value of node surplus rest Surplus energy for the node;
s3: and utilizing the path weight value to obtain an optimal communication path between any unmanned aerial vehicle nodes in the formation through a Floyd algorithm.
2. The method for selecting an optimal path in a wireless ultraviolet light cooperative unmanned aerial vehicle formation holding topology according to claim 1, wherein the step S3 is specifically as follows:
s301: initializing unmanned aerial vehicle UAV i And UAV (unmanned aerial vehicle) j When the path weight between the unmanned aerial vehicle and the unmanned aerial vehicle can be directly communicated, the unmanned aerial vehicle UAV is calculated by utilizing the step S2 i And UAV (unmanned aerial vehicle) j Path weights between; when communication between two unmanned aerial vehicles needs to pass through other unmanned aerial vehiclesWhen the machine node forwards the message, the path weight is infinite;
s302: in unmanned aerial vehicle UAV i And UAV (unmanned aerial vehicle) j Inter-vertex added UAV 1 Comparing UAVs i ,UAV 1 With UAV j And UAV (unmanned aerial vehicle) i With UAV j Taking the path with small weight as UAV i To UAV (unmanned aerial vehicle) j An optimal path having a vertex number of not more than 1;
s303, in unmanned aerial vehicle UAV i To UAV (unmanned aerial vehicle) j Inter-vertex added UAV 2 Obtaining UAV i ,...,UAV 2 And UAV (unmanned aerial vehicle) 2 ,...,UAV j Wherein the UAV i ,...,UAV 2 Is a UAV (unmanned aerial vehicle) i To UAV (unmanned aerial vehicle) 2 An optimal path with a middle vertex number not greater than 1; UAV (unmanned aerial vehicle) 2 ,...,UAV j Is a UAV (unmanned aerial vehicle) 2 To UAV (unmanned aerial vehicle) j An optimal path with a middle vertex number not greater than 1; UAV (unmanned aerial vehicle) i ,...,UAV 2 ,...,UAV j Comparing with the optimal path obtained in step S302, taking the shorter path as UAV i To UAV (unmanned aerial vehicle) j An optimal path with a middle vertex number not greater than 2;
s304, by analogy, the UAV is obtained in the n-1 th step after n times of comparison and correction i To UAV (unmanned aerial vehicle) j The optimal path with the middle vertex number not larger than n-1 is any two-node UAV in unmanned aerial vehicle formation i To UAV (unmanned aerial vehicle) j Is provided for the optimal communication path of (a).
CN202010274949.6A 2020-04-09 2020-04-09 Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology Active CN111601355B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010274949.6A CN111601355B (en) 2020-04-09 2020-04-09 Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010274949.6A CN111601355B (en) 2020-04-09 2020-04-09 Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology

Publications (2)

Publication Number Publication Date
CN111601355A CN111601355A (en) 2020-08-28
CN111601355B true CN111601355B (en) 2024-01-19

Family

ID=72190651

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010274949.6A Active CN111601355B (en) 2020-04-09 2020-04-09 Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology

Country Status (1)

Country Link
CN (1) CN111601355B (en)

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113741513A (en) * 2021-08-24 2021-12-03 北京理工大学 Method for optimizing formation of ground search task formation of multiple unmanned aerial vehicles under implicit communication condition
CN114302265B (en) * 2021-11-26 2024-06-04 军事科学院系统工程研究院网络信息研究所 Coordinate addressing unmanned aerial vehicle all-optical networking method
CN114531201B (en) * 2021-12-27 2024-07-09 南京中科算通科技有限公司 Simplified method of path loss model of single scattering of non-direct-view ultraviolet communication
CN114553290B (en) * 2022-01-07 2024-10-11 浙江星舰无人机系统有限公司 Wireless ultraviolet communication tracking and maintaining method based on MIMO structure
CN116261150B (en) * 2023-03-03 2023-09-15 深圳市云联友科科技有限公司 Wireless network bridge data transmission interference resistance method, device, equipment and medium
CN117240359B (en) * 2023-11-10 2024-03-15 西安现代控制技术研究所 Ultraviolet light-based unmanned aerial vehicle cluster photoelectric hybrid networking method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494590A (en) * 2008-01-23 2009-07-29 中兴通讯股份有限公司 Optimum path selection method of communication network based on load balance
CN105764114A (en) * 2016-04-19 2016-07-13 浙江理工大学 Underwater wireless sensor network topology control method based on balanced energy consumption
CN106525047A (en) * 2016-10-28 2017-03-22 重庆交通大学 Unmanned aerial vehicle path planning method based on floyd algorithm
CN108541039A (en) * 2018-04-24 2018-09-14 苏州市职业大学 A kind of power consumption wireless sensor network static node-routing method
CN108924788A (en) * 2018-06-21 2018-11-30 西安理工大学 Energy consumption balance method in wireless ultraviolet light cooperation unmanned plane formation network
WO2019077006A1 (en) * 2017-10-18 2019-04-25 Uvue Ltd System and method for determining optimal paths for drones
CN110456813A (en) * 2019-04-16 2019-11-15 西安理工大学 The unmanned plane of wireless ultraviolet light guidance is formed into columns the method that optimal sub-clustering formation is kept

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20140103158A1 (en) * 2012-10-12 2014-04-17 Benjamin Lawrence Berry AirShip Endurance VTOL UAV and Solar Turbine Clean Tech Propulsion
US9253079B2 (en) * 2013-10-11 2016-02-02 Telefonaktiebolaget L M Ericsson (Publ) High performance LFA path algorithms

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101494590A (en) * 2008-01-23 2009-07-29 中兴通讯股份有限公司 Optimum path selection method of communication network based on load balance
CN105764114A (en) * 2016-04-19 2016-07-13 浙江理工大学 Underwater wireless sensor network topology control method based on balanced energy consumption
CN106525047A (en) * 2016-10-28 2017-03-22 重庆交通大学 Unmanned aerial vehicle path planning method based on floyd algorithm
WO2019077006A1 (en) * 2017-10-18 2019-04-25 Uvue Ltd System and method for determining optimal paths for drones
CN108541039A (en) * 2018-04-24 2018-09-14 苏州市职业大学 A kind of power consumption wireless sensor network static node-routing method
CN108924788A (en) * 2018-06-21 2018-11-30 西安理工大学 Energy consumption balance method in wireless ultraviolet light cooperation unmanned plane formation network
CN110456813A (en) * 2019-04-16 2019-11-15 西安理工大学 The unmanned plane of wireless ultraviolet light guidance is formed into columns the method that optimal sub-clustering formation is kept

Non-Patent Citations (7)

* Cited by examiner, † Cited by third party
Title
Energy efficient routing considering link robustness in wireless sensor networks;Shital Joshi;《IEEE》;全文 *
启发式无人机蜂群自组网协议及仿真;郑繁繁;张立冬;赵浦媛;吕欣;郝明;;指挥与控制学报(01);全文 *
基于剩余能量和节点度的多跳分簇算法的研究;秦相林;张盈盈;;信息技术(02);全文 *
无线Mesh网络路径选择协议和信道分配方案的研究与改进;金冬成;《中国博士学位论文全文数据库》;全文 *
王立春;罗守品;吴继浩.改进A~*算法在AGV小车路径规划中的应用.自动化应用.2018,(02),全文. *
罗小元;王慧彬;王金然;关新平.基于最优刚性图的链路质量与能量的拓扑控制算法.控制与决策.2015,(11),全文. *
赵太飞.紫外光NLOS通信的机群间通路快速恢复算法.《激光技术》.2017,正文第1-2节. *

Also Published As

Publication number Publication date
CN111601355A (en) 2020-08-28

Similar Documents

Publication Publication Date Title
CN111601355B (en) Optimal path selection method in wireless ultraviolet light cooperation unmanned aerial vehicle formation maintenance topology
CN108924788B (en) Energy consumption balancing method in wireless ultraviolet light cooperation unmanned aerial vehicle formation network
CN108768497B (en) Unmanned aerial vehicle auxiliary wireless sensor network and node scheduling and flight parameter design method thereof
CN112737837B (en) Method for allocating bandwidth resources of unmanned aerial vehicle cluster under high dynamic network topology
CN111970658A (en) Unmanned aerial vehicle swarm formation network routing method based on optimal rigid graph
CN108243431A (en) The power distribution algorithm of unmanned plane relay system based on efficiency optiaml ciriterion
CN109309525B (en) Distributed transmission mode selection method based on flight trajectory of unmanned aerial vehicle
CN111736628A (en) Optimal persistent formation generation method for wireless ultraviolet MIMO cooperative unmanned aerial vehicle
CN111970709A (en) Unmanned aerial vehicle relay deployment method and system based on particle swarm optimization algorithm
Liu et al. Power-efficient clustering routing protocol based on applications in wireless sensor network
Park et al. Analysis of dynamic cluster head selection for mission-oriented flying ad hoc network
CN111600644A (en) Ultraviolet light assisted unmanned aerial vehicle formation optimal rigid topology generation method
CN110493802A (en) A kind of optimization method and its optimization device of wireless sensor network APTEEN Routing Protocol
CN112654001B (en) Hybrid communication network architecture, management method and communication quality evaluation for multi-unmanned-boat cooperative control
Shen et al. A Power Control-Aided Q-Learning-Based Routing Protocol for Optical-Acoustic Hybrid Underwater Sensor Networks
Liu et al. Distributed relay selection for heterogeneous UAV communication networks using a many-to-many matching game without substitutability
Li et al. An optimal relay number selection algorithm for balancing multiple performance in flying ad hoc networks
CN112752250A (en) Q-learning-based neighbor discovery method in ultraviolet unmanned aerial vehicle formation
CN116113025A (en) Track design and power distribution method in unmanned aerial vehicle cooperative communication network
CN107948315B (en) Method and system for controlling coverage of area of Internet of things
CN111356039B (en) Topology forming method for wireless optical communication network
CN113453305A (en) Annular wireless sensor network clustering routing algorithm based on particle swarm and lion swarm
CN109639473B (en) Full-to-full communication method for double-sided array radar ad hoc network
CN114553290B (en) Wireless ultraviolet communication tracking and maintaining method based on MIMO structure
CN106712813B (en) MIMO relay selection method for selecting antenna based on network life cycle threshold

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20231221

Address after: 518000 1104, Building A, Zhiyun Industrial Park, No. 13, Huaxing Road, Henglang Community, Longhua District, Shenzhen, Guangdong Province

Applicant after: Shenzhen Hongyue Information Technology Co.,Ltd.

Address before: 710048 No. 5 Jinhua South Road, Shaanxi, Xi'an

Applicant before: XI'AN University OF TECHNOLOGY

Effective date of registration: 20231221

Address after: No. 291, West Section of Renmin Avenue, Cao'e Street, Shangyu District, Shaoxing City, Zhejiang Province, 312300

Applicant after: SHAOXING CITY SHANGYU DISTRICT SHUNXING ELECTRIC POWER CO.,LTD.

Applicant after: State Grid Zhejiang Electric Power Co., Ltd. Shaoxing Shangyu district power supply Co.

Applicant after: State Grid Zhejiang Electric Power Co., Ltd. Yuyao Power Supply Co.

Address before: 518000 1104, Building A, Zhiyun Industrial Park, No. 13, Huaxing Road, Henglang Community, Longhua District, Shenzhen, Guangdong Province

Applicant before: Shenzhen Hongyue Information Technology Co.,Ltd.

GR01 Patent grant
GR01 Patent grant