CN106879071A - Wireless Mesh netword low time delay optimization method based on dynamic time slot allocation - Google Patents
Wireless Mesh netword low time delay optimization method based on dynamic time slot allocation Download PDFInfo
- Publication number
- CN106879071A CN106879071A CN201710076756.8A CN201710076756A CN106879071A CN 106879071 A CN106879071 A CN 106879071A CN 201710076756 A CN201710076756 A CN 201710076756A CN 106879071 A CN106879071 A CN 106879071A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- time
- slot
- frame
- 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
- 238000000034 method Methods 0.000 title claims abstract description 22
- 238000005457 optimization Methods 0.000 title claims abstract description 14
- 230000005540 biological transmission Effects 0.000 claims abstract description 34
- 230000008859 change Effects 0.000 claims abstract description 21
- 230000004913 activation Effects 0.000 claims description 5
- 238000010586 diagram Methods 0.000 claims description 4
- 238000012423 maintenance Methods 0.000 claims description 3
- 238000000205 computational method Methods 0.000 claims description 2
- 238000007689 inspection Methods 0.000 claims description 2
- 238000013461 design Methods 0.000 abstract description 27
- 238000012546 transfer Methods 0.000 abstract description 2
- 239000011159 matrix material Substances 0.000 description 5
- 230000000694 effects Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 241000238876 Acari Species 0.000 description 2
- 101100172132 Mus musculus Eif3a gene Proteins 0.000 description 2
- 238000004891 communication Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 238000013468 resource allocation Methods 0.000 description 2
- 238000012216 screening Methods 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 241001269238 Data Species 0.000 description 1
- 230000002411 adverse Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000003780 insertion Methods 0.000 description 1
- 230000037431 insertion Effects 0.000 description 1
- 229940074869 marquis Drugs 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- VBUNOIXRZNJNAD-UHFFFAOYSA-N ponazuril Chemical compound CC1=CC(N2C(N(C)C(=O)NC2=O)=O)=CC=C1OC1=CC=C(S(=O)(=O)C(F)(F)F)C=C1 VBUNOIXRZNJNAD-UHFFFAOYSA-N 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000010187 selection method Methods 0.000 description 1
- MHRLWUPLSHYLOK-UHFFFAOYSA-N thiomorpholine-3,5-dicarboxylic acid Chemical compound OC(=O)C1CSCC(C(O)=O)N1 MHRLWUPLSHYLOK-UHFFFAOYSA-N 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention provides a kind of wireless Mesh netword low time delay optimization method based on dynamic time slot allocation, by the broadcast order of concept transfer in control frame in Mac algorithm architecture designs, enable a node to the slot requirements of oneself that upgraded in time according to the routing information of data flow, it is ensured that forward node obtains corresponding time slot when time slot is distributed；The order of time slot application in the slot contention stage is by adjusting network, is that related data flow adds paths information, completes the slot requirements real-time update in network node slot contention stage, improves the real-time of the time slot distribution for data flow.Network topological information change is upgraded in time by radio slot, enable that node is perceived and be updated in time to network topology change, cause that the expense of control protocol is reduced by the treatment to crucial topological data, improve the data transmission efficiency of whole network.
Description
Technical field
It is more particularly to a kind of based on the wireless of dynamic time slot allocation the present invention relates to wireless mesh Mesh network technical field
Mesh network low time delay optimization method.
Background technology
Wireless Mesh netword typically uses Carrier Sense Multiple Access CSMA random sources scheduling architecture or time division multiple acess
TDMA scheduling of resource frameworks.Although wherein CSMA frameworks network scalability is stronger, hidden terminal problem cannot be solved, and
Collision probability becomes big as network node number increases, it is impossible to provide the guarantee on end-to-end time delay.TDMA scheduling of resource framves
Channel resource is divided into multiple time slots according to the time to carry out scheduling of resource by structure, more clear on Protocol Design, by controlling to assist
View is interacted and can solve the problem that hidden terminal problem, but Mac and routing algorithm are not examined in traditional TDMA scheduling of resource frameworks
Consider multihop flows and the real time problems of time slot distribution in Mesh network, all deposited in time slot allocative efficiency and router efficiency
In improved space.
For the wireless Mesh netword of distributed scheduling framework, existed using the loop cycle access dispatching mechanism based on the time-division
Ensure there is the advantage that Stochastic accessing is dispatched and pseudorandom access dispatching mechanism does not possess on data end-to-end time delay.In order to improve
The reusability of channel resource, i.e. time slot, for wireless Mesh netword low time delay scheduling architecture design typically all using being based on
The scheduling of resource framework of TDMA.
Mac layers traditional of TDMA scheduling of resource frameworks are divided into using fixed time slot distribution and two kinds of channels of dynamic time slot allocation
Resource allocation methods, fixed time slot is assigned as each node distribution in Mesh network one or more time slots for fixing, in engineering
Simple clear in realization, but do not account for the situation that different node slot time demands differ, it is not high to there is slot efficiency, end
Cannot ensure problem to terminal delay time.Dynamic time slot allocation does not specify quantity and the position of fixed time slot for node, but according to when
Gap demand, type of service etc. come the quantity of dynamically distributes time slot, position, when a kind of design of slot priorities can be used to solve
Collision problem during gap position, the design can determine needing multiple time slots according to each node to the different priorities of time slot
The time slot of other different priorities can also be assigned to during distribution in addition to the time slot of highest priority master, for Mesh network data
The characteristics of stream, the optimization in performance can be carried out to end-to-end time delay using different time-gap priority design in differing time frames.
Traditional dynamic time slot allocation is improved to a certain extent by the method for dynamically distributes after all node firsts to file
Slot efficiency, but in not accounting for data flow in distribution forward node slot requirements problem, therefore cannot ensure
The real-time of this when frame in forward node time slot distribution, cannot often ensure to need the end-to-end of the data of multi-hop transmission in data flow
Time delay.
The patent of Application No. 201310108812.3 discloses a kind of based on time-multiplexed channel resource allocation method.
It is divided into control section and data division by by each time slot, control section is by the broadcast to slot contention information double bounce scope
The collisionless time slot distribution of channel is carried out with data priority, forwarding data flow node is not considered in the slot allocation method
Slot requirements, are unable to make full use of time interval resource, there is the sky of improvement in the performances such as end-to-end time delay, network throughput
Between.
The patent of Application No. 201510906203.1 discloses a kind of distributed money of Wireless MESH network based on TDMA
The method of source distribution.Specifically, node is first carried out in slot requirements two-hop neighbors by fixed order before data transmission
Broadcast, then the slot requirements according to node carry out the dynamically distributes of time interval resource with load, and the invention is in data is activation
Gap selects sending time slots according to different pieces of information flow path, and the transmission delay performance to data flow is carried to a certain extent
Rise, but the slot requirements of forwarding data flow node are not accounted for when time slot is distributed yet, forwarding number might not be ensure that
According to the slot requirements of stream.
The important evidence of wireless Mesh netword routing algorithm routing is network topology, is opened up for the quick movement of node, network
Flutter the wireless Mesh netword of high dynamic change, topology updates must be accelerated accordingly, but completely, the acquisition of detailed network topology
Often set up in increasing control protocol expense, traditional distributed non-stop layer Mesh network is often used opens up to all
Put oneself into the mode of the general broadcast of flood passage to carry out topological renewal, occupy the bandwidth of a large amount of preciousnesses, and because of topological link not
Including same setup time is often not accounted for, it is impossible to ensure the validity that topology updates, so as to the correct of routing algorithm
Execution causes adverse effect.
Wireless Mesh netword routing algorithm is divided into heuristic route according to routing opportunity and priori formula route.Traditional priori
Formula routing algorithm only considers network link topology, according to the hop count distance selection shortest path in path, not with reference in TDMA
Mac layers of time slot sequencing distributed by node calculates route criterion, and selected hop count shortest route might not energy
Optimal route is ensured of, causes data transmission period greatly to increase.Topology when traditional heuristic route only takes into account routing
Channel distribution state, calculate route criterion without the time slot that will be obtained for dynamic time slot allocation node, therefore also not
Can guarantee that the optimal route of acquisition.
The patent of Application No. 201310108812.3 discloses a kind of many radio frequency multi-Channel Wireless Mesh Network route choosings
Selection method design routing criterion when consider path in forward node load and the expectation transmission time ETT in path, but
Being the data delivery rate according to link during the design of ETT is calculated, not in view of the Wireless Mesh based on TDMA
Time slot distribution pauper character of the network in propagation delay time, therefore it is not appropriate for the wireless Mesh netword route based on time slot distribution
Criterion is designed.
Network layer routing algorithm is often separated design by traditional wireless Mesh netword in architecture design with Mac layers, with
Mitigate architecture design complexity, but do not account for based on dynamic time slot allocation channel dispatch framework have to route according to
Rely property this feature, often cause routing algorithm inadequate to Mac layer of support, therefore in the wireless mesh for low time delay
There is the space of optimization in network architecture design.
The content of the invention
The characteristics of technical problems to be solved by the invention are to provide one kind based on dynamic time slot allocation is to Wireless Mesh network
The method that the Media access contorl MAC of network is optimized, is additionally based on the optimization of MAC, and a kind of routing optimality is additionally provided afterwards
Method.
The technical problems to be solved by the invention are, the wireless Mesh netword low time delay optimization side based on dynamic time slot allocation
Method, it is characterised in that each node completes time slot distribution by the cycle of time frame in wireless mesh Mesh network；The time frame includes wide
Broadcast 1 period, broadcast 2 periods and data frame period；Broadcasting for 1 period includes 1 time slot of N number of broadcast, and 2 periods of broadcast include N number of broadcast 2
Time slot, the data frame period includes being more than or equal to N number of data frame interval, and N is maximum node number in wireless Mesh netword；Each node
In the data frame period to the main time slot that should there is a data frame interval to be the node；Each node is in differing time frames by node slot time
Main time-slot sequence specified by priority list is different；
Each node distributes one according to its main time-slot sequence in current time frame with 2 periods of broadcast in 1 period of broadcast by corresponding
1 time slot of individual broadcast and 2 time slots of broadcast；Each node in each time frame according to current main time-slot sequence broadcast this node with
The slot requirements of neighbor node carry out the dynamically distributes of time slot with change in topology：
1) 1 period, time slot demand are broadcasted：
Each node generates the 1st Broadcasting Control frame, and the 1st Broadcasting Control of this node is broadcasted in 1 time slot of corresponding broadcast
Frame, the 1st Broadcasting Control frame includes node ID, the total size of data to be sent and each traffic flow information to be sent, data flow letter
Breath includes that the size of data of data flow and each data flow send priority and each data flow residual paths information, data to be sent
Total size be the size of data sum of each data flow to be sent in spot broadcasting data buffer storage；In spot broadcasting data buffer storage
Include what present node to be forwarded as the source node traffic flow information to be sent and present node as intermediate node
Traffic flow information；Excessively cause that the length of the 1st Broadcasting Control frame of node exceedes broadcast 1 when there is traffic flow information to be sent
When time slot sends the maximum data length of data, the node then sends priority order from big to small by maximum number by data flow
The 1st Broadcasting Control frame is put into according to the traffic flow information in length；
The computational methods that data flow sends priority w are：
W=α stream_Length+ β ETT+ (1- alpha-betas) prior
Wherein, ETT is that path is expected the transmission time, and prior is the service priority of data flow, and stream_Length is
The size of data of the data flow, α, β ∈ [0,1] and alpha+beta≤1, the size of data of representative of data flow and path are expected to send respectively
The weight coefficient of time；
After each node receives the 1st Broadcasting Control frame of other nodes transmission, carried out according to the 1st Broadcasting Control frame for receiving
The node is added to the renewal of local topology information table, the node ID in the 1st Broadcasting Control frame a jump of local maintenance
In neighbor information table, at the same according to this node of data flow residual paths information inspection in the 1st Broadcasting Control frame for receiving whether
It is next forward node of the data flow, if so, then sending the size of data of the data flow of the data flow and each data flow
Priority and each data flow residual paths information are added in spot broadcasting data buffer storage, if it is not, then believing the data stream
Breath is abandoned；
2) broadcasted for 2 periods, broadcast neighbor node slot requirements and change in topology：
Each node generates the 2nd Broadcasting Control frame, and the 2nd Broadcasting Control of this node is broadcasted in 2 time slots of corresponding broadcast
Frame, the 2nd Broadcasting Control frame is opened up including node ID, neighbor node ID, the total size of data to be sent, network topology data and network
Flutter delta data；When there are network topology data and being excessive so that the total length of the 2nd Broadcasting Control frame has exceeded node in broadcast 2
During the maximum data length that gap sends, the node according to local topology information table then to carrying out crucial topology to network topology data
Selection, in selecting crucial topology to be added to the 2nd Broadcasting Control frame in the maximum data length for broadcasting the transmission of 2 time slots；
Each node receive other nodes transmission the 2nd Broadcasting Control frame after, according in the 2nd Broadcasting Control frame for receiving
Node ID update in neighbor list in the range of local double bounce, and local topology information table is carried out according to the 2nd Broadcasting Control frame
Renewal；
3) data frame period, dynamic time slot allocation：
The total size of the data to be sent corresponding to the neighbor node in neighbor list in the range of local double bounce is obtained
The data frame interval quantity that this node needs in the current data frame period：
If node does not have data to send and forward in this time frame, data slot is not distributed to the node, by the node
Corresponding main data frames time slot is used as free timeslot；If node only needs to 1 data frame interval, by this node in this time frame week
Main data frames time slot belonging to phase gives this node；If this node needs the data frame interval of more than 2, according to node slot time
Priority list carries out free timeslot competition；If node is assigned to the data frame interval of more than 2, when data is activation is carried out,
Node preferentially sends the data that can be forwarded in this time frame；Node sends preferential in 1 data frame interval according to data flow
Level order from big to small sends data flow.
Further, a kind of new local topology information table renewal, the system of selection of crucial topology have been also provided to.
In addition, each node frame at completes to be routed after time slot distribution, Route Selection reference mode
Main time-slot sequence in slot priorities table.
Route selection is concretely comprised the following steps：
S1：Check whether as this time frame runs Routing Algorithm for the first time, if so, then emptying route set and forwarding load
Table, performs step S2, otherwise performs step S3；
S2：The network topology data obtained according to 2 periods of broadcast calculate this node net that frame in can be reached at
Network scope, and all nodes in the range of this are added in route set, route set covers ID, the arrival node up to node
Most short ETT path, if destination node is not in route set, go to step S3, if destination node is in route set, seek
Road success, for the data flow adds the routing information, the data flow is stored in data buffer storage to be sent, while according to data
Load of the stream size to the middle forward node in the path in forwarding load table is updated；
S3：According to each destination node in breadth First order traversal route set, with reference to the node of next time frame
The node that frame in can be reached when the loading condition of main time-slot sequence and node in slot priorities table calculates two；Range is excellent
First order traversal is the conventional traversal method in the data structure of tree and figure；
S4：Repeat step S3 is crossed and pathfinding or pathfinding failure is completed in destination node is added into set of routes, if completing
Pathfinding then for the data flow corresponding to purpose node adds paths information, by the data corresponding to destination node if pathfinding failure
Banish pathfinding failure data flow cache in.
The present invention is in control frame in Mac algorithm architecture designs by the broadcast order of concept transfer so that node can
Routing information according to data flow is upgraded in time the slot requirements of oneself, it is ensured that forward node is obtained accordingly when time slot is distributed
Time slot, improves the utilization rate of channel resource, reduces the transmission delay of data flow.
The order of present invention time slot application in the slot contention stage is by adjusting network, is that related data flow adds paths
Information, completes the slot requirements real-time update in network node slot contention stage, improves the time slot distribution for data flow
Real-time.Network topological information change is upgraded in time by radio slot so that node can to network topology change
Perceive and be updated in time, cause that the expense of control protocol is reduced by the treatment to crucial topological data, improve
The data transmission efficiency of whole network.Carried out by the size according to data flow, path ETT, service priority different attribute
Data flow sends the calculating of priority, meets different network service quality QOS business demands.
The present invention in routing algorithm, by a kind of greedy algorithm of combination Schedule, with reference to when the frame period in it is wide
The network topological information that the stage of broadcasting upgrades in time, and consider that path node is loaded, most short time-delay can be searched out for data flow
Transmission path, while having reached the purpose of load balancing, improves the handling capacity of whole network.Routing algorithm is according to dynamic slot
Allocation table carries out the selection of data flow transmitting path, and Mac layers of control frame combination dynamic time slot allocation algorithm is data stream load section
The slot requirements that upgrade in time are put, Mac layers completes data is activation with routing algorithm cross-layer cooperation, and this architecture design is greatly reduced
The end-to-end time delay of data flow, it is ensured that the realization of low time delay design.
The beneficial effects of the invention are as follows：Whole network is improve in terms of data throughout, end-to-end time delay, load balancing
On performance, significantly improve the channel resource utilization rate of wireless Mesh netword, reduce the end-to-end time delay of network, it is adaptable to communicate
Scheduling of resource meets high dynamic, the wireless Mesh netword framework of low time delay sets using the wireless Mesh netword scene of TDMA patterns
Meter.
Brief description of the drawings
Fig. 1 is architecture design flow chart of the invention；
Fig. 2 is loop cycle scheduling architecture superframe figure；
Fig. 3 is Mesh network exemplary plot；Fig. 4 updates flow chart for topology；
Fig. 5 is routing algorithm flow chart.
Specific embodiment
Technical scheme is described in further detail below in conjunction with the accompanying drawings, but protection scope of the present invention is not limited to
It is as described below.
Optimizing Flow structure of the invention at Mac layers before routing algorithm execution as shown in figure 1, first will complete topology more
Newly, this is the important foundation for ensureing routing availability；Simultaneously as when forward node needs to send in the transmitting path of data flow
Gap, so the basis of the time slot distribution that frame data stream is carried out at Mac layers when this time frame routing algorithm is next, this is required in base
Mac when low time delay is designed is carried out in this flow want collaborative design with routing algorithm.
As shown in Fig. 2 the wireless Mesh netword loop cycle scheduling architecture based on dynamic time slot allocation can by time slot this
Kind of channel resource regards different frames as according to function, and a superframe is made up of L time frame, wherein L >=N, according to network demand, when
The design of gap priority list carries out value.
Each time frame is divided into 3 parts, that is, broadcast 1 period, 2 periods of broadcast, data frame period, wherein broadcasting 1 period and wide
Broadcasting for 2 periods generally may be collectively termed as the control frame period.Broadcasted for 1 period and 2 periods of broadcast are all divided into N number of time slot, it is ensured that each
Node is controlled the broadcast of information there is a time slot, specific slot length can according to the scale of network, topological feature,
Business demand is designed, and data frame is divided into M time slot, M >=N, it is ensured that each node possesses an one's own main time slot.Respectively
Node is in the data frame period to the main time slot that should have a data frame interval to be the node；Each node differing time frames interior joint by
Main time-slot sequence specified by slot priorities table is different.
M can according to network to efficiency of transmission η the need for design, η is given by formula below.
Wherein, timebroad1It is the slot length in 1 period of broadcast, timebroad2It is the slot length in 2 periods of broadcast,
timedetaIt is the slot length in the data frame period, slot length contains protection interval.
The flow of dynamic time slot allocation is：In control time slot node according to a certain order in turn by the data to be sent of oneself
The size of data to be sent of size and neighbours is broadcasted, and time slot distribution is completed with a kind of Slot Allocation Algorithm so that each
Node obtains enough time interval resources in the case of without channel confliction.It is excellent that this Slot Allocation Algorithm can combine node slot time
First level table is carried out, and for the channel for ensureing network is uniform, fair, in each time frame a set pattern can be made to slot priorities table
Rule, predictable adjustment, its result is exactly that the main time slot of each time frame interior joint can change, and main time slot to be node having
The fixation time slot to be distributed during slot requirements, according to this dynamic time slot allocation algorithm, to wireless Mesh netword end-to-end time delay
Analysis below can be carried out at Mac layers.
As shown in Fig. 2 when data flow path is single-hop, data end-to-end time delay only has the propagation delay time in physical layer,
Propagation delay time typically can be ignored compared to Forwarding Delay, for ease of analysis, the propagation delay time in physical layer is set into 0.Turn
Hair time delay will receive after data this when frame in and be divided into two kinds of situations with the presence or absence of data slot according to forward node, that is, when forwarding
Prolong TrelayAs shown in formula (2)：
Wherein, TrelayForwarding Delay when (i, j) represents that node j is data flow transmitting path interior joint i next-hops, unit
It is data slot, Slot (j) represents the data slot numbering that forward node j is distributed, and Slot (i) represents that back end i divides
The data slot sequence number matched somebody with somebody, SlotnextJ () represents the minimum slot index for being distributed of next time frame node j, M represents one
The number of timeslots that time frame is divided.
Thus formula (2) understands, the Forwarding Delay to reduce data flow, and the path order of data flow should try one's best according to turning
Send out the data slot order of node to design, and time slot needed for forward node must be believed before Mac layers carries out time slot distribution
Breath is broadcasted, and to ensure that forward node is obtained in that data slot, the Forwarding Delay of the otherwise forward node will have to increase
Plus several when the frame period time.Therefore in order to the forward node ensured in data flow transmitting path can be according to this time slot
Demand, must be from Mac algorithms and route in the wireless Mesh netword designed using the TDMA scheduling architectures of dynamic time slot allocation
Consider simultaneously on algorithm, specific design target is as follows：
First, Mac layers of architecture design will ensure that the slot requirements of forwarding data flow node can be upgraded in time, together
When safeguard a topological renewal speed matched with network attribute, it is ensured that forward node data slot sequentially meeting this time frame
Slot requirements information can be in time obtained in the case of interior forwarding demand, can so complete effective for multihop flows
Time slot is distributed.
Secondly, the time-slot sequence of data flow forward node in the routing stage of networking layer routing algorithm is just considered as path
Problem, so just can guarantee that effective execution of above-mentioned Mac layer architectures design.
Analyzed for more than, the present invention completes a kind of Wireless Mesh based on dynamic time slot allocation using step as described below
Network low time delay MAC is designed with routing framework.Each node with time frame as cycle, in each time frame under TMDA channelling modes
The design of Mac and route is completed based on dynamic time slot allocation.
S1：Broadcasted for 1 period, by main time-slot sequence broadcast the slot requirements of local node, including following sub-step：
S11：Each node broadcasts the slot requirements of oneself data flow according to the main time-slot sequence of oneself this when frame in；
In broadcast data broad1_Data comprising oneself node ID, the total size Data_Length of data to be sent,
The size of data stream_Length and data flow of data flow to be sent send priority w and data flow residual paths information
Path, if there is multiple data flows to cause to broadcast broad1_Data length more than the maximum data length that time slot can send,
Service priority prior and the size stream_Length of data, path then according to data flow is expected transmission time ETT
The transmission weights w sizes for carrying out data flow are ranked up and select the big traffic flow information of weights to add broadcast data, so
Both can guarantee that does not influence to notify that remaining forward node updates slot requirements information, and can reduce certain control protocol expense,
The transmission weights w of wherein data flow is calculated according to formula below：
W=α stream_Length+ β ETT+ (1- alpha-betas) prior (3)
Wherein α, β ∈ [0,1], and alpha+beta≤1, represents the weight coefficient of stream_Length and ETT respectively, and path is expected
The transmission time, ETT was calculated by routing layer when for data routing, and service priority prior is then according to networks offer services class
Type and service need to calculate.The value of α, β can be according to the topological feature of Mesh network, main data types, business demand
Flexibly set.Such as represented when α=1 and only consider size of data, do not consider that transmission time ETT is expected in data flow path path
And data priority；And represented when β=1 and only consider that transmission time ETT is expected in data flow path path, does not consider size of data
And data priority；Represented when α=β=0 and only consider the priority that data type possesses；Other situations can divide like this
Analysis.
The maximum data length max_Length that one time slot can send is calculated by formula below (4).
Max_Length=timeslot·Bandphy (4)
Wherein, timeslotIt is slot length, BandphyThe bandwidth provided by node physical layer.
When the construction of broad1_Data is carried out, node can be carried out according to the node slot time priority list of this when frame in
The screening of traffic flow information, if next forward node of this node has broadcast broad1_Data numbers in data flow path
According to, illustrating that the data flow will not be forwarded in this when frame in by the next main time slot of forward node, next forward node simultaneously differs
Surely having other can complete time slots of forwarding, it is believed that the data stream does not meet and includes broad1_Data and carry out forwarding announcement
The condition known.
The total size Data_Length of data to be sent represents that the data to be sent of this node are big in caching to be sent
It is small, in units of byte.Data flow residual paths information path includes the residual paths since this node next-hop.
S12：After the 1st Broadcasting Control frame broad1_Data for receiving the transmission of other nodes, node will complete two to node
Divide the renewal of content.1) node is added to oneself and is safeguarded by the node ID in the 1st Broadcasting Control frame broad1_Data
A hop neighbor information table in, so broadcast 1 after, all of node can all get the hop neighbor node of oneself.
2) while checking that oneself is according to data flow residual paths information path in the first Broadcasting Control frame broad1_Data
No is next forward node of the data flow, if then by size of data stream_Length, the residual paths of the data flow
Path, data flow transmission weights w information are added in spot broadcasting data buffer storage, otherwise represent that this node need not forward the number
According to stream, the data stream information is abandoned.Node is in one's own 1 time slot of broadcasting by the information in spot broadcasting data buffer storage
And oneself is broadcasted as the traffic flow information of source node as the 1st Broadcasting Control frame broad1_Data.
Node carries out local topology information table after the 1st Broadcasting Control frame broad1_Data for receiving the transmission of other nodes
One hop neighbor updates.
For a node, if having been completed S11 steps, represent that its main time slot comes what remaining was not broadcasted
Before the main time slot of node, it will not undertake the forwarding data flow task of main time slot row remaining node after which, then at this
It only need to be performed the above 1 in step) work of the part, that is, neighbor node is updated, this is from step S11
Broad1_Data screening process analysis it is also seen that.
Consider Fig. 3 in topology situation, it is assumed that this when the main time slot of each node of frame in be node ID, then node 3 is complete
Into after the transmission of oneself broad1_Data, in 1 time slot of ensuing broadcast, it will not appear in surplus as forward node
In the data flow path of the broad1_Data of remaining node 4,5,6,7,8, because the main time slot 3 of its data is in node 4,5,6,7,8
Before the main time slot of data, now node 3 need to only update the neighbor information of oneself according to broad1_Data.
I.e. when this node does not broadcast out the broad1_Data data of oneself also, often receive a broad1_Data it
Be required for complete the above 1), the work 2), and work as it complete broad1_Data broadcast after only need to be performed content
1) work, can thus reduce the data processing amount of a big chunk node.
A main time-slot sequence for node is can also be seen that from above-mentioned analysis more rearward, the node undertakes forwarding task
Probability is bigger, therefore differing time frames can play certain load balancing using different main time-slot sequences in a superframe
Effect.
S2：Broadcasted for 2 periods, broadcasted neighbor node slot requirements and opened up in the time slot of broadcast 2 of oneself by main time-slot sequence
Flutter change information, including following sub-step：
S21：Neighbor node slot requirements and change in topology are carried in the 2nd Broadcasting Control frame broad2_Data, and time slot is needed
Ask and embodied by the total size Data_Length of data to be sent, change in topology passes through network topology data topology and net
Network change in topology topology_change embodies.It is adjacent that each node broadcasts oneself according to the main time-slot sequence of oneself this when frame in
The slot requirements information in residence, while neighbor information according to oneself broadcasts the network topology data oneself safeguarded
Topology, network topology change topology_change.The node of oneself is included in 2nd Broadcasting Control frame broad2_Data
ID, neighbor node ID and data total size Data_Length to be sent, network topology data topology and network topology change
Topology_change, if to have exceeded the maximum data that the time slot can send long for the total length of broad2_Data data
Degree, then be compressed to topological data, and the crucial topological data of selection is added in broadcast data broad2_Data.
S22：After the broad2_Data for receiving neighbours' transmission, the slot requirements information according to broad2_Data will for node
These information of neighbor nodes are updated in neighbor list in the range of the double bounce of oneself, while according to these neighbor informations and topological Numbers
According to the topology information table topology_Table that renewal is safeguarded oneself.
It is somebody's turn to do for the attached weights TL of each of the links (Time of Living) is represented in the design of topology_Table
The newness degree that link information is obtained, the TL values are defined as follows shown in formula：
In addition, for the wireless Mesh netword node in this architecture design, the topology information table of node maintenance one
Topology_Table, represents the ambient network topology situation that node is found out, specific topology information table topology_Table
Data structure represented using adjacency matrix.In order to reduce the bandwidth that topology updates the data occupancy, point following two situation treatment：
One is and when there is new node in a hop neighbor node of node, takes the mode for broadcasting whole topological datas
Carry out topology to inform, because when occurring new node in neighbours, representing that the new node is wide before not receiving this node
The topology information broadcast, so the superposition that variable cannot be carried out on the basis of before updates, so all topology letters must be sent
Breath.Due to having contained a part of topology information in the slot requirements information of neighbours, so topology_Table can here
With part topology removal in the slot requirements information by neighbours, to save the channel width of topology information occupancy.In addition, for
In this when, the topology of frame in acquisition is separately identified, and represents that this partial-topology has confidence level higher.
Because topology_Table is a data structure for figure, figure is the set on summit and side, i.e. Graph
{Vertex,Edge}.In the data structure of figure is represented, adjacency matrix represents that structural visual is clear, lookup, insertion algorithm letter
It is single, the positive direct ratio of data space nodes number square of occupancy.Adjacency list data structure represent occupancy size of data with
The degree of communication of the nodes and figure of topological diagram is directly proportional, therefore than representing the storage sky of occupancy using adjacency matrix data structure
Between it is small, but search speed there is no adjacency matrix data structure to represent fast.To sum up, the local topology data safeguarded in node are adopted
Represented with adjacency matrix data structure, can so reduce the time complexity in some related algorithms for the treatment of topology, and
Topological data in broad2_Data is represented using adjacency list data structure, to reduce the expense of control protocol.
Two is that, when there is not new node in a hop neighbor node of node, taking need only be to broadcast topology change information
The broadcast that carries out of topology_Change informs that the topology that can be previously received node transmission of such neighbours' section is believed
The topological data size that topology updates and reduces broadcast is completed on the basis of breath.The change of topology is embodied in adding for side in topological diagram
Add deduct on lacking, correspond to the foundation of wireless Mesh netword link and lose, so the packet of topology_Change contains
Two kinds of side, it is increased while and reduce while.
The hop neighbor nodal information and these hop neighbor sections around oneself can be got in S1 steps interior joint
The slot requirements information that point has upgraded in time for data flow, then this information is broadcasted in 2 periods of broadcast, works as neighbours
Node receive oneself surrounding neighbours transmission this information after can just learn oneself 2 jump in the range of neighbor information and its time slot
Demand, this just constitutes the data basis of dynamic time slot allocation.
Topological data in broad2_Data carries out as shown in Figure 4 the step of topology updates：
(1) plus 1 to all TL not for 0 in topology_Table tables when 1 period of broadcast starts, represent all topologys
The time of finding out increased 1 time frame；
(2) neighbor_Info described in the S21 according to received by 2 periods of broadcast updates opening up in the range of two
Flutter, these topological TL values are 1；
(3) when 2 periods of broadcast broadcast data broad2_Data is received, according to neighbor information therein, topology information
(topology or topology_Change) updates topology, takes and is defined by newest topology when updating, only when receiving
Topological TL values it is smaller than TL values in the topology_Table of this node when marquis or this node topology_Table in
TL values can just update when be 0, expression is defined by the newest link found out, when receiving deletion link<m,n>Topology letter
During breath, by TLmnIt is set to 0.
(4) it is that TL sets a threshold value TL according to the actual change feature of real network topologymax, when TL values surpass in topology
Cross TLmaxRepresent that the topology has had TLmaxIndividual time frame does not update, it is believed that the link is expired invalid, and its is corresponding
TL values set to 0.
According to the definition of above topology more new algorithm and topology_Table, it can be seen that the smaller expression of TL values this open up
Flutter real-time stronger, so, the present invention according to topology_Table come design key topology definition, in order to opened up
Reasonable selection is carried out when flutterring data broadcasting.I.e. crucial topological data is selected with the following step：
(1) it is source node with this node, the weights with TL values non-zero in topology_Table as side, using in graph theory
Prim minimal spanning tree algorithms construct minimum spanning tree, and all topologys in the minimum spanning tree are opened up for the key of highest priority
Data are flutterred, is defined according to minimum spanning tree, if topology is connected graph, the link that can now select N-1 bars side to represent, if topological
For non-UNICOM schemes, the connected subgraph nodes where this node are K, then can select K-1 bars side；
(2) topology that need to be deleted：The topology that needs are deleted must be that this node is no longer certainly by broadcasting 1 some for finding
The node of own neighbours, is the most strong topology of real-time, therefore is also crucial topology information；
(3) the smaller topology of TL values is more crucial in remaining topology；
(4) delete by topology in the range of 1 jump in topological data acquired in three above step, because 1 hop neighbor
Topology information is included in " neighbours' slot requirements information ", so containing without duplicate packages here.
Sequencing according to (1), (2), (3), (4) builds crucial topology information, until in topology_Table
Topological data be completely covered or broad2_Data sizes are up to the broadcast 2 time slots size that can send of maximum.
S3：Broadcasted for 2 periods, dynamic time slot allocation, including following son are carried out according to the slot requirements information for having upgraded in time
Step：
S31：According to the neighbours' slot requirements information in the range of two obtained in S2 steps, calculate this node to be divided
The number of timeslots for arriving；
S32：If this node does not have data to send and forward in this time frame, data slot is not distributed to this node；If
This node only needs to a data slot, then this node is given into this node in the main time slot belonging to the frame period this when；If this section
The data slot that point can be assigned to, then can number needed for the priority selection of distribution node time slot to residue according to node more than one
The data slot of amount gives this node；
S33：If unnecessary 1 of the time slot of node distribution, when data is activation is carried out, preferential transmission can be turned in this time frame
The data of hair.
S4：Distributing priority list according to time slot carries out the Route Selection of data flow, as shown in figure 5, including following sub-step：
S41：Check whether for this time frame runs Routing Algorithm for the first time, if so, then emptying route set Set_Path<>
With forwarding load table relay_Load [], S42 steps are performed, otherwise perform S43 steps.
S42：Network topological information operation according to acquired in step S2 calculates this node frame at can be reached
Network range, and all nodes in the range of this are added to route set Set_Path<>In, wherein should cover up to node
ID, reach node most short ETT paths path, if destination node is not in Set_Path<>It is interior, go to S43.Otherwise, pathfinding into
Work(, for the data flow adds the routing information, the data is stored in data buffer storage to be sent, while being increased according to size of data
Plus in path forward node load relay_Load.If otherwise entering next step.
S43：According to breadth First order traversal Set_Path<>In each node, with reference to it is next when frame slot distribution
The main time-slot sequence and the loading condition of node of priority list, the node that frame in can be reached when calculating two.To avoid route
In there is loop, calculate path next-hop node when, the next-hop node must be from Set_Path<>Supplementary set in choose,
The node is included into Set_Path<>, while by Set_Path<>Traversed vertex ticks, in order to avoid repeat to travel through.To avoid bearing
Load excessively concentrates on some forward node, when the load of forward node is more than the data length that a data slot can be transmitted
During certain proportion λ, also by the vertex ticks, the node is will not be considered any further in routing process afterwards, unless the node is in net
The path in destination node is arrived must exceed load through position or all available forward node in network.
The degree of communication of the value network topology of wherein λ, node location, the service attribute correlation of network, should regard concrete condition
Depending on, such as in the mesh network topologies of Fig. 3, if node 1 is in the route of node 3, node 5 is cutpoint, then it must be
The forward node in path, so just without considering λ, and for other forward node, such as node 4 and node 7, then can contemplate
λ is reaching the effect of load balancing.
S44：S43 processes are repeated until destination node is added into Set_Path<>In, for the data flow adds paths letter
Breath, the data flow pathfinding is completed, if all nodes all have been added to Set_ in UNICOM's subgraph in topology where this node
Path<>In, still without destination node, pathfinding failure is represented, by the data flow and it is put into pathfinding miss data stream caching, and
Pathfinding number of times is added 1, this when frame in no longer be the data pathfinding.The pathfinding strategy that i.e. present invention is used is a kind of greedy algorithm,
Ensure that the always ETT minimum path of the result of each searching.
S45：When this when, frame in had the data flow to new destination node to produce, whether destination node is inquired about first
In Set_Path<>In, if S43 steps are not jumped to if, continue to travel through the node of unmarked mistake by breadth First order；If
Whether can load the transmission of the data flow in the existing load detecting path then according to path, if can if by its routing information
The data flow is added directly into, forward node load is updated, and by data flow addition data buffer storage to be sent；If can not if
It is the data flow again pathfinding since the previous node of path failure node, if load can have been exceeded with forward node,
Can use the main time-slot sequence of next time frame of forward node as the foundation of pathfinding algorithm.
Consider the mesh network topologies in Fig. 3, if the data that 8 orientation node of node 5 sends, currently route Set_Path
<>In have the transmitting path of 8-7-4-5, but node 4 is loaded and exceeded, then the node 7 from before path interior joint 4 continues time
The route for searching out node 5 is gone through, if the load of node 7 also exceeds, when ETT is calculated, next time frame of node 5 and 7 is selected
Main time slot is used as the foundation for calculating.
S46：Check whether data flow cache is empty, if not, the data flow to being produced before this time frame is sought again
The data flow is then taken out and is added in data buffer storage to be sent by road, again pathfinding success, in this way, then adds 1 by its pathfinding number of times,
This time frame is no longer the data pathfinding, after pathfinding number of times is more than a numerical value time_Failuer, represents the data flow pathfinding
Failure, abandons the data.The setting of time_Failuer is general and threshold value TLmaxCorrespondence, and network topology change attribute phase
Close.
S5:After new time frame starts, according to the main time-slot sequence of this time frame interior nodes into S1 steps start new round Mac and
The execution cycle of routing algorithm.
Claims (6)
1. the wireless Mesh netword low time delay optimization method of dynamic time slot allocation is based on, it is characterised in that wireless mesh Mesh nets
Each node carries out time slot distribution by the cycle of time frame in network；When the time frame includes 1 period of broadcast, broadcast 2 periods and data frame
Section；Broadcasting for 1 period includes 1 time slot of N number of broadcast, and 2 periods of broadcast include 2 time slots of N number of broadcast, and the data frame period includes being more than or equal to
N number of data frame interval, N is maximum node number in wireless Mesh netword；Each node is in the data frame period to that should have a data
Frame slot is the main time slot of the node；Main time-slot sequence of each node in differing time frames as specified by node slot time priority list
It is different；
Each node is wide by corresponding distribution one in the main time-slot sequence of current time frame according to it with 2 periods of broadcast in 1 period of broadcast
Broadcast 1 time slot and 2 time slots of broadcast；Each node broadcasts this node and neighbours in each time frame according to current main time-slot sequence
The dynamically distributes and topology that the slot requirements of node carry out time slot with change in topology are safeguarded：
1) 1 period, time slot demand are broadcasted：
Each node generates the 1st Broadcasting Control frame, and the 1st Broadcasting Control frame of this node is broadcasted in 1 time slot of corresponding broadcast, the
1 Broadcasting Control frame includes node ID, the total size of data to be sent and each traffic flow information to be sent, and traffic flow information includes
The size of data of data flow and each data flow send priority and each data flow residual paths information, data to be sent it is total big
The size of data sum of each data flow to be sent in the small data buffer storage for spot broadcasting；Include in spot broadcasting data buffer storage
Present node is used as the source node traffic flow information to be sent and the present node data flow to be forwarded as intermediate node
Information；Excessively cause that the length of the 1st Broadcasting Control frame of node exceedes 1 time slot of broadcast and sends out when there is traffic flow information to be sent
When sending the maximum data length of data, the node then sends priority order from big to small by maximum data length by data flow
Interior traffic flow information is put into the 1st Broadcasting Control frame；
The computational methods that data flow sends priority w are：
W=α stream_Length+ β ETT+ (1- alpha-betas) prior
Wherein, ETT is that path is expected the transmission time, and prior is the service priority of data flow, and stream_Length is the number
According to the size of data of stream, α, β ∈ [0,1] and alpha+beta≤1, the transmission time is expected in the size of data of representative of data flow and path respectively
Weight coefficient；
After each node receives the 1st Broadcasting Control frame of other nodes transmission, carried out locally according to the 1st Broadcasting Control frame for receiving
The node is added to the renewal of topology information table, the node ID in the 1st Broadcasting Control frame a hop neighbor of local maintenance
In information table, while whether being this according to this node of data flow residual paths information inspection in the 1st Broadcasting Control frame for receiving
Next forward node of data flow, if so, the size of data of the data flow of the data flow and each data flow then are sent into preferential
Level and each data flow residual paths information are added in spot broadcasting data buffer storage, if it is not, then losing the data stream information
Abandon；
2) broadcasted for 2 periods, broadcast neighbor node slot requirements and change in topology：
Each node generates the 2nd Broadcasting Control frame, and the 2nd Broadcasting Control frame of this node is broadcasted in 2 time slots of corresponding broadcast, the
2 Broadcasting Control frames include that node ID, neighbor node ID, the total size of data to be sent, network topology data and network topology become
Change data；When occur network topology data it is excessive so that the total length of the 2nd Broadcasting Control frame exceeded node broadcast 2 time slots hair
During the maximum data length sent, the node according to local topology information table then to carrying out crucial topology choosing to network topology data
Select, in selecting crucial topology to be added to the 2nd Broadcasting Control frame in the maximum data length for broadcasting the transmission of 2 time slots；
Each node receive other nodes transmission the 2nd Broadcasting Control frame after, according to the section in the 2nd Broadcasting Control frame for receiving
Point ID is updated in neighbor list in the range of local double bounce, and carries out local topology information table more according to the 2nd Broadcasting Control frame
Newly；
3) data frame period, dynamic time slot allocation：
The total size of the data to be sent corresponding to the neighbor node in neighbor list in the range of local double bounce obtains this section
The data frame interval quantity that point needs in the current data frame period：
If node does not have data to send and forward in this time frame, data slot is not distributed to the node, by node correspondence
Main data frames time slot as free timeslot；If node only needs to 1 data frame interval, by this node in frame period this when institute
The main data frames time slot of category gives this node；If this node needs the data frame interval of more than 2, preferential according to node slot time
Level table carries out free timeslot competition；If node is assigned to the data frame interval of more than 2, when data is activation is carried out, node
Preferentially send the data flow that can be forwarded in this time frame；Node sends priority in 1 data frame interval according to data flow
Order from big to small sends data flow.
2. the wireless Mesh netword low time delay optimization method of dynamic time slot allocation is based on as claimed in claim 1, it is characterised in that
The local topology information table topology_Table that each node is safeguarded is：
Each element T L in local topology information tableijThe link circuit condition j=1,2 ..., N, i=1 between node i, j are represented,
2 ..., N；Work as TLij=0, then it represents that do not exist link between node i, j or do not find out the situation of link；Work as TLijIt is non-zero, then table
Show there is link between node i, j, i.e., in the presence of the side in a topological diagram, when its specific value is that link is to find out between node i, j
Between, its unit is time frame, for representing the newness degree that this link is obtained, is worth the smaller link information newer.
3. the wireless Mesh netword low time delay optimization method of dynamic time slot allocation is based on as claimed in claim 2, it is characterised in that
Step 2) in by following sequential selection key topological data, until the topological data in local topology information table is completely covered
Or the 2nd Broadcasting Control frame sign up to one broadcast 2 time slots send maximum data length：
(1) it is source node with this node, the topological diagram constituted according to local topology information table constructs minimum spanning tree, the minimum
All links in spanning tree；
(2) according to the 1st Broadcasting Control frame know be no longer oneself this node one jump in the range of neighbor node link；
(3) according to TLijAlso non-selected link in value sequential selection local topology information table from small to large；
(4) link in the range of 1 jump in current acquired topological data is deleted.
4. the wireless Mesh netword low time delay optimization method of dynamic time slot allocation is based on as claimed in claim 2, it is characterised in that
The information updating of local topology information table is comprised the following steps：
Broadcasted for 1 period, add 1 to all element values not for 0 in local topology information table；
Broadcasted for 2 periods, the corresponding element in local topology information table of neighbor list link in the range of local double bounce is set
TLijBe worth is 1；As the TL of the link in the network topology data in the 2nd Broadcasting Control frame for receivingijValue is less than local topology
During the corresponding element value of information table, or local topology information table corresponding element value be 0 when just use the 2nd Broadcasting Control frame in
Network topology data in link TLijValue updates corresponding element value；When the link for needing to delete is received, setting person is local
The corresponding element value of topology information table is 0；When the element value for having element in local topology information table is more than the expired threshold value for setting
When, then corresponding element value is set to 0.
5. the wireless Mesh netword low time delay optimization method of dynamic time slot allocation is based on as claimed in claim 1, it is characterised in that
Each node frame at completes to be routed after time slot distribution in wireless mesh Mesh network, Route Selection reference
Main time-slot sequence in node slot time priority list.
6. the wireless Mesh netword low time delay optimization method of dynamic time slot allocation is based on as claimed in claim 5, it is characterised in that
Route selection is concretely comprised the following steps：
S1：Check whether as this time frame runs Routing Algorithm for the first time, if so, then emptying route set and forwarding load table, hold
Row step S2, otherwise performs step S3；
S2：The network topology data obtained according to 2 periods of broadcast calculate this node network model that frame in can be reached at
Enclose, and all nodes in the range of this are added in route set, route set covers ID up to node, reaches node most
The path of short ETT, if destination node is not in route set, goes to step S3, if destination node is in route set, pathfinding into
Work(, for the data flow adds the routing information, the data flow is stored in data buffer storage to be sent, while big according to data flow
The load of the middle forward node in the path is updated in the small load table to forwarding；
S3：According to each destination node in breadth First order traversal route set, with reference to the node slot time of next time frame
The node that frame in can be reached when the loading condition of main time-slot sequence and node in priority list calculates two.
S4：Repeat step S3 is crossed and pathfinding or pathfinding failure is completed in destination node is added into set of routes, if completing pathfinding
Then for the data flow corresponding to purpose node adds paths information, the data corresponding to destination node are banished if pathfinding failure
Enter pathfinding failure data flow cache in.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710076756.8A CN106879071B (en) | 2017-02-13 | 2017-02-13 | Wireless Mesh network low-delay optimization method based on dynamic time slot allocation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710076756.8A CN106879071B (en) | 2017-02-13 | 2017-02-13 | Wireless Mesh network low-delay optimization method based on dynamic time slot allocation |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106879071A true CN106879071A (en) | 2017-06-20 |
| CN106879071B CN106879071B (en) | 2020-01-14 |
Family
ID=59166343
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710076756.8A Expired - Fee Related CN106879071B (en) | 2017-02-13 | 2017-02-13 | Wireless Mesh network low-delay optimization method based on dynamic time slot allocation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106879071B (en) |
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109104767A (en) * | 2018-07-30 | 2018-12-28 | 武汉中元通信股份有限公司 | A kind of dynamic time slot allocation optimization method |
| CN109152079A (en) * | 2018-07-05 | 2019-01-04 | 东南大学 | A kind of timeslot scheduling and method for channel allocation for TSCH network |
| CN109429347A (en) * | 2017-09-01 | 2019-03-05 | 杭州海康威视数字技术股份有限公司 | Slot allocation method and device |
| CN109561513A (en) * | 2019-01-29 | 2019-04-02 | 四川九洲电器集团有限责任公司 | A kind of distribution Lothrus apterus ad hoc network multiple access protocol |
| WO2019084956A1 (en) * | 2017-11-06 | 2019-05-09 | 海能达通信股份有限公司 | Method for resource scheduling in mesh network and mesh network nodes |
| CN109803433A (en) * | 2019-02-27 | 2019-05-24 | 深圳绿米联创科技有限公司 | Wireless communication control method, device, electronic equipment and storage medium |
| CN110086671A (en) * | 2019-04-30 | 2019-08-02 | 电子科技大学 | A kind of topology discovery method of Ad Hoc network |
| CN110519845A (en) * | 2019-05-16 | 2019-11-29 | 重庆邮电大学 | The unmanned plane ad hoc network multi-hop TDMA cut-in method for assisting distribution based on time slot and using |
| CN111314862A (en) * | 2020-02-19 | 2020-06-19 | 东南大学 | Caching method with recommendation under deep reinforcement learning in fog wireless access network |
| CN111642022A (en) * | 2020-06-01 | 2020-09-08 | 重庆邮电大学 | Industrial wireless network deterministic scheduling method supporting data packet aggregation |
| CN111683384A (en) * | 2020-06-10 | 2020-09-18 | 广州空天通讯技术服务有限公司 | Network optimization method for realizing dynamic weighting of communication link by artificial intelligence |
| CN112188639A (en) * | 2020-09-07 | 2021-01-05 | 珠海格力电器股份有限公司 | Communication method, device, equipment and computer readable medium based on WiFi Mesh network |
| CN113709809A (en) * | 2021-08-16 | 2021-11-26 | 电子科技大学 | Mobile ad hoc network broadcasting method based on cooperative communication |
| CN115150286A (en) * | 2022-07-01 | 2022-10-04 | 苏州华兴源创科技股份有限公司 | Transmission node changing method, device, computer equipment and storage medium |
| CN115277306A (en) * | 2022-06-27 | 2022-11-01 | 重庆邮电大学 | Joint scheduling method for time-sensitive network and industrial wireless network based on successive approximation |
| CN115883364A (en) * | 2022-12-21 | 2023-03-31 | 中山大学 | Dynamic optimization method for distributed network controller |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090154481A1 (en) * | 2007-12-12 | 2009-06-18 | Synapsense Corporation | Apparatus and method for adaptive data packet scheduling in mesh networks |
| CN101558583A (en) * | 2006-09-29 | 2009-10-14 | 罗斯蒙德公司 | Wireless mesh network with multisized timeslots for TDMA communication |
| US20160021596A1 (en) * | 2014-07-21 | 2016-01-21 | Cisco Technology, Inc. | Traffic class capacity allocation in computer networks |
| CN105554887A (en) * | 2015-12-09 | 2016-05-04 | 电子科技大学 | Wireless MESH network distributed resource distribution method based on TDMA |
-
2017
- 2017-02-13 CN CN201710076756.8A patent/CN106879071B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101558583A (en) * | 2006-09-29 | 2009-10-14 | 罗斯蒙德公司 | Wireless mesh network with multisized timeslots for TDMA communication |
| US20090154481A1 (en) * | 2007-12-12 | 2009-06-18 | Synapsense Corporation | Apparatus and method for adaptive data packet scheduling in mesh networks |
| US20160021596A1 (en) * | 2014-07-21 | 2016-01-21 | Cisco Technology, Inc. | Traffic class capacity allocation in computer networks |
| CN105554887A (en) * | 2015-12-09 | 2016-05-04 | 电子科技大学 | Wireless MESH network distributed resource distribution method based on TDMA |
Non-Patent Citations (2)
| Title |
|---|
| 邱鹏飞: "基于TDMA的无线Mesh网络时隙分配算法研究与实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
| 马瑞: "基于TDMA和网络编码的低时延无线Mesh网络协议研究与节点实现", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (27)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109429347A (en) * | 2017-09-01 | 2019-03-05 | 杭州海康威视数字技术股份有限公司 | Slot allocation method and device |
| WO2019084956A1 (en) * | 2017-11-06 | 2019-05-09 | 海能达通信股份有限公司 | Method for resource scheduling in mesh network and mesh network nodes |
| CN109152079B (en) * | 2018-07-05 | 2021-09-07 | 东南大学 | Time slot scheduling and channel allocation method for TSCH (three-channel switched capacitor) network |
| CN109152079A (en) * | 2018-07-05 | 2019-01-04 | 东南大学 | A kind of timeslot scheduling and method for channel allocation for TSCH network |
| CN109104767A (en) * | 2018-07-30 | 2018-12-28 | 武汉中元通信股份有限公司 | A kind of dynamic time slot allocation optimization method |
| CN109104767B (en) * | 2018-07-30 | 2023-04-18 | 武汉中元通信股份有限公司 | Dynamic time slot allocation optimization method |
| CN109561513A (en) * | 2019-01-29 | 2019-04-02 | 四川九洲电器集团有限责任公司 | A kind of distribution Lothrus apterus ad hoc network multiple access protocol |
| CN109561513B (en) * | 2019-01-29 | 2022-03-08 | 四川九洲电器集团有限责任公司 | Distributed conflict-free ad hoc network multiple access protocol |
| CN109803433A (en) * | 2019-02-27 | 2019-05-24 | 深圳绿米联创科技有限公司 | Wireless communication control method, device, electronic equipment and storage medium |
| CN109803433B (en) * | 2019-02-27 | 2023-04-07 | 深圳绿米联创科技有限公司 | Wireless communication control method, device, electronic device and storage medium |
| CN110086671A (en) * | 2019-04-30 | 2019-08-02 | 电子科技大学 | A kind of topology discovery method of Ad Hoc network |
| CN110519845B (en) * | 2019-05-16 | 2022-07-22 | 重庆邮电大学 | Unmanned aerial vehicle ad hoc network multi-hop TDMA access method based on time slot auxiliary allocation and use |
| CN110519845A (en) * | 2019-05-16 | 2019-11-29 | 重庆邮电大学 | The unmanned plane ad hoc network multi-hop TDMA cut-in method for assisting distribution based on time slot and using |
| CN111314862A (en) * | 2020-02-19 | 2020-06-19 | 东南大学 | Caching method with recommendation under deep reinforcement learning in fog wireless access network |
| CN111642022B (en) * | 2020-06-01 | 2022-07-15 | 重庆邮电大学 | Industrial wireless network deterministic scheduling method supporting data packet aggregation |
| CN111642022A (en) * | 2020-06-01 | 2020-09-08 | 重庆邮电大学 | Industrial wireless network deterministic scheduling method supporting data packet aggregation |
| CN111683384A (en) * | 2020-06-10 | 2020-09-18 | 广州空天通讯技术服务有限公司 | Network optimization method for realizing dynamic weighting of communication link by artificial intelligence |
| CN112188639A (en) * | 2020-09-07 | 2021-01-05 | 珠海格力电器股份有限公司 | Communication method, device, equipment and computer readable medium based on WiFi Mesh network |
| CN112188639B (en) * | 2020-09-07 | 2022-08-19 | 珠海格力电器股份有限公司 | Communication method based on WiFi Mesh network and related equipment |
| CN113709809A (en) * | 2021-08-16 | 2021-11-26 | 电子科技大学 | Mobile ad hoc network broadcasting method based on cooperative communication |
| CN113709809B (en) * | 2021-08-16 | 2023-04-07 | 电子科技大学 | Mobile ad hoc network broadcasting method based on cooperative communication |
| CN115277306A (en) * | 2022-06-27 | 2022-11-01 | 重庆邮电大学 | Joint scheduling method for time-sensitive network and industrial wireless network based on successive approximation |
| CN115277306B (en) * | 2022-06-27 | 2023-05-26 | 重庆邮电大学 | Successive approximation-based joint scheduling method for time-sensitive network and industrial wireless network |
| CN115150286A (en) * | 2022-07-01 | 2022-10-04 | 苏州华兴源创科技股份有限公司 | Transmission node changing method, device, computer equipment and storage medium |
| CN115150286B (en) * | 2022-07-01 | 2023-09-22 | 苏州华兴源创科技股份有限公司 | Transmission node changing method, device, computer equipment and storage medium |
| 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 |
|---|---|
| CN106879071B (en) | 2020-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106879071A (en) | Wireless Mesh netword low time delay optimization method based on dynamic time slot allocation | |
| CN105554887B (en) | A kind of Wireless MESH network distributed resource allocation method based on TDMA | |
| Chlamtac et al. | Fair algorithms for maximal link activation in multihop radio networks | |
| CN101980565B (en) | QoS-based Ad Hoc network adaptive node speed multi-path routing method | |
| US7773569B2 (en) | System and method for efficiently routing data packets and managing channel access and bandwidth in wireless multi-hopping networks | |
| US7693939B2 (en) | Context-based routing in multi-hop networks | |
| CN104010289B (en) | The communication means that a kind of wireless self-networking neighbor node is mutually found | |
| CN101827415B (en) | Channel allocating method and system in wireless mesh network | |
| CN101155131A (en) | Method for establishing label switched path of minimized path preemption cost | |
| CN101494591A (en) | End-to-end routing method, device and system | |
| CN112019254B (en) | Active low-delay routing method for low-earth-orbit satellite network | |
| Liu et al. | A biologically inspired QoS routing algorithm for mobile ad hoc networks | |
| CN105491584A (en) | Mobile application specific networks | |
| CN109951335A (en) | Satellite network time delay and rate joint protection method for routing based on time aggregation figure | |
| WO2008007255A2 (en) | Method for scheduling of packets in tdma channels | |
| CN107370536A (en) | Satellite network multi-broadcast routing method and system based on minimum connected dominating set | |
| CN109040865A (en) | A kind of satellite optical burst swit- ching conflict resolution scheduling realization system and method | |
| CN109922441A (en) | A kind of multihop network communication means, device and system | |
| CN101854694A (en) | Multi-path routing method based on bandwidth requirements | |
| KR20110046861A (en) | Wireless mesh network system, generating virtual node, unicast routing method, and scheduling method thereof | |
| CN101867993B (en) | Multi-path routing method based on route correlation degree | |
| CN102036335A (en) | Route cognizing protocol for wireless network | |
| CN116668356A (en) | SRv 6-based multi-service distribution method for low-orbit satellite network | |
| Bitaillou et al. | Q-routing: from the algorithm to the routing protocol | |
| Anguswamy et al. | A multi-interface multi-channel routing (MMCR) protocol for 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 | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20200114 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |