CN110611881B - Control node determination method and device - Google Patents
Control node determination method and device Download PDFInfo
- Publication number
- CN110611881B CN110611881B CN201910916959.2A CN201910916959A CN110611881B CN 110611881 B CN110611881 B CN 110611881B CN 201910916959 A CN201910916959 A CN 201910916959A CN 110611881 B CN110611881 B CN 110611881B
- Authority
- CN
- China
- Prior art keywords
- nodes
- matrix
- node
- determining
- 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
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
- H04W4/026—Services making use of location information using location based information parameters using orientation information, e.g. compass
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/02—Services making use of location information
- H04W4/025—Services making use of location information using location based information parameters
- H04W4/027—Services making use of location information using location based information parameters using movement velocity, acceleration information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/30—Services specially adapted for particular environments, situations or purposes
- H04W4/40—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P]
- H04W4/46—Services specially adapted for particular environments, situations or purposes for vehicles, e.g. vehicle-to-pedestrians [V2P] for vehicle-to-vehicle communication [V2V]
Abstract
The embodiment of the invention provides a method and a device for determining a control node, wherein the method comprises the following steps: acquiring the positions and communication radiuses of all nodes in a preset control range every other preset time; determining the connection relation between every two nodes according to the positions of every two nodes and the communication radius of the nodes; constructing an adjacency matrix according to the connection relation between every two nodes; according to the adjacent matrix, primary column transformation is carried out to obtain a simplest column ladder matrix; determining rows in the simplest column ladder matrix which are linearly related to other rows; and selecting a control node from the nodes corresponding to the determined row. By applying the technical scheme provided by the embodiment of the invention, part of the nodes are selected from all the nodes in the preset control range to be used as the control nodes instead of all the nodes being used as the control nodes, so that the number of the control nodes is reduced, and the deployment cost and the communication cost of the intelligent traffic network are greatly saved.
Description
Technical Field
The invention relates to the technical field of Internet of things, in particular to a method and a device for determining a control node.
Background
In recent years, the internet of things and mobile edge computing are rapidly developed, more and more devices are accessed to a network, and data traffic in the network is larger and larger. In an intelligent transportation network, vehicles are nodes in the network, the vehicles can move or stop at any time, and the traffic flow of a certain area or a certain road section can increase or decrease at any time. Because the intelligent transportation network has the dynamic characteristics, the connection state of the nodes in the intelligent transportation network and the network topology structure frequently change, and controllability is difficult to realize.
In the prior art, to solve the above problem, a control signal is input to each vehicle in the intelligent transportation network, so that each vehicle becomes a control node. The control node can control the moving direction or speed of the control node and other vehicles according to the network condition, so that the congestion or collision of the vehicles is avoided, and the controllability of the whole network is realized. Due to the dynamic characteristic of the intelligent transportation network, each control node can generate a large amount of data traffic to control the moving direction or speed of the control node and other vehicles, and further, a large amount of communication cost is consumed. In addition, each vehicle in the existing intelligent transportation network is a control node, and the manufacturing cost of the control node is high, which results in high deployment cost of the intelligent transportation network.
Disclosure of Invention
The embodiment of the invention aims to provide a method and a device for determining control nodes, so that the number of the control nodes in an intelligent traffic network is reduced while vehicles in the intelligent traffic network are controlled, and the deployment cost and the communication cost of the intelligent traffic network are saved. The specific technical scheme is as follows:
in a first aspect, an embodiment of the present invention provides a method for determining a control node, where the method includes:
acquiring the positions and communication radiuses of all nodes in a preset control range every other preset time;
determining the connection relation between every two nodes according to the positions of every two nodes and the communication radius of the nodes;
constructing an adjacent matrix according to the connection relationship between every two nodes, wherein the elements of each row in the adjacent matrix correspond to the same node, the elements of each column in the adjacent matrix correspond to the same node, the value of each element in the adjacent matrix represents the connection relationship between the two nodes corresponding to the element, the node corresponding to the element of the nth row is the same as the node corresponding to the element of the nth column, and n is more than or equal to 1 and less than or equal to the number of nodes in the preset control range;
according to the adjacent matrix, primary column transformation is carried out to obtain a simplest column ladder matrix;
determining rows in the simplest column ladder matrix that are linearly related to other rows;
and selecting a control node from the nodes corresponding to the determined row.
Optionally, the step of determining a connection relationship between each two nodes according to the positions of each two nodes and the communication radius of the node includes:
calculating the Euclidean distance between every two nodes according to the positions of every two nodes;
for every two nodes, if the Euclidean distance between the two nodes is smaller than or equal to the minimum value in the communication radiuses of the two nodes, determining that a connection relation exists between the two nodes; and if the Euclidean distance between the two nodes is larger than the minimum value in the communication radiuses of the two nodes, determining that no connection relation exists between the two nodes.
Optionally, the step of constructing an adjacency matrix according to a connection relationship between every two nodes includes:
constructing an initial matrix, wherein the number of rows and the number of columns of the initial matrix are the same as the number of nodes in the preset control range, elements of each row in the initial matrix correspond to the same node, and elements of each column in the initial matrix correspond to the same node; the node corresponding to the element in the nth row is the same as the node corresponding to the element in the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in the preset control range;
for every two nodes, if a connection relation exists between the two nodes, setting values of elements corresponding to the two nodes in the initial matrix as a first preset value; if the two nodes do not have a connection relation, setting the values of the elements corresponding to the two nodes in the initial matrix as a second preset value;
and after the values of all the elements in the initial matrix are set, taking the set initial matrix as an adjacent matrix.
Optionally, the step of performing elementary column transformation according to the adjacency matrix to obtain a simplest column ladder matrix includes:
subtracting an intermediate matrix from the adjacent matrix to obtain a matrix to be simplified, wherein the intermediate matrix is a matrix obtained by multiplying a unit matrix which is in the same dimension as the adjacent matrix and the characteristic value of the adjacent matrix;
and performing elementary column transformation on the matrix to be simplified to obtain a simplest column ladder matrix.
Optionally, the step of selecting a control node from the nodes corresponding to the determined row includes:
selecting all nodes from the nodes corresponding to the determined row, and determining control nodes; or
Calculating the maximum repeated number of the characteristic values of the adjacency matrix; and selecting the nodes with the number equal to the maximum number of the heavy roots from the nodes corresponding to the determined rows, and determining the control nodes.
In a second aspect, an embodiment of the present invention further provides a device for determining a control node, where the device includes:
the device comprises an acquisition unit, a control unit and a communication unit, wherein the acquisition unit is used for acquiring the positions and communication radiuses of all nodes in a preset control range every preset time;
the first determining unit is used for determining the connection relation between every two nodes according to the positions of every two nodes and the communication radius of the nodes;
the construction unit is used for constructing an adjacent matrix according to the connection relationship between every two nodes, elements in each row in the adjacent matrix correspond to the same node, elements in each column in the adjacent matrix correspond to the same node, the value of each element in the adjacent matrix represents the connection relationship between the two nodes corresponding to the element, the node corresponding to the element in the nth row is the same as the node corresponding to the element in the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in the preset control range;
the simplification unit is used for carrying out primary column transformation according to the adjacent matrix to obtain a simplest column ladder matrix;
a second determining unit, configured to determine rows in the simplest column ladder matrix that are linearly related to other rows;
and the selection unit is used for selecting the control node from the nodes corresponding to the determined row.
Optionally, the first determining unit may be specifically configured to:
calculating the Euclidean distance between every two nodes according to the positions of every two nodes;
for every two nodes, if the Euclidean distance between the two nodes is smaller than or equal to the minimum value in the communication radiuses of the two nodes, determining that a connection relation exists between the two nodes; and if the Euclidean distance between the two nodes is larger than the minimum value in the communication radiuses of the two nodes, determining that no connection relation exists between the two nodes.
Optionally, the building unit may be specifically configured to:
constructing an initial matrix, wherein the number of rows and the number of columns of the initial matrix are the same as the number of nodes in the preset control range, elements of each row in the initial matrix correspond to the same node, and elements of each column in the initial matrix correspond to the same node; the node corresponding to the element in the nth row is the same as the node corresponding to the element in the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in the preset control range;
for every two nodes, if a connection relation exists between the two nodes, setting values of elements corresponding to the two nodes in the initial matrix as a first preset value; if the two nodes do not have a connection relation, setting the values of the elements corresponding to the two nodes in the initial matrix as a second preset value;
and after the values of all the elements in the initial matrix are set, taking the set initial matrix as an adjacent matrix.
Optionally, the simplification unit may be specifically configured to:
subtracting an intermediate matrix from the adjacent matrix to obtain a matrix to be simplified, wherein the intermediate matrix is a matrix obtained by multiplying a unit matrix which is in the same dimension as the adjacent matrix and the characteristic value of the adjacent matrix;
and performing elementary column transformation on the matrix to be simplified to obtain a simplest column ladder matrix.
Optionally, the selecting unit may be specifically configured to:
selecting all nodes from the nodes corresponding to the determined row, and determining control nodes; or
Calculating the maximum repeated number of the characteristic values of the adjacency matrix; and selecting the nodes with the number equal to the maximum number of the heavy roots from the nodes corresponding to the determined rows, and determining the control nodes.
In a third aspect, an embodiment of the present invention further provides an electronic device, including a processor, a communication interface, a memory, and a communication bus, where the processor, the communication interface, and the memory complete mutual communication through the communication bus;
a memory for storing a computer program;
and the processor is used for realizing the steps of the determination method of any control node when executing the program stored in the memory.
In a fourth aspect, the embodiment of the present invention further provides a computer-readable storage medium, in which a computer program is stored, and the computer program, when executed by a processor, implements the steps of the determining method of any one of the control nodes.
According to the method and the device for determining the control node, provided by the embodiment of the invention, the simplest row ladder matrix is updated according to the position and the communication radius of the node which are periodically obtained, and then the control node is determined according to the row which is linearly related to other rows in the simplest row ladder matrix. In addition, in the embodiment of the invention, part of the nodes are selected from all the nodes in the preset control range to be used as the control nodes, instead of all the nodes being used as the control nodes, so that the number of the control nodes is reduced, and the deployment cost and the communication cost of the intelligent transportation network are greatly saved.
Of course, not all of the advantages described above need to be achieved at the same time in the practice of any one product or method of the invention.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a flowchart of a method for determining a control node according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a topology structure of a network node according to an embodiment of the present invention;
fig. 3 is a structural diagram of a control node determination apparatus according to an embodiment of the present invention;
fig. 4 is a structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In order to solve the above problems in the prior art, embodiments of the present invention provide a method and an apparatus for determining a control node, which are described in detail below.
The execution subject of the method for determining the control node provided by the embodiment of the invention can be as follows: any electronic device that deploys a control node in the network. The electronic device includes, but is not limited to, a server. For convenience of description, the following description will be made with reference to an electronic device as an execution subject, but the present invention is not limited thereto.
As shown in fig. 1, fig. 1 is a flowchart of a method for determining a control node according to an embodiment of the present invention. The method for determining the control node comprises the following steps.
And the electronic equipment acquires the position and the communication radius of each node in a preset control range every other preset time. In the embodiment of the invention, a control range, namely a preset control range, is preset for an intelligent traffic network. The preset control range is an area which needs to be controlled by the vehicle, and the preset control range can be a city or a block. The nodes in the preset control range can be vehicles, airplanes, unmanned aerial vehicles and other equipment, and the method is not limited in the embodiment of the invention. The preset duration can be set according to attributes such as the moving direction and the speed of the node.
In the embodiment of the invention, the electronic equipment can acquire the equipment information such as the service time and the service life of the node besides the position and the communication radius of the node. This is not particularly limited.
In an embodiment, the step of obtaining the position and the communication radius of each node within the preset control range every preset time (step 101) may include: the electronic equipment sends an information acquisition request to nodes in a preset control range every other preset time; and the nodes in the preset control range send the positions and the communication radiuses of the nodes to the electronic equipment according to the information acquisition request. Therefore, the electronic equipment can timely and accurately determine the position and the communication radius of the node, and the accuracy of determining the control node is further improved.
In another embodiment, the step (step 101) of acquiring the position and the communication radius of each node within the preset control range every other preset time period may be that the electronic device re-determines the position and the communication radius of each node at every other preset time period according to the moving speed and the direction of the node on the basis of the position and the communication radius of each node within the last acquired preset control range, and sends an information acquisition request to the nodes within the preset control range at every other preset period; and the nodes in the preset control range send the positions and the communication radiuses of the nodes to the electronic equipment according to the information acquisition request. The preset period may include a plurality of preset durations. Therefore, the position and the communication radius of the electronic equipment obtained from the node are reduced, network resources are saved, and the counting difficulty of the electronic equipment is reduced.
For example, the position information of the node i within the preset control range may be represented as a coordinate point (x)i,yi,zi) Wherein 0 is less than or equal to xi≤X，0≤yi≤Y，0≤ziZ is more than or equal to Z, i is more than or equal to 0 and less than or equal to N, wherein X, Y and Z are preset control ranges in three coordinate axesAnd the boundary value in the direction, N is the total number of nodes in the preset control range. If the node position is refreshed every preset time length t, the updated position information of the node is represented as
(xi,yi,zi)＝(xi+vix×t,yi+viy×t,zi+viz×t)
Wherein v isix，viy，vizRepresenting the velocity of node i in the x, y, z directions, respectively.
And 102, determining the connection relation between every two nodes according to the positions of every two nodes and the communication radius of the nodes.
In one embodiment, the electronic device may determine the connection relationship between each two nodes as follows.
Calculating the Euclidean distance between every two nodes according to the positions of every two nodes;
for every two nodes, if the Euclidean distance between the two nodes is smaller than or equal to the minimum value in the communication radiuses of the two nodes, determining that a connection relation exists between the two nodes; and if the Euclidean distance between the two nodes is larger than the minimum value in the communication radiuses of the two nodes, determining that no connection relation exists between the two nodes.
In one embodiment, in order to facilitate the electronic device to count the connection relationship between the nodes, the connection relationship between the nodes is abstracted into a undirected topology structure diagram of the network nodes. Therefore, the electronic equipment can directly obtain the connection relation between the nodes according to the connection relation between the nodes in the undirected topology structure chart, the calculation cost is reduced, and the network resources are saved.
As shown in fig. 2, fig. 2 is a schematic diagram of a topology structure of a network node according to an embodiment of the present invention. In order to facilitate the electronic equipment to identify different nodes more easily, the nodes are numbered, so that the electronic equipment can distinguish the nodes without detecting the equipment information of the nodes. In the figure, 7 nodes are numbered as node 1 to node 7, the euclidean distance between every two nodes is calculated according to the positions of every two nodes, if the euclidean distance between the node 1 and the node 2 is 40 meters, the communication radius of the node 1 is 50 meters, and the communication radius of the node 2 is 60 meters, the euclidean distance between the node 1 and the node 2 is smaller than the minimum value of the communication radii of the two nodes, namely 50 meters, so that a connection relationship exists between the node 1 and the node 2, and the connection line exists between the node 1 and the node 2. If the euclidean distance between the node 1 and the node 4 is 70 meters, the communication radius of the node 1 is 50 meters, and the communication radius of the node 4 is 70 meters, the euclidean distance between the node 1 and the node 4 is greater than the minimum value of the communication radii of the two nodes, namely 50 meters, so that no connection exists between the node 1 and the node 4, which is shown in the figure.
103, constructing an adjacent matrix according to the connection relationship between every two nodes, wherein the elements of each row in the adjacent matrix correspond to the same node, the elements of each column in the adjacent matrix correspond to the same node, the value of each element in the adjacent matrix represents the connection relationship between the two nodes corresponding to the element, the node corresponding to the element of the nth row is the same as the node corresponding to the element of the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in a preset control range.
In one embodiment, the electronic device may construct the adjacency matrix as follows.
Constructing an initial matrix, wherein the number of rows and the number of columns of the initial matrix are the same as the number of nodes in a preset control range, elements of each row in the initial matrix correspond to the same node, and elements of each column in the initial matrix correspond to the same node; the node corresponding to the element of the nth row is the same as the node corresponding to the element of the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in a preset control range;
for every two nodes, if a connection relation exists between the two nodes, setting values of elements corresponding to the two nodes in the initial matrix as a first preset value; if the two nodes do not have a connection relation, setting the values of elements corresponding to the two nodes in the initial matrix as second preset values;
and after the setting of the values of all the elements in the initial matrix is finished, taking the initial matrix after the setting as an adjacent matrix.
For example, the first preset value is 1, and the second preset value is 0. As shown in the schematic diagram of the network node topology provided in fig. 2, the number of nodes in the preset control range is 7, so that an initial matrix a 'with 7 rows and 7 columns is constructed, and the value of each element in the initial matrix a' is 0, as follows:
the elements in the first row of the initial matrix a 'correspond to node 1, the elements in the first column also correspond to node 1, the elements in the second row of the initial matrix a' correspond to node 2, the elements in the second column also correspond to node 2, and so on.
And setting the value of each element in the initial matrix A' according to the connection relation of every two nodes in the figure 2. For example, there is a connection relationship between node 1 and node 2, and node 1 and node 2 correspond to the element in the first row and the second column in the initial matrix a 'and the element in the second row and the first column in the initial matrix a', so the value of the element in the first row and the second column in the initial matrix a 'is set to 1, the value of the element in the second row and the first column in the initial matrix a' is set to 1, and so on. In addition, since the euclidean distance between a node and the node itself is 0, a connection relationship necessarily exists between the node and the node itself, and therefore, the element corresponding to the node and the node itself in the initial matrix a' is set to 1, for example, the value of the element in the first row and the first column corresponding to the node 1 and the node 1 is set to 1. The values of the other elements in the initial matrix a' are set to 0. After setting the values of the elements in the initial matrix a' is completed, the adjacency matrix a is obtained as follows:
and step 104, performing elementary column transformation according to the adjacent matrix to obtain a simplest column ladder matrix.
In one embodiment, the simplest column ladder matrix can be obtained as follows.
And subtracting the intermediate matrix from the adjacent matrix to obtain a matrix to be simplified, wherein the intermediate matrix is a matrix obtained by multiplying the unit matrix with the same dimension as the adjacent matrix and the characteristic value of the adjacent matrix.
When the adjacent matrix has a plurality of eigenvalues, one eigenvalue is arbitrarily selected to be multiplied by the identity matrix with the same dimension as the adjacent matrix, and an intermediate matrix is obtained. And subtracting the intermediate matrix from the adjacent matrix to obtain a matrix to be simplified.
And performing elementary column transformation on the matrix to be simplified to obtain the simplest column ladder matrix.
The simplest column ladder matrix is the ladder matrix if the first non-zero elements of the non-zero columns are all 1 and the rest elements of the rows where the first element 1 of the non-zero columns is located are all zero in the ladder matrix.
Still taking the above adjacency matrix a as an example, all eigenvalues of a are calculated as:
selecting a characteristic value from the characteristic values corresponding to the maximum weight number, wherein the characteristic values of A are different, that is, the maximum weight number of A is 1, so that one of the characteristic values can be selected arbitrarily, for example, 1.618, and λ is setM1.618, the intermediate matrix is λME, i.e.
Subtracting the intermediate matrix lambda from the adjacent matrix AME, obtaining a matrix to be simplified:
performing elementary column transformation on the matrix to be simplified to obtain a simplest column ladder matrix:
in step 105, the rows in the simplest column ladder matrix that are linearly related to other rows are determined.
The electronic equipment determines rows in the simplest column ladder matrix which are linearly related to other rows according to the linear correlation of the simplest column ladder matrix. The definition related to linear correlation belongs to the existing general mathematical knowledge, and the embodiment of the invention is not discussed in more detail here.
With the simplest column ladder matrix (A- λ) described aboveMEN) ' for example, it can be easily derived that the seventh row is linearly related to the other rows.
And 106, selecting a control node from the nodes corresponding to the determined row.
In one embodiment, the electronic device selects all nodes from the nodes corresponding to the determined row and determines the control node.
Each row determined in step 105 corresponds to one node, and if all the nodes corresponding to the determined rows are used as control nodes, compared with the prior art, the number of the control nodes can be reduced, and further the deployment cost and the communication cost of the intelligent transportation network are greatly saved.
In another embodiment, the electronic device calculates a maximum number of significant elements of eigenvalues of the adjacency matrix; after the rows linearly related to other rows in the simplest column ladder matrix are determined, the nodes with the number equal to the maximum weight number are selected from the nodes corresponding to the determined rows, and the control nodes are determined.
The electronic equipment calculates the maximum repeated number of the characteristic values of the adjacent matrix, and selects nodes with the number equal to the maximum repeated number from the determined rows as control nodes, so that the number of the control nodes can be minimized on the premise of realizing network controllability, and the deployment cost and the communication cost of the intelligent traffic network can be further saved.
Still taking the above-mentioned neighboring matrix a as an example, the eigenvalues of a are different from each other, so the maximum number of the eigenvalues of a is 1, which means that only 1 control node is needed to realize the controllability of the network, and the simplest rank ladder matrix (a- λ) isMEN) ' the determined action is the seventh row, so node 7 is determined to be the control node. At this time, the number of control nodesAnd the deployment cost and the communication cost of the intelligent transportation network are minimized.
According to the method for determining the control node, provided by the embodiment of the invention, the position and the communication radius of the node are regularly obtained according to the preset time length, the equipment position and the equipment information in the network can be updated in time, the adjacency matrix is constructed according to the connection relation of the node, and the elementary column transformation is carried out according to the adjacency matrix to obtain the simplest column ladder matrix; determining rows in the simplest column ladder matrix which are linearly related to other rows; and selecting a control node from the nodes corresponding to the determined row. In the embodiment of the invention, part of the nodes are selected from all the nodes in the preset control range to be used as the control nodes, but not all the nodes are used as the control nodes, so that the number of the control nodes is reduced, and the deployment cost and the communication cost of the intelligent traffic network are greatly saved.
Corresponding to the embodiment of the method for determining the control node, the embodiment of the invention also provides a device for determining the control node. As shown in fig. 3, fig. 3 is a structural diagram of a control node determination apparatus according to an embodiment of the present invention. The device includes:
an obtaining unit 301, configured to obtain the positions and communication radii of all nodes within a preset control range every other preset duration;
a first determining unit 302, configured to determine a connection relationship between every two nodes according to positions of every two nodes and communication radiuses of the nodes;
a constructing unit 303, configured to construct an adjacent matrix according to a connection relationship between every two nodes, where an element in each row in the adjacent matrix corresponds to the same node, an element in each column in the adjacent matrix corresponds to the same node, a value of each element in the adjacent matrix indicates a connection relationship between two nodes corresponding to the element, a node corresponding to an element in an nth row is the same as a node corresponding to an element in an nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in a preset control range;
a simplification unit 304, configured to perform elementary column transformation according to the adjacent matrix to obtain a simplest column ladder matrix;
a second determination unit 305 for determining rows in the simplest column ladder matrix that are linearly related to other rows;
a selecting unit 306, configured to select a control node from the nodes corresponding to the determined row.
In an embodiment, the first determining unit 302 may be specifically configured to calculate an euclidean distance between every two nodes according to the positions of every two nodes; for every two nodes, if the Euclidean distance between the two nodes is smaller than or equal to the minimum value in the communication radiuses of the two nodes, determining that a connection relation exists between the two nodes; and if the Euclidean distance between the two nodes is larger than the minimum value in the communication radiuses of the two nodes, determining that no connection relation exists between the two nodes.
In one embodiment, the constructing unit 303 may be specifically configured to construct an initial matrix, where the number of rows and the number of columns of the initial matrix are both the same as the number of nodes in a preset control range, elements in each row in the initial matrix correspond to the same node, and elements in each column in the initial matrix correspond to the same node; the node corresponding to the element of the nth row is the same as the node corresponding to the element of the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in a preset control range; for every two nodes, if a connection relation exists between the two nodes, setting values of elements corresponding to the two nodes in the initial matrix as a first preset value; if the two nodes do not have a connection relation, setting the values of elements corresponding to the two nodes in the initial matrix as second preset values; and after the setting of the values of all the elements in the initial matrix is finished, taking the initial matrix after the setting as an adjacent matrix.
In an embodiment, the selecting unit 306 is specifically configured to select all nodes from the nodes corresponding to the determined row, and determine a control node; or
Calculating the maximum repeated number of the characteristic values of the adjacent matrix; and selecting the nodes with the number equal to the maximum number of the heavy roots from the nodes corresponding to the determined rows, and determining the control nodes.
The determining device for the control node provided by the embodiment of the invention can periodically acquire the position and the communication radius of the node according to the preset time length, can timely update the equipment position and the equipment information in the network, construct an adjacency matrix according to the connection relation of the node, and perform elementary column transformation according to the adjacency matrix to obtain a simplest column ladder matrix; determining rows in the simplest column ladder matrix which are linearly related to other rows; and selecting a control node from the nodes corresponding to the determined row. In the embodiment of the invention, part of the nodes are selected from all the nodes in the preset control range to be used as the control nodes, but not all the nodes are used as the control nodes, so that the number of the control nodes is reduced, and the deployment cost and the communication cost of the intelligent traffic network are greatly saved.
Corresponding to the embodiment of the method for determining a control node, an embodiment of the present invention further provides an electronic device, as shown in fig. 4, including a processor 401, a communication interface 402, a memory 403, and a communication bus 404, where the processor 401, the communication interface 402, and the memory 403 complete mutual communication through the communication bus 404,
a memory 403 for storing a computer program;
the processor 401, when executing the program stored in the memory 403, implements the following steps:
acquiring the positions and communication radiuses of all nodes in a preset control range every other preset time;
determining the connection relation between every two nodes according to the positions of every two nodes and the communication radius of the nodes;
constructing an adjacent matrix according to the connection relation between every two nodes, wherein the elements of each row in the adjacent matrix correspond to the same node, the elements of each column in the adjacent matrix correspond to the same node, the value of each element in the adjacent matrix represents the connection relation between the two nodes corresponding to the element, the node corresponding to the element of the nth row is the same as the node corresponding to the element of the nth column, and n is more than or equal to 1 and less than or equal to the number of nodes in a preset control range;
according to the adjacent matrix, primary column transformation is carried out to obtain a simplest column ladder matrix;
determining rows in the simplest column ladder matrix which are linearly related to other rows;
and selecting a control node from the nodes corresponding to the determined row.
The communication bus mentioned in the electronic device may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The communication bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown, but this does not mean that there is only one bus or one type of bus.
The communication interface is used for communication between the electronic equipment and other equipment.
The Memory may include a Random Access Memory (RAM) or a Non-Volatile Memory (NVM), such as at least one disk Memory. Optionally, the memory may also be at least one memory device located remotely from the processor.
The Processor may be a general-purpose Processor, including a Central Processing Unit (CPU), a Network Processor (NP), and the like; but may also be a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic device, discrete hardware component.
In yet another embodiment of the present invention, a computer-readable storage medium is further provided, where a computer program is stored in the computer-readable storage medium, and the computer program, when executed by a processor, implements the steps of any of the above methods for determining a control node.
It is noted that, herein, relational terms such as first and second, and the like may be used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other identical elements in a process, method, article, or apparatus that comprises the element.
All the embodiments in the present specification are described in a related manner, and the same and similar parts among the embodiments may be referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the embodiments of the apparatus, the electronic device, and the computer-readable storage medium, since they are substantially similar to the embodiments of the method, the description is simple, and for the relevant points, reference may be made to the partial description of the embodiments of the method.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention shall fall within the protection scope of the present invention.
Claims (8)
1. A method for determining a control node, comprising:
acquiring the positions and communication radiuses of all nodes in a preset control range every other preset time;
determining the connection relation between every two nodes according to the positions of every two nodes and the communication radius of the nodes;
constructing an adjacency matrix according to the connection relation between every two nodes;
according to the adjacent matrix, primary column transformation is carried out to obtain a simplest column ladder matrix;
determining rows in the simplest column ladder matrix that are linearly related to other rows;
selecting a control node from the nodes corresponding to the determined row;
wherein, the step of constructing the adjacency matrix according to the connection relationship between every two nodes comprises the following steps:
constructing an initial matrix, wherein the number of rows and the number of columns of the initial matrix are the same as the number of nodes in the preset control range, elements of each row in the initial matrix correspond to the same node, and elements of each column in the initial matrix correspond to the same node; the node corresponding to the element in the nth row is the same as the node corresponding to the element in the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in the preset control range;
for every two nodes, if a connection relation exists between the two nodes, setting values of elements corresponding to the two nodes in the initial matrix as a first preset value; if the two nodes do not have a connection relation, setting the values of the elements corresponding to the two nodes in the initial matrix as a second preset value;
after the values of all elements in the initial matrix are set, taking the set initial matrix as an adjacent matrix;
wherein, the step of performing elementary column transformation according to the adjacency matrix to obtain a simplest column ladder matrix comprises:
subtracting an intermediate matrix from the adjacent matrix to obtain a matrix to be simplified, wherein the intermediate matrix is a matrix obtained by multiplying a unit matrix which is in the same dimension as the adjacent matrix and the characteristic value of the adjacent matrix;
and performing elementary column transformation on the matrix to be simplified to obtain a simplest column ladder matrix.
2. The method according to claim 1, wherein the step of determining the connection relationship between each two nodes according to the positions of each two nodes and the communication radius of the nodes comprises:
calculating the Euclidean distance between every two nodes according to the positions of every two nodes;
for every two nodes, if the Euclidean distance between the two nodes is smaller than or equal to the minimum value in the communication radiuses of the two nodes, determining that a connection relation exists between the two nodes; and if the Euclidean distance between the two nodes is larger than the minimum value in the communication radiuses of the two nodes, determining that no connection relation exists between the two nodes.
3. The method of claim 1, wherein the step of selecting the control node from the nodes corresponding to the determined row comprises:
selecting all nodes from the nodes corresponding to the determined row, and determining control nodes; or
Calculating the maximum repeated number of the characteristic values of the adjacency matrix; and selecting the nodes with the number equal to the maximum number of the heavy roots from the nodes corresponding to the determined rows, and determining the control nodes.
4. An apparatus for determining a control node, comprising:
the device comprises an acquisition unit, a control unit and a communication unit, wherein the acquisition unit is used for acquiring the positions and communication radiuses of all nodes in a preset control range every preset time;
the first determining unit is used for determining the connection relation between every two nodes according to the positions of every two nodes and the communication radius of the nodes;
the construction unit is used for constructing an adjacency matrix according to the connection relation between every two nodes;
the simplification unit is used for carrying out primary column transformation according to the adjacent matrix to obtain a simplest column ladder matrix;
a second determining unit, configured to determine rows in the simplest column ladder matrix that are linearly related to other rows;
a selection unit configured to select a control node from nodes corresponding to the determined row;
wherein, the step of constructing the adjacency matrix according to the connection relationship between every two nodes comprises the following steps:
constructing an initial matrix, wherein the number of rows and the number of columns of the initial matrix are the same as the number of nodes in the preset control range, elements of each row in the initial matrix correspond to the same node, and elements of each column in the initial matrix correspond to the same node; the node corresponding to the element in the nth row is the same as the node corresponding to the element in the nth column, and n is greater than or equal to 1 and less than or equal to the number of nodes in the preset control range;
for every two nodes, if a connection relation exists between the two nodes, setting values of elements corresponding to the two nodes in the initial matrix as a first preset value; if the two nodes do not have a connection relation, setting the values of the elements corresponding to the two nodes in the initial matrix as a second preset value;
after the values of all elements in the initial matrix are set, taking the set initial matrix as an adjacent matrix;
wherein, the step of performing elementary column transformation according to the adjacency matrix to obtain a simplest column ladder matrix comprises:
subtracting an intermediate matrix from the adjacent matrix to obtain a matrix to be simplified, wherein the intermediate matrix is a matrix obtained by multiplying a unit matrix which is in the same dimension as the adjacent matrix and the characteristic value of the adjacent matrix;
and performing elementary column transformation on the matrix to be simplified to obtain a simplest column ladder matrix.
5. The apparatus according to claim 4, wherein the first determining unit is specifically configured to:
calculating the Euclidean distance between every two nodes according to the positions of every two nodes;
for every two nodes, if the Euclidean distance between the two nodes is smaller than or equal to the minimum value in the communication radiuses of the two nodes, determining that a connection relation exists between the two nodes; and if the Euclidean distance between the two nodes is larger than the minimum value in the communication radiuses of the two nodes, determining that no connection relation exists between the two nodes.
6. The apparatus according to claim 4, wherein the selection unit is specifically configured to:
selecting all nodes from the nodes corresponding to the determined row, and determining control nodes; or
Calculating the maximum repeated number of the characteristic values of the adjacency matrix; and selecting the nodes with the number equal to the maximum number of the heavy roots from the nodes corresponding to the determined rows, and determining the control nodes.
7. An electronic device is characterized by comprising a processor, a communication interface, a memory and a communication bus, wherein the processor and the communication interface are used for realizing mutual communication by the memory through the communication bus;
a memory for storing a computer program;
a processor for implementing the method steps of any of claims 1 to 3 when executing a program stored in the memory.
8. A computer-readable storage medium, characterized in that a computer program is stored in the computer-readable storage medium, which computer program, when being executed by a processor, carries out the method steps of any one of the claims 1-3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910916959.2A CN110611881B (en) | 2019-09-26 | 2019-09-26 | Control node determination method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910916959.2A CN110611881B (en) | 2019-09-26 | 2019-09-26 | Control node determination method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110611881A CN110611881A (en) | 2019-12-24 |
| CN110611881B true CN110611881B (en) | 2020-09-18 |
Family
ID=68893512
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910916959.2A Active CN110611881B (en) | 2019-09-26 | 2019-09-26 | Control node determination method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110611881B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108183929A (en) * | 2017-11-28 | 2018-06-19 | 特斯联（北京）科技有限公司 | A kind of target association sensory perceptual system and method based on Intelligentized internet-of-thing |
| CN108848191A (en) * | 2018-07-26 | 2018-11-20 | 深圳市元征科技股份有限公司 | A kind of joint connecting method and relevant device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9610476B1 (en) * | 2016-05-02 | 2017-04-04 | Bao Tran | Smart sport device |
-
2019
- 2019-09-26 CN CN201910916959.2A patent/CN110611881B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108183929A (en) * | 2017-11-28 | 2018-06-19 | 特斯联（北京）科技有限公司 | A kind of target association sensory perceptual system and method based on Intelligentized internet-of-thing |
| CN108848191A (en) * | 2018-07-26 | 2018-11-20 | 深圳市元征科技股份有限公司 | A kind of joint connecting method and relevant device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110611881A (en) | 2019-12-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7344389B2 (en) | Cooperative positioning methods, devices, equipment and storage media | |
| CN107808122B (en) | Target tracking method and device | |
| JP6384065B2 (en) | Information processing apparatus, learning method, and program | |
| JP6596516B2 (en) | Method and apparatus for improving the positioning performance of an artificial neural network | |
| KR102116824B1 (en) | Positioning system based on deep learnin and construction method thereof | |
| CN105356450B (en) | A kind of sub-area division method based on dynamic electricity price | |
| CN110967028B (en) | Navigation map construction method and device, robot and storage medium | |
| CN111461410B (en) | Air quality prediction method and device based on transfer learning | |
| CN110232584B (en) | Parking lot site selection method and device, computer readable storage medium and terminal equipment | |
| CN113054651B (en) | Network topology optimization method, device and system | |
| CN112203324B (en) | MR positioning method and device based on position fingerprint database | |
| CN116828515A (en) | Edge server load prediction method based on space-time diagram convolution under Internet of vehicles | |
| CN110611881B (en) | Control node determination method and device | |
| KR101814023B1 (en) | Apparatus and Method for Automatic Calibration of Finite Difference Grid Data | |
| CN111260056B (en) | Network model distillation method and device | |
| CN115859765B (en) | Urban expansion prediction method, device, equipment and storage medium | |
| CN108133234B (en) | Sparse subset selection algorithm-based community detection method, device and equipment | |
| CN104968047A (en) | Network distance prediction algorithm aiming for nodes in mobile network | |
| CN110308428B (en) | Method for establishing low-altitude clutter distribution simulation model | |
| CN104965190A (en) | Axial decoupling indoor positioning method based on location fingerprint | |
| CN111767934A (en) | Image identification method and device and electronic equipment | |
| CN110019633B (en) | Line density statistical method and system based on ArcGIS secondary development | |
| CN104917575A (en) | Monitoring point layout optimization method for radio environment monitoring | |
| CN114444416B (en) | Grid aggregation method and device for fluid dynamics simulation | |
| CN117253209B (en) | Automatic driving point cloud detection method, device, communication equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |