CN110139319A - High dynamic time-delay network propagation delay time minimizes method for routing - Google Patents
High dynamic time-delay network propagation delay time minimizes method for routing Download PDFInfo
- Publication number
- CN110139319A CN110139319A CN201910442319.2A CN201910442319A CN110139319A CN 110139319 A CN110139319 A CN 110139319A CN 201910442319 A CN201910442319 A CN 201910442319A CN 110139319 A CN110139319 A CN 110139319A
- Authority
- CN
- China
- Prior art keywords
- node
- network
- neighbor
- information
- routing
- 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/02—Topology update or discovery
- H04L45/028—Dynamic adaptation of the update intervals, e.g. event-triggered updates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/124—Shortest path evaluation using a combination of metrics
-
- 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/24—Multipath
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0284—Traffic management, e.g. flow control or congestion control detecting congestion or overload during communication
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
A kind of high dynamic time-delay network propagation delay time proposed by the present invention minimizes method for routing, it is intended to control network congestion with flexible low overhead network configuration.The present invention is achieved through the following technical solutions: the whole network node being divided into center control nodes and ordinary node using software defined network SDN；Center control nodes generate source node to the optimal path of destination node, are handed down to ordinary node by control channel；Each ordinary node is according to neighbor discovery mechanisms periodically by control channel to center control nodes feedback node neighbor table information, itself Topology connection information and node flow status information；Center control nodes take the mode of continuous iteration to obtain full-mesh network view information；When there is data packet to need to forward, the routing table instruction that ordinary node is issued according to center control nodes is completed data grouping and is forwarded；Center control nodes judge whether network occurs congestion according to the node flow information of collection, and bypass data packet is shunted in a manner of shunting and detour and alleviates network congestion.
Description
Technical field
The invention belongs to wireless communication technology fields, more particularly to one kind to be suitable for solving under high speed high dynamic network environment
The effective routing method of propagation delay time and congestion control.
Background technique
With the increase of internet scale and the raising of technology, demand of the user to network also produces corresponding variation.
The service that network can be provided produces very big difference with network Development initial stage.People are to the continuous of access to information demand
Increase, mobile communication technology plays the role of vital in wireless communications.Self-organization network is by a group with wireless receiving and dispatching
The multi-hop autonomy network of the mobile device composition of device.Wireless network has been segmented into center according to the textural classification of broad sense
Network (Infrastructured Network) and network without center (Infrastructureless Network).Often refer to
Cellular mobile communication networks be exactly center, need just operate normally based on preset base station；Network without center is then
Be not dependent on any network facilities, can self-organization mobile radio networks, also referred to as mobile ad-hoc network
(MobileAd-hocNetworks, abbreviation MANET).With there is central site network to compare, " dynamic topology " is the essential characteristic of MANET
One of, all nodes are autonomous, and the topological structure of network is thus caused to change constantly.There is no fix in network
Base station, all nodes independently can complete networking, can also directly carry out no barrier between node at any time and any place
Hinder data exchange, when destination node is not in communication range, can also complete to lead to by way of relaying by other nodes
Letter.Therefore, MSNET network has bigger popularize compared to there is central site network to have stronger flexibility, robustness and survivability
Space.There are many differences, these features cause its realization process to have many technologies for self-organizing network and traditional network
Difficult point and challenging problem.The network topology structure of dynamic change is its distinguishing feature, in mobile ad hoc network
In the network topology structure of dynamic change, conventional routing protocols are usually not account for this point.When network topology structure is sent out
After changing, it will lead to former topological structure most contents and be run ragged, if directly will need to spend using conventional routing protocols
Long time can just make network reach convergence state, cause the routing cost of agreement excessive, and end-to-end propagation delay time increases, into
And influence the transmission of data information.In high speed high dynamic network, since number of nodes is more, relative moving speed is very fast, directly
It connects and causes the quick variation of network structure.In this case, traditional multihop routing agreement can not meet quickly
Chain rupture re-establishes the requirement of connection.It is necessarily dependent upon the support of physical layer and MAC layer, agreement can be allowed preferably to fit
Answer the network of high speed high dynamic.
Network delay and shake are two important parameters of QoS, have very important influence to upper layer application.Network passes
Defeated is a complicated process, intermediate to be inevitable by router and different communication links, delay, because of data
Transmission in a communication link has to pass through the regular hour, each data packet after delay it is also different.For a spy
Fixed network path, network delay data packet pass through the referred to as delay of one or more network segments time experienced.From the angle of user
Degree says that delay is that user issues a request to the time for receiving the response of distal end application system.Network delay mainly has transmission to prolong
When, propagation delay, processing delay, queuing delay, first three is fixed delay, and queuing delay is variable time delay.Queuing delay is
It is determined by network dynamic, the congestion condition in network is different, and queuing delay varies widely.Based on ICP/IP protocol net
Network transmission includes following treatment process: router processing, user data cell are in transmission over networks and server process process.
Transmission delay is that the bit of all groupings is completely transferred to on route the required time, i.e. the of protocol Data Unit PDU
One bit is transmitted on route to the last that a bit leaves this period of endpoint from endpoint.Transmission delay is big with PDU
Transfer rate on small and route is related.In the network of one store-and-forward mechanism, data packet will generate multiple transmission and prolong
When, PDU forwarding next-hop will all be generated into a transmission delay every time.Each of one data packet bit is pushed to communication
After link, which is propagated, and is transmitted from the starting point of the communication link to next hop router is reached
The required time is exactly propagation delay.If there is shake there are the different packet delay time in transmission process.
Shake is the degree for describing delay variation, refers to the variation degree of grouping delay, is since the variation of various delays causes
The variation of data grouping arrival rate in network.Therefore, shake will be an important parameter for the transmission of real-time.Number
Evenly distributed at regular intervals when leaving transmitting terminal according to packet, after through network, this uniform interval is because of data packet
It undergoes different delay sizes and is destroyed, to generate shake.The size of shake depends on the delay time of data packet
Difference degree, difference degree is bigger, then shakes bigger.Some multimedia application, as video on demand end-to-end delay constraint compared with
It is small, but its constraint by shake and time lag factor simultaneously.Multimedia data transmission is uneven, will cause picture or sound quivers
It trembles；There are when the media jitter of two media, the variation of corresponding data packet arrival time causes synchronous loss.Due to interconnection
In net flow distribution it is unbalanced will lead to network congestion, Internet resources cannot make effective use of, network congestion is to its shadow
It rings often fatal.Currently, operator generallys use the excessive method for providing bandwidth in a network to reduce the generation of congestion,
Although this method can alleviate congestion to a certain extent, cannot tackle the problem at its root.Flow in internet
Change sufficiently complex, is often fluctuated in a big time scale, it is therefore, excessive to provide result caused by bandwidth method just
It is that a part of communication link in network will or have occurred and that congestion, and other communication link is in idle and obtains
Less than making full use of, this undoubtedly increases the cost of network construction.Simultaneously as the fast development of Internet service leads to backbone
Flow growth in net is too fast, and the speed of network construction is difficult to keep up with the speed of flow growth, and congestion still cannot obtain effectively
It avoids.
The basic reason for causing face phenomenon is existing Routing Protocol not QoS of customer QoS, network topology
Three combines with flow distribution, and a large amount of flows is caused to focus in a small number of critical paths, and remaining communication link
Usually it is in idle condition.The Routing Protocol of traditional mobile ad-hoc network can be divided into on-demand routing (On- by driving method point
Demand Routing Protocol) and by two kinds of table routing (Table-driven Routing Protocol).It drives on demand
Dynamic Routing Protocol is also referred to as Reactive routing protocols, and in this agreement, any node does not safeguard global routing table, but only when
When data need to forward, just start " on-demand " selection for carrying out path.Entire routing procedure is divided into route querying and route maintenance
Two parts.Source node can initiate route querying process, find in a network by way of broadcast route request information first
After corresponding path, destination node feedback sources node-routing confirmation message, after receiving confirmation message, source node just starts to send
Data grouping.Although on-demand type routing can save between node according to " on-demand " generation " shortest path " without storing routing table
Interaction routing table bring routing cost, but route querying, route maintenance procedure needs take a significant amount of time, and thereby result in number
It is larger according to packet propagation delay time, it is not suitable for the business with low time delay demand.In addition, when network structure change, the association
View can also aggravate the expense of route maintenance procedure generation.More typical demand-based routing agreement has AODV, ABR, DSR etc..
Proactive routing protocols are also referred to as by Table Driven agreement.Compared to demand-based routing agreement, in Proactive routing protocols
Each node can safeguard one or more table, these tables include the routing iinformation for reaching other nodes.When there is data
When transmission task, query node routing table is only needed, data are directly issued into corresponding node according to routing table content, can effectively be dropped
Low transmission time delay.Routing iinformation is interacted between node according to the time cycle of setting by Table Driven agreement, or is monitored
When network topology structure changes, routing table content is updated by way of broadcast between node in real time.So by phenotype routing association
View can accurately reflect the structure change of network, can in real time, accurately update node route list information, and time delay is smaller.
But its routing cost is larger, be easy to cause broadcast storm.If network structure variation is acutely, update can be frequently triggered
Mechanism occupies a large amount of network bandwidths, and network congestion is even caused when serious.Typically by Table Driven agreement have DSDV,
OLSR, WRP etc..In addition, on demand type and press selection criteria of the phenotype agreement by " fewest number of hops " as " optimal path ".But
It is optimal that route jumping figure does not necessarily represent path performance less.Under same propagation ambient condition, nodal distance difference is remoter, and signal is strong
Degree is lower, in this case, is forwarded by intermediate node often more preferable than directly transmitting effect.On the other hand, when hop count is minimum
Path on certain intermediate node when overloading, if continuing to use the path, will lead to the loss and transmission of mass data packet
Time delay sharply increases.
In MSNET network, especially in the high speeds such as mobile car networking, aviation self-organization network, highly dynamic radio network,
The movement speed of node has compared to the speed of conventional network node to be obviously improved, and the quickening of node motion speed will lead to
The case where network topology structure changes rapidly, and it is easy to appear communication link is broken between node in this case, causes
Communication failure is to cause inter-node communication time delay to greatly increase.Therefore, MANET conventional routing protocols are obviously unable to satisfy high dynamic
The needs of reliable communication between state wireless network environment lower node, how to design one kind can be adapted for highly dynamic radio network environment
Dynamic routing algorithm, and communication delay can also be effectively reduced, will be a difficulty and challenge.
Summary of the invention
The present invention in view of the above problems, provide a kind of routing accuracy is higher, network efficiency is higher, reliability is higher, consume
When the congestion control method for routing that minimizes of the faster high dynamic time-delay network propagation delay time of less, convergence rate.
The present invention solves the technical solution of its technical problem: a kind of high dynamic time-delay network propagation delay time minimum routing side
Method, has following technical characteristic, and a kind of high dynamic time-delay network propagation delay time minimum method for routing has following technology special
Sign: using software defined network SDN, and the whole network node is divided into the center control that maintenance is managed to full-mesh network status information
The ordinary node of node and uploaded state information separates network-based control function and forwarding capability, and then will control function
It can all focus in long-range center control nodes, and ordinary node need to be only responsible for generating locally according to center control nodes
Forwarding strategy do the data forwarding of simple high speed.Center control nodes are based on global network state information and generate source node to mesh
Node optimal path, ordinary node is uniformly handed down to by control channel；Each ordinary node is according to neighbor discovery mechanisms, week
Pass through to phase property data channel to center control nodes feedback node neighbor table information, itself Topology connection information and node flow
Status information.Under single service conditions, center control nodes are based on global network view information, using propagation delay time as path cost
Function, construction schedule are handed down to global optimum's routing table of each ordinary node.When there is data packet to need to forward, ordinary node
Using neighbor discovery mechanisms, the routing table issued according to center control nodes searches the " optimal of the required destination node of corresponding arrival
Data grouping forwarding is completed in path ".Under multi-service circumstances, ordinary node is according to different business QoS characteristic, by data packet point
For high, medium and low three kinds of priority types, center control nodes judge whether network is gathered around according to the node flow information of collection
Plug starts congestion control mechanism if congestion, and center control nodes generate two-by-two congested node according to global view information
The alap multipath routing table of correlation between path in a manner of shunting and detour, is delayed according to packet priority distribution path
Solve network congestion.
The present invention has the advantages that compared to traditional mobile ad-hoc network Routing Protocol.
It is higher to route accuracy.The present invention uses software defined network thought, and the whole network node is divided into center control nodes
And ordinary node, by network central control channel and data channel separation.By remote center's control node of logical centralization to universe
Network is managed and safeguards that center control nodes collect global network view information, using propagation delay time as path cost function,
Construct network optimum routing table.It is to negotiate to generate by interaction complicated between node compared to traditional movable self-organization Routing Protocol
Local topology information generate routing table, routing accuracy it is higher.
Router efficiency is higher.The present invention is managed full-mesh network status information by the center control nodes of logical centralization
Maintenance, and source node is generated to the optimal path of destination node, unify to be handed down to ordinary node by control channel, not need in
Status information needed for intermediate node maintains connection, time-consuming less, convergence rate faster, can guarantee Autonomous Domain fringe node it
Between establish shortest forward-path, can meet simultaneously and be required of both crucial flow path electrical path length and maximum bandwidth utilization rate.
Compared to conventional routing protocols, expense needed for node-routing is safeguarded is reduced, the end-to-end propagation delay time of data packet is reduced.And take congestion
Controlling mechanism reduces network packet loss rate, avoids network congestion, has better feasibility and practicability, is more applicable for high dynamic
State network environment.
Flexibility is higher.The present invention uses under single service conditions, and center control nodes are based on global view information to pass
Defeated time delay is that path cost generates routing table, is handed down to ordinary node and completes data packet forwarding operation；Under multi-service circumstances, in
Heart control node optimizes routing table according to different types of data packet qos requirement according to the node flow information of collection, takes point
The mode that stream detours judges whether node occurs congestion by center control nodes according to the whole network flow information, excellent according to data packet
First grade implements congestion control policy and avoids network congestion, realizes lower expense, effectively control network with flexible network configuration
Congestion.
Present invention can apply to the fields such as mobile car networking, aeronautical Ad hoc networks.
Detailed description of the invention
Fig. 1 is the logical architecture schematic diagram of high dynamic time-delay network role distribution of the present invention.
Fig. 2 is congestion control schematic diagram under Fig. 1 node i multi-service circumstances.
Fig. 3 is nodes neighbors table updating maintenance schematic diagram.
Fig. 4 is that node receives Neighbor Report messages flow chart.
Fig. 5 is that node sends Neighbor Report messages flow chart.
Fig. 6 is the work flow diagram that high dynamic time-delay network propagation delay time of the present invention minimizes routing.
To keep the technical problem to be solved in the present invention, technical solution and main points clearer, below in conjunction with attached drawing and tool
The present invention is further described for body embodiment.
Specific embodiment
Refering to fig. 1, Fig. 2.According to the present invention, using software defined network (Software Defined Network, SDN)
The whole network node is divided into the center control nodes and uploaded state information that maintenance is managed to full-mesh network status information by thought
Ordinary node, network-based control function and forwarding capability are separated, and then control function is all focused on long-range
In center control nodes, and ordinary node need to be only responsible for doing simple height locally according to the forwarding strategy that center control nodes generate
The data forwarding of speed.Center control nodes generate source node to the optimal path of destination node, are uniformly issued by control channel
To ordinary node.Each ordinary node is fed back according to neighbor discovery mechanisms, periodically by control channel to center control nodes
Nodes neighbors table information, itself Topology connection information and node flow status information, center control nodes are joined based on these information
Other control nodes are closed, the mode of continuous iteration is taken, obtain full-mesh network view information.Under single service conditions, center control
Node processed is based on global network view information, using propagation delay time as path cost function, constructs global optimum's routing table, periodically
It is handed down to each ordinary node, when there is data packet to need to forward, ordinary node uses neighbor discovery mechanisms, controls and saves according to center
The routing table that point issues, " optimal path " of destination node needed for searching corresponding reach complete data grouping forwarding.In multi-service
In the case of, ordinary node is divided into high, medium and low three kinds of priority types, center control according to different business QoS characteristic, by data packet
Node processed judges whether network occurs congestion according to the node flow information of collection, if congestion, starts congestion control immediately
Mechanism, by center control nodes according to global view information, correlation is alap generating path two-by-two to congested node
Multipath routing table in a manner of shunting and detour, alleviates network congestion according to packet priority distribution path.
The composition of aforementioned routing table, particular content include: destination node address (Dest), next-hop node address
(NextHop), route jumping figure (Hops), internodal communication link path cost (Cost), path sequence number (SeqNum), path
Class letter (Class), path settling time (Time).In order to mitigate routing table information to the occupancy of control channel bandwidth, originally
The next-hop node address for only leading to destination node in invention routing table comprising source node does not include all nodes on path
Location.Wherein, destination node address is the destination-address in path；Next-hop node address is that this node leads under destination node
One jumps hair node address；Route jumping figure refers to the hop count that this node needs to forward to destination node path；Internodal communication link
Path cost is constructed by path cost function of propagation delay time, this node reaches the path of destination node in each communication link
Cost summation；Serial No. destination node routing information identification number, for reflecting the newness degree of this paths, center control section
Point takes sequence number from the mode added in each routing update, and bigger this paths of expression of sequence number value are newer；Path etc.
Grade mark characterizes the priority level of this paths；Settling time indicates the settling time of this paths.
The building of aforementioned multipath routing table, center control nodes are still using propagation delay time as path cost function and construct
's.The characterization of path cost function is using propagation delay time of the data frame between node.Path cost value is smaller, between expression node
Transmission time is lower, and efficiency is also higher, then this paths is more excellent.Center control nodes are according to real-time the whole network view information, choosing
The alap path of correlation factor is as path set between selecting path two-by-two, then using propagation delay time as selection criteria, from path set
In select excellent, good, general three kinds of grade paths, as multipath route.When correlation factor is identical, the small road of selection propagation delay time
Diameter.The correlation of path correlation factor is divided into intersection and non-intersecting two types, for nonintersecting paths, correlation factor default
It is 0；For intersecting paths, correlation factor is equal to the quantity for the identical forward node that two paths have.Therefore, path RiAnd Rj
Correlation factor Pi,jIt can be expressed as
In the workflow that high dynamic time-delay network propagation delay time minimizes routing, software defined network SDN is according to each
Nodal function initializes network distribution node role.Each ordinary node constructs nodes neighbors table, period according to neighbor discovery mechanisms
Feedback node neighbor table information and node flow state strength information are reported to property to center control nodes by control channel.Institute
Stating flow status strength information is characterized using nodal cache queue length.Network is during transmitting data packet, data
Packet is introduced into buffer queue and waits node-node transmission, therefore data packet will be subjected to queuing delay.The queuing delay of one specified packet
To depend on it is reaching in advance, waiting in line quantity to the data packet of communication link.If the queue be it is empty,
And it is being transmitted currently without other data packets, then the data packet queuing delay is 0；If flow is very big at this time, and many
Other groupings are also waiting to be transmitted, then queuing delay will be very big.Queuing delay and data packet packet loss have certain relationship, if
A indicates that data packet reaches the Mean Speed (unit pks/s) of queue, and R is transmission rate (unit bps), and L is that block length is (single
Position bit), then the traffic intensity (trafficintensity) of node can be expressed as La/R.Under ideal conditions, flow is strong
Degree is bigger, and queuing delay also can be bigger, but the length of nodal cache queue is limited, and the data packet reached at this time will be seen that
One very slow queue, due to storing the data packet without space, node will abandon the data packet, when node flow intensity
Bigger, the queuing delay of grouping is longer, and the data packet of discarding is also more.Therefore, nodal cache queue length can be certain
The flow status information of node is characterized in degree.
Refering to Fig. 2.In optional congestion control embodiment, under multi-service circumstances, it is assumed that certain moment node i is toward section
Point j sends data packet 1, and the data packet 2 for reaching a kind of higher priority at this time needs node i to be sent to j, only according to queuing principle
Have and the data packet 1 reached in advance delivery is waited to finish, can just start the transmission for newly reaching data packet 2, when data packet flow intensity
When very big, the queuing delay of data packet 2 will be very high, will result in node i congestion.Therefore, certain moment node i is toward node
J sends data packet 1, and when reaching the data packet 2 of higher priority, data packet 2 waits the data reached in advance according to queuing principle
Packet 1 is delivered and is finished, and the new transmission for reaching data packet 2 is just started.The present embodiment takes congestion control mechanism, works as center control nodes
When perceiving the length of buffer queue arrival threshold value of node i, according to the alap principle of path-dependency, generated for node i
Multipath routing table, node i are that data packet 1 distributes good path (i, Isosorbide-5-Nitrae, 7, j) according to priority, for number according to multipath routing table
Shortest path (i, 2,5, j) is distributed according to packet 2, slows down network congestion, promotes router efficiency.Assuming that communication link midpoint between network node
ACK/NACK response message affirmation mechanism is taken to a transmission, the confirmation message reported by UE disappears when node receives certain
After breath, response informing will be fed back and receive ACK message；Transmitting node receive response informing receive ACK message after, can just send down
A piece of news, every a period of time, re-emits this message if informing the response for not receiving NACK in the stipulated time.
Refering to Fig. 3.Neighbor discovery mechanisms are to interact neighbours between the nodes neighbors table being locally stored and node by node
Report message realizes the discovery of neighbor node.Nodes neighbors table contains multiple neighbor node addresses (Address), receives
Communication link quality (RxLm), transmitting communication link quality (TxLm) and nodes neighbors table set-up time (Time), wherein receive
Communication link quality RxLm refers to the communication link quality instruction that local node receives when neighbor node sends message；Transmitting communication
Link-quality TxLm refers to the communication link quality instruction that neighbor node receives when local node sends message.It is above-mentioned about node
Between communication link quality instruction characterized with the probability of the disposable transmission success of internodal data packet, characterization probability calculation mode
Packet loss e between nodef:
efIllustrate transmitting data between nodes packet quality condition.Wherein, NrxFor the data packet number that receiving node is properly received,
NtxThe data packet number sent for transmitting node.
The frame format of Neighbor Report messages mainly has: the message source section of 1 byte message type (MessageType), 2 bytes
Dot address (SourceAdd), neighbours' number (Count) of 1 byte, neighbor node address (Destination), communication link matter
Amount instruction (LinkMetric, abbreviation Lm).Wherein, neighbor node address (Destination) includes respectively to account for 2 bytes
Destination 1 and Destination 2 ... Destination n, the communication link quality with respective neighbours node
It (Lm) include the communication link quality Lm-1 and Lm-2 ... Lm-n for respectively accounting for 1 byte.Neighbor Report messages frame format:
Neighbor Report messages
The 0th byte field in Neighbor Report messages frame format is type of message (MessageType), indicates this message for neighbour
Occupy report message；1st~2 byte field is Message Source Address (SourceAdd), indicates the node address for sending this message；
3rd byte field is neighbours' number (Count), indicates the neighbor node number that this message includes altogether；4th~5 byte field
It is 1 address of neighbor node (Destination 1)；6th byte field is and 1 communication link quality situation (Lm- of neighbor node
1)；7th~8 byte field is 2 address of neighbor node (Destination 2)；9th byte field is communicated with neighbor node 2
Link quality condition (Lm-2)；It is subsequent and so on.Internodal communication link path cost is referred to by internodal communication link quality
Show decision, and communication link cost function is
In formula, BtFor data package size (per bit), r is transmission rate (per bit is per second), and T is respectively by node spacing
From the signal transmission delay and processing delay summation (unit second) determined with bottom physical equipment when one timing of communication scenes, can recognize
To be constant value, efThe packet loss between node.
Between network node the point-to-point transmission overall delay X of communication link mainly by signal processing time delay, signal propagation delay time and
Signal transmission delay three parts are constituted, and X meets following relationship.When primary transmission is just properly received, overall delay X=Bt/r+
T, at this time transmission success Probability p=1-ef；When transmission can be properly received twice, X=2 (Bt/ r+T), transmission success Probability p
=ef·(1-ef)；And so on, when needing n times transmission that can just be properly received, X=N (Bt/ r+T), transmission success Probability p=
(ef)N-1(1-ef), then the mathematical expectation of point-to-point transmission overall delay
Then have
Therefore, available
Due to ef≤ 1, therefore
Abbreviation is availableTherefore, using propagation delay time as the communication link path of path cost function at
Originally it can be expressed asIt can be seen that internodal communication link path cost is by internodal communication link quality
Instruction determines.If certain paths probability H is by comprising a series of node D of several subsegments1,D2,D3,……,DLIt constitutes,
Wherein, each subsegment includes the path [D between node i and node i+1i,Di+1]), total length is the communication link of the path H of L
Totle drilling cost can be expressed as
Refering to Fig. 4.Whenever ordinary node receives the Neighbor Report messages of other neighbor node broadcast in network, Huo Zhexu
When sending itself neighbor report information, ordinary node will actively trigger the updating maintenance mechanism of nodes neighbors table.So section
Point neighbor table updating maintenance mechanism is divided into node and sends and receivees two kinds of scenes of Neighbor Report messages.It updates and ties up in nodes neighbors table
During shield, each node jumps communication range periodically respective one and broadcasts Neighbor Report messages, feeds back this section to adjacent node
Point Topology connection information.For ordinary node during receiving Neighbor Report messages, receiving node parses this neighbor report first
Message, detects whether Address field in local node neighbor table has this report message source address SourceAdd field contents
(1. refering to step in Fig. 3).If comprising receiving node continues to extract this Neighbor Report messages payload field；Otherwise, it receives
Node increases the message source node information newly in local node neighbor table.Then receiving node detects the payload field of the message
It whether include this node address (2. refering to step in Fig. 3) in Destination.If comprising receiving node updates local
Communication link quality (Lm-i) field contents corresponding in this Neighbor Report messages are put into this node by nodes neighbors table information
(Lm-i --- > TxLm, refering to step in Fig. 3 in the corresponding TxLm field for sending this Neighbor Report messages in neighbor table
③)；Otherwise, this Neighbor Report messages are directly abandoned.Finally, receiving node detects whether this Neighbor Report messages are last
Otherwise one Neighbor Report messages returns to if then directly terminating to receive Neighbor Report messages process and continues to parse neighbours' report
Accuse message.If showing communication link quality value Lm-i lower than defined in certain Neighbor Report messages that receiving node receives
Threshold value then determines that receiving node and this message source node have disconnected, and receiving node can be by the correspondence in nodes neighbors table
TxLm field is set as 0, and two nodes of characterization have disconnected.
Neighbor Report messages
Refering to Fig. 5.During ordinary node sends its Neighbor Report messages.Upper layer application is initiated according to sending cycle
Send Neighbor Report messages process.Then sending node starts to extract local node neighbor table information, by local node neighbor table
Content is successively filled to neighbor report and is corresponded in message load field.Detailed process is: the local address of sending node is inserted
Message Source Address SourceAdd field in Neighbor Report messages, characterizing this Neighbor Report messages is that this node sends (Fig. 3
Shown in middle step a)；All neighbor address entry contents in its nodes neighbors table are sequentially placed into the neighbour of Neighbor Report messages
It occupies in node address (Destination-i) item (in Fig. 3 shown in step b)；Then it will be saved in nodes neighbors table with neighbours respectively
Point receives the corresponding information of communication link quality RxLm and is put into Lm-i field (in Fig. 3 shown in step c).Finally, sending node
It detects whether to be the last item nodes neighbors table clause, is to encapsulate Neighbor Report messages, extremely by underlying device periodic broadcast
In network, otherwise returns and continue to extract local node neighbor table information.
Refering to Fig. 6.In the workflow that high dynamic time-delay network propagation delay time minimizes routing.Net is initialized first
Network, ordinary node construct nodes neighbors table by neighbor discovery mechanisms, periodically by control channel to center control nodes
Report nodes neighbors table and traffic intensity information.Then judge that time-delay network is single business or multi-service scene.If it is list
Business scenario, then the nodes neighbors table information that center control nodes are directly fed back according to ordinary node construct the whole network propagation delay time
" optimal " routing table, is periodically handed down to ordinary node；If it is multi-service scene, then center control nodes can also be according to common
The node flow state strength information of node feeding back judges whether there is node congestion.If center control nodes judgement has node to gather around
Plug, then start congestion control mechanism, and center control nodes are based on real-time global view information and generate propagation delay time " optimal " multipath
Routing table, ordinary node take the mode for shunting and detouring according to packet priority, alleviate network congestion.In starting congestion control
After making mechanism, center control nodes judge whether congested node restores normal every certain time.If having restored normal, entire net
Network exits congestion control mechanism, and follow-up process is executed according to single business scenario；If not yet restoring, return continues to execute congestion control
Making mechanism.Center control nodes take time trigger and event to trigger double mechanism to ensure the update of global optimum's routing table,
Whether center control nodes sensing network topological structure changes.If changing, center control nodes are according to newest reality
When topology situation, complete updating route information immediately；Otherwise, center control nodes can periodically update global routing iinformation.It is general
Logical node indicates content according to neighbor discovery mechanisms, according to routing table, completes data packet forwarding, terminates routing.
Under single business scenario.Nodes neighbors table information that center control nodes are fed back according to ordinary node, topological link letter
Breath constructs full mesh topology, generates using propagation delay time as the whole network " optimal " single-path routing table of path cost function, then center is controlled
Node processed is periodically unified to be handed down to ordinary node by control channel.
Under multi-service scene.Whether the traffic intensity information that center control nodes are fed back according to ordinary node, judge node
Congestion occurs.It is congested node by the vertex ticks, and start congestion control mechanism if congestion.Center control nodes root
According to global view information, the alap path set of correlation two-by-two is established between path, center control nodes are with each path transmission
Time delay is foundation, and path set is divided into excellent, good, general three kinds of path grades, generates multipath routing table with this.Ordinary node according to
Data packet is divided into high, medium and low three kinds of priority types by different business QoS characteristic, distributes excellent road according to high priority packets
Diameter, middle priority data packet distribute good path, and lower-priority data packet distributes the principle in general path, according to packet priority
Grade takes the mode for shunting and detouring, and reduces packet loss, alleviates network congestion, promotes network efficiency.If there is no gather around in network
Node is filled in, center control nodes will be handled according to single business scene, according to ordinary node feedback node neighbor table information as a result, structure
The single-path routing table of the whole network propagation delay time " optimal " is built, and is periodically handed down to each ordinary node.After having node that congestion occurs,
Center control nodes can judge whether congested node is restored normally, to determine whether flow status is less than flow whithin a period of time
Threshold value releases congestion control mechanism, otherwise continues to execute congestion control mechanism if being less than defined threshold.
The update of aforementioned routing table.Center control nodes take time trigger and event to trigger double mechanism to ensure the overall situation
The update of optimal finger table.Each network state information that center control nodes are reported according to ordinary node monitors network knot in real time
Whether structure changes.Not changed under normal circumstances in the whole network structure, center control nodes are updated using time trigger
Mechanism according to real-time the whole network status information, periodically updates global routing table to schedule.When center control nodes sense
When knowing that the network topology structures such as network communication link disconnection, node failure, new node addition change, then touched using event
It sends out update mechanism and routing update information is regenerated according to latest network topology situation at this time immediately, will more new information be handed down to
Corresponding changed ordinary node, and the new and old of routing iinformation is characterized from by the way of adding using destination node sequence number, it is general
Logical node completes routing table update by comparing the size that routing table sequence number was wrapped and was locally stored in update routing.To reduce routing
The excessive occupancy to control channel is updated, center control nodes are local message to the routing update information of event trigger mechanism,
The path for only including newest change not sends the path remained unchanged.
The foregoing is merely presently preferred embodiments of the present invention, is merely illustrative for the purpose of the present invention, and not restrictive
's.Those skilled in the art understand that it can be carried out in the spirit and scope defined by the claims in the present invention it is many change,
It modifies, is even equivalent, but falling in protection scope of the present invention.
Claims (10)
1. a kind of high dynamic time-delay network propagation delay time minimizes method for routing, there is following technical characteristic: using software definition
Network SDN separates network-based control function and forwarding capability, by the whole network node be divided into uploaded state information ordinary node and
The center control nodes of maintenance are managed to full-mesh network status information；Each ordinary node is according to neighbor discovery mechanisms, period
Property by data channel to center control nodes feedback node neighbor table information, itself Topology connection information and node flow shape
State information；Center control nodes generate source node to the optimal path of destination node based on full-mesh network status information, pass through control
Uniformly it is handed down to ordinary node in channel processed；Under single service conditions, center control nodes are based on global network view information, to pass
Defeated time delay is path cost function, and building is handed down to global optimum's routing table of each ordinary node；When there is data packet to need to forward
When, ordinary node uses neighbor discovery mechanisms, and the newest routing table issued according to center control nodes is searched needed for corresponding reach
" optimal path " of destination node completes data grouping forwarding；Under multi-service circumstances, ordinary node is according to different business QoS
Data packet is divided into high, medium and low three kinds of priority types by characteristic, and center control nodes are sentenced according to the node flow information of collection
Whether circuit network occurs congestion, if congestion, center control nodes start congestion control mechanism, believes according to global view at this time
Breath, the alap multipath routing table of correlation generating path two-by-two to congested node distribute road according to packet priority
Diameter alleviates network congestion in a manner of shunting and detour.
2. high dynamic time-delay network propagation delay time according to claim 1 minimizes method for routing, it is characterised in that: more industry
In the case of business, when node sends congestion, center control nodes according to real-time the whole network view information, selection two-by-two between path it is related because
Excellent, good, general three are selected from path set as path set, then using propagation delay time as selection criteria in the alap path of son
Kind grade path is routed as multipath；When correlation factor is identical, the small path of selection propagation delay time.
3. high dynamic time-delay network propagation delay time according to claim 1 minimizes method for routing, it is characterised in that: neighbours
Discovery mechanism is that Neighbor Report messages are interacted between the local node neighbor table stored by ordinary node and node to realize neighbours
The discovery of node.
4. high dynamic time-delay network propagation delay time according to claim 3 minimizes method for routing, it is characterised in that: in neighbour
It occupies in report message frame format, the 0th byte field is type of message (MessageType), indicates that this message is neighbor report
Message；1st~2 byte field is Message Source Address (SourceAdd), indicates the node address for sending this message；3rd byte
Field is neighbours' number (Count), indicates the neighbor node number that this message includes altogether；4th~5 byte field is neighbours' section
Point 1 address (Destination 1)；6th byte field is and 1 communication link quality situation (Lm-1) of neighbor node；7th~8
Byte field is 2 address of neighbor node (Destination 2)；9th byte field is and 2 communication link quality feelings of neighbor node
Condition (Lm-2)；It is subsequent and so on.
5. high dynamic time-delay network propagation delay time according to claim 1 minimizes method for routing, it is characterised in that: path
The characterization of cost function is using propagation delay time of the data frame between node, and path communication link cost values are smaller, indicates node
Between transmission time it is lower, efficiency is also higher, then this paths is more excellent.Internodal communication link cost is by internodal communication link
Quality instruction determines, and communication link cost function is
Wherein, BtFor data package size (per bit), r is transmission rate (per bit is per second), and T is respectively by node spacing
From the signal transmission delay and processing delay summation (unit second) determined with bottom physical equipment, efThe packet loss between node,
It is exactly the instruction of inter-node link quality.
6. high dynamic time-delay network propagation delay time according to claim 3 minimizes method for routing, it is characterised in that: whenever
Local ordinary node receives the Neighbor Report messages of other neighbor node broadcast in network, or needs to send itself neighbour report
When accusing information, local node will actively trigger the updating maintenance mechanism of nodes neighbors table, and by nodes neighbors table updating maintenance
Mechanism is divided into node and sends and receivees two kinds of scenes of Neighbor Report messages.
7. high dynamic time-delay network propagation delay time according to claim 6 minimizes method for routing, it is characterised in that: local
Ordinary node is during receiving Neighbor Report messages.Firstly, node parses this Neighbor Report messages, detection local node is adjacent
It occupies with the presence or absence of message source node information in table, is to extract Neighbor Report messages payload field, otherwise, in local node neighbours
Increase the message source node information in table newly；Then it whether detects in payload field Destination of the message comprising this section
Dot address is to update local node neighbor table information, by communication link quality (Lm-i) word corresponding in Neighbor Report messages
Section content is put into this node neighbor table in the corresponding Lm-i-> TxLm field for sending this Neighbor Report messages, otherwise, directly
It connects and abandons this Neighbor Report messages；Then local node detects whether this Neighbor Report messages are the last item neighbor reports
Message, otherwise back to step is started, continues to parse neighbor information if terminating to receive Neighbor Report messages process.
8. high dynamic time-delay network propagation delay time according to claim 6 minimizes method for routing, it is characterised in that: general
Logical node is sent during its Neighbor Report messages.Upper layer application is initiated to send Neighbor Report messages process according to sending cycle,
Then sending node starts to extract local node neighbor table information, and local node neighbor table content is successively filled to neighbor report
In corresponding message load field.Detailed process is: by the message source in the local address filling Neighbor Report messages of sending node
Address SourceAdd field characterizes this Neighbor Report messages as the transmission of this node；By all neighbours in its nodes neighbors table
Address entry content is sequentially placed into neighbor node address (Destination-i) item of Neighbor Report messages；Then distinguish
It information corresponding with neighbor node reception communication link quality RxLm will be put into Lm-i field in nodes neighbors table.Finally, hair
Send whether nodal test current neighbours table clause is the last item neighbor table information, is to encapsulate Neighbor Report messages, by bottom
Device periodically is broadcasted into network, is otherwise returned and is continued to extract local neighbor table information.
9. high dynamic time-delay network propagation delay time according to claim 1 minimizes method for routing, it is characterised in that: more
Business scenario, the node flow state strength information that center control nodes are fed back according to ordinary node judge whether there is node and gather around
Plug, if there is node congestion, then center control nodes start congestion control mechanism, are based on global view in real time by center control nodes
Figure information generates the multipath routing table of propagation delay time " optimal ", and ordinary node is taken according to packet priority and shunts detour
Mode alleviates network congestion.Center control nodes judge whether congested node restores normal every a period of time.If having restored just
Often, then congestion control mechanism is exited, follow-up process is executed according to single business scenario；If not restoring, return continues to execute congestion
Controlling mechanism.
10. high dynamic time-delay network propagation delay time according to claim 1 minimizes method for routing, it is characterised in that: in
Heart control node takes time trigger and event to trigger double mechanism to ensure the update of global optimum's routing table, is controlled by center
Node comes whether sensing network topological structure changes.If network structure changes, center control nodes are according to newest
Real-time topology situation completes updating route information immediately, and the event triggering of completion updates；Otherwise center control nodes are periodical on time
Between trigger mechanism update global routing iinformation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910442319.2A CN110139319B (en) | 2019-05-25 | 2019-05-25 | Routing method for minimizing transmission delay of high dynamic delay network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910442319.2A CN110139319B (en) | 2019-05-25 | 2019-05-25 | Routing method for minimizing transmission delay of high dynamic delay network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110139319A true CN110139319A (en) | 2019-08-16 |
| CN110139319B CN110139319B (en) | 2022-04-01 |
Family
ID=67581583
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910442319.2A Active CN110139319B (en) | 2019-05-25 | 2019-05-25 | Routing method for minimizing transmission delay of high dynamic delay network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110139319B (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110691374A (en) * | 2019-11-27 | 2020-01-14 | 上海海事大学 | Multi-hop wireless network routing method for data collection |
| CN111432434A (en) * | 2020-03-13 | 2020-07-17 | 中国国家铁路集团有限公司 | Low-delay monitoring and detecting method and system for railway engineering |
| CN111741382A (en) * | 2020-06-11 | 2020-10-02 | 北京全路通信信号研究设计院集团有限公司 | Dynamic network topology management system and method |
| CN112291747A (en) * | 2020-11-13 | 2021-01-29 | 珠海大横琴科技发展有限公司 | Network congestion control method and device, electronic equipment and storage medium |
| CN112583735A (en) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Method, device and system for determining required bandwidth for transmitting data stream |
| CN112615785A (en) * | 2021-03-05 | 2021-04-06 | 北京视界云天科技有限公司 | Routing method and device of network data packet |
| CN112769696A (en) * | 2019-11-06 | 2021-05-07 | 中兴通讯股份有限公司 | Routing method, network controller, system and storage medium |
| CN113727379A (en) * | 2021-09-28 | 2021-11-30 | 深圳绿米联创科技有限公司 | Network visualization processing method and device, computer equipment and storage medium |
| CN113923155A (en) * | 2021-12-06 | 2022-01-11 | 浙商银行股份有限公司 | Shortest path algorithm-based alliance link communication method and system |
| CN114124792A (en) * | 2021-09-30 | 2022-03-01 | 国网湖南省电力有限公司 | Multi-path concurrent transmission dynamic decision method and device for hybrid dual-mode heterogeneous power distribution field area network |
| CN114339668A (en) * | 2022-01-10 | 2022-04-12 | 重庆邮电大学 | OLSR routing protocol based on multidimensional measurement criterion |
| CN114466008A (en) * | 2021-12-22 | 2022-05-10 | 天翼云科技有限公司 | Cloud side communication system, method and device, electronic equipment and storage medium |
| CN114553768A (en) * | 2021-12-29 | 2022-05-27 | 航天科工网络信息发展有限公司 | Networking method based on SDN |
| CN114615238A (en) * | 2022-03-11 | 2022-06-10 | 北京晟海汇泽科技有限公司 | Lightweight network layer MTLink protocol suitable for embedded system |
| CN115087064A (en) * | 2022-06-13 | 2022-09-20 | 中国电子科技集团公司第十研究所 | Cross-domain high-availability routing method and system for measurement and control communication access network |
| CN115150325A (en) * | 2022-06-29 | 2022-10-04 | 东北大学 | Reliable routing method applied to B5G vehicle-mounted network |
| CN115361333A (en) * | 2022-10-19 | 2022-11-18 | 中国电子科技集团公司第二十八研究所 | Network cloud fusion information transmission method based on QoS edge self-adaption |
| CN115883364A (en) * | 2022-12-21 | 2023-03-31 | 中山大学 | Dynamic optimization method for distributed network controller |
| CN116390188A (en) * | 2022-12-16 | 2023-07-04 | 航天行云科技有限公司 | Low-power consumption route updating method and system suitable for high-dynamic mobile ad hoc network |
| WO2024021622A1 (en) * | 2022-07-28 | 2024-02-01 | 中兴通讯股份有限公司 | Latency resource allocation method, electronic device, and storage medium |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1819556A (en) * | 2006-03-23 | 2006-08-16 | 武汉理工大学 | Multi-routing broadcasting method with dynamic delay constraining based on minimal generating tree and greedy algorithm |
| CN1878074A (en) * | 2006-07-10 | 2006-12-13 | 武汉理工大学 | Method for establishing Ad hoc network multicast routing based on broadcast relay |
| CN101043444A (en) * | 2007-04-26 | 2007-09-26 | 浙江大学 | Distributed quality of service multicast routing process based on ant group optimization |
| CN101119303A (en) * | 2007-08-30 | 2008-02-06 | 浙江工业大学 | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm |
| CN101170503A (en) * | 2007-11-23 | 2008-04-30 | 中兴通讯股份有限公司 | An optimization method for multicast route ant group algorithm |
| KR20100127518A (en) * | 2009-05-26 | 2010-12-06 | 주식회사 포스코 | Distributed dynamic routing of vehicles in an automated vehicle system |
| US20110310788A1 (en) * | 2010-06-21 | 2011-12-22 | Fujitsu Limited | Wireless Communication Apparatus, Wireless Communication Network and Method of Controlling Routing Selection |
| CN103476086A (en) * | 2013-09-18 | 2013-12-25 | 南京理工大学 | Dynamic multi-path AODV routing method based on node congestion degree prediction |
| US20150046582A1 (en) * | 1999-10-06 | 2015-02-12 | Borgia/Cummins, Llc | Apparatus for internetworked wireless integrated network sensors (wins) |
| CN106851727A (en) * | 2017-01-23 | 2017-06-13 | 西安电子科技大学 | The method that MANET congestion control is realized based on multipath routing protocols |
| CN107453801A (en) * | 2017-08-28 | 2017-12-08 | 西安电子科技大学 | A kind of Layered Multipath method for routing towards satellite network |
| CN108494680A (en) * | 2018-02-05 | 2018-09-04 | 北京连山时代科技有限公司 | A kind of on-demand multi-path routing algorithm for supporting isomery networking |
-
2019
- 2019-05-25 CN CN201910442319.2A patent/CN110139319B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150046582A1 (en) * | 1999-10-06 | 2015-02-12 | Borgia/Cummins, Llc | Apparatus for internetworked wireless integrated network sensors (wins) |
| CN1819556A (en) * | 2006-03-23 | 2006-08-16 | 武汉理工大学 | Multi-routing broadcasting method with dynamic delay constraining based on minimal generating tree and greedy algorithm |
| CN1878074A (en) * | 2006-07-10 | 2006-12-13 | 武汉理工大学 | Method for establishing Ad hoc network multicast routing based on broadcast relay |
| CN101043444A (en) * | 2007-04-26 | 2007-09-26 | 浙江大学 | Distributed quality of service multicast routing process based on ant group optimization |
| CN101119303A (en) * | 2007-08-30 | 2008-02-06 | 浙江工业大学 | Dynamic cluster based multi-objective programming wireless sensing network routing algorithm |
| CN101170503A (en) * | 2007-11-23 | 2008-04-30 | 中兴通讯股份有限公司 | An optimization method for multicast route ant group algorithm |
| KR20100127518A (en) * | 2009-05-26 | 2010-12-06 | 주식회사 포스코 | Distributed dynamic routing of vehicles in an automated vehicle system |
| US20110310788A1 (en) * | 2010-06-21 | 2011-12-22 | Fujitsu Limited | Wireless Communication Apparatus, Wireless Communication Network and Method of Controlling Routing Selection |
| CN103476086A (en) * | 2013-09-18 | 2013-12-25 | 南京理工大学 | Dynamic multi-path AODV routing method based on node congestion degree prediction |
| CN106851727A (en) * | 2017-01-23 | 2017-06-13 | 西安电子科技大学 | The method that MANET congestion control is realized based on multipath routing protocols |
| CN107453801A (en) * | 2017-08-28 | 2017-12-08 | 西安电子科技大学 | A kind of Layered Multipath method for routing towards satellite network |
| CN108494680A (en) * | 2018-02-05 | 2018-09-04 | 北京连山时代科技有限公司 | A kind of on-demand multi-path routing algorithm for supporting isomery networking |
Non-Patent Citations (2)
| Title |
|---|
| JUNYI DU, ZHENGHAI WANG, LEI XIAO, LI WANG, AND WENSHENG QIAO: ""LDPC coded DBICM Scheme for Two Way Relay Channel with a Pipeline Decoding Structure"", 《ICCS》 * |
| 王钰 余永胜 郑智飞: ""基于NS2的网络拥塞控制算法的仿真研究"", 《科学技术与工程》 * |
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112583735A (en) * | 2019-09-27 | 2021-03-30 | 华为技术有限公司 | Method, device and system for determining required bandwidth for transmitting data stream |
| CN112769696A (en) * | 2019-11-06 | 2021-05-07 | 中兴通讯股份有限公司 | Routing method, network controller, system and storage medium |
| CN112769696B (en) * | 2019-11-06 | 2023-09-26 | 中兴通讯股份有限公司 | Routing method, network controller, system and storage medium |
| CN110691374A (en) * | 2019-11-27 | 2020-01-14 | 上海海事大学 | Multi-hop wireless network routing method for data collection |
| CN110691374B (en) * | 2019-11-27 | 2023-03-14 | 上海海事大学 | Multi-hop wireless network routing method for data collection |
| CN111432434A (en) * | 2020-03-13 | 2020-07-17 | 中国国家铁路集团有限公司 | Low-delay monitoring and detecting method and system for railway engineering |
| CN111741382A (en) * | 2020-06-11 | 2020-10-02 | 北京全路通信信号研究设计院集团有限公司 | Dynamic network topology management system and method |
| CN111741382B (en) * | 2020-06-11 | 2022-06-17 | 北京全路通信信号研究设计院集团有限公司 | Dynamic network topology management system and method |
| CN112291747A (en) * | 2020-11-13 | 2021-01-29 | 珠海大横琴科技发展有限公司 | Network congestion control method and device, electronic equipment and storage medium |
| CN112291747B (en) * | 2020-11-13 | 2021-12-03 | 珠海大横琴科技发展有限公司 | Network congestion control method and device, electronic equipment and storage medium |
| CN112615785A (en) * | 2021-03-05 | 2021-04-06 | 北京视界云天科技有限公司 | Routing method and device of network data packet |
| CN112615785B (en) * | 2021-03-05 | 2021-06-01 | 北京视界云天科技有限公司 | Routing method and device of network data packet |
| CN113727379A (en) * | 2021-09-28 | 2021-11-30 | 深圳绿米联创科技有限公司 | Network visualization processing method and device, computer equipment and storage medium |
| CN114124792A (en) * | 2021-09-30 | 2022-03-01 | 国网湖南省电力有限公司 | Multi-path concurrent transmission dynamic decision method and device for hybrid dual-mode heterogeneous power distribution field area network |
| CN113923155A (en) * | 2021-12-06 | 2022-01-11 | 浙商银行股份有限公司 | Shortest path algorithm-based alliance link communication method and system |
| CN114466008A (en) * | 2021-12-22 | 2022-05-10 | 天翼云科技有限公司 | Cloud side communication system, method and device, electronic equipment and storage medium |
| CN114466008B (en) * | 2021-12-22 | 2023-10-13 | 天翼云科技有限公司 | Cloud edge communication system, cloud edge communication method, cloud edge communication device, electronic equipment and storage medium |
| CN114553768A (en) * | 2021-12-29 | 2022-05-27 | 航天科工网络信息发展有限公司 | Networking method based on SDN |
| CN114339668A (en) * | 2022-01-10 | 2022-04-12 | 重庆邮电大学 | OLSR routing protocol based on multidimensional measurement criterion |
| CN114615238A (en) * | 2022-03-11 | 2022-06-10 | 北京晟海汇泽科技有限公司 | Lightweight network layer MTLink protocol suitable for embedded system |
| CN115087064A (en) * | 2022-06-13 | 2022-09-20 | 中国电子科技集团公司第十研究所 | Cross-domain high-availability routing method and system for measurement and control communication access network |
| CN115087064B (en) * | 2022-06-13 | 2024-04-05 | 中国电子科技集团公司第十研究所 | Cross-domain high-availability routing method and system for measurement and control communication access network |
| CN115150325A (en) * | 2022-06-29 | 2022-10-04 | 东北大学 | Reliable routing method applied to B5G vehicle-mounted network |
| CN115150325B (en) * | 2022-06-29 | 2024-04-09 | 东北大学 | Reliable routing method applied to B5G vehicle-mounted network |
| WO2024021622A1 (en) * | 2022-07-28 | 2024-02-01 | 中兴通讯股份有限公司 | Latency resource allocation method, electronic device, and storage medium |
| CN115361333A (en) * | 2022-10-19 | 2022-11-18 | 中国电子科技集团公司第二十八研究所 | Network cloud fusion information transmission method based on QoS edge self-adaption |
| CN115361333B (en) * | 2022-10-19 | 2023-03-24 | 中国电子科技集团公司第二十八研究所 | Network cloud fusion information transmission method based on QoS edge self-adaption |
| CN116390188A (en) * | 2022-12-16 | 2023-07-04 | 航天行云科技有限公司 | Low-power consumption route updating method and system suitable for high-dynamic mobile ad hoc network |
| CN115883364A (en) * | 2022-12-21 | 2023-03-31 | 中山大学 | Dynamic optimization method for distributed network controller |
| CN115883364B (en) * | 2022-12-21 | 2023-11-07 | 中山大学 | Dynamic optimization method for distributed network controller |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110139319B (en) | 2022-04-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110139319A (en) | High dynamic time-delay network propagation delay time minimizes method for routing | |
| He | Destination-sequenced distance vector (DSDV) protocol | |
| Kamali et al. | Posant: A position based ant colony routing algorithm for mobile ad-hoc networks | |
| CN101883048B (en) | Routing method of multi-dimensional network | |
| CN106160800A (en) | Data transmission method and device | |
| CN107071850A (en) | A kind of improved AODV Routing Protocols for being suitable for different motion scene | |
| Deepalakshmi et al. | Ant colony based QoS routing algorithm for mobile ad hoc networks | |
| Faheem et al. | Dynamic sink location update scope control mechanism for mobile sink wireless sensor networks | |
| CN101232458B (en) | Multi path extension method based on MAODV protocol | |
| CN101867973B (en) | Multidimensional network and data transmission method thereof | |
| CN101431810A (en) | Cross-layer cooperated routing method supporting multi-speed transmission in Ad Hoc network | |
| CN101867920A (en) | Grading type wireless sensor networking method | |
| Wannawilai et al. | AOMDV with sufficient bandwidth aware | |
| CN109510769A (en) | A kind of fusion route system being suitable for width combination network and its method | |
| Uchhula et al. | Comparison of different ant colony based routing algorithms | |
| Roy et al. | Performance optimization of Ad Hoc on demand vector routing protocol in cognitive radio network | |
| Rong et al. | LSMR: A label switching multipath routing protocol for ad hoc networks | |
| Raju et al. | Scenario-based comparison of source-tracing and dynamic source routing protocols for ad hoc networks | |
| Deepalakshmi et al. | An ant colony based multi objective approach to source-initiated QoS multicasting method for ad hoc networks | |
| Temar et al. | A new way of achieving multi-path routing in wireless networks | |
| Hizal et al. | lResearch on quality of service based routing protocols for mobile ad hoc networks | |
| Best et al. | Self-learning ad-hoc routing protocol | |
| Kankane et al. | Light Load Path Selection Techniques for Control Congestion in MANET (ENBA) | |
| Bhardwaj et al. | Congestion aware multi-path routing protocol for mobile ad-hoc networks | |
| Boukerche et al. | A preemptive on-demand distance vector routing protocol for mobile and wireless ad hoc networks |
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 |