CN113726565B - Method for designing monitoring information transmission topological structure in strip-shaped non-mobile network area - Google Patents
Method for designing monitoring information transmission topological structure in strip-shaped non-mobile network area Download PDFInfo
- Publication number
- CN113726565B CN113726565B CN202110976988.5A CN202110976988A CN113726565B CN 113726565 B CN113726565 B CN 113726565B CN 202110976988 A CN202110976988 A CN 202110976988A CN 113726565 B CN113726565 B CN 113726565B
- Authority
- CN
- China
- Prior art keywords
- node
- bridge
- communication
- transmission
- data
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/14—Network analysis or design
- H04L41/145—Network analysis or design involving simulating, designing, planning or modelling of a network
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention belongs to the technical field of monitoring information transmission topological structure design, and particularly relates to a method for designing a monitoring information transmission topological structure in a strip-shaped mobile network-free area. According to the invention, boundary conditions are set by refining common characteristics of different application scenes, and the planning of the communication link is completed aiming at different scenes. For the problem of low applicability of the current solution, the invention comprehensively considers the link structure and hardware communication equipment to formulate a transmission scheme, integrates a plurality of factors, can lead the transmission scheme to have good adaptability, and is beneficial to completing the topology structure design of special scenes and dynamic planning positions. For the problem of poor transmission effect of the prior solution, the invention obtains a better transmission link scheme through mathematical derivation and simulation verification. For traversing all communication link transmission schemes, the invention realizes the optimal solution of a logic level, improves the transmission rate from a hardware topological structure level and reduces the system time delay.
Description
Technical Field
The invention belongs to the technical field of monitoring information transmission topological structure design, and particularly relates to a method for designing a monitoring information transmission topological structure in a strip-shaped mobile network-free area.
Background
At present, the distribution of areas with lower population density in China is still wide, and the cost of operating manpower and material resources of a mobile network is considered, and the distribution of the areas with lower population density is 4G/4G + The coverage rate of the mobile network is not high, and the video transmission requirement cannot be met. For practical application scene nodes are distributed and concentrated in one or more mutually connected straight lines, and the flow direction of data is generally in a strip-shaped area of unidirectional transmission, for example, linear non-mobile network scenes such as petroleum pipeline transportation, high-voltage power transmission line transportation and the like all need to monitor parameters or return of image information. Due to the mobile network environment with uneven distribution of the strip application scene and the unique geographic conditions, the method leadsThe monitoring information is difficult to return efficiently. For this reason, a need exists to address the realistic demands of such scenarios.
Aiming at the problem of planning the monitoring information transmission topological structure, two transmission modes are mainly adopted at present: firstly, the data communication is carried out by adopting a wired mode, and all nodes are interconnected by adopting a network cable to finish the transmission of monitoring information. And secondly, by using the 4G network of the environment, each monitoring node checks the monitoring information from the server after transmitting the information to the cloud through the 4G network card. For the strip-shaped non-mobile network area, a wireless transmission mode is needed, and the current scenes are all information transmission modes with smaller related ranges, so that the optimization design is lacking in the aspect of network topology. There are only a few modes fixed for different scenes, and the limitation is large. The existing scheme is only imitated, and has no good adaptability to special terrains and dynamic planning areas. For the transmission effect, the current solution is in a stage of realizing only the target task, and the network optimization can only be optimized from the improvement of the own hardware index of the transmission equipment.
Disclosure of Invention
The invention aims to solve the problems of high limitation, low applicability and no good transmission effect of a transmission scheme of a high-efficiency feedback application scene of linear non-mobile network area monitoring data indexes and image information in an actual environment, and provides a design method of a monitoring information transmission topological structure in a strip non-mobile network area.
The aim of the invention is realized by the following technical scheme: the method comprises the following steps:
step 1: determining the range of the strip area, the number of communication nodes in the strip area and the positions of the communication nodes;
the communication nodes in the strip-shaped area are distributed and concentrated in one or more straight lines connected with each other, and the flow direction of data is generally in unidirectional transmission;
step 2: setting the maximum data carrying capacity of a single line, the maximum connection number of single communication nodes and the transmission farthest distance S of the communication nodes;
step 3: layering network bridge equipment;
step 3.1: decomposing a communication link into two or more unidirectional communication links;
step 3.2: layering the decomposed unidirectional communication links according to boundary conditions;
the unidirectional communication link is provided with n communication nodes, which are numbered 1,2,3, … and n in sequence from left to right, and the distance S between two adjacent communication nodes near The node i belongs to the kth i The layer satisfies:
step 4: determining the number of the communication node bridge devices and the corresponding relation of the communication node bridge devices;
the known receiving bridge receives at most the signals of m transmitting bridges, kth i Layer reception (k) i +1) layer signal, then kth i The layer at least needsStation bridge->X is (k) i +1) number of layer nodes; adding N is a common requirement for unidirectional communication links main Station bridge->k is the total layer number of the unidirectional communication link; since the data flow per node is N data ，N data ≤N data_max Moving each layer leftwards from the right end node according to the position of the bridge, searching out the bridge data flow of each node until the data flow is uniformly distributed, and if +_, searching out the data flow of each node according to the position of the bridge>Adding a bridge at the point where the data flow exceeds the standard;
step 5: and forming a data link of each communication node according to the data flow direction of each communication node, the number of newly-increased bridge class equipment of each communication node and the corresponding relation among each bridge class equipment, and completing the design of the communication topological structure of the whole strip area.
The invention has the beneficial effects that:
according to the invention, boundary conditions are set by refining common characteristics of different application scenes, and the planning of the communication link is completed aiming at different scenes. For the problem of low applicability of the current solution, the invention comprehensively considers the link structure and hardware communication equipment to formulate a transmission scheme, integrates a plurality of factors, can lead the transmission scheme to have good adaptability, and is beneficial to completing the topology structure design of special scenes and dynamic planning positions. For the problem of poor transmission effect of the prior solution, the invention obtains a better transmission link scheme through mathematical derivation and simulation verification. For traversing all communication link transmission schemes, the invention realizes the optimal solution of a logic level, improves the transmission rate from a hardware topological structure level and reduces the system time delay.
Drawings
Fig. 1 is a general flow chart of the present invention.
Fig. 2 is a flow chart of a layered implementation of the bridge device according to the present invention.
Fig. 3 is a flow chart of a method for planning a communication topology structure in the present invention.
Fig. 4 is a schematic diagram of distribution of nodes in a non-mobile network area according to an embodiment of the present invention
Fig. 5 is a planning result of a network topology of nodes 1 to 19 according to an embodiment of the present invention.
Fig. 6 shows the result of planning the network topology from node 20 to node 38 according to an embodiment of the present invention.
Fig. 7 is a table of the number of newly added bridges and the correspondence relationship between bridges in the embodiment of the present invention.
Detailed Description
The invention is further described below with reference to the accompanying drawings.
The invention provides a method for designing a topological structure for monitoring information transmission in a strip-shaped non-mobile network area, which adopts a layered unidirectional search method and a traversal optimizing algorithm to design, comprehensively considers a link structure and hardware communication equipment to formulate a transmission scheme, combines a plurality of factors, enables the transmission scheme to have good adaptability, and is favorable for completing the topological structure design of special scenes and dynamic planning positions. For the problem of poor transmission effect of the prior solution, the invention obtains a better transmission link scheme through mathematical derivation and simulation verification
A design method for monitoring information transmission topological structure in a strip-shaped non-mobile network area comprises the following steps:
step 1: determining the range of the strip area, the number of communication nodes in the strip area and the positions of the communication nodes;
the communication nodes in the strip-shaped area are distributed and concentrated in one or more straight lines connected with each other, and the flow direction of data is generally in unidirectional transmission;
step 2: setting the maximum data carrying capacity of a single line, the maximum connection number of single communication nodes and the transmission farthest distance S of the communication nodes;
step 3: layering network bridge equipment;
step 3.1: decomposing a communication link into two or more unidirectional communication links;
step 3.2: layering the decomposed unidirectional communication links according to boundary conditions;
the unidirectional communication link is provided with n communication nodes, which are numbered 1,2,3, … and n in sequence from left to right, and the distance S between two adjacent communication nodes near The node i belongs to the kth i The layer satisfies:
step 4: determining the number of the communication node bridge devices and the corresponding relation of the communication node bridge devices;
the known receiving bridge receives at most the signals of m transmitting bridges, kth i Layer reception (k) i +1) layer signal, then kth i The layer at least needsStation bridge->X is (k) i +1) number of layer nodes; adding N is a common requirement for unidirectional communication links main Station bridge->k is the total layer number of the unidirectional communication link; since the data flow per node is N data ，N data ≤N data_max Moving each layer leftwards from the right end node according to the position of the bridge, searching out the bridge data flow of each node until the data flow is uniformly distributed, and if +_, searching out the data flow of each node according to the position of the bridge>Adding a bridge at the point where the data flow exceeds the standard;
step 5: and forming a data link of each communication node according to the data flow direction of each communication node, the number of newly-increased bridge class equipment of each communication node and the corresponding relation among each bridge class equipment, and completing the design of the communication topological structure of the whole strip area.
Step 1 is to determine the linear region range, the number of communication nodes and the position. The range size of the area to be planned is determined, and the geographical location (pitch) of each node is determined. The strip-shaped area refers to the overall shape of the target area in the actual environment, the strip-shaped area describes the shape of the area, the strip-shaped area mainly refers to the fact that node distribution is concentrated on one or more straight lines connected with each other, and the flow direction of data is generally transmitted in a single direction; the area range and location refer to the actual geographic area and actual geographic coordinates (longitude, latitude, and altitude information) of the target area; the number of communication nodes refers to the number of locations with an efficient transmission function.
In step 2, the selection and setting of boundary condition parameters is performed. The determining boundary condition parameters according to the basic parameters of the strip-shaped area in the step 1 mainly comprises the following steps: maximum data bearing capacity of single line, maximum connection number of single node, and furthest distance of node transmission. The setting of three boundary conditions is the main content of scheme initialization, the setting of boundary condition parameters directly affects the final result of the topology structure of a communication link, and the determination of the three parameters requires a certain engineering experience basis. The following is a set principle of three parameters and the main meaning of the set principle is developed.
Setting the maximum data carrying capacity of a single line: the data carrying capacity of a single wireless link when the nodes transmit data is calculated according to the type and duration of transmission information. In order to ensure the real-time performance of the system transmission parameter information and the image information (under the condition of meeting specific engineering conditions), the boundary condition parameter of the maximum data bearing capacity of a single line is determined.
The maximum connection number of single nodes is set: the maximum number of connections of a bridge class device at a node is often in the form of bridge class wireless communications in a remote linear transmission system. In the method, all nodes default to use the network bridge equipment as the same model, and the performance only has a slight gap of factory batches. The maximum number of single-node connections is determined by the actual parameters and engineering requirements of the bridge class devices (meeting the system transmission stability and real-time performance).
The furthest distance setting of node transmission: furthest transmission distance of bridge class devices at the node. The transmission distance here refers to the transmission distance meeting the transmission information signal strength in actual engineering, and the general engineering experience is set to 60% of the nominal transmission distance of the network bridge equipment.
Step 3, layering network bridge equipment, which specifically comprises the following two steps: 3.1 decomposing the communication node into two or more unidirectional communication links. Step 3.2 hierarchies the unidirectional communication link after step 3.1 has been decomposed according to the boundary conditions of step 2.3.
Step 3.1, decomposing the communication node. The communication link is broken down into two or more unidirectional communication links. Since the signal is transmitted unidirectionally, there is no signal detour, and one double ended line can be equivalent to two single ended lines. The double-end line is provided with n communication nodes, the double-end line is equivalent to two single-end lines, and the single-end lines are respectively provided with n 1 、n 2 Each node, n 1 +n 2 ＝n(n 1 =1, 2,3, …, n-1), then n 1 Transmission scheme and n for individual nodes 2 Transmission scheme for individual nodesAnd is the total transmission scheme. If at this time n 1 All values in 1,2,3, …, n-1 are traversed to obtain all equivalent single-ended line modes. In the scheme, a traversal optimizing method is adopted, namely, a single-ended line traverses all transmission schemes; the single-ended line 2 is the total number of points minus the number of nodes of the single-ended line 1.
Step 3.2 is to layer the unidirectional communication link decomposed in step 3.1. The method comprises the following steps: it is provided that a certain end has n nodes, and the n adjacent communication nodes are numbered 1,2,3 and … in sequence from left to right and have the same distance. The boundary condition in step 2 can determine the farthest wireless communication distance S, and the distance between two adjacent communication nodes is S near The communicable conditions between the two nodes are:wherein i and j are two node numbers respectively. The single end of the line can be divided into k layers, the node 1 belongs to the 1 st layer, and the nodeBelonging to layer 2, …, node i belongs to the kth i A layer of->Because of the kth i The last node j of the layer may receive the (k) i +1) layer, so we equivalent the transmission of signals by "node" to "layer" transmission, can be placed at node j to receive the (k) i +1) layer of any node slave signal.
Step 4, determining the number of communication node bridges, and determining the corresponding relation of each node bridge according to the layering relation determined in the step 3 specifically comprises the following steps: the known receiving bridge receives at most the signals of m transmitting bridges, kth i Layer reception (k) i +1) layer signal, then kth i The layer at least needsA station bridge. />Wherein X is (k) i +1) layer node number circuit is added with N in total main A station bridge. Wherein->Since the data flow per node is N data ，N data ≤N data_max Moving each layer leftwards from the right end node according to the position of the bridge, searching out the bridge data flow of each node until the data flow is uniformly distributed, and if +_, searching out the data flow of each node according to the position of the bridge>Then a bridge is added where the data flow exceeds the standard.
In step 4, for the double-ended communication link, n communication nodes are provided at both ends, the double-ended communication is equivalent to two single-ended communication, and n is provided at each of the single ends 1 、n 2 Each node, n 1 +n 2 ＝n(n 1 ＝1,2,3,…,n-1)n 1 N needs to be added to single end of node n1_main Station bridge, n 2 N needs to be added to single end of node n2_main Station bridge, then double-ended needs to be added (N n1_main +N n2_main ) The station bridge traverses all combinations to obtain min (N n1_main +N n2_main ) At least min (N) n1_main +N n2_main ) A station bridge.
And 5, forming data links of all nodes, and completing planning of the communication topological structure of the whole area. The step 4 can be performed to obtain the following steps: the data flow direction of each node, the number of newly-added bridge class devices of each node, the corresponding relation among the bridge class devices and the like form basic information of a topological structure, the information is integrated according to the nodes in the step, and the integration steps are as follows:
step 5.1: the data flow direction and the number of bridge class devices per node are determined.
Step 5.2: and determining the corresponding connection relation of each bridge type device according to the data flow direction.
Step 5.3: the overall topology structure is determined from the node sequence numbers from small to large according to the content determined in the steps 5.1 and 5.2, and a communication link design scheme is formed.
The invention has the beneficial effects that: for the limitation of the current solution, the invention sets boundary conditions by extracting common characteristics under different application scenes, and completes the planning of the communication link aiming at different scenes. For the problem of low applicability of the current solution, the invention comprehensively considers the link structure and hardware communication equipment to formulate a transmission scheme, integrates a plurality of factors, can lead the transmission scheme to have good adaptability, and is beneficial to completing the topology structure design of special scenes and dynamic planning positions. For the problem of poor transmission effect of the prior solution, the invention obtains a better transmission link scheme through mathematical derivation and simulation verification. For traversing all communication link transmission schemes, the invention realizes the optimal solution of a logic level, improves the transmission rate from a hardware topological structure level and reduces the system time delay.
Example 1:
the invention aims at the design of the information transmission link topological structure of the linear non-mobile network practical environment, and mainly solves the problems of larger limitation, low applicability and no better transmission effect of the current transmission scheme of the application scene without the requirement of the mobile network regional backhaul. The invention firstly determines the range, the node position and the communication node number of the strip area, and sets the boundary condition parameters according to the actually used network bridge equipment. And carrying out unidirectional link decomposition on the whole communication link in a traversal optimizing mode, and then carrying out network bridge equipment layering according to boundary conditions. After layering, firstly determining the number of bridges of each node and the corresponding relation of each node class bridge device according to boundary conditions, determining the data flow direction of each node and the bridge device corresponding to each node according to the sequence of the node serial numbers after determining the corresponding relation, and thus completing the planning of the whole communication topological structure.
Fig. 1 is a flow chart of a planning method based on a strip area communication network topology according to an embodiment of the present invention, and the specific implementation steps include steps 1 to 5.
Step 1 is determining the linear region range and position, and the number of communication nodes. The distribution diagram of each node in the area without mobile network in this embodiment is shown in fig. 4. In step 1, determining the range size of the area to be planned and the geographic position of each node by using the existing network area mapping method. The number of nodes that need to communicate in the coverage area of the mobile-free network is 38 nodes (where there is a 4G signal between node 1 and node 38), because the distance between all nodes is fixed to 400m, the range length of the mobile-free network is 15Km continuously, and the altitude is relatively gentle. The normal state of the transmission path of the network bridge equipment is not shielded, and the transmission environment can meet the normal working requirement.
In step 2, the boundary condition parameters are selected and set according to the basic area condition parameters in step 1. Wherein the boundary condition parameters of the method mainly comprise: step 2.1, maximum data carrying capacity of single line; step 2.2, the maximum number of single-node connections; step 2.3 the node transmits the furthest distance.
Step 2.1, setting the maximum data carrying capacity of a single line, wherein the setting needs to be determined together according to the type of a network interface of the network bridge type equipment, the maximum data quantity which can be carried by the interface, the type of a network transmission line, the maximum carrying capacity, a video compression format and a transmission mode of node data. For the bridge type equipment, 300MHz bandwidth bridge type equipment is selected in the embodiment, and the actual bandwidth in engineering is 60% of the nominal bandwidth, namely 180Mbps, under the influence of other factors such as actual environment and transmission medium. The ports of the network cable and the bridge equipment are hundred mega network cable ports. The transmission mode adopted in the case is multi-node real-time transmission, namely, the image monitoring information of each node is transmitted back in real time, and the information type is in a video format. And the H.264 video compression format is adopted, the pixel of each camera is 800 ten thousand, the output code rate is 15Mbps at maximum, and 5Mbps is adopted as the allowance bandwidth, so that each camera obtains 20MHz of bandwidth. Therefore, 9 cameras adopted by the scheme for simultaneously transmitting the image monitoring information in real time can be used for calculating the maximum data bearing capacity of each line.
Step 2.2, setting the maximum connection quantity of single nodes, wherein the quantity of equipment which can be connected on the premise of ensuring the transmission effect and stable connection according to the transmission angle of the network bridge equipment is needed. The transmission angle of the bridge class transmission device in this case is 45 ° in the horizontal direction and 30 ° in the vertical direction. The network bridge type devices can realize data transmission within the transmission angle range of the opposite device. However, in order to make data stably transmitted, and the nodes where the bridge devices are located are not completely in a straight line, a certain angle exists at the location. In the embodiment, the maximum connection limit of the bridge class device is 3, and three devices are connected at the same time. The maximum number of device connections for a single node is set to 3.
Step 2.3 the node transmits the furthest distance setting. The general parameters are selected as the furthest distance for the effective transmission of the bridge class device, but the transmission distance needs to be limited for tasks requiring stable transmission effects and accomplishing real-time transmission of image monitoring information. The engineering stable transmission distance is 60% of the product calibration value, and the bandwidth processing mode is the same, so that the boundary condition of the furthest transmission distance is set to be 3Km in the present case.
Step 3 is shown in fig. 2 and is divided into step 3.1 and step 3.2. First, the communication node is decomposed according to the node information and the environment information in the step 1, and the communication link is decomposed into two or more unidirectional communication links. In this case, the two-end line has 38 communication nodes, the two-end line is equivalent to two single-end lines, and the single-end lines have n respectively 1 、n 2 Each node, n 1 +n 2 ＝n(n 1 =1, 2,3, …, n-1), then n 1 Transmission scheme and n for individual nodes 2 The sum of the transmission schemes of the individual nodes is the total transmission scheme. If at this time n 1 All values in 1,2,3, …, n-1 are traversed to obtain all equivalent single-ended line modes. In the scheme, a traversal optimizing method is adopted, namely, the single-ended line 1 searches an optimal solution through the traversal method; the single-ended line 2 is the total number of points minus the number of nodes of the single-ended line 1. So, in this case, 38 nodes are calculated in a symmetrical equivalent way, since the area is continuously decomposed into two single-ended lines. The number of nodes for the two single ended lines is 18 and 20 calculated as described above.
Step 3.2 of step 3 is layering for unidirectional communication links. The method is specifically implemented as follows: in this case, two unidirectional links have 19 nodes, which are numbered 1,2,3, …,19 in sequence from left to right, and the distances between two adjacent communication nodes are the same.The farthest wireless communication distance S=3 Km, and the distance between two adjacent communication nodes is S near =400 m, the communicable conditions between two nodes are:wherein i and j are two node numbers respectively. The single-ended line can be divided into k layers, in this case +.>Node 1 belongs to layer 1, node->Belonging to layer 2, …, node i belongs to the kth i A layer in whichBecause of the kth i The last node j of the layer may receive the (k) i +1) layer, so we equivalent the transmission of signals by "node" to "layer" transmission, can be placed at node j to receive the (k) i +1) layer of any node slave signal.
In step 4, according to the layering result in step 3 and the boundary condition in step 2, determining the number of communication node bridges and the corresponding relation of each node bridge device. The network bridge is known to receive signals of at most 3 slaves according to the boundary conditions, kth i Layer reception (k) i +1) layer signal, then kth i The layer at least needsA station bridge. />Wherein X is (k) i +1) layer node number circuit is added with N in total main A station bridge. Programming according to the formula and the hierarchical deduction in the step 3, and inputting the boundary conditions in the step 2. The calculation result is shown in FIG. 7, in which the number of newly added receiving bridges is shown for each node, and each newly added receiving networkAnd a list of communication nodes corresponding to the bridge.
In step 5, a specific implementation flow is shown in fig. 3. In this case, the next calculation is performed according to the calculation result obtained in step 4, and the calculation result is shown in detail in fig. 7. According to step 5.1, the overall data flow direction, in this case a continuous network-free area, is first determined, and according to step 3 the communication link is broken down into two unidirectional data links, so that the overall data flow direction is two directions, and flows from the intermediate node to the nodes on both sides respectively. The number of devices per bridge consists of two parts: the transmitting device of each node and the number of newly added bridges according to step 4 (no transmitting device exists for the end node of each unidirectional communication link). And (3) carrying out step 5.2 according to the data flow determined in step 5.1, wherein the node number corresponding to each node device is given in step 4, and the network bridge corresponding to each node, the node corresponding to each network bridge and the node of the backward data flow direction corresponding to the node are sorted according to the given node number and the data flow direction. Step 5.3 further finishing is carried out in step 5.2. The overall topology structure is determined from the node sequence numbers from small to large according to the content determined in the step 5.1 and the step 5.2, and a communication link design scheme is formed as shown in fig. 5 and 6.
The above description is only of the preferred embodiments of the present invention and is not intended to limit the present invention, but various modifications and variations can be made to the present invention by those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (1)
1. The method for designing the monitoring information transmission topological structure in the strip-shaped non-mobile network area is characterized by comprising the following steps of:
step 1: determining the range of the strip area, the number of communication nodes in the strip area and the positions of the communication nodes;
the communication nodes in the strip-shaped area are distributed and concentrated in one or more straight lines connected with each other, and the flow direction of data is generally in unidirectional transmission;
step 2: setting the maximum data carrying capacity of a single line, the maximum connection number of single communication nodes and the transmission farthest distance S of the communication nodes;
step 3: layering network bridge equipment;
step 3.1: decomposing a communication link into two or more unidirectional communication links;
step 3.2: layering the decomposed unidirectional communication links according to boundary conditions;
the unidirectional communication link is provided with n communication nodes, which are numbered 1,2,3, … and n in sequence from left to right, and the distance S between two adjacent communication nodes near The node i belongs to the kth i The layer satisfies:
step 4: determining the number of the communication node bridge devices and the corresponding relation of the communication node bridge devices;
the known receiving bridge receives at most the signals of m transmitting bridges, kth i Layer reception (k) i +1) layer signal, then kth i The layer at least needsStation bridge->X is (k) i +1) number of layer nodes; adding N is a common requirement for unidirectional communication links main Station bridge->k is the total layer number of the unidirectional communication link; since the data flow per node is N data ，N data ≤N data_max Moving each layer leftwards from the right end node according to the position of the bridge, searching out the bridge data flow of each node until the data flow is uniformly distributed, and if +_, searching out the data flow of each node according to the position of the bridge>Then at the point where the data stream exceeds the standardAdding a network bridge;
step 5: and forming a data link of each communication node according to the data flow direction of each communication node, the number of newly-increased bridge class equipment of each communication node and the corresponding relation among each bridge class equipment, and completing the design of the communication topological structure of the whole strip area.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110976988.5A CN113726565B (en) | 2021-08-24 | 2021-08-24 | Method for designing monitoring information transmission topological structure in strip-shaped non-mobile network area |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110976988.5A CN113726565B (en) | 2021-08-24 | 2021-08-24 | Method for designing monitoring information transmission topological structure in strip-shaped non-mobile network area |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113726565A CN113726565A (en) | 2021-11-30 |
| CN113726565B true CN113726565B (en) | 2023-08-15 |
Family
ID=78677829
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110976988.5A Active CN113726565B (en) | 2021-08-24 | 2021-08-24 | Method for designing monitoring information transmission topological structure in strip-shaped non-mobile network area |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113726565B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20010059624A (en) * | 1999-12-30 | 2001-07-06 | 이계철 | Method for drawing hierarchically network topology using representative nodes and links |
| CN108462643A (en) * | 2016-12-11 | 2018-08-28 | 苏州大学 | The weak security multicast based on network code towards integer transmission rate transmits topological construction method |
| CN109889376A (en) * | 2019-01-28 | 2019-06-14 | 东莞理工学院 | A kind of network topology generation method of equilibrium |
| CN112953761A (en) * | 2021-01-26 | 2021-06-11 | 中国电子科技集团公司第七研究所 | Virtual-real resource mapping method for virtual network construction in multi-hop network |
-
2021
- 2021-08-24 CN CN202110976988.5A patent/CN113726565B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20010059624A (en) * | 1999-12-30 | 2001-07-06 | 이계철 | Method for drawing hierarchically network topology using representative nodes and links |
| CN108462643A (en) * | 2016-12-11 | 2018-08-28 | 苏州大学 | The weak security multicast based on network code towards integer transmission rate transmits topological construction method |
| CN109889376A (en) * | 2019-01-28 | 2019-06-14 | 东莞理工学院 | A kind of network topology generation method of equilibrium |
| CN112953761A (en) * | 2021-01-26 | 2021-06-11 | 中国电子科技集团公司第七研究所 | Virtual-real resource mapping method for virtual network construction in multi-hop network |
Non-Patent Citations (1)
| Title |
|---|
| 基于星间网络拓扑技术的星间链路优化设计;贺瑜飞;;计算机测量与控制(第12期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113726565A (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109699033B (en) | LoRa power Internet of things base station deployment method and device for cost and load balancing | |
| CN110417588B (en) | Aviation dynamic network path planning method based on alliance game | |
| CN106685745B (en) | A kind of constructing network topology method and device | |
| CN116319355A (en) | Satellite network topology generation method based on deep reinforcement learning | |
| CN110248392B (en) | Opportunity forwarding method based on node efficiency in Internet of vehicles | |
| CN103701647B (en) | A kind of wireless network topology optimization generates method | |
| CN104113849A (en) | Correction method of propagation model | |
| CN113726565B (en) | Method for designing monitoring information transmission topological structure in strip-shaped non-mobile network area | |
| CN111356039B (en) | Topology forming method for wireless optical communication network | |
| CN108551403A (en) | Transmission network method and system for planning | |
| CN104053207B (en) | A kind of wireless sensor network spacing query method | |
| CN109089219B (en) | Patrol communication method for high-voltage cable patrol vehicle | |
| CN116133082A (en) | Multi-hop clustering method for improving topology duration of aviation ad hoc network | |
| CN103974372A (en) | Delay tolerant network routing method based on fuzzy reasoning | |
| Kong et al. | Ant colony algorithm based routing protocol in software defined vehicular networks | |
| CN110138444B (en) | Multi-domain optical network dynamic multicast sharing protection method based on fuzzy game | |
| CN117119555B (en) | Lunar exploration time-varying topology group node self-adaptive networking routing method and system | |
| CN116980881B (en) | Multi-unmanned aerial vehicle collaboration data distribution method, system, electronic equipment and medium | |
| CN107294853B (en) | Power communication network path optimization method | |
| Cao et al. | A beacon-less relay-node selection method for 3-D scenarios in Internet of Vehicle | |
| CN116683981B (en) | Low-orbit satellite path planning method based on multidimensional time-varying resource diagram | |
| CN111988788B (en) | 5G positioning network design method and system for rail transit | |
| CN117793663B (en) | Remote agricultural machinery operation information transmission method based on LoRa | |
| WO2024057391A1 (en) | Learning device, inference device, learning method, inference method, learning program, and inference program | |
| CN110519164B (en) | Signal transmission method, system and computer readable 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 |