CN106487684A - A kind of method for routing based on link-quality and queuing delay - Google Patents
A kind of method for routing based on link-quality and queuing delay Download PDFInfo
- Publication number
- CN106487684A CN106487684A CN201610981477.1A CN201610981477A CN106487684A CN 106487684 A CN106487684 A CN 106487684A CN 201610981477 A CN201610981477 A CN 201610981477A CN 106487684 A CN106487684 A CN 106487684A
- Authority
- CN
- China
- Prior art keywords
- node
- quality
- link
- business
- neighbor
- 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
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/302—Route determination based on requested QoS
- H04L45/306—Route determination based on the nature of the carried application
-
- 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/30—Routing of multiclass traffic
-
- 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/54—Organization of routing tables
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a kind of method for routing based on link-quality and queuing delay, it is first depending on net interior nodes periodic broadcasting oneself state and neighbor node message number to count internodal communication link quality, and estimates queuing delay using business transmitted traffic.Secondly extract network topology structure from information of neighbor nodes, and combine node oneself state information build Info table.Finally according to service feature from up to path choose Optimization route.The present invention manually need not preassign path, can select route for addressing class service dynamic, thus adapting to datalink network topology dynamic change.Additionally, the present invention considers the requirement to link-quality and time delay for the service feature when selecting route, and the method is applied on Practical Project, and performance reaches manufacture claim.
Description
Technical field
The present invention relates to a kind of datalink network technical field, particularly to being based on link-quality and queuing in Two-Hop
The method for routing of time delay.
Background technology
Datalink network is non-stop layer, a distributed network architecture, and it requires guarantee business not only reliable but also rapidly send
Reach destination node.In the datalink network system of directional communication, it is extended network communication coverage, during it passes through to set
Continue node forwarding service.
It is necessary first to the forward node of business is manually specified in advance in above-mentioned network, network is in running interior joint
Business optimal path can not automatically be chosen according to change in topology, lack motility.Secondly, when specified via node can not be normal
The communication coverage of whole network is influenced whether, the vigorousness of the network operation is not high during work.Finally, due to be subject to wireless network
Topological structure impact complicated and changeable it is intended that forward node cannot ensure that forwarding service is reliably sent to.For problem above, one
A little scholars propose using by tabledriven method for routing choice of dynamical path it is desirable to solve to be manually specified forward node deficiency it
Place.But, its only using connected ratio between node as business up to unique foundation, not by inter-node link quality and queue
Reason two key factors of scheduling delay are brought in route selecting method, more do not account for network dynamic and service feature satisfies the need
By adaptability impact, and only stop and demonstrate in laboratory environments, in datalink network on be not applied.
Content of the invention
In order to overcome the deficiencies in the prior art, the present invention provides a kind of route side based on link-quality and queuing delay
Method, for double bounce up to network, integrated service feature and Link State choose the path that optimum is sent to up to link, solution business
Problem, effectively meets the demand of datalink network dynamic, is applied on Practical Project.
The technical solution adopted for the present invention to solve the technical problems comprises the following steps：
(1) net interior nodes, with node oneself state information and information of neighbor nodes two class group network service as statistical sample, save
Point oneself state information includes node ID, network responsibility and node location, and network responsibility is divided into major network pipe, substitute webmaster, relaying
With substitute relaying four types；Information of neighbor nodes includes node self ID, neighbor node ID, neighbor node to this node link
Quality and this node arrive neighbor node link-quality；Net interior nodes periodic broadcasting sends two class group network services, and counts single
Receive the group network service number of neighbor node transmission in cycle, subsequently end of term this week calculate current period with two cycles system
The message collecting, the result after message is added as neighbor node to the link-quality of this node, and from upper a cycle
Obtain this node in neighbor node message and arrive neighbor node link-quality；The initial time link-quality running in node is defaulted as
0；
(2) intra-node sets up different queues according to the priority of message, counts first when estimating queuing delay
The number of services of fixed cycle Nei Ge priority query's transmission, then calculated transmitted traffic each week end of term, that is, considering team
During row scheduling, how many bytes of transmission, the transmission to last cycle and current period simultaneously can be dispatched by every millisecond of each priority query
Flow is weighted processing；The weights in this cycle are 0.7, and the weights in a upper cycle are 0.3；
(3) each node is set up and updating maintenance nodal information according to node oneself state information and neighbor node message
Table, informational table of nodes include each priority service of intra-node queuing estimation time delay, around a hop node number and node ID,
Own node jumps, with one, the network responsibility undertaking up to node bi-directional link quality and this node；
(4) pass through to search the possible path that informational table of nodes extracts arrival destination node presence；If destination node is in industry
Business produce node neighbours in, then be labeled as a jump up to and extract reach this node link-quality；If destination node is
Business produce node a hop node neighbor node, then be labeled as double bounce up to and calculate reach destination node link-quality
With forward node queuing delay；The link-quality in this path produces node to forward node link-quality and forward node for business
It is multiplied to destination node quality, and it is converted to compared with fixed numbers this path and be sent to rate；
(5) quick business and reliable service two big class when applied business being divided into, when quick business refer to business time delay is had will
Ask, if exceeding life cycle, this business will lose efficacy；Reliable service refers to that business need can accurately be sent to destination node；For
When quick business, prioritizing selection tolerates the optimum path of link-quality under queuing delay threshold value at it；For reliable service, it is being higher than
The minimum path of queuing delay is chosen on link-quality thresholding；If current network conditions can not meet the link matter of applied business
Amount requires or delay requirement, then choose the best path of link-quality；If under equal conditions having mulitpath up to purpose
Node, then select the path without major network pipe or relay forwarding.
The invention has the beneficial effects as follows：First, the present invention manually need not preassign forward-path, can be according to node between
Link-quality and queuing delay dynamically select route, such that it is able to adapt to the dynamic change of datalink network topology.Secondly,
The present invention has considered applied business feature, and when being classified as, quick business and reliable service are it is ensured that selected route is optimum.This
Outward, the present invention is applied on Practical Project, and demonstration and verification effect shows, under complex network environment, it can be each
Class business finds Optimization route.
Brief description
Fig. 1 is method of the present invention flow chart.
Fig. 2 is the network topological diagram of the embodiment of the present invention.
Fig. 3 is the time slot schematic diagram of the embodiment of the present invention.
Specific embodiment
The present invention is further described with reference to the accompanying drawings and examples, and the present invention includes but are not limited to following enforcements
Example.
The present invention comprises the following steps：
(1) count link-quality
Link quality statistics are with node oneself state and information of neighbor nodes two class group network service as statistical sample, do not account for
Use extra bandwidth.Node status information data element includes node ID, network responsibility, node location data item.Network responsibility is
Major network pipe, substitute webmaster, relaying, substitute relaying four types.The data element of information of neighbor nodes includes node self ID, neighbour
Occupy node ID, neighbor node to this node link-quality, this node to neighbor node link-quality.Net interior nodes periodic broadcasting is sent out
Send two class group network services, and count the group network service number receiving the transmission of surrounding neighbours node in signal period, subsequently at this
All moment in the end of term calculate the message that current period is received with upper two cycles statistics, and the result after message is added saves as neighbours
Point arrives the link-quality of this node, and this node to neighbor node link-quality can obtain from upper a cycle neighbor node message
Take.The initial time link-quality running in node is defaulted as 0.For the ease of link quality statistics, arrange node in each week
The group network service number that phase sends is fixed value.
(2) estimate queuing delay
Intra-node sets up different queues according to the priority of message, counts first when estimating queuing delay and is fixing
The number of services of cycle Nei Ge priority query's transmission, then calculates transmission stream in the moment in each week end of term according to these information
Amount, that is, when considering queue scheduling, every millisecond of individual queue can dispatch how many bytes of transmission, simultaneously to last cycle and currently week
The transmitted traffic of phase is weighted processing.The weights in this cycle are 0.7, and the weights in a upper cycle are 0.3.
(3) set up and safeguard informational table of nodes
Each node sets up the information of simultaneously updating maintenance net interior nodes according to the status message receiving and neighbor node message
Table, its concrete message element includes intra-node each priority service queuing estimation time delay, around a hop node number and node
ID, own node and is jumped up to node bi-directional link quality, and the network responsibility that this node undertakes.
(4) extract reachable path
Extract the possible path reaching destination node presence by searching informational table of nodes.If destination node is in business
Produce node neighbours in, then be labeled as a jump up to and extract arrival this node link quality.If destination node is business
Neighbor node in the hop node information table of source one, then be labeled as double bounce up to and calculate reach destination node link-quality and turn
Send out node queuing delay.Now the link-quality in this path produces node to forward node link-quality and forward node for business
It is multiplied to destination node quality, and it is converted to compared with fixed numbers this path and be sent to rate.
(5) determine optimum route
Quick business and reliable service two big class when applied business is divided into.When quick business refer to that business requires to time delay,
If exceeding life cycle, this business will lose efficacy.Reliable service refers to that business need can accurately be sent to destination node.For when
Quick business, prioritizing selection tolerates the optimum path of link-quality under queuing delay threshold value at it.For reliable service, higher than chain
The minimum as Optimization route of queuing delay is chosen on the quality threshold of road.If current network conditions can not meet application industry really
Business is to link-quality or delay requirement, but this business also requires promptly to send out, then choose link-quality outside threshold value best
Path.If under equal conditions, business has mulitpath can be sent to destination node, prioritizing selection is without major network pipe or relaying
The path forwarding.
As shown in figure 1, the present invention can dynamically choose route according to current network state for locator service.With reference to
Fig. 2 describes in detail to the specific implementation method of the present invention：
(1) assume there are 4 nodes in network, its No. ID is respectively 1,2,3,4.On unified time shafts, each node
From small to large 5 package network services were sequentially sent with 5 seconds a cycles according to No. ID.In 4 groups of network service sending time slots of node
Two time slots count the group network service number that this cycle received with upper two cycles, as the chain of other nodes to this node
Road quality, span is 0～15, and detailed process is as shown in Figure 3.And the link-quality that this node arrives other nodes can be from receipts
To neighbor node message in extract.
(2) it is located at tsiFor initial time and teiFor sending priority i (i=1,2...8) in the time period of finish time
Business number be Si, with 5s as a cycle, calculate this cycle each priority in second time slot of node 4 business sending time slots
Business transmission rate is Rcur_i=Si/(tei-tsi).Current business transmission rate Ri=0.7*Rcur_i+0.3*Rpre_iWill this week
Phase is processed with upper a cycle business transmission rate weighting, wherein Rpre_iIn expression, a cycle sends service rate.If current
Priority query's length is Li, estimate that business queuing postpones as Ti=Li/Ri, TiValue is 0～20000ms.Eat dishes without rice or wine to save
Transmission bandwidth, by TiValue Linear Mapping to 0～126.
(3) node 1 maintains the information table of itself and node 2,3,4, and net interior nodes broadcast member's shape with 5s a cycle
State and information of neighbor nodes, node safeguards informational table of nodes according to this two classes information updating receiving other members' transmissions.Node 1
Maintain information table content as follows：
(4) assume that the locator service that node 1 produces need to be delivered to node 4, understand there are 3 altogether by topological structure schematic diagram
Road up to.One type is jumped for business one and can directly be communicated with node 4 up to i.e. node 1, and now link quality values are node 1
It is multiplied by 15 to node 4 link-quality numerical value, queuing delay is designated as 0.Another type can for service needed forward node ability
Reach destination address, when the business that node 1 produces need to forward through node 2 to node 4, now link-quality is that node 1 arrives section
Point 2 arrives node 4 link-quality multiplied result with node 2, obtains in neighbor node link-quality from node information table.Due to this industry
Business reaches destination node and need to forward through node 2, now can produce queuing delay, its value can be according to service priority from node
Obtain in 2 information tables.The business of node 1 need to be when node 3 forwards, its link-quality and the same node of queuing delay value mode
2 forwardings.The link-quality being calculated numerical value is obtained compared with fixed number 225 packet loss of this link.
(5) if what node 1 was sent to node 4 is reliable service, it is more than in 10 path in link-quality numerical value and selects
Select the optimum route of the minimum conduct of queuing delay.When quick business route be under its corresponding threshold value select link-quality
Good path.If when quick business, then by time threshold, 4 class are divided into time-sensitive degree according to applied business, its
It is respectively 10,30,60,90.If the path selected is 1->2->4 and 1->3->4 it is assumed that node 2 serves as relaying responsibility, then exist
Under the conditions of equal link-quality and queuing delay, the final path determining is 1->3->4.
Above step gives realizes flow process based on the method for routing of link-quality and queuing delay, and the method being capable of foundation
Network condition simultaneously combines service feature choice of dynamical Optimization route it is ensured that business fast and reliable ground reaches destination node.
Claims (1)
1. a kind of method for routing based on link-quality and queuing delay is it is characterised in that comprise the steps：
(1), with node oneself state information and information of neighbor nodes two class group network service as statistical sample, node is certainly for net interior nodes
Body status information includes node ID, network responsibility and node location, and network responsibility is divided into major network pipe, substitute webmaster, relaying and replaces
Invigorating middle warmer continues four types；Information of neighbor nodes includes node self ID, neighbor node ID, neighbor node to this node link-quality
Arrive neighbor node link-quality with this node；Net interior nodes periodic broadcasting sends two class group network services, and counts in signal period
Inside receive the group network service number of neighbor node transmission, subsequently end of term this week calculate current period with two cycles statistics receive
The message arriving, the result after message is added as neighbor node to the link-quality of this node, and from upper a cycle neighbours
Obtain this node in node messages and arrive neighbor node link-quality；The initial time link-quality running in node is defaulted as 0；
(2) intra-node sets up different queues according to the priority of message, counts first when estimating queuing delay and is fixing
The number of services of cycle Nei Ge priority query's transmission, then calculated transmitted traffic each week end of term, that is, considering queue tune
When spending, how many bytes of transmission, the transmitted traffic to last cycle and current period simultaneously can be dispatched by every millisecond of each priority query
It is weighted processing；The weights in this cycle are 0.7, and the weights in a upper cycle are 0.3；
(3) each node is set up and updating maintenance informational table of nodes according to node oneself state information and neighbor node message, section
Point information table include each priority service of intra-node queuing estimation time delay, around a hop node number and node ID, itself
Node jumps, with one, the network responsibility undertaking up to node bi-directional link quality and this node；
(4) pass through to search the possible path that informational table of nodes extracts arrival destination node presence；If destination node is produced in business
In the neighbours of tight knot point, then be labeled as a jump up to and extract reach this node link-quality；If destination node is business
Produce node a hop node neighbor node, then be labeled as double bounce up to and calculate reach destination node link-quality and turn
Send out node queuing delay；The link-quality in this path produces node to forward node link-quality and forward node to mesh for business
Node quality be multiplied, and it is converted to compared with fixed numbers this path and is sent to rate；
(5) quick business and reliable service two big class when applied business being divided into, when quick business refer to that business requires to time delay, if
Then this business will lose efficacy to exceed life cycle；Reliable service refers to that business need can accurately be sent to destination node；For when quick
Business, prioritizing selection tolerates the optimum path of link-quality under queuing delay threshold value at it；For reliable service, higher than link
The minimum path of queuing delay is chosen on quality threshold；If the link-quality that current network conditions can not meet applied business will
Ask or delay requirement, then choose the best path of link-quality；If under equal conditions having mulitpath up to destination node,
Then select the path without major network pipe or relay forwarding.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610981477.1A CN106487684B (en) | 2016-11-08 | 2016-11-08 | A kind of method for routing based on link-quality and queuing delay |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610981477.1A CN106487684B (en) | 2016-11-08 | 2016-11-08 | A kind of method for routing based on link-quality and queuing delay |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106487684A true CN106487684A (en) | 2017-03-08 |
| CN106487684B CN106487684B (en) | 2019-05-10 |
Family
ID=58271701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610981477.1A Active CN106487684B (en) | 2016-11-08 | 2016-11-08 | A kind of method for routing based on link-quality and queuing delay |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106487684B (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110167032A (en) * | 2019-04-30 | 2019-08-23 | 陕西师范大学 | The network-building method and system of the software definition wireless self-organization network of unmanned aerial vehicle (UAV) control |
| CN110730217A (en) * | 2019-09-24 | 2020-01-24 | 日立楼宇技术（广州）有限公司 | Transmission link adjusting method and device of access control system, access control equipment and storage medium |
| CN110809054A (en) * | 2019-11-11 | 2020-02-18 | 腾讯科技（深圳）有限公司 | Data transmission method, device, equipment and storage medium |
| CN111447114A (en) * | 2020-03-25 | 2020-07-24 | 深信服科技股份有限公司 | Data packet transmission method and device, electronic equipment and storage medium |
| CN111770551A (en) * | 2020-07-09 | 2020-10-13 | 南方电网科学研究院有限责任公司 | Method, system and equipment for communication between gateways of high-dynamic uncertain link |
| CN112866108A (en) * | 2021-02-01 | 2021-05-28 | 迪莲娜(上海)大数据服务有限公司 | Edge gateway link optimization method, system, medium and cloud management system |
| CN113365252A (en) * | 2021-05-31 | 2021-09-07 | 浙江大华技术股份有限公司 | Data transmission method, data transmission device, storage medium and electronic device |
| CN113726656A (en) * | 2021-08-09 | 2021-11-30 | 北京中电飞华通信有限公司 | Method and device for forwarding delay sensitive flow |
| CN114448816A (en) * | 2021-12-30 | 2022-05-06 | 中国航空研究院 | Integrated IP networking method based on heterogeneous data chain |
| CN114938530A (en) * | 2022-06-10 | 2022-08-23 | 电子科技大学 | Wireless ad hoc network intelligent networking method based on deep reinforcement learning |
| CN115550244A (en) * | 2022-09-21 | 2022-12-30 | 中国电子科技集团公司第二十八研究所 | Method for forwarding instruction messages among multiple data chains |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1889514A (en) * | 2005-09-02 | 2007-01-03 | 华为技术有限公司 | Carrying and controlling separated route controlling method in group exchange network |
| US20090180480A1 (en) * | 2008-01-15 | 2009-07-16 | Lucent Technologies Inc. | Systems and methods for network routing |
| CN102148752A (en) * | 2010-12-22 | 2011-08-10 | 华为技术有限公司 | Routing implementing method based on content distribution network and related equipment and system |
| CN104348732A (en) * | 2013-07-25 | 2015-02-11 | 华为技术有限公司 | Topology structure discovery method and device thereof |
| CN104661260A (en) * | 2015-01-20 | 2015-05-27 | 中南大学 | Wireless Mesh intelligent power grid routing mechanism with QoS perceiving and loading balancing |
| CN105656779A (en) * | 2016-01-18 | 2016-06-08 | 西安三星电子研究有限公司 | Method, device and system for selecting route in asymmetrical link |
| CN105721302A (en) * | 2016-03-31 | 2016-06-29 | 重庆邮电大学 | Routing selection method for software defined network |
| CN106160800A (en) * | 2016-06-22 | 2016-11-23 | 邦彦技术股份有限公司 | Data transmission method and device |
-
2016
- 2016-11-08 CN CN201610981477.1A patent/CN106487684B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1889514A (en) * | 2005-09-02 | 2007-01-03 | 华为技术有限公司 | Carrying and controlling separated route controlling method in group exchange network |
| US20090180480A1 (en) * | 2008-01-15 | 2009-07-16 | Lucent Technologies Inc. | Systems and methods for network routing |
| CN102148752A (en) * | 2010-12-22 | 2011-08-10 | 华为技术有限公司 | Routing implementing method based on content distribution network and related equipment and system |
| CN104348732A (en) * | 2013-07-25 | 2015-02-11 | 华为技术有限公司 | Topology structure discovery method and device thereof |
| CN104661260A (en) * | 2015-01-20 | 2015-05-27 | 中南大学 | Wireless Mesh intelligent power grid routing mechanism with QoS perceiving and loading balancing |
| CN105656779A (en) * | 2016-01-18 | 2016-06-08 | 西安三星电子研究有限公司 | Method, device and system for selecting route in asymmetrical link |
| CN105721302A (en) * | 2016-03-31 | 2016-06-29 | 重庆邮电大学 | Routing selection method for software defined network |
| CN106160800A (en) * | 2016-06-22 | 2016-11-23 | 邦彦技术股份有限公司 | Data transmission method and device |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110167032A (en) * | 2019-04-30 | 2019-08-23 | 陕西师范大学 | The network-building method and system of the software definition wireless self-organization network of unmanned aerial vehicle (UAV) control |
| CN110730217A (en) * | 2019-09-24 | 2020-01-24 | 日立楼宇技术（广州）有限公司 | Transmission link adjusting method and device of access control system, access control equipment and storage medium |
| CN110809054A (en) * | 2019-11-11 | 2020-02-18 | 腾讯科技（深圳）有限公司 | Data transmission method, device, equipment and storage medium |
| CN110809054B (en) * | 2019-11-11 | 2021-10-29 | 腾讯科技（深圳）有限公司 | Data transmission method, device, equipment and storage medium |
| CN111447114A (en) * | 2020-03-25 | 2020-07-24 | 深信服科技股份有限公司 | Data packet transmission method and device, electronic equipment and storage medium |
| CN111770551B (en) * | 2020-07-09 | 2022-05-03 | 南方电网科学研究院有限责任公司 | Method, system and equipment for communication between gateways of high-dynamic uncertain link |
| CN111770551A (en) * | 2020-07-09 | 2020-10-13 | 南方电网科学研究院有限责任公司 | Method, system and equipment for communication between gateways of high-dynamic uncertain link |
| CN112866108A (en) * | 2021-02-01 | 2021-05-28 | 迪莲娜(上海)大数据服务有限公司 | Edge gateway link optimization method, system, medium and cloud management system |
| CN113365252A (en) * | 2021-05-31 | 2021-09-07 | 浙江大华技术股份有限公司 | Data transmission method, data transmission device, storage medium and electronic device |
| CN113726656A (en) * | 2021-08-09 | 2021-11-30 | 北京中电飞华通信有限公司 | Method and device for forwarding delay sensitive flow |
| CN114448816A (en) * | 2021-12-30 | 2022-05-06 | 中国航空研究院 | Integrated IP networking method based on heterogeneous data chain |
| CN114448816B (en) * | 2021-12-30 | 2023-10-10 | 中国航空研究院 | Integrated IP networking method based on heterogeneous data chain |
| CN114938530A (en) * | 2022-06-10 | 2022-08-23 | 电子科技大学 | Wireless ad hoc network intelligent networking method based on deep reinforcement learning |
| CN114938530B (en) * | 2022-06-10 | 2023-03-21 | 电子科技大学 | Wireless ad hoc network intelligent networking method based on deep reinforcement learning |
| CN115550244A (en) * | 2022-09-21 | 2022-12-30 | 中国电子科技集团公司第二十八研究所 | Method for forwarding instruction messages among multiple data chains |
| CN115550244B (en) * | 2022-09-21 | 2023-11-17 | 中国电子科技集团公司第二十八研究所 | Method for forwarding instruction message among multiple data chains |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106487684B (en) | 2019-05-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106487684A (en) | A kind of method for routing based on link-quality and queuing delay | |
| CN101932062B (en) | Multipath routing method in Ad Hoc network environment | |
| CN101711048B (en) | Method for choosing gateway in integrating process of mobile self-organization network and Internet | |
| WO2014112250A1 (en) | Node and method for routing packets based on measured workload of node in low-power and lossy network | |
| CN101674630A (en) | Implementation method of cross-layer routing capable of perceiving congestion | |
| Ghaffari et al. | Energy-efficient and QoS-aware geographic routing protocol for wireless sensor networks | |
| Gilani et al. | SDNMesh: An SDN based routing architecture for wireless mesh networks | |
| Boushaba et al. | Node stability-based routing in wireless mesh networks | |
| CN109548112A (en) | A kind of wireless sense network distributed routing method based on the various dimensions path quality factor | |
| JP2009218626A (en) | Path multiplexing communication system, communication node, and communication method | |
| CN102769885A (en) | Method for realizing routing in sensor network and sensor network | |
| CN105007570B (en) | A kind of mobile ad-hoc network jamming control method based on OLSR agreement | |
| Yamunadevi et al. | Efficient comparison of multipath routing protocols in WSN | |
| Yu et al. | An ant colony optimization-based QoS routing algorithm for wireless multimedia sensor networks | |
| Kannan et al. | Ant colony optimization for routing in mobile ad-hoc networks | |
| CN102088751B (en) | Gradient-based wireless sensor network (WSN) topology maintenance method and packet forwarding method | |
| Hua et al. | A DTN routing protocol based on hierarchy forwarding and cluster control | |
| Srinivasan et al. | Stability and energy aware multipath routing for mobile ad hoc networks | |
| Kai et al. | MDSDV: a modified DSDV routing mechanism for wireless mesh networks | |
| Aalsalem et al. | A framework for real time communication in sensor networks | |
| CN102905340B (en) | A kind of addressing method and device being applied to aeronautical communications network | |
| Zhong et al. | Research and Implementation of AOMDV Multipath Routing Protocol | |
| Geng | A cross layer qos design model for mobile ad hoc networks | |
| CN102006235B (en) | Flow control method and device in cognitive packet network | |
| Meng et al. | A beyond 5G edge network for ultra-low latency services |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | 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 |