CN113726565A - 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
- CN113726565A CN113726565A CN202110976988.5A CN202110976988A CN113726565A CN 113726565 A CN113726565 A CN 113726565A CN 202110976988 A CN202110976988 A CN 202110976988A CN 113726565 A CN113726565 A CN 113726565A
- Authority
- CN
- China
- Prior art keywords
- node
- communication
- bridge
- transmission
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- 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 non-mobile network area. The invention sets boundary conditions by abstracting common characteristics under different application scenes, and finishes the planning of communication links aiming at different scenes. For the problem of poor applicability of the existing solution, the invention comprehensively considers the link structure and the hardware communication equipment to formulate a transmission scheme, combines a plurality of factors, can ensure that the transmission scheme has good adaptability, and is favorable for finishing the topological structure design of a special scene and a dynamic planning position. For the problem of poor transmission effect of the existing 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 non-mobile network area.
Background
At present, IThe distribution of countries in regions with low population density is still wide, and for the cost consideration of the operating manpower and material resources of the mobile network, 4G/4G is used in the regions with low population density+The coverage rate of the mobile network is not high, and the requirement of video transmission cannot be met. For a strip-shaped area in which nodes of an actual application scene are distributed and concentrated on one or more mutually connected straight lines and the flow direction of data is generally transmitted in a single direction, linear non-mobile network scenes such as petroleum pipeline transportation, high-voltage power transmission line transportation and the like need to monitor parameter or return image information. Due to the mobile network environment with unevenly distributed strip-shaped application scenes and the unique geographic conditions, the monitoring information is difficult to return efficiently. There is a need to address the real-world needs of such scenarios.
For the problem of planning a monitoring information transmission topological structure, two transmission modes are mainly adopted at present: firstly, data communication is carried out in a wired mode, and monitoring information transmission is completed among all nodes through network cable interconnection. And secondly, by utilizing the 4G network of the environment, each monitoring node checks monitoring information from the server after transmitting the information to the cloud end through the 4G network card. For the strip-shaped non-mobile network area, a wireless transmission mode is required, the current scenes are all information transmission modes with a small range, and the optimization design in the aspect of network topology is deficient. And for different scenes, the method has only fixed modes and has larger limitation. The existing scheme is only imitated, and has no good adaptability to special terrains and dynamically planned regions. For the transmission effect, the current solution is in the stage of only realizing the target task, and the network optimization can only be optimized from the hardware index promotion of the transmission equipment.
Disclosure of Invention
The invention aims to solve the problems that a transmission scheme of a linear non-mobile network area monitoring data index and an efficient return application scene of image information in an actual environment is large in limitation, not strong in applicability and free of a good transmission effect, and provides a method for designing a monitoring information transmission topological structure in a strip-shaped non-mobile network area.
The purpose of the invention is realized by the following technical scheme: the method comprises the following steps:
step 1: determining the range of the strip-shaped area, the number of communication nodes in the strip-shaped area and the position of each communication node;
the communication nodes in the strip-shaped area are distributed and concentrated on one or more mutually connected straight lines, and the flow direction of the data is generally transmitted in a single direction;
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;
and step 3: layering the network bridge equipment;
step 3.1: decomposing the communication link into two or more unidirectional communication links;
step 3.2: layering the decomposed unidirectional communication link according to boundary conditions;
the unidirectional communication link is provided with n communication nodes which are numbered as 1,2,3, …, n from left to right in sequence, and the distance S between two adjacent communication nodesnearIf the same, node i belongs to the kth nodeiThe layers satisfy:
and 4, step 4: determining the number of communication node bridge devices and the corresponding relation of each communication node bridge device;
the known receiving bridge receives signals of at most m transmitting bridges, kthiLayer receives the (k) thi+1) layer signal, then kthiLayer at least needsThe bridge of a station network,x is the (k) thi+1) number of layer nodes; unidirectional communication link requires the addition of N in totalmainThe bridge of a station network,k is the total number of layers of the unidirectional communication link; since the data flow per node is Ndata,Ndata≤Ndata_maxMoving each layer from right end node to left according to the position of network bridge, searching out network bridge data flow of each node until its distribution is uniform, if it is uniformAdding a bridge at the position where the data stream exceeds the standard;
and 5: and forming a data link of each communication node according to the data flow direction of each communication node, the number of newly added bridge type devices of each communication node and the corresponding relation between each bridge type device, and finishing the design of the whole strip-shaped area communication topological structure.
The invention has the beneficial effects that:
the invention sets boundary conditions by abstracting common characteristics under different application scenes, and finishes the planning of communication links aiming at different scenes. For the problem of poor applicability of the existing solution, the invention comprehensively considers the link structure and the hardware communication equipment to formulate a transmission scheme, combines a plurality of factors, can ensure that the transmission scheme has good adaptability, and is favorable for finishing the topological structure design of a special scene and a dynamic planning position. For the problem of poor transmission effect of the existing 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 diagram of the present invention.
Fig. 2 is a flowchart illustrating a layered implementation of the bridge device of the present invention.
Fig. 3 is a flowchart of a method for planning a communication topology according to the present invention.
FIG. 4 is a schematic diagram illustrating 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 from node 1 to node 19 in the embodiment of the present invention.
Fig. 6 shows the planning result of the network topology from node 20 to node 38 according to the embodiment of the present invention.
Fig. 7 is a table showing the number of newly added bridges and the correspondence 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 monitoring information transmission topological structure in a strip-shaped non-mobile network area, which is designed by adopting a layered one-way search method and a traversal optimization algorithm, comprehensively considers a link structure and hardware communication equipment to formulate a transmission scheme, integrates a plurality of factors, can ensure that the transmission scheme has good adaptability, and is favorable for finishing the topological structure design of a special scene and a dynamic planning position. For the problem of poor transmission effect of the existing solution, the invention obtains a better transmission link scheme through mathematical derivation and simulation verification
A method for designing a 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-shaped area, the number of communication nodes in the strip-shaped area and the position of each communication node;
the communication nodes in the strip-shaped area are distributed and concentrated on one or more mutually connected straight lines, and the flow direction of the data is generally transmitted in a single direction;
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;
and step 3: layering the network bridge equipment;
step 3.1: decomposing the communication link into two or more unidirectional communication links;
step 3.2: layering the decomposed unidirectional communication link according to boundary conditions;
the unidirectional communication link is provided with n communication nodes which are numbered as 1,2,3, …, n from left to right in sequence, and the distance S between two adjacent communication nodesnearIf the same, node i belongs to the kth nodeiThe layers satisfy:
and 4, step 4: determining the number of communication node bridge devices and the corresponding relation of each communication node bridge device;
the known receiving bridge receives signals of at most m transmitting bridges, kthiLayer receives the (k) thi+1) layer signal, then kthiLayer at least needsThe bridge of a station network,x is the (k) thi+1) number of layer nodes; unidirectional communication link requires the addition of N in totalmainThe bridge of a station network,k is the total number of layers of the unidirectional communication link; since the data flow per node is Ndata,Ndata≤Ndata_maxMoving each layer from right end node to left according to the position of network bridge, searching out network bridge data flow of each node until its distribution is uniform, if it is uniformAdding a bridge at the position where the data stream exceeds the standard;
and 5: and forming a data link of each communication node according to the data flow direction of each communication node, the number of newly added bridge type devices of each communication node and the corresponding relation between each bridge type device, and finishing the design of the whole strip-shaped area communication topological structure.
The selection and setting of the boundary condition parameters is performed in step 2. Determining boundary condition parameters according to the basic parameters of the strip-shaped areas in the step 1 mainly comprises the following steps: the maximum data carrying capacity of a single line, the maximum connection quantity of single nodes and the farthest distance of node transmission are set. The setting of three boundary conditions is the main content of scheme initialization, the setting of boundary condition parameters can directly influence the final result of the communication link topology structure, and the determination of the three parameters needs a certain engineering experience basis. The principle of setting three parameters and the main meaning are expanded below.
Setting the maximum data carrying capacity of a single line: and when the nodes transmit data, the data carrying capacity of the single wireless link is calculated according to the type and the duration of the transmission information. In order to ensure the real-time property of the system transmission parameter information and the image information (meeting specific engineering conditions), the boundary condition parameter of the maximum data bearing capacity of the single line is determined.
Setting the maximum connection quantity of the single nodes: in long-range linear transmission systems, often in the form of bridge-like wireless communication, the maximum number of connections of bridge-like devices at a node is used. In the method, all nodes are defaulted to use the bridge type equipment with the same model, and the performance has only a slight difference of factory batches. The maximum connection number of the single node is determined by actual parameters and engineering requirements (meeting the system transmission stability and real-time performance) of bridge type equipment.
Setting the farthest transmission distance of the nodes: the farthest transmission distance of the bridge class device at the node. The transmission distance here refers to a transmission distance that satisfies the strength of a transmission information signal in actual engineering, and general engineering experience is set to 60% of a calibrated transmission distance of bridge equipment.
Step 3.1 decomposes the communication node. The communication link is broken down into two or more unidirectional communication links. Since the signals are transmitted in a single direction, the signals are not transmitted in a roundabout way, 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 n1、n2A node, n1+n2=n( n 11,2,3, …, n-1), then n1Transmission scheme of individual nodes and n2The sum of the transmission schemes of the individual nodes is the total transmission scheme. If n is present1All equivalent single-ended wire-ways are obtained by traversing all values in 1,2,3, …, n-1. In the scheme, a traversal optimization method is adopted, namely, a single-ended line traverses all transmission schemes; the single-ended line 2 is the sum of the nodes minus the number of nodes of the single-ended line 1.
And 3.2, layering the one-way communication link decomposed in the step 3.1. The method specifically comprises the following steps: and n nodes are arranged at a certain end and are numbered as 1,2,3 and … from left to right in sequence, and the distances between two adjacent communication nodes are the same. The farthest wireless communication distance S can be determined by the boundary condition of step 2, and the distance between two adjacent communication nodes is SnearIf the communication conditions between the two nodes are as follows:wherein i and j are numbers of two nodes respectively. The single end of the line can be divided into k layers, the node 1 belongs to the layer 1, and the nodeBelong to level 2, …, node i belongs to kthiLayer of whichBecause of the k-thiThe last node j of the layer may receive the (k) th nodei+1) layer arbitrary node, so we equate to "node" transmission to "layer" transmission, where node j can be placed to receive the (k) th signali+1) layer arbitrary node slave signal.
In step 4, for a double-end communication link, n communication nodes are arranged at two ends, the double-end communication is equivalent to two single-end communication, and the single end is respectively provided with n1、n2A node, n1+n2=n(n1=1,2,3,…,n-1)n1Node single end needs to add Nn1_mainBridge of the station, n2Node single end needs to add Nn2_mainPlatform bridge, then both ends need to be added (N)n1_main+Nn2_main) The station bridge traverses all combinations to obtain min (N)n1_main+Nn2_main) At least min (N) is addedn1_main+Nn2_main) A station bridge.
And 5, forming a data link of each node to complete the planning of the communication topological structure of the whole area. After the step 4, the method can include: the data flow direction of each node, the number of newly added bridge devices of each node, the corresponding relation between each bridge device and the like form basic information of a topological structure, the information is integrated according to the nodes in the step, and the integration step is 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 device according to the data flow direction.
Step 5.3: and determining the overall topological structure from the node sequence number from small to large according to the content determined in the steps 5.1 and 5.2 to form a communication link design scheme.
The invention has the beneficial effects that: for the limitation of the current solution, the invention sets boundary conditions by abstracting common characteristics under different application scenes, and finishes the planning of communication links aiming at different scenes. For the problem of poor applicability of the existing solution, the invention comprehensively considers the link structure and the hardware communication equipment to formulate a transmission scheme, combines a plurality of factors, can ensure that the transmission scheme has good adaptability, and is favorable for finishing the topological structure design of a special scene and a dynamic planning position. For the problem of poor transmission effect of the existing 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 actual environment, and mainly solves the problems that the current transmission scheme of the application scene without the mobile network regional return requirement has larger limitation, weak applicability and no better transmission effect. The invention firstly determines the range, the node position and the number of communication nodes of the strip area, and sets the boundary condition parameters according to the actually used bridge equipment. And performing unidirectional link decomposition on the whole communication link by adopting a traversal optimization mode, and then layering the network bridge equipment according to boundary conditions. After layering, firstly determining the number of bridges of each node and the corresponding relation of bridge equipment of each node according to boundary conditions, and then determining the data flow direction of each node and the bridge equipment corresponding to each node according to the sequence of the node serial number, thereby finishing the planning of the whole communication topological structure.
Fig. 1 is a schematic flowchart of a planning method based on a topology of a strip-shaped area communication network according to an embodiment of the present invention, and the specific implementation steps include steps 1 to 5.
In step 2, the boundary condition parameters are selected and set according to the basic region condition parameters in step 1. The boundary condition parameters of the method mainly comprise: step 2.1, the maximum data carrying capacity of the single line; step 2.2, the maximum connection quantity of the single nodes; and 2.3, transmitting the farthest distance by the node.
Step 2.1, setting the maximum data carrying capacity of the single line is determined according to the model of the network interface of the network bridge type device, the maximum data carrying capacity of the interface, the type of the network transmission line, the maximum carrying capacity, the video compression format and the transmission mode of the node data. For the bridge equipment, the 300MHz bandwidth is selected in the present case, and for the influence of other factors such as the actual environment and the transmission medium, the actual bandwidth in the engineering is 60% of the calibrated bandwidth, i.e. 180 Mbps. The network cable and the bridge device ports are all hundred-megabyte network cable ports. The transmission mode adopted by 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 a video format. By adopting an H.264 video compression format, the number of camera pixels is 800 ten thousand, the highest output code rate is 15Mbps, and 5Mbps is adopted as the margin bandwidth, so that the bandwidth of each camera is 20 MHz. Therefore, the maximum data bearing capacity of each line can be calculated, and the 9 cameras adopted by the scheme can simultaneously transmit image monitoring information in real time.
And 2.2, setting the maximum connection quantity of the single nodes according to the transmission angle of the bridge equipment and the quantity of the equipment which can be connected on the premise of ensuring the transmission effect and stable connection. The transmission angle of the bridge-like transmission device in this case is 45 ° in the horizontal direction and 30 ° in the vertical direction. The network bridge devices can realize data transmission within the transmission angle range of the opposite device. However, in order to stably transmit data, the nodes where the bridge devices are located are not completely in a straight line, and a certain angle exists between the nodes. In the embodiment, the maximum connection limit of the bridge class device is 3 to connect three devices simultaneously. The maximum number of device connections for a single node is set to 3.
Step 2.3 the node transmits the setting of the farthest distance. The general parameter is selected as the farthest distance for effective transmission of the bridge-type device, but the transmission distance needs to be limited for the tasks of requiring stable transmission effect and completing real-time transmission of image monitoring information. The stable transmission distance in engineering and the bandwidth processing mode are the same and are 60% of the product calibration value, so the boundary condition of the farthest transmission distance in this case is set to be 3 Km.
Step 3.2 in step 3 is layering the unidirectional communication link. The method is implemented as follows: in the case, two unidirectional links have 19 nodes which are numbered 1,2,3, … and 19 from left to right in sequence, and the distances between two adjacent communication nodes are the same. The farthest wireless communication distance S is 3Km, and the distance between two adjacent communication nodes is SnearWhen the distance is 400m, the communicable condition between the two nodes is as follows:wherein i and j are numbers of two nodes respectively. The single-ended line can be divided into k layers, in this caseNode 1 belongs to layer 1, nodeBelong to level 2, …, node i belongs to kthiLayer of whichBecause of the k-thiThe last node j of the layer may receive the (k) th nodei+1) layer arbitrary node, so we equate to "node" transmission to "layer" transmission, where node j can be placed to receive the (k) th signali+1) layer arbitrary node slave signal.
And 4, determining the number of communication node bridges and the corresponding relation of each node bridge device according to the layering result of the step 3 and the boundary conditions in the step 2. The bridge receiving at most 3 slave signals according to the boundary conditions, kthiLayer receives the (k) thi+1) layer signal, then kthiLayer at least needsA station bridge.Wherein X is the (k) thi+1) layer node number line total need to add NmainA station bridge. And (4) programming according to the formula and step 3 hierarchical derivation, and inputting the boundary conditions in the step 2. The calculation result is shown in fig. 7, and the table shows the number of receiving bridges that need to be newly added for each node and the communication node list corresponding to each newly added receiving bridge.
In step 5, the 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 fig. 7 shows the calculation result in detail. According to step 5.1, the overall data flow direction, in this case a continuous non-network area, is first determined, and according to step 3, the communication link is decomposed into two unidirectional data links, so that the overall data flow direction is in two directions, and flows from the middle node to the nodes on both sides. The number of devices per bridge is made up of two parts: the sending device of each node and the number of newly added bridges obtained according to step 4 (no sending device exists at the end node of each unidirectional communication link). And 5.2, performing step 5.2 according to the data flow determined in step 5.1, giving a node number corresponding to each node device in step 4, and sorting the bridge corresponding to each node, the node corresponding to each bridge and the node corresponding to the node in the backward data flow direction according to the given node number and the data flow direction. Step 5.3 is further finished after step 5.2. The overall topology structure is determined according to the contents determined in step 5.1 and step 5.2 from the node sequence number from small to large, and the design scheme of the communication link is formed as shown in fig. 5 and fig. 6.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (1)
1. A method for designing a monitoring information transmission topological structure in a strip-shaped non-mobile network area is characterized by comprising the following steps:
step 1: determining the range of the strip-shaped area, the number of communication nodes in the strip-shaped area and the position of each communication node;
the communication nodes in the strip-shaped area are distributed and concentrated on one or more mutually connected straight lines, and the flow direction of the data is generally transmitted in a single direction;
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;
and step 3: layering the network bridge equipment;
step 3.1: decomposing the communication link into two or more unidirectional communication links;
step 3.2: layering the decomposed unidirectional communication link according to boundary conditions;
the unidirectional communication link is provided with n communication nodes which are numbered as 1,2,3, …, n from left to right in sequence, and the distance S between two adjacent communication nodesnearIf the same, node i belongs to the kth nodeiThe layers satisfy:
and 4, step 4: determining the number of communication node bridge devices and the corresponding relation of each communication node bridge device;
the known receiving bridge receives signals of at most m transmitting bridges, kthiLayer receives the (k) thi+1) layer signal, then kthiLayer at least needsThe bridge of a station network,x is the (k) thi+1) number of layer nodes; unidirectional communication link requires the addition of N in totalmainThe bridge of a station network,k is the total number of layers of the unidirectional communication link; since the data flow per node is Ndata,Ndata≤Ndata_maxMoving each layer from right end node to left according to the position of network bridge, searching out network bridge data flow of each node until its distribution is uniform, if it is uniformAdding a bridge at the position where the data stream exceeds the standard;
and 5: and forming a data link of each communication node according to the data flow direction of each communication node, the number of newly added bridge type devices of each communication node and the corresponding relation between each bridge type device, and finishing the design of the whole strip-shaped area communication topological structure.
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 true CN113726565A (en) | 2021-11-30 |
CN113726565B 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 |
---|
贺瑜飞;: "基于星间网络拓扑技术的星间链路优化设计", 计算机测量与控制, no. 12 * |
Also Published As
Publication number | Publication date |
---|---|
CN113726565B (en) | 2023-08-15 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN110417588B (en) | Aviation dynamic network path planning method based on alliance game | |
CN111212384A (en) | Unmanned aerial vehicle multi-data-chain intelligent switching method | |
Moysiadis et al. | Extending ADR mechanism for LoRa enabled mobile end-devices | |
CN109639575A (en) | Route planning method based on link congestion coefficient | |
CN113315569A (en) | Satellite reliability routing method and system with weighted link survival time | |
CN104735744A (en) | Multi-hop transitroute design method based on terminal direct communication | |
CN109275154B (en) | Dynamic self-adaptive routing path planning method based on double-layer topological routing algorithm | |
CN104579957A (en) | Routing method of delay tolerant network based on degree of intimacy and time constraint forwarding | |
CN110336751A (en) | Low-track satellite network routing policy based on membership function | |
Odarchenko et al. | Improved method of routing in UAV network | |
Alves et al. | Introducing a survey methodology for assessing LoRaWAN coverage in Smart Campus scenarios | |
Naser et al. | Implementation of RWP and Gauss Markov Mobility Model for Multi-UAV Networks in Search and Rescue Environment. | |
CN113726565A (en) | Method for designing monitoring information transmission topological structure in strip-shaped non-mobile network area | |
CN113727278B (en) | Path planning method, access network equipment and flight control equipment | |
CN117221948A (en) | Network selection and power control method oriented to dense scene | |
CN108306671A (en) | Solar system revolution orbit Constellation Design method and device for deep space trunking traffic | |
CN104053207B (en) | A kind of wireless sensor network spacing query method | |
Qin et al. | Optimal resource allocation for AGIN 6G: a learning-based three-sided matching approach | |
CN102572998B (en) | Heuristic routing method utilizing position information in shipborne adhoc network | |
CN103974372A (en) | Delay tolerant network routing method based on fuzzy reasoning | |
Cao et al. | A beacon-less relay-node selection method for 3-D scenarios in Internet of Vehicle | |
CN116980881B (en) | Multi-unmanned aerial vehicle collaboration data distribution method, system, electronic equipment and medium | |
CN104581750A (en) | Construction method for opportunity network computable model | |
CN117119555B (en) | Lunar exploration time-varying topology group node self-adaptive networking routing method and system | |
CN105007588B (en) | A kind of communication means based on wireless ultraviolet light |
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 |