CN112351438A - Unmanned aerial vehicle base station deployment method based on undirected graph - Google Patents
Unmanned aerial vehicle base station deployment method based on undirected graph Download PDFInfo
- Publication number
- CN112351438A CN112351438A CN202011219855.5A CN202011219855A CN112351438A CN 112351438 A CN112351438 A CN 112351438A CN 202011219855 A CN202011219855 A CN 202011219855A CN 112351438 A CN112351438 A CN 112351438A
- Authority
- CN
- China
- Prior art keywords
- aerial vehicle
- unmanned aerial
- base station
- undirected graph
- vertex
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/18—Network planning tools
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18502—Airborne stations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/14—Relay systems
- H04B7/15—Active relay systems
- H04B7/185—Space-based or airborne stations; Stations for satellite systems
- H04B7/18502—Airborne stations
- H04B7/18504—Aircraft used as relay or high altitude atmospheric platform
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Astronomy & Astrophysics (AREA)
- Aviation & Aerospace Engineering (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides an unmanned aerial vehicle base station deployment method based on an undirected graph, which mainly solves the problem of optimal deployment of an unmanned aerial vehicle base station. The realization method comprises the following steps: 1) and drawing an undirected graph according to the distance information between the ground terminals. 2) And preprocessing the nodes with the degrees of 0 and 1 in the undirected graph based on the undirected graph. 3) And dividing the undirected graph into a plurality of first-order or second-order complete subgraphs, and deploying the unmanned aerial vehicle base station on the basis of the undirected graph. 4) And continuously adjusting the coverage range of the base station according to the degree information of the vertex and the adjacent information of the vertex in the undirected graph, combining the base stations and reducing the number of the base stations. 5) Repeating the processes 3) and 4) for a plurality of times to optimize the deployment scenario until a termination condition is reached. The invention can deploy the unmanned aerial vehicle base station with high efficiency and low cost, and can be applied to area monitoring, temporary communication and the like.
Description
Technical Field
The patent relates to the field of wireless communication technology, in particular to an optimization method for unmanned aerial vehicle base station deployment.
Background
As a new communication method, the unmanned aerial vehicle wireless communication has been rapidly developed in recent years due to its high mobility and high possibility of LOS channel. Currently, unmanned aerial vehicle wireless communication has been widely applied to applications such as auxiliary communication, relay communication, information collection, and the like. For example, the drone can serve as a flying mobile base station to provide temporary communication service for the ground terminal. The unmanned aerial vehicle base station has the characteristics of fast deployment and low cost, and gradually becomes a research hotspot in recent years. Unmanned aerial vehicle base station has been widely used at present, post-disaster temporary communication network, fire detection, traffic patrol and the like.
Limited by the limited battery energy of the unmanned aerial vehicle, communication power and other reasons, how to deploy the unmanned aerial vehicle base station quickly and with low cost is a technical challenge for the existing unmanned aerial vehicle base station to be put into use. Currently, there are some studies on deployment methods of drone base stations. In the document "deployed information of UAV-mounted access points recording to specific users in two-tier cellular networks", a K-means method is adopted to deploy the UAV base station, but the method has low efficiency and the algorithm is greatly influenced by the number of clusters. The document "Placement Optimization of UAV-Mounted Mobile Base Stations" adopts an algorithm of spiral layout and convex hull boundary solving to arrange the unmanned aerial vehicle Base Stations, but the solution space of the method is limited, and the optimal solution is difficult to obtain. The literature "Placement optimization method for multi-UAV relay communication" adopts a genetic algorithm to perform combined coding on an unmanned aerial vehicle and a ground terminal to deploy an unmanned aerial vehicle base station, but the method needs to continuously try the number of unmanned aerial vehicle base stations, and when the number of unmanned aerial vehicle base stations is large, the algorithm efficiency is low.
Disclosure of Invention
The invention aims to overcome the defects of the technology and provides an unmanned aerial vehicle base station deployment method based on an undirected graph.
An unmanned aerial vehicle base station deployment method based on undirected graphs comprises the following steps:
s1: establishing a system model, and constructing an undirected graph according to the distance information of the ground terminal;
s2: preprocessing the vertex in the graph based on the adjacent information of the vertex in the undirected graph;
s3: a plurality of unmanned aerial vehicle base stations are randomly constructed, and the unmanned aerial vehicle base stations are not available, so that the number of the unmanned aerial vehicle base stations is reduced;
s4: and circularly executing S3 until the maximum circulation times are reached or the number of the base stations of the optimal deployment scheme is unchanged.
The specific method of S1 is as follows:
establishing a coordinate system by taking the initial position of the unmanned aerial vehicle as an origin (0, 0), wherein the coordinate of the unmanned aerial vehicle at any moment is u (t) ═ xu(t)，yu(t)), wherein xu(t) is unmanned plane at any moment tAbscissa of (a), yu(t) is the ordinate of the unmanned aerial vehicle at any time t, and for all the N ground terminals {1, 2, 3.., N }, the position of any ground terminal i on the coordinate system is qi＝(xi，yi) Wherein x isi，yiRespectively are the abscissa and ordinate information of the ground terminal i on the coordinate system.
The Distance between any ground terminals i, j is Distance (i, j),
wherein x isi，yiInformation of abscissa and ordinate, x, of the ground terminal ij，yjAnd the information of the abscissa and the ordinate of the ground terminal j is obtained.
Assuming that the unmanned aerial vehicle flies at a fixed height H, the channel between the unmanned aerial vehicle and the ground terminal is an LOS channel, and the farthest allowable communication distance between the unmanned aerial vehicle and each ground terminal is R, according to the formula:
R2＝r2+H2
and solving the farthest horizontal communication distance r between the unmanned aerial vehicle and the ground terminal, and determining the horizontal coverage range of the base station.
The formulation of the problem of minimizing the number of drone base stations K is described as (P):
according to the distance information between the ground terminals, an undirected graph G is constructed, which specifically comprises the following steps: if the distance between any ground terminal i and terminal j is less than or equal to 2r, two corresponding vertexes of the undirected graph are adjacent, and the notation W (i, j) is 1; if the distance between them is greater than 2r, then its corresponding two vertices in the undirected graph are not adjacent, let W (i, j) be 0, which can be expressed as:
the degree information of each vertex in the undirected graph is obtained as follows: if there are k vertices adjacent to any vertex i in the undirected graph G, the connectivity of the vertex is k, which is denoted as "degree (i) ═ k".
Based on the created undirected graph, the following inferences can be determined:
the distance between any two ground terminals in the range covered by the unmanned aerial vehicle base station is not more than 2r, and the distance between the ground terminals corresponding to any two nonadjacent vertexes in the undirected graph G is not more than 2r, so that the conclusion can be drawn that the ground terminals corresponding to any two nonadjacent vertexes in the undirected graph can not be covered by one unmanned aerial vehicle base station;
further, for any subgraph in the undirected graph, if the subgraph is not a complete subgraph, non-adjacent points are inevitably present therein, and terminals with a distance greater than 2r are also inevitably present in the ground terminals corresponding thereto, so that the ground terminals corresponding to the subgraph cannot be covered by one unmanned aerial vehicle base station;
based on the above conclusion, it is necessary that any plurality of ground terminals can be covered by one drone base station, and a subgraph formed by vertices in an undirected graph corresponding to the ground terminals is a complete subgraph.
The specific method of S2 is as follows:
circularly executing the steps (1) to (2), wherein the circulation end condition is as follows: the undirected graph G is a null graph or the number of all points in the undirected graph is more than or equal to 2.
(1) Finding isolated points with the middle degree of 0 in the undirected graph G, namely, Degree (i) ═ 0, deploying the unmanned aerial vehicle base stations by taking the isolated points as the center, and deleting the points from the undirected graph G;
(2) finding whether suspended vertices with the degree of 1 exist in the undirected graph G, obviously, the suspended vertices, and vertices uniquely connected with the suspended vertices, form a tree structure, and for each tree structure, the minimum number of the suspended vertices, which are divided into complete subgraphs, can be determined as h-1, where h is the number of nodes of each tree structure, and for each tree structure in the undirected graph G, the following operations are performed: father nodes and any leaf nodes in the tree structure are provided with an unmanned aerial vehicle base station, and the rest leaf nodes are respectively and independently provided with the unmanned aerial vehicle base station.
The specific method of S3 is as follows:
if G is empty at this time, directly executing step S4; if G is not an empty graph, then execution continues down.
All vertex degrees in the undirected graph G are more than or equal to 2 at present, if any two adjacent vertexes in the undirected graph form a complete subgraph, obviously, the ground terminal corresponding to the point in the second-order complete subgraph can be covered by one unmanned aerial vehicle base station.
And (3) randomly forming a plurality of second-order or first-order complete subgraphs by pairwise adjacent points in the undirected graph G, wherein the complete subgraphs are required to be mutually non-overlapped, so that a preliminary scheme for deploying the unmanned aerial vehicle base station is obtained.
And traversing all the vertexes in the undirected graph G from small to large according to the degrees of the vertexes in the undirected graph G, and executing the processes a) to b).
(a) Assuming that the selected vertex is a, defining the unmanned aerial vehicle base station covering a as MBSaIf the unmanned aerial vehicle base station where the a is located is not processed, continuing to execute the following steps; otherwise, skipping vertex a;
(b) define the set of vertices at the SAME drone base station as a as { SAMEaDefining a set of vertices adjacent to a as { Connection }aAnd traversing the set { Connection from small to large according to the degree sequencea}-{SAMEaAll vertices in the tree, the following processes (b1) - (b3) are performed until the Connection is traverseda}-{SAMEaAll vertices in (1);
(b1) let the selected point be z, if z is equal to { SAMEaIf all the vertexes are adjacent, continuing, otherwise, skipping over the point z;
(b2) if the z belongs to the unmanned aerial vehicle base station MBS at the momentzThe number of middle vertices is less than or equal to MBSaIf yes, continuing, otherwise skipping over the point z;
(b3) if z is equal to a, and { SAMEaThe radius of the smallest enclosing circle formed by all the vertexes in the circle is not more than r, thenLet z from unmanned aerial vehicle base station MBS covering zzDeleting the point A and adding the point Z to the MBS (base station of unmanned aerial vehicle) to which the point A belongs at presentaOtherwise, skip point z.
S4, the specific implementation method comprises the following steps:
step S3 is executed in a loop until the following termination condition is reached: 1. the maximum cycle number is reached; 2. the optimal deployment scenario for m consecutive times is unchanged (where the value of m defaults to 5, which may vary as the case may be).
Through the process, the deployment scheme of the unmanned aerial vehicle base station is obtained.
Compared with the prior art, the invention has the remarkable advantages that: the invention utilizes the knowledge of the complete subgraph in the undirected graph to solve the deployment problem of the base station of the unmanned aerial vehicle for the first time, can preliminarily screen out the ground terminal which can not be covered by one base station of the unmanned aerial vehicle by judging whether the vertex forms the complete subgraph, improves the arrangement efficiency of the base station, is simple and easy to realize, and does not need to consume a large amount of resources of a computer.
Drawings
FIG. 1 is a flow chart of the algorithm as a whole in the present invention.
Fig. 2 shows the distribution of the ground terminals on a plane.
Fig. 3 is an undirected graph drawn based on location information of a ground terminal.
Fig. 4 is a schematic diagram of processing isolated points in an undirected graph.
FIG. 5 is a schematic illustration of the processing of suspended vertices in an undirected graph.
Fig. 6 is a schematic diagram of a pre-processed base station deployment.
Fig. 7 is a schematic diagram of a preliminary arrangement of drone base stations.
Fig. 8 is a schematic diagram of the final placement of the drone base station.
Detailed Description
The present invention will be further described in detail with reference to the accompanying drawings, and the overall flow chart of the present invention is shown in fig. 1.
S1: and constructing a system model and establishing an undirected graph.
As shown in fig. 2, the ground terminalThe unmanned aerial vehicle is distributed on a plane, the ground terminals are assumed to be at the same height, the terrain is smooth, and at any moment, the coordinate of the unmanned aerial vehicle is qU(t)＝(xU(t)，yU(t)), wherein xu(t) is the abscissa of the unmanned plane at any time t, yu(t) is the vertical coordinate of the unmanned aerial vehicle at any moment t, and the unmanned aerial vehicle is positioned at the origin of the coordinate system at the initial moment. The number of ground terminals is N, and the position information of any ground terminal i is qi＝(xi，yi) Wherein x isi，yiRespectively, the abscissa and ordinate information of the ground terminal i.
The Distance between any ground terminals i, j is denoted Distance (i, j), where,
wherein x isi，yiInformation of abscissa and ordinate, x, of the ground terminal ij，yjAnd the information of the abscissa and the ordinate of the ground terminal j is obtained.
Assuming that the unmanned aerial vehicle is flying horizontally at a constant altitude H, according to the formula
R2＝r2+H2
And calculating the farthest horizontal distance R between the unmanned aerial vehicle and the ground terminal, wherein R is the farthest allowable communication distance between the unmanned aerial vehicle and the ground terminal.
And constructing an undirected graph according to the distance information between the ground terminals, wherein the undirected graph is constructed in the following mode: if the distance between any two ground terminals is greater than 2r, the two ground terminals are not considered to be adjacent, if the distance between the two ground terminals is less than or equal to 2r, the two ground terminals are considered to be adjacent, and an undirected graph is drawn as shown in FIG. 3.
And determining the degrees of all the vertexes in the undirected graph G, and if k vertexes adjacent to any point i are provided, the degree of the point is k, and the degree is marked Degree (i) ═ k.
S2: and (4) preprocessing the vertexes with the degrees of 0 and 1 in the undirected graph based on the system model.
Circularly executing the steps (1) to (2), wherein the circulation end condition is as follows: the undirected graph G is a null graph or the number of all points in the undirected graph is more than or equal to 2.
(1) As shown in fig. 4, an isolated point of undirected graph G with a middle value of 0, i.e., the point degree (i) is found to be 0. Deploying the unmanned aerial vehicle base station by taking the isolated points as the center, and deleting the points from the undirected graph G;
(2) and searching whether the suspension vertex with the degree of 1 exists in the undirected graph G. For each tree structure consisting of each suspended vertex in G and its uniquely connected vertices, the following operations are performed:
(2a) and deploying an unmanned aerial vehicle base station for a father node and any leaf node in the tree structure, wherein the center of the base station is the center of mass of the father node and any leaf node, and each remaining leaf node is respectively and independently provided with the unmanned aerial vehicle base station, and the center of the unmanned aerial vehicle base station is the center of the leaf node.
Step S2 is explained below with reference to an example.
As shown in fig. 5, the leaf nodes are a, b, c, and d, the father node is e, the leaf node a and the father node e are covered by an unmanned aerial vehicle base station, and the center of the base station is the centroid of the nodes a and e. And for other nodes b, c and d, respectively setting unmanned aerial vehicle base stations in the centers of the nodes.
The result of the drone base station deployment is shown in fig. 6, via step S2.
S3: based on undirected graph G, a plurality of unmanned aerial vehicle base stations are randomly deployed, the coverage area of each base station is continuously adjusted, the base stations are combined, the number of the base stations is reduced, and the specific execution process is as follows:
if the undirected graph G is empty at this time, directly executing S4; if G is not an empty graph, then execution continues down.
In the undirected graph G, adjacent vertices are arbitrarily grouped into a plurality of second-order or first-order complete subgraphs, and the complete subgraphs are required to be mutually non-overlapped, so as to obtain a preliminary scheme for deploying the base station of the unmanned aerial vehicle, as shown in fig. 7.
And (c) traversing all the vertexes in the undirected graph G from small to large according to the vertex degree information in the undirected graph G, and executing the processes (a) and (b).
(a) Assuming the selected vertex is a, define the absence of coverage aThe man-machine base station is MBSa. If the unmanned aerial vehicle base station where the a is located is not processed, continuing to execute the following steps; otherwise, vertex a is skipped.
(b) Define the set of vertices at the SAME drone base station as a as { SAMEaDefining a set of vertices adjacent to a as { Connection }aAnd traversing the set { Connection from small to large according to the degree sequencea}-{SAMEaAt all points in the sequence, processes (b1) - (b3) are executed until the Connection is traverseda}-{SAMEaAll points in.
(b1) Let the selected vertex be z, if z is equal to { SAMEaIf all the vertexes are adjacent, continuing to execute downwards; otherwise, point z is skipped.
(b2) If z belongs to the UAV base station MBSzThe number of middle top points is not more than MBSaIf yes, continuing to execute downwards; otherwise, point z is skipped.
(b3) If z is equal to a, and { SAMEaThe radius of the smallest enclosing circle formed by the vertices in (z) is not larger than r, then z is selected from the unmanned aerial vehicle base station MBS covering zzDeleting the point A and adding the point Z to the MBS (base station of unmanned aerial vehicle) to which the point A belongs at presentaPerforming the following steps; otherwise, skip point z.
S4: step S3 is executed in a loop until the following termination condition is reached: 1. the maximum cycle number is reached; 2. the 5 consecutive best solutions did not change.
Based on the above procedure, a deployment scenario of drone base stations for ground terminals distributed as shown in fig. 2 can be obtained, with the result shown in fig. 8.
Claims (5)
1. An unmanned aerial vehicle base station deployment method based on undirected graphs is characterized by comprising the following steps:
step 1, establishing a system model of unmanned aerial vehicle communication, which comprises the following specific steps:
(1) at any moment, the position information of the unmanned aerial vehicle is: u (t) ═ xu(t)，yu(t)), wherein xu(t) is the position of the abscissa of the unmanned aerial vehicle at any moment t, yu(t) is the position of the vertical coordinate of the unmanned aerial vehicle at any moment t, and the initial timeAt first, the coordinate of the unmanned aerial vehicle is the origin of a coordinate system; the position information of the ground terminal is as follows: q. q.si＝(xi，yi) Wherein x isi，yiRespectively representing the abscissa and ordinate information of the ground terminal i on a coordinate system;
(2) distance (i, j) between any ground terminals i, j:
wherein x isi，yiInformation of abscissa and ordinate, x, of the ground terminal ij，yjInformation of a horizontal coordinate and a vertical coordinate of the ground terminal j;
(3) the farthest horizontal communication distance r between the unmanned aerial vehicle and the ground terminal is as follows:
r2＝R2-H2
wherein R is the farthest communication distance allowed between the unmanned aerial vehicle and each ground terminal, and H is the fixed flight height of the unmanned aerial vehicle;
(4) the problem of minimizing the number K of drone base stations can be described in a formulation as:
wherein q isiIs position information of a ground terminal, ujThe position information of the unmanned aerial vehicle is obtained, N is the number of ground terminals, i is the serial number of the ground terminals, and j is the serial number of the unmanned aerial vehicle;
(5) constructing an undirected graph according to distance information between ground terminals, determining the degree of any vertex in the undirected graph, and preliminarily judging whether the ground terminals can be covered by an unmanned aerial vehicle base station or not based on adjacent information between the vertices in the undirected graph;
step 2, preprocessing a vertex with the degree of 0 or 1 in the undirected graph, deploying an unmanned aerial vehicle base station for a corresponding ground terminal, and reducing the workload of the step 3;
step 3, randomly constructing a plurality of unmanned aerial vehicle base stations, continuously adjusting and combining the unmanned aerial vehicle base stations, and reducing the number of the base stations;
step 4, the process loops to S3 until the following termination conditions are reached: 1) reaching a maximum cycle number; 2) the optimal solution for m consecutive times is unchanged, wherein m defaults to 5 and can be set according to specific conditions.
2. The method for creating an undirected graph as claimed in claim 1, wherein the neighborhood information between the vertices in the undirected graph is first determined according to the distance between the ground terminals, and the method for determining the neighborhood information between the vertices in the undirected graph is as follows: if the distance between any ground terminal i and any ground terminal j is not more than 2r, the two points are considered to be adjacent in the undirected graph, and if the distance between the two points is more than 2r, the two points are considered to be non-adjacent; and then, constructing an undirected graph based on adjacent information between the vertexes, and determining the degrees of each vertex in the undirected graph.
3. The method of claim 1, wherein the preliminary determination of whether the ground terminal can be covered by an drone base station is made from information about the neighborhood of the vertices in the undirected graph, wherein:
(1) according to the adjacent information of the vertexes in the undirected graph, for any pair of vertexes which are not adjacent in the undirected graph, the distance between the corresponding ground terminals is larger than 2r, and then the pair of ground terminals can be determined to be incapable of being covered by one unmanned aerial vehicle base station;
(2) based on the above conclusion, the necessary condition that any two ground terminals can be covered by one base station of the unmanned aerial vehicle is that the vertexes, corresponding to the base station, on the undirected graph are adjacent;
(3) accordingly, a necessary condition that any plurality of ground terminals can be covered by one drone base station is that a subgraph formed by corresponding vertexes of the base station on the undirected graph is a complete subgraph.
4. The preprocessing method according to claim 1, characterized in that the base station of the drone is set individually for the isolated points with degree 0 in the undirected graph and deleted from the undirected graph; the method for processing the suspension vertex with the degree of 1 is characterized in that the suspension vertex and the vertex which is uniquely connected with the suspension vertex form a tree structure, h-1 unmanned aerial vehicle base stations are deployed for each tree structure, wherein h is the number of the vertexes of each tree structure, and the specific process is as follows:
the suspended vertex (called leaf node) and the vertex (called father node) which is uniquely connected with the suspended vertex in the undirected graph form a tree structure, the number of the unmanned aerial vehicle base stations is determined for the tree structure, h-1 is adopted, one unmanned aerial vehicle base station is randomly deployed for one leaf node and the father node, and one unmanned aerial vehicle base station is deployed for each leaf node for the rest leaf nodes.
5. The method of claim 1, wherein according to the conclusion that any non-adjacent vertex in the undirected graph corresponds to a ground terminal that cannot be covered by one drone base station, randomly constructing a plurality of first-order and second-order complete subgraphs, then checking whether the vertex constitutes a complete subgraph, and checking whether the diameter of a minimum bounding circle formed by the vertex is larger than that of the drone base station by a method of checking whether the vertex constitutes a complete subgraph, continuously adjusting the range of the drone base station, merging the drone base stations, and optimizing the deployment scheme, the specific implementation scheme is as follows:
(1) forming a plurality of second-order complete subgraphs from adjacent points in the undirected graph G in pairs, if the vertex cannot form a second-order subgraph, independently forming a first-order complete subgraph, and setting an unmanned aerial vehicle base station based on the complete subgraphs to obtain a primary scheme for placing the unmanned aerial vehicle base station;
(2) continuously optimizing the deployment scheme, traversing all vertexes in the undirected graph G from small to large according to the degrees of the vertexes in the undirected graph G, and executing the processes (2a) and (2b) until all the vertexes are traversed;
(2a) suppose that the arbitrarily selected vertex is a, and the base station of the unmanned aerial vehicle to which a belongs is MBSa，{SAMEaDenoted as the set of vertices with a at the same drone base station, { Connection }aDenoted as a set of vertices adjacent to aIf the unmanned aerial vehicle base station to which the point a belongs is processed, skipping the point a, otherwise, executing the process b downwards);
(2b) traversing the set { Connection from small to large in degree ordera}-{SAMEaAll the vertices in the tree are processed by the processes (2b1) - (2b3) until all the Connection points are traverseda}-{SAMEaPoints in (c) };
(2b1) let the arbitrarily chosen vertex be z, if z is equal to { SAMEaIf all the vertexes are adjacent, continuing, otherwise, skipping the vertex z;
(2b2) if z belongs to the unmanned aerial vehicle base station MBSZThe number of middle vertices is less than or equal to MBSaIf yes, continuing, otherwise, skipping over the vertex z;
(2b3) if z is equal to a, and { SAMEaThe radius of a minimum enclosing circle formed by all points in the z is not more than r, and then z is selected from the MBS (unmanned aerial vehicle) base station to which z belongsZDeleting the point A and adding the point Z to the existing unmanned aerial vehicle base station MBSaOtherwise, skip point z.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011219855.5A CN112351438B (en) | 2020-11-04 | 2020-11-04 | Unmanned aerial vehicle base station deployment method based on undirected graph |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011219855.5A CN112351438B (en) | 2020-11-04 | 2020-11-04 | Unmanned aerial vehicle base station deployment method based on undirected graph |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112351438A true CN112351438A (en) | 2021-02-09 |
| CN112351438B CN112351438B (en) | 2022-12-02 |
Family
ID=74428730
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011219855.5A Active CN112351438B (en) | 2020-11-04 | 2020-11-04 | Unmanned aerial vehicle base station deployment method based on undirected graph |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112351438B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113190031A (en) * | 2021-04-30 | 2021-07-30 | 成都思晗科技股份有限公司 | Forest fire automatic photographing and tracking method, device and system based on unmanned aerial vehicle |
| CN114840028A (en) * | 2022-07-04 | 2022-08-02 | 中国科学院自动化研究所 | Target monitoring method, target monitoring device, electronic equipment and storage medium |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| US20160018224A1 (en) * | 2013-09-27 | 2016-01-21 | Regents Of The University Of Minnesota | Symbiotic Unmanned Aerial Vehicle and Unmanned Surface Vehicle System |
| CN107124755A (en) * | 2017-04-26 | 2017-09-01 | 哈尔滨工业大学 | The double-layer network Poewr control method of Gossip algorithm is broadcasted based on unbiased |
| WO2018082711A1 (en) * | 2016-11-07 | 2018-05-11 | 北京佰才邦技术有限公司 | Base station deployment method, network server, and unmanned aerial vehicle |
| WO2018132224A1 (en) * | 2017-01-13 | 2018-07-19 | Microsoft Technology Licensing, Llc | Optimal scanning trajectories for 3d scenes |
| WO2018191596A1 (en) * | 2017-04-14 | 2018-10-18 | Qualcomm Incorporated | Scheduling and transmission scheme for periodic and aperiodic control information |
| CN109819453A (en) * | 2019-03-05 | 2019-05-28 | 西安电子科技大学 | Cost optimization unmanned plane base station deployment method based on improved adaptive GA-IAGA |
| CN110233657A (en) * | 2019-04-01 | 2019-09-13 | 南京邮电大学 | A kind of multiple no-manned plane region overlay dispositions method based on population genetic algorithm |
| US20190354106A1 (en) * | 2018-05-17 | 2019-11-21 | University Of Connecticut | System and Method for Complete Coverage of Unknown Environments |
| CN110557767A (en) * | 2019-09-06 | 2019-12-10 | 华南师范大学 | Base station allocation method, device and equipment |
| CN111163477A (en) * | 2020-02-29 | 2020-05-15 | 南开大学 | Automatic deployment method of integrated intelligent base station in wide-area three-dimensional environment |
| CN111194038A (en) * | 2020-01-07 | 2020-05-22 | 北京航空航天大学 | Position deployment method for multiple unmanned aerial vehicles mobile base stations |
| CN111426810A (en) * | 2020-05-11 | 2020-07-17 | 河海大学 | Air-space-ground-integration-oriented water environment monitoring system deployment method |
-
2020
- 2020-11-04 CN CN202011219855.5A patent/CN112351438B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160018224A1 (en) * | 2013-09-27 | 2016-01-21 | Regents Of The University Of Minnesota | Symbiotic Unmanned Aerial Vehicle and Unmanned Surface Vehicle System |
| CN103716803A (en) * | 2013-12-03 | 2014-04-09 | 西安交通大学 | Wireless sensor network relay node deployment method |
| WO2018082711A1 (en) * | 2016-11-07 | 2018-05-11 | 北京佰才邦技术有限公司 | Base station deployment method, network server, and unmanned aerial vehicle |
| WO2018132224A1 (en) * | 2017-01-13 | 2018-07-19 | Microsoft Technology Licensing, Llc | Optimal scanning trajectories for 3d scenes |
| WO2018191596A1 (en) * | 2017-04-14 | 2018-10-18 | Qualcomm Incorporated | Scheduling and transmission scheme for periodic and aperiodic control information |
| CN107124755A (en) * | 2017-04-26 | 2017-09-01 | 哈尔滨工业大学 | The double-layer network Poewr control method of Gossip algorithm is broadcasted based on unbiased |
| US20190354106A1 (en) * | 2018-05-17 | 2019-11-21 | University Of Connecticut | System and Method for Complete Coverage of Unknown Environments |
| CN109819453A (en) * | 2019-03-05 | 2019-05-28 | 西安电子科技大学 | Cost optimization unmanned plane base station deployment method based on improved adaptive GA-IAGA |
| CN110233657A (en) * | 2019-04-01 | 2019-09-13 | 南京邮电大学 | A kind of multiple no-manned plane region overlay dispositions method based on population genetic algorithm |
| CN110557767A (en) * | 2019-09-06 | 2019-12-10 | 华南师范大学 | Base station allocation method, device and equipment |
| CN111194038A (en) * | 2020-01-07 | 2020-05-22 | 北京航空航天大学 | Position deployment method for multiple unmanned aerial vehicles mobile base stations |
| CN111163477A (en) * | 2020-02-29 | 2020-05-15 | 南开大学 | Automatic deployment method of integrated intelligent base station in wide-area three-dimensional environment |
| CN111426810A (en) * | 2020-05-11 | 2020-07-17 | 河海大学 | Air-space-ground-integration-oriented water environment monitoring system deployment method |
Non-Patent Citations (2)
| Title |
|---|
| SHUOWEN ZHAN等: "Cellular-Enabled UAV Communication: A Connectivity-Constrained Trajectory Optimization Perspective", 《IEEE TRANSACTIONS ON COMMUNICATIONS》 * |
| 阮凯: "TD-LTE无人机系统路径规划的研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113190031A (en) * | 2021-04-30 | 2021-07-30 | 成都思晗科技股份有限公司 | Forest fire automatic photographing and tracking method, device and system based on unmanned aerial vehicle |
| CN114840028A (en) * | 2022-07-04 | 2022-08-02 | 中国科学院自动化研究所 | Target monitoring method, target monitoring device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112351438B (en) | 2022-12-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109819453B (en) | Cost optimization unmanned aerial vehicle base station deployment method based on improved genetic algorithm | |
| CN112351438B (en) | Unmanned aerial vehicle base station deployment method based on undirected graph | |
| CN111194038B (en) | Position deployment method for multiple unmanned aerial vehicles mobile base stations | |
| CN110267249B (en) | Post-disaster unmanned aerial vehicle base station deployment method and system based on artificial bee colony algorithm | |
| He et al. | Towards 3D deployment of UAV base stations in uneven terrain | |
| CN109960279B (en) | Heuristic algorithm-based unmanned aerial vehicle hovering radius optimization method | |
| CN113645143B (en) | Optimization method and device for air trunking communication network | |
| CN114268903B (en) | Geographic information assisted unmanned aerial vehicle relay position deployment and power distribution method | |
| Sawalmeh et al. | Providing wireless coverage in massively crowded events using UAVs | |
| Zhang et al. | Base stations from current mobile cellular networks: Measurement, spatial modeling and analysis | |
| Guo et al. | 3D aerial vehicle base station (UAV-BS) position planning based on deep Q-learning for capacity enhancement of users with different QoS requirements | |
| CN109600756B (en) | Physical cell identification and distribution method based on maximum degree priority dyeing algorithm | |
| Wang et al. | Capacity-aware cost-efficient network reconstruction for post-disaster scenario | |
| CN114448490B (en) | Path planning and spectrum resource allocation method and system for multiple unmanned aerial vehicles | |
| Liu et al. | Throughput optimization for flying ad hoc network based on position control using genetic algorithm | |
| Cao et al. | Cooperative task offloading and dispatching optimization for large-scale users via UAVs and HAP | |
| Zixuan et al. | UAV flight strategy algorithm based on dynamic programming | |
| CN114885379A (en) | Large-scale unmanned aerial vehicle cluster self-adaptive clustering networking method | |
| Wu et al. | A novel deployment method for uav-mounted mobile base stations | |
| CN114845316B (en) | Unmanned aerial vehicle aerial base station deployment method and device and electronic equipment | |
| Jiang et al. | Research on location planning of 5G base station based on DBSCAN clustering algorithm | |
| Zheng et al. | UAV 3D Placement for Near-Optimal LOS Relaying to Ground Users in Dense Urban Area | |
| Lv et al. | Design of Tethered UAV Low Altitude Relay Communication Networking Technology | |
| CN113328775B (en) | UAV height positioning system and computer storage medium | |
| Wang | Dynamic Resource Allocation Algorithm for UAV Emergency Communication Network Based on Energy Balance |
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 | ||
| DD01 | Delivery of document by public notice |
Addressee: Xu Juan Document name: Notice of publication and substantive examination of invention patent application |
|
| DD01 | Delivery of document by public notice | ||
| DD01 | Delivery of document by public notice |
Addressee: Xu Juan Document name: Notice of deemed withdrawal |
|
| DD01 | Delivery of document by public notice | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |