CN113259242B - Method and device for networking field area network - Google Patents
Method and device for networking field area network Download PDFInfo
- Publication number
- CN113259242B CN113259242B CN202110651146.2A CN202110651146A CN113259242B CN 113259242 B CN113259242 B CN 113259242B CN 202110651146 A CN202110651146 A CN 202110651146A CN 113259242 B CN113259242 B CN 113259242B
- Authority
- CN
- China
- Prior art keywords
- node
- link
- signal
- path
- noise ratio
- 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
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/004—Artificial life, i.e. computing arrangements simulating life
- G06N3/006—Artificial life, i.e. computing arrangements simulating life based on simulated virtual individual or collective life forms, e.g. social simulations or particle swarm optimisation [PSO]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
- H04L45/08—Learning-based routing, e.g. using neural networks or artificial intelligence
Abstract
The embodiment of the invention provides a field area network networking method and device, which are used for the field of power distribution. The method comprises the following steps: acquiring a preliminary network topological structure; and realizing field area network networking according to the primary network topology structure and the improved ant colony algorithm, wherein the improved ant colony algorithm comprises a path reliability factor. The invention selects the shortest path from the central node to each node in the network based on the improved ant colony algorithm, uses the path reliability factor for weighting, accelerates the convergence speed of the algorithm, optimizes the networking structure and realizes the networking of the whole field area network.
Description
Technical Field
The invention belongs to the field of power distribution Internet of things, and particularly relates to a field area network networking method and device and a power distribution method.
Background
The power distribution internet of things is a novel power network form generated by deep fusion of the traditional industrial technology and the internet of things technology, and comprehensive sensing, data fusion and intelligent application of a power distribution network are realized through comprehensive interconnection, intercommunication and interoperation among power distribution network devices. Along with the continuous promotion and the perfection of the construction task of the power internet of things, the number and the complexity of equipment in the links of the power distribution network are continuously increased, a sensing layer in the power distribution network plays an important role, and the accuracy and the timeliness of monitoring, operation and maintenance of the sensing layer are directly related to whether the power distribution network can safely, stably and reliably operate.
At present, distribution equipment is multi-faceted and wide, transformation is frequent, ledger information acquisition is basically completed manually, accuracy and timeliness are difficult to guarantee, and the whole life cycle management of the distribution equipment cannot be effectively supported; the wiring mode and the operation mode of the power distribution network are changed frequently, a large number of people, properties and objects need to be consumed for field check according to the corresponding relation among medium-voltage topological connection, the transformer area and the household transformer, the authenticity and the consistency of data are influenced, hidden dangers are caused to the safe operation of the power distribution network, and the difficulty of operation and distribution integration and line loss lean management of workers is increased.
Disclosure of Invention
The method selects the shortest path from a central node to each node in the network based on an improved ant colony algorithm, uses path reliability factors for weighting, accelerates the convergence speed of the algorithm, optimizes the networking structure and realizes the networking of the whole field network.
The invention provides a field area network networking method, which comprises the following steps: acquiring a preliminary network topological structure; and realizing field area network networking according to the primary network topology structure and the improved ant colony algorithm, wherein the improved ant colony algorithm comprises a path reliability factor.
Optionally, the obtaining the preliminary network topology includes the following steps: the central node initiates a networking process; determining neighbor nodes of each node according to the information fed back by each node; and after all the nodes complete the feedback, obtaining a preliminary network topology structure.
Optionally, the node includes one or more of a platform area intelligent terminal, a power distribution device, a switch cabinet and a branch box, and the central node is the platform area intelligent terminal.
Optionally, implementing a field area network networking according to the preliminary network topology and the improved ant colony algorithm, including: determining a path reliability factor according to the signal-to-noise ratio factor of the link, the signal-to-noise ratio change rate of the link and the number of paths from the first node to the final destination node; determining the state transition probability of the node according to the path reliability factor, the pheromone concentration and the heuristic information; determining an optimal path according to the state transition probability of the node; and realizing field area network networking according to the communication mode and the optimal path among the nodes.
Optionally, the path reliability factor is used to reflect a probability of successful communication from the first node to the final destination node.
Optionally, the determining the path reliability factor according to the sum of the signal-to-noise ratio factors of the links, the signal-to-noise ratio change rate of the links, and the number of paths passing from the first node to the final destination node includes: determining the communication reliability of the link according to the signal-to-noise ratio factor of the link and the signal-to-noise ratio change rate of the link; and determining a path reliability factor according to the communication reliability and the number of paths from the first node to the final destination node.
Optionally, the determining the communication reliability of the link according to the snr factor of the link and the snr change rate of the link includes determining the communication reliability of the link within a time period T
Comprises the following steps:
wherein the content of the first and second substances,
is the signal-to-noise ratio factor of the link (i, j),
is the rate of change of the signal-to-noise ratio of the link (i, j).
Optionally, the link signal-to-noise factor when the signal-to-noise ratio of the link (i, j) is available
Is 1; link signal-to-noise factor when signal-to-noise ratio of link (i, j) is not available
Is 0.
Optionally, a path reliability factor is determined according to the communication reliability and the number of paths from the first node to the final destination node
Comprises the following steps:
wherein the content of the first and second substances,
m is the number of paths traversed from the first node to the final destination node,
is the signal-to-noise ratio factor of the link (i, j),
is the rate of change of the signal-to-noise ratio of the link (i, j).
Optionally, the state transition probability of the node is determined according to the path reliability factor, the pheromone concentration and the heuristic information, wherein the state transition probability includes the state transition probability that the ant k moves to the next node at the time t
Comprises the following steps:
wherein M is the number of paths from the first node to the final destination node,
nodes that are next allowed access but not accessed for ants,
is the signal-to-noise ratio factor of the link (i, j),
is the signal-to-noise ratio factor of the link (i, m),
the rate of change of the signal-to-noise ratio of the link (i, j),
the rate of change of the signal-to-noise ratio of the link (i, m),
the intensity value of the pheromone on the path (i, j) at time t,
the concentration value of the pheromone on the path (i, m) at time t,
indicating heuristic information on the path (i, j) at time t,
indicating heuristic information on the path (i, m) at time t.
Optionally, the communication mode is carrier communication and/or wireless communication.
Optionally, the communication mode is selected as one with higher reliability in carrier communication and wireless communication.
Optionally, the field area network networking method further includes updating and maintaining the node when the node is increased or decreased and/or the node location is changed.
Correspondingly, an embodiment of the present invention further provides a field area network networking apparatus, where the apparatus includes: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the computer program to implement the field area network networking method according to any one of the above.
Correspondingly, the embodiment of the invention also provides a power distribution method, and power distribution arrangement is carried out on each node according to the field area network networking method.
Accordingly, an embodiment of the present invention further provides a machine-readable storage medium, where the machine-readable storage medium has instructions stored thereon, and the instructions cause a machine to execute the field area network networking method according to any one of the foregoing descriptions.
At present, in the aspect of power distribution business, information acquisition and monitoring at a terminal side are insufficient in coverage, low in online rate and poor in instantaneity, a unified planning design is lacked, low-voltage power distribution station equipment is various in types and different in communication interfaces, and isolated units are easily formed. The topological structure of the power distribution side is complex and changeable, the change is frequent, the access or disconnection of the bottom layer nodes cannot be carried out in time, and networking and topology updating cannot be carried out. According to the traditional scheme, the master station is required to flood and send information again, the information can travel to all nodes, great burden and resource waste are brought to a communication network, the influence of communication delay and the like is easily caused, and timely processing and fine management of faults cannot be realized. In the existing carrier or wireless single communication mode, the power carrier communication technology cannot be opened or unstable due to poor line channel condition, large attenuation, large impedance change, strong burst interference and the like; the micropower wireless communication technology has the problems of limited communication capability, short transmission distance, easy environmental influence and interference, communication blind areas, frequency interference and the like.
The power distribution field domain network networking method and system provided by the invention select the shortest path from the central node to each node in the network based on an improved ant colony algorithm, carry out weighting by utilizing the reliability of the path and determine the communication mode among the nodes, thereby realizing the networking of the whole field domain network, and in addition, the updating and the maintenance of the nodes are completed in a minimum overhead mode, the networking structure is optimized, the coverage range is expanded, the communication blind spot is eliminated, and the reliability of the communication network is improved.
Additional features and advantages of embodiments of the invention will be set forth in the detailed description which follows.
Drawings
The accompanying drawings, which are included to provide a further understanding of the embodiments of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the embodiments of the invention without limiting the embodiments of the invention. In the drawings:
fig. 1 is a schematic flow chart of a field area network networking method according to the present invention;
FIG. 2 is a schematic flow chart of obtaining a preliminary network topology according to an embodiment of the present invention;
fig. 3 and 4 are schematic flow diagrams of an improved ant colony algorithm used in embodiments of the present invention.
Detailed Description
The following detailed description of embodiments of the invention refers to the accompanying drawings. It should be understood that the detailed description and specific examples, while indicating embodiments of the invention, are given by way of illustration and explanation only, not limitation.
Fig. 1 is a schematic flow chart of a field networking method of the present invention, preferably used for electric power distribution. As shown in fig. 1, a method for networking a field area network according to an embodiment of the present invention may include the following steps:
step S101, a preliminary network topology is obtained. The network topology is the network shape, or its physical connectivity. There are many topologies for constructing a network. Network topology refers to the physical layout of the devices interconnected by a transmission medium, which is the manner in which the devices, such as computers, in a network are connected. The topological diagram shows the network configuration and mutual connection of the network server and the workstation, and the structure of the topological diagram mainly comprises a star structure, a ring structure, a bus structure, a distributed structure, a tree structure, a mesh structure, a honeycomb structure and the like.
The obtaining of the preliminary network topology may include: the central node initiates a networking process; determining neighbor nodes of each node according to the information fed back by each node; and after all the nodes complete the feedback, obtaining a preliminary network topology structure. The nodes may comprise one or more of intelligent terminals, distribution equipment, switch cabinets and branch boxes, and preferably, the central node is an intelligent terminal.
In the invention, the distribution field area network can take a platform area intelligent terminal as a core, realize a self-organizing local communication network of backbone nodes such as distribution equipment, a switch cabinet, a branch box and the like, form a distribution platform area local communication backbone network, transmit electrical information and environmental information acquired by the distribution equipment to the intelligent terminal through power line carrier waves/wireless, and realize wide interconnection, deep information acquisition, comprehensive perception and data fusion of the distribution equipment to the distribution network.
And S102, realizing field area network networking according to the primary network topology structure and the improved ant colony algorithm, including the path reliability factor. The ant colony algorithm is a group intelligent algorithm, and a group of individuals (agents) without intelligence or with slight intelligence show intelligent behaviors through mutual cooperation, so that a new possibility is provided for solving complex problems. The ant colony algorithm is a bionic algorithm and is inspired by the foraging behavior of ants in nature. In nature, the ant colony is always able to find an optimal path from the nest and the food source as ants seek food.
According to the primary network topology structure and the improved ant colony algorithm, the field area network networking is realized, which comprises the following steps: the communication reliability of the link is determined according to the signal-to-noise ratio factor of the link and the signal-to-noise ratio change rate of the link, and the basic purpose of communication is to timely and accurately complete tasks of information transmission and exchange. One important metric measuring the performance of a communication system is reliability. Which refers to the degree of reliability of the information received in a given channel. The metric measures differently for analog and digital communication systems. In an analog communication system, reliability is expressed by the output signal-to-noise ratio of the system, which is the ratio of the average power of the signal at the output end of the communication system to the average power of noise, wherein the signal-to-noise ratio at least comprises a signal-to-noise factor and a signal-to-noise ratio change rate; determining a path reliability factor according to the communication reliability of a link and the number of paths from a first node to a final destination node, wherein the path reliability factor is used for reflecting the successful communication probability from the first node to the final destination node, and the higher the success rate is, the higher the reliability is; determining the state transition probability of the node according to the path reliability factor, the pheromone concentration and the heuristic information, and determining the next moving direction of the ant according to the state transition probability; determining an optimal path according to the state transition probability of the node; and realizing field area network networking according to the communication mode and the optimal path among the nodes.
In the traditional ant colony algorithm, the pheromones of all nodes are the same in the initial stage, ants mainly depend on the difference of heuristic information in path selection, and the next moving direction of the ants is determined according to the state transition probability, so that the randomness of the ants in the searching process is ensured. Due to the pheromone concentration positive feedback mechanism of the ant colony algorithm, after a plurality of search cycles, the pheromone concentration of the local optimal solution is continuously increased, all ants tend to the local optimal path, and the algorithm falls into local optimal.
The heuristic information is in inverse proportion to the distance from the current node to the next node, as iteration progresses, the concentration difference of pheromones of each path is larger and larger along with different updating modes, and the guidance action authority of the pheromones is gradually increased. The convergence rate of the algorithm is improved, the possibility of stagnation of the local optimal solution is reduced, and the possibility of searching the optimal solution globally in a short time is improved. And determining a communication mode between each node according to the path reliability and the link reliability by weighting the reliability factor, and if the path reliability of the carrier communication mode is greater than that of the wireless communication mode, selecting the carrier communication mode between the two nodes, and vice versa, thereby completing the networking of the whole field area network.
Fig. 2 is a schematic flow chart of obtaining a preliminary network topology according to an embodiment of the present invention. As shown in fig. 2, obtaining the preliminary network topology may include the steps of:
step S201, the central node initiates networking. The nodes of the networking (including the central node) may include one or more of intelligent terminals, power distribution equipment, switch cabinets and branch boxes, and preferably, the central node is an intelligent terminal. Firstly, the intelligent terminal of the transformer area is used as a first central node, and a broadcast networking process is respectively initiated from the node in a carrier mode and a wireless mode. The distribution field area network takes a distribution area intelligent terminal as a core, realizes a self-organization local communication network of backbone nodes such as distribution equipment, a switch cabinet, a branch box and the like, forms a distribution area local communication backbone network, and transmits electrical information and environmental information acquired by the distribution equipment to the intelligent terminal through power line carrier/wireless, so that the distribution equipment is widely interconnected, the information is deeply acquired, and comprehensive perception and data fusion of a distribution network are realized.
And S202, determining neighbor nodes of the nodes according to the information fed back by the nodes. Triggering neighbor nodes to carry out network access requests by sending request association messages, collecting the request association messages of carrier links of all nodes and the field intensity of wireless links by a central node, counting the success rate of communication, and establishing a temporary neighbor table; and then respectively initiating networking information by taking the nodes in the neighbor table as central nodes, updating the neighbor table according to the collected feedback information of the step-by-step nodes, and continuing to perform step-by-step networking.
Step S203, after all the nodes complete the feedback, a preliminary network topology structure is obtained. After all the nodes are fed back, the topological structure of the self-organizing local communication network from the station area intelligent terminal node to the backbone nodes such as the switch cabinet and the branch box and the carrier/wireless communication mode among all the nodes are obtained preliminarily.
Fig. 3 is a flow diagram of an improved ant colony algorithm used in an embodiment of the present invention.
The traditional ant colony algorithm is a probability type algorithm used for searching an optimization path, a walking path of an ant is used for representing a feasible solution of a problem to be optimized, and all paths of the whole ant colony form a solution space of the problem to be optimized. During foraging and tracing, ants can release a substance called pheromone on the path which is traveled, the pheromone amount released by ants with shorter paths is larger, the concentration of the pheromone accumulated on the shorter paths is gradually increased along with the advance of time, and the number of ants selecting the path is increased. Finally, the whole ant can be concentrated on the optimal path under the action of positive feedback, so that the optimal path is found.
The ant k selects the next node according to the pheromones left by all the former ants in the moving process, the traditional ant colony algorithm selects the next node according to the state transition rule, and in the ant colony algorithm, the next node is used
The distance between the points i, j is represented,
indicating the path at time t
The concentration value of the above pheromone is,
indicating heuristic information on the path at time t, wherein
At the initial moment, take
Randomly placing m ants on n nodes, wherein the state transition probability of the ant k moving to the next node at the time t is as follows:
wherein
To indicate the relative importance of the pheromone,
to indicate the relative importance of the heuristic information,
representing nodes that the ant can allow access but not access next.
The larger the value, the greater the probability that the representative ant will select the next node. By using
Expressing the volatilization coefficient of the path pheromone, then
And (3) representing path pheromone residual factors, and updating pheromone concentration values of all paths according to the following formula after all ants complete one cycle:
in the formula
Indicating the pheromone concentration at time t-1,
the pheromone increment of the kth ant is represented by the following calculation formula:
where Q represents the pheromone strength, is a constant value,
representing the total length of the path taken by the kth ant in the current round of circulation.
In the traditional ant colony algorithm, the pheromones of all nodes are the same in the initial stage, ants mainly depend on the difference of heuristic information in path selection, and the next moving direction of the ants is determined according to the state transition probability, so that the randomness of the ants in the searching process is ensured. Due to the pheromone concentration positive feedback mechanism of the ant colony algorithm, after a plurality of search cycles, the pheromone concentration of the local optimal solution is continuously increased, all ants tend to the local optimal path, and the algorithm falls into local optimal.
As shown in fig. 3, the improved ant colony algorithm of the present invention may include the following steps:
step S301, determining the communication reliability of the link according to the SNR factor and the SNR change rate of the link. The heuristic information is in inverse proportion to the distance from the current node to the next node, as iteration progresses, the concentration difference of pheromones of each path is larger and larger along with different updating modes, the guidance action authority of the pheromones is gradually increased, and the convergence of the algorithm can be accelerated by introducing the path reliability factor. Link signal-to-noise factor when signal-to-noise ratio of link (i, j) is available
Is 1; link signal-to-noise factor when signal-to-noise ratio of link (i, j) is not available
Is 0. Signal-to-noise ratio factor of link
：
Determining the communication reliability of the link according to the signal-to-noise ratio factor of the link and the signal-to-noise ratio change rate of the link, wherein the communication reliability of the link is determined within the time with the period of T
Comprises the following steps:
wherein the content of the first and second substances,
is the signal-to-noise ratio factor of the link (i, j),
is the rate of change of the signal-to-noise ratio of the link (i, j).
Step S302, according to the communication reliability of the link and the number of paths from the first node to the final destination node, a path reliability factor is determined. The path reliability factor
Comprises the following steps:
wherein the content of the first and second substances,
m is the number of paths traversed from the first node to the final destination node,
for the signal-to-noise ratio factor of the link (i, j),
is the rate of change of the signal-to-noise ratio of the link (i, j).
Step S303, determining the state transition probability of the node according to the path reliability factor, the pheromone concentration and the heuristic information. Including the probability of a state transition of ant k to the next node at time t
Comprises the following steps:
wherein M is the number of paths from the first node to the final destination node,
nodes that are next allowed access but not accessed for ants,
is the signal-to-noise ratio factor of the link (i, j),
is the signal-to-noise ratio factor of the link (i, m),
the rate of change of the signal-to-noise ratio of the link (i, j),
the rate of change of the signal-to-noise ratio of the link (i, m),
the intensity value of the pheromone on the path (i, j) at time t,
for the concentration of pheromones on the path (i, m) at time tThe value of the intensity of the light beam is calculated,
indicating heuristic information on the path (i, j) at time t,
indicating heuristic information on the path (i, m) at time t.
Determining an optimal path according to the state transition probability of the node; and realizing field area network networking according to the communication mode and the optimal path among the nodes. Through the strategy improvement, the convergence speed of the algorithm is improved, meanwhile, the possibility of stagnation of the local optimal solution is reduced, and the possibility of searching the optimal solution globally in a short time is improved. And determining the communication mode among the nodes according to the path reliability and the link reliability by weighting the reliability factor. The communication mode can be carrier communication and/or wireless communication. Preferably, the communication method is selected as one having a high reliability in carrier communication and wireless communication. After the best path is determined, if the two nodes only have the carrier or wireless communication mode, the carrier or wireless is directly selected. If both communication modes exist, the communication mode among all nodes is determined according to the weighting of the reliability factor and the reliability of the path and the link, and the communication mode with the optimal signal-to-noise ratio is selected. If the path reliability of the carrier communication mode is greater than that of the wireless communication mode, the communication mode between the two nodes selects the carrier communication mode, and vice versa, so that the networking of the whole field area network is completed.
Fig. 4 is a schematic flow chart of the improved ant colony algorithm of the present invention, which is another specific embodiment of fig. 3. As shown in the figure: initializing parameter information, randomly placing m ants on n nodes, increasing the number of ants in the searching process by increasing the cycle number of the ants, selecting the next node based on the weighted state transition probability, modifying Zk (i) after the ant k finishes the node selection until the ant k passes through all the nodes, then updating pheromone based on an improved ant colony algorithm, resetting the m ants as initial nodes and emptying Zk (i) for the next iteration, continuing to search the ants if the cycle number does not reach a set value, and ending if the cycle number reaches the set value.
The field area network networking method further comprises the step of updating and maintaining the nodes when the nodes are increased or decreased and/or the positions of the nodes are changed. In the actual networking process, the node may be added or deleted, and the node position may change, so that the node networking needs to be updated and maintained. When a certain node is newly added, the node is taken as a central node to respectively initiate a networking process in a carrier wave and wireless mode, and the neighbor nodes of the node are determined according to the feedback information of each node, wherein the node can be directly connected to the intelligent terminal of the transformer area in a carrier wave/wireless mode, and the neighbor nodes can also be taken as proxy nodes to access the network. The route and the communication mode from the platform area intelligent terminal to the node are calculated through the improved ant colony algorithm, the networking optimal route and the communication mode of the node can be obtained, and the network access request of the node is completed. Similarly, when a node is deleted or the position of the node is changed, only the network topology information of the neighbor node in the area where the node is located needs to be updated, the networking topology is obtained again by using the improved ant colony algorithm, flooding is not needed to be carried out in the whole network, and updating and maintenance of the node are completed in a mode of minimum network overhead.
According to the method, the heuristic information is weighted by using the path reliability factor, the convergence speed of the traditional ant colony algorithm is increased, meanwhile, a carrier/wireless communication mode between nodes can be obtained through link reliability evaluation, and the networking topology of the whole field area network is determined; the field area network networking mode provided by the invention is also suitable for updating the network nodes, only the network cost of the neighbor nodes is needed to be increased, the flooding of the whole network is not needed, and the updating of the network topology is completed with the minimum cost.
Based on an improved ant colony algorithm, the shortest path from a central node to each node in the network is selected, weighting is carried out by utilizing the reliability of the path, and the communication mode among the nodes is determined, so that the networking of the whole field area network is realized; by adopting a power line carrier and micropower wireless fusion communication technology, the deployment of power line carriers and wireless dual channels or a heterogeneous networking deployment mode is facilitated, a networking structure is optimized, the coverage range is expanded, a communication blind spot is eliminated, and the reliability of a communication network is improved.
An embodiment of the present invention further provides a field area network networking apparatus, where the apparatus includes: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the computer program to implement the field area network networking method according to any one of the above.
The embodiment of the invention also provides a power distribution method, and power distribution arrangement is carried out on each node according to the field area network networking method.
An embodiment of the present invention further provides a machine-readable storage medium, where the machine-readable storage medium stores instructions for causing a machine to execute the field area network networking method according to any one of the foregoing descriptions.
Although the embodiments of the present invention have been described in detail with reference to the accompanying drawings, the embodiments of the present invention are not limited to the details of the above embodiments, and various simple modifications can be made to the technical solutions of the embodiments of the present invention within the technical idea of the embodiments of the present invention, and the simple modifications all belong to the protection scope of the embodiments of the present invention.
It should be noted that the various features described in the above embodiments may be combined in any suitable manner without departing from the scope of the invention. In order to avoid unnecessary repetition, the embodiments of the present invention do not describe every possible combination.
Those skilled in the art will understand that all or part of the steps in the method according to the above embodiments may be implemented by a program, which is stored in a storage medium and includes several instructions to enable a single chip, a chip, or a processor (processor) to execute all or part of the steps in the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.
In addition, any combination of various different implementation manners of the embodiments of the present invention is also possible, and the embodiments of the present invention should be considered as disclosed in the embodiments of the present invention as long as the combination does not depart from the spirit of the embodiments of the present invention.
Claims (13)
1. A field area network networking method is characterized by comprising the following steps:
acquiring a preliminary network topological structure;
according to a primary network topology structure and an improved ant colony algorithm, field area network networking is achieved, wherein the improved ant colony algorithm comprises path reliability factors and comprises the following steps:
determining the communication reliability of the link according to the signal-to-noise ratio factor of the link and the signal-to-noise ratio change rate of the link;
determining a path reliability factor according to the communication reliability and the number of paths from the first node to the final destination node;
determining the state transition probability of the node according to the path reliability factor, the pheromone concentration and the heuristic information;
determining an optimal path according to the state transition probability of the node;
according to the communication mode and the optimal path among the nodes, field area network networking is realized;
the path reliability factor is used to reflect the probability of successful communication from the first node to the final destination node.
2. The method of claim 1, wherein the obtaining of the preliminary network topology comprises:
the central node initiates a networking process;
determining neighbor nodes of each node according to the information fed back by each node;
and after all the nodes complete the feedback, obtaining a preliminary network topology structure.
3. The method of claim 2,
the node comprises one or more of a platform area intelligent terminal, power distribution equipment, a switch cabinet and a branch box, and the central node is the platform area intelligent terminal.
4. The method of claim 1, wherein determining the communication reliability of the link based on the signal-to-noise ratio factor of the link and the rate of change of the signal-to-noise ratio of the link comprises
The communication reliability of the link is within the time with the period T
Comprises the following steps:
wherein the content of the first and second substances,
is the signal-to-noise ratio factor of the link (i, j),
5. The method of claim 4,
link signal-to-noise factor when signal-to-noise ratio of link (i, j) is available
Is 1;
link signal-to-noise factor when signal-to-noise ratio of link (i, j) is not available
Is 0.
6. The method of claim 1, wherein determining a path reliability factor is based on the communication reliability and the number of paths traversed from the first node to the final destination node
Comprises the following steps:
wherein the content of the first and second substances,
for the communication reliability of the link (i, j),
m is the number of paths traversed from the first node to the final destination node,
7. The method of claim 1, wherein determining the state transition probability of a node based on the path reliability factor, the pheromone concentration, and the heuristic information comprises
State transition probability of ant k moving to next node at time t
Comprises the following steps:
wherein M is the number of paths from the first node to the final destination node,
nodes that are next allowed access but not accessed for ants,
8. The method of claim 1,
the communication mode is carrier communication and/or wireless communication.
9. The method according to claim 8, wherein the communication method is selected as one having a higher reliability in carrier communication and wireless communication.
10. The method of claim 1, wherein the field area network networking method further comprises
And when the nodes are increased or decreased and/or the positions of the nodes are changed, the nodes are updated and maintained.
11. A field area network networking apparatus, comprising: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the computer program to implement the field area network networking method according to any one of claims 1 to 10.
12. A power distribution method, characterized in that the field area network networking method according to any one of claims 1-10 performs power distribution arrangement for each node.
13. A machine-readable storage medium having stored thereon instructions for causing a machine to perform the method of any one of claims 1-10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110651146.2A CN113259242B (en) | 2021-06-11 | 2021-06-11 | Method and device for networking field area network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110651146.2A CN113259242B (en) | 2021-06-11 | 2021-06-11 | Method and device for networking field area network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113259242A CN113259242A (en) | 2021-08-13 |
| CN113259242B true CN113259242B (en) | 2021-10-01 |
Family
ID=77187743
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110651146.2A Active CN113259242B (en) | 2021-06-11 | 2021-06-11 | Method and device for networking field area network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113259242B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114205283B (en) * | 2021-12-16 | 2023-08-29 | 赫里奥(苏州)科技有限公司 | Heterogeneous network topology establishment method of Internet of things, network and optimal path calculation method |
| CN114268573B (en) * | 2021-12-23 | 2023-06-27 | 南京南瑞信息通信科技有限公司 | HPLC and RF-based method, device and system for routing mixed group network of stations |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103559536A (en) * | 2013-11-12 | 2014-02-05 | 杭州银江智慧城市技术集团有限公司 | Illumination communication dynamic routing ant colony algorithm based on new probability transfer function |
| CN108540204A (en) * | 2018-03-22 | 2018-09-14 | 大连大学 | Fast Convergent ant group algorithm for satellite network Topology g eneration |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR102324361B1 (en) * | 2017-05-29 | 2021-11-11 | 한국전자통신연구원 | Apparatus and method for detecting malicious devices based on a swarm intelligence |
-
2021
- 2021-06-11 CN CN202110651146.2A patent/CN113259242B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103559536A (en) * | 2013-11-12 | 2014-02-05 | 杭州银江智慧城市技术集团有限公司 | Illumination communication dynamic routing ant colony algorithm based on new probability transfer function |
| CN108540204A (en) * | 2018-03-22 | 2018-09-14 | 大连大学 | Fast Convergent ant group algorithm for satellite network Topology g eneration |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113259242A (en) | 2021-08-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113259242B (en) | Method and device for networking field area network | |
| CN108540204B (en) | Satellite network topology generation method using fast convergence ant colony algorithm | |
| Patil et al. | Serial data fusion using space-filling curves in wireless sensor networks | |
| Potluri et al. | Hybrid metaheuristic algorithms for minimum weight dominating set | |
| CN104539315A (en) | Rapid networking method for power line carrier communication | |
| CN111163477B (en) | Automatic deployment method of integrated intelligent base station in wide-area three-dimensional environment | |
| CN101652959A (en) | Arrangement and method relating to network management | |
| CN113765544B (en) | Dual-mode heterogeneous field area network multipath concurrent transmission method, system and device based on HPLC and RF | |
| CN108200628B (en) | Wireless ad hoc networking method of linear topological structure | |
| CN106658539B (en) | Mobile path planning method for mobile data collector in wireless sensor network | |
| Gunasekaran et al. | Efficient algorithms to solve broadcast scheduling problem in WiMAX mesh networks | |
| CN106792912B (en) | A kind of improvement method for routing and device based on AODV | |
| CN105246117A (en) | Energy-saving routing protocol realization method suitable for mobile wireless sensor network | |
| CN110290001B (en) | Single-chain structure optimization method, device and equipment for power communication network | |
| Kechiche et al. | A novel opportunistic fuzzy logic based objective function for the routing protocol for low-power and lossy networks | |
| Marcuzzi et al. | Artificial-intelligence-based performance enhancement of the G3-PLC LOADng routing protocol for sensor networks | |
| Al-Hamid et al. | Vehicular intelligence: Towards vehicular network digital-twin | |
| CN114844812A (en) | Low-delay low-overhead path deployment method for active network remote sensing | |
| Chen | Simulation model of AI-assisted cognitive routing algorithm for the dynamic optical network in business | |
| Morgan | An ant colony approach to regenerator placement with fault tolerance in optical networks | |
| Koskinen et al. | On improving connectivity of static ad-hoc networks by adding nodes | |
| CN110289980A (en) | Using the method and system of learning automaton prediction pocket exchange network link | |
| CN114615678A (en) | Construction method based on dynamic tree network flow model | |
| CN109379726B (en) | SA message forwarding and sharing method and device in LTE-V2V | |
| Rathod et al. | Relay placement algorithms for IoT connectivity and coverage in an outdoor heterogeneous propagation environment |
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 |