CN109547148B - Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network - Google Patents
Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network Download PDFInfo
- Publication number
- CN109547148B CN109547148B CN201910048626.2A CN201910048626A CN109547148B CN 109547148 B CN109547148 B CN 109547148B CN 201910048626 A CN201910048626 A CN 201910048626A CN 109547148 B CN109547148 B CN 109547148B
- Authority
- CN
- China
- Prior art keywords
- node
- time slot
- path
- sets
- business
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/16—Time-division multiplex systems in which the time allocation to individual channels within a transmission cycle is variable, e.g. to accommodate varying complexity of signals, to vary number of channels transmitted
- H04J3/1694—Allocation of channels in TDM/TDMA networks, e.g. distributed multiplexers
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Time-Division Multiplex Systems (AREA)
- Small-Scale Networks (AREA)
Abstract
The invention discloses the dynamic time slot allocating method based on service flow path in a kind of TDMA ad hoc network, the problem of dynamic time slot allocation overlong time when solving multi-hop transmission, non-bottleneck node occupies invalid time slot.Scheme is: detecting business in business stream source node, the dynamic slot occupancy situation of each node is aggregated into final jump node on service flow path and is distributed all node slot times；By wheel sub-distribution, guarantee be assigned the dynamic slot number that all nodes in rear path are got be it is equal, by wheel distribute when take a step rollback mode, increase bottleneck node occupies number of time slots.Present invention design detects Business Stream comprising source node, final jump node summarizes each nodal information progress time slot allocation on path, shorten business detection and time slot allocation time, by wheel sub-distribution and a step rollback mode, avoid wooden pail effect, slot efficiency is improved, handling capacity end to end is increased, is used for TDMA self-organizing network field.
Description
Technical field
The invention belongs to wireless communication technology field, a kind of time slot based on service path in MAC layer is further related to
It distributes, the dynamic time slot allocating method based on service flow path in specifically a kind of TDMA ad hoc network can be widely used in from group
It nets in TDMA agreement.
Background technique
Message transmissions as control node in ad hoc network guarantee the MAC of overall performance of network to the occupancy of wireless medium
Agreement is the key technology of mobile ad hoc network, and the space reuse degree of channel and node are improved by the way that channel is divided into time slot and is connect
Enter fairness.How research direction of the dynamic time slot allocation algorithm as TDMA multiple access protocol meets each section in practical applications
How the business demand of point, efficiently distribute time slot, is particularly important in the application of TDMA.
Currently, mainly having fixed time slot allocation, contention slot allocation, dynamic time slot allocation algorithm, wherein fixed time slot point
Time slot has been allocated in advance for the node in network with algorithm, but cannot change dynamic adjustment distribution side according to node traffic demands
Case, the wasting of resources is extremely serious, and practicability is poor；Contention slot allocation algorithm allows network node to compete in a certain range
Time slot, to realize the multiplexing of time slot, but this kind of algorithm is based entirely on random competition mechanism, thus exist conflict it is more, handle up
Measure small problem；The dynamic time slot allocation algorithm synthesis advantage of fixed Slot Allocation Algorithm and contention slot allocation algorithm, In
When node needs to send data, its time slot used is just distributed to, data are sent, and node cancels the occupancy to time slot, in this way
The utilization rate of channel can be improved, but there is also some shortcomings, if Business Stream on multihop path when transmitting, each section on path
The judgement and calculating that point will detect business, carry out time slot reservation, can extend the time of dynamic slot resource allocation, and can go out
Existing wooden pail effect, influences handling capacity and the effective rate of utilization of time slot end to end.
Summary of the invention
It is an object of the invention in view of the above shortcomings of the prior art, propose a kind of shortening time slot allocation time and raising
Dynamic time slot allocating method based on service flow path in the TDMA ad hoc network of time slot efficiency.
The present invention is the path-level dynamic time slot allocating method based on Business Stream in a kind of TDMA ad hoc network, and feature exists
In comprising the following steps that
(1) service rate and routing information are obtained according to Business Stream: in TDMA ad hoc network, is reached and saved according to each multi-frame
The frame number of point obtains business flow rate Vin, then number of time slots n needed for each node meets Business Stream transmissionc=Vin, according to
The header information table of query and routing of traffic frame obtains the node set S on service flow path0。
(2) summarize the available time slot information of each node and sort: the time slot sets that occupy of each node are sent to business
The last one node of flow path summarizes to obtain each available time slot sets U of node on pathia, when available according to each node
Gap set UiaCalculate the assignable node set S of each time slotjk, according to the number at node set midpoint by node set SjkInto
Row ascending sort.
(3) time slot is distributed for the node on service flow path:
Using the method by wheel sub-distribution, each round sub-distribution makes each node on path respectively obtain a time slot；It is each
When wheel distribution, sequentially traverse each time slot can distribution node set, obtain the node of unallocated time slot in node set, be
The node distribute time slot, each round be assigned after guarantee distribute to each node on path number of time slots be it is equal,
When a certain node can not obtain time slot, this time slot allocation terminates；When occurring bottleneck node in the assignment procedure can occupy
When gap is preempted, make non-bottleneck node that output time slot be allowed to occupy for bottleneck node by the way of step rollback.
The present invention avoids the generation of wooden pail effect, shortens the time of dynamic slot resource allocation, improves effective benefit of time slot
With rate, increase handling capacity end to end, improves communication quality.
Compared with the prior art, the present invention has the following advantages:
First, shorten the time slot allocation time: since the present invention is in the final jump node progress path of service flow path
The decision of node reserving time slots calculates entire road after corresponding node receives decision instruction in the detection cycle of a node
The allocation result of all nodes of diameter, the detection of Business Stream only carry out in source node, individually detect without each node, accelerate road
The time of diameter resource allocation.
Second, improve the effective rate of utilization of time slot: due to the present invention be using service flow path as object by wheel sub-distribution when
Gap calculates the dynamic slot reserved needed for each node on service flow path, when the available time slot of certain node on path is insufficient,
When being unable to satisfy the rate of Business Stream, other nodes only need to reserve the time slot for the number that the bottleneck node can be reserved, and
Without reducing the invalid time interval resource of non-bottleneck node and occupying with the rate reserving time slots of Business Stream.
The present invention negotiates the distribution of shared time interval resource from the angle in path between node, by complete trails by wheel sub-distribution
Method, avoid that invalid resource in non-bottleneck node distributes and distributed slot has been surveyed caused resource contention, thus
Improve the utilization rate and the supportability of QoS end to end of time interval resource.
Detailed description of the invention
Fig. 1 is implementation flow chart of the invention；
Fig. 2 is the node dynamic slot information data structure figure in the present invention；
Fig. 3 is that the time slot in the present invention can distribution node data structure diagram.
Specific embodiment
The present invention is described in detail below:
Embodiment 1:
TDMA self-organization network technology can satisfy communication network not only to be realized with a low cost except high data rate, additionally it is possible to
It effectively supports various flexible network construction forms, there is good adaptability and survival ability, therefore can be widely applied to the public
Among the broadband wireless access system such as, industrial application and national defence.Time slot is as the link in TDMA self-organization network
Resource, its distribution determine the effective rate of utilization of handling capacity and resource end to end.Current slot allocation method mainly has
Fixed time slot allocation, contention slot allocation, dynamic time slot allocation algorithm, the fixed time slot allocation of dynamic time slot allocation algorithm synthesis
The advantage of algorithm and contention slot allocation algorithm just distributes to its time slot used when node needs to send data, and data are sent
It finishes, node cancels the occupancy to time slot, the utilization rate of channel can be improved in this way, but there is also some shortcomings, extend dynamic
The time of distributing slot resources, and will appear wooden pail effect, influence handling capacity and the effective rate of utilization of time slot end to end.
The present invention expands research for above-mentioned status, proposes that the path-level based on Business Stream is moved in a kind of TDMA ad hoc network
State slot allocation method is comprised the following steps that referring to Fig. 1
(1) service rate and routing information are obtained according to Business Stream: in TDMA ad hoc network, is reached and saved according to each multi-frame
The frame number of point obtains business flow rate Vin, VinRepresent the frame number that each multi-frame reaches.Then each node meets Business Stream
Number of time slots n needed for transmissionc, nc=Vin；According to the header information table of query and routing of traffic frame, obtain on service flow path
Node set S0。
(2) summarize the available time slot information of each node and sort: referring to fig. 2, Fig. 2 is moved in the double bounce of each node maintenance
The data structure diagram of state Time Slot Occupancy situation, the left side of Fig. 2 are array index, represent timeslot number, and right side is corresponding lower target value,
Represent the busy flag of the time slot.According to the Time Slot Occupancy situation of the maintenance of node, the time slot sets that occupy of node are obtained, it will
It is available to summarize to obtain each node on path for the final jump node for occupying time slot sets and being sent to service flow path of each node
Time slot sets Uia, UiaWhat is indicated is that node i occupies time slot sets.According to the available time slot sets U of each nodeiaIt calculates
Each assignable node set S of time slotjk, referring to Fig. 3, left side is array index in Fig. 3, represents timeslot number, and right side is to correspond to
Lower target value, represent the time slot can distribution node set, Fig. 3 be each time slot can distribution node set data structure
Figure.Each time slot can be there are many distribution node set expression modes, this example is only indicated in a manner of a kind of array.SjkWhen representing
K-th of gap j can distribution node set.According to the number at node set midpoint by node set SjkCarry out ascending sort.Node
The time slot sets that occupy obtained by interaction protocol between the node of self-organization network.
Existing slot allocation method is mostly set out with node and carries out the distribution of time slot, and such methods advantage is that logic is clear
It is clear, strong operability, but there are still the problem of be that can not make full use of in TDMA self-organization network that time slot can with the angle in path
The characteristic of multiplexing.The present invention opens the method from time slot angular distribution, in combination in the method for node set out, and refers to
Service flow path allocates slots to node, has given full play to the reusable characteristic of time slot in TDMA self-organization network, improves end and arrives
The handling capacity at end.
(3) time slot is distributed for the node on service flow path:
Using the method by wheel sub-distribution, each round sub-distribution makes each node on path respectively obtain a time slot；It is each
When wheel distribution, sequentially traverse each time slot can distribution node set, obtain the node of unallocated time slot in node set, be
The node distribute time slot, each round be assigned after guarantee distribute to each node on path number of time slots be it is equal,
When a certain node can not obtain time slot, this time slot allocation terminates.When occurring bottleneck node in the assignment procedure can occupy
When gap is preempted, make non-bottleneck node that output time slot be allowed to occupy for bottleneck node by the way of step rollback.
Technical thought of the invention is: saving on the source-end detection type of service of Business Stream, service rate and service path
Point information is obtained in network respectively by the double bounce and double bounce that include in dynamic slot information frame with the slot occupancy information of interior nodes
Node occupies time slot, and the gap information that occupies of this node is transferred to path final jump node by each node, will be every
A assignable node division of time slot is multiple conflict point sets, carries out decision according to certain strategy, will divide after the completion of decision
It is transferred to each node on path with result, node carries out the reservation of time slot according to allocation result.
Existing slot allocation method is mostly the reservation to carry out time slot centered on this node, and the advantage of such method exists
In the Time Slot Occupancy situation that need to only consider this node, realization is relatively simple, but existing deficiency is, does not consider service flow path
The Time Slot Occupancy situation of other upper nodes, is easy to appear wooden pail effect, non-bottleneck node is made to occupy invalid time slot.The present invention opens
The Time Slot Occupancy situation for having warded off all nodes using on path is to distribute time slot as nodes all on path with reference to by round, and take
The method that one step retracts guarantees that each node occupies equal number of time slot, avoids wooden pail effect, improve time slot
Utilization rate and end to end handling capacity.
The present invention detects business in the source node of Business Stream, and it is all to carry out path in the last one node of service flow path
The time slot allocation of node shortens the time slot allocation time of node in the detection time and path of business.Using by wheel sub-distribution, protect
It is equal with the number of time slots that bottleneck node obtains to demonstrate,prove the number of time slots that non-bottleneck node obtains, avoids the generation of wooden pail effect, disappears
Unless the invalid Time Slot Occupancy of bottleneck node, improves the effective rate of utilization of time slot.The present invention can be widely used in ad hoc network TDMA
In agreement.
Embodiment 2:
Path-level dynamic allocation method in TDMA ad hoc network based on Business Stream is with embodiment 1, wherein described in step (3)
Be the node distribution time slot on service flow path, be the business flow rate obtained in step (1) and step (2), routing information,
Carried out on the basis of the information such as each assignable node set of time slot, step (3) be use in the way of taking turns sub-distribution for
All nodes distribute time slot on service flow path, comprise the following steps that
The initialization of (3a) round method of salary distribution: initialization distribution round n is 1, empties the time slot sets for distributing to node
di, set number of time slots niIt is 0, the value for setting N is the number of node on path, executes (3b), starts the distribution of the first round.
The initialization of the wheel distribution of (3b) n-th: starting the assigning process of the n-th wheel, and the number d for setting pre- deletion of node collection is 0, will
It traverses position reset to gather to first, execute (3c), point set can be distributed by starting this round traversal time slot.
(3c) is that each node distributes time slot: from traversal position traverse node set, if all in node set
The time slot that node has all been pre-allocated in the round then continues to traverse next node set, until set StkIn there are nodes
I, so that ni< n is set up, and traversal position is moved to set StkThe preemption of node i is set to t with time slot, will collected by subsequent position
Close StkPre- deleted marker be set to 1, by niValue add the value of 1, d to add 1, judge whether d equal with N: if so, deleting point set in advance
Number d is equal with N, executes step (3j).Otherwise, the number d and N for deleting point set in advance is unequal, is that d is less than N under normal circumstances,
Judging whether all point sets traverse terminates: if so, i.e. traversal terminates, executing step (3d), obtaining in this round is to distribute
The node of time slot；Otherwise, i.e., traversal is not finished, and executes (3c), continues to traverse.
(3d) obtains the unallocated node set for obtaining time slot of this round: all the points in traverse path will meet niThe section of < n
The node set of point set, i.e. this round are unallocated time slot is set as SlIf set Sp=(S0-Sl), node set SpFor in epicycle
The secondary node set for having obtained time slot executes step (3e), traverses set Sl。
(3e) obtains SlOther of interior joint can occupy the big collection S of the node set of time sloti: traversal Sl, set up an office i ∈ Sl。
The point set that pre- deleted marker is 1 is traversed, i.e., has node in the set and distributes to obtain the corresponding time slot of the node set.Judgement is
No to exist containing the set for having point i, that is, judge node i occupies whether time slot is occupied by other nodes: containing if so, existing
All node sets containing node i are added to big collection S by the pre- deletion of node set of point ii, big collection SiIn be all node
Set executes step (3f), traverses set Sp；Otherwise, i.e., there is no containing the pre- deletion of node set for having point i, node i has not had
There is time slot that can occupy, executes step (3k), terminate this time slot allocation procedures.
(3f) obtains the node for seizing time slot: traversal big collection SiIf set Stk∈Si, traverse set Sp, obtain pre- occupancy
Time slot is the node j of t, traverses the point set that all pre- deleted marker positions are 0, judges whether there is the set containing j: if so, i.e.
Time slot j there is also in addition to time slot t others can occupy time slot, execute step (3g), node j allows output time slot t to account for for node i
With；Otherwise, i.e. the others in addition to time slot t, which are not present, in time slot j can occupy time slot, execute step (3h).
(3g) seizes the node of time slot by output time slot: setting j ∈ Smk, the preemption of point j is set to m, the preemption of point i with time slot
It is set to t with time slot, by StkPre- deleted marker be set to 2, by SmkPre- deleted marker be set to 1, by niValue add the value of 1, d to add 1,
By point i from set SlIt deletes, judges SlIt whether is empty: if so, i.e. this round node for not obtained time slot, executes step
The preemption of epicycle minor node is added in the time slot sets of node occupancy by (3i) suddenly with time slot；Otherwise, step (3e) is executed,
Continue to traverse Sl。
(3h) judges big collection SiIt whether is empty: by point set StkFrom SiMiddle deletion judges big collection SiWhether it is empty: if
It is to execute step (3k), terminate this assigning process；It is no to then follow the steps (3f), continue traverse node big collection Si。
Preemption is converted to occupancy time slot with time slot by (3i): by the preemption of each node with time slot be added to corresponding points when
Gap set di, execute step (3k), terminate this time slot allocation procedures.
(3j) terminates epicycle distribution: the value for distributing round n being added 1, the preemption of each node is added to correspondence with time slot
The time slot sets d of pointi, all node preemptions are set to nothing with time slot, delete all point sets that pre- deleted marker position is not 0,
Judge n whether with time slot n needed for Business StreamcIt is equal: if so, i.e. all nodes it is the allocated enough to time slot meet business
Stream executes step (3k), terminates this time slot allocation procedures；Otherwise, all nodes it is also unallocated enough to time slot meet industry
Business stream, executes step (3b), continues the time slot allocation of next one.
(3k) is recorded and is noticed this allocation result: recording the allocation result d of this assigning process of each pointi, hop-by-hop will
Respective nodes in allocation result notification path, assigning process terminate.
The present invention, which is used, is guaranteed the number of time slots that non-bottleneck node obtains and the time slot that bottleneck node obtains by wheel sub-distribution
Number is equal, avoids the generation of wooden pail effect, eliminates the invalid Time Slot Occupancy of non-bottleneck node, improves the effective use of time slot
Rate.When generation time slot is seized, the mode for taking a step to retract increases the Time Slot Occupancy number of bottleneck node, increases end to end
Handling capacity improves communication quality.
Embodiment 3:
Path-level dynamic slot reserving method in TDMA ad hoc network based on Business Stream is with embodiment 1-2, wherein step (1)
In, it is described that service rate and routing information are obtained according to Business Stream, it carries out as follows:
Time slot needed for (1a) obtains business flow rate and business: the length of each time slot is set as s, each multi-frame includes m
Time slot, then the period of timing detection is T, and the number of the traffic frame reached in T=m*s, detection cycle T is nin, then Business Stream
Rate be Vin, Vin=nin, number of time slots needed for each point meets Business Stream transmission is nc, nc=Vin。
(1b) obtains type of service and routing information: according to the transport layer header information of data frame, judging traffic flow types.
If TCP traffic, nc=nc+2；Otherwise, ncIt is constant.According to the source address and destination address query routing in self-organization network frame head portion
Table obtains the set S of all nodes on path0, the sequence for gathering interior joint is the source node of Business Stream to destination node upper hop
Node.
Information is obtained to obtain in (1c) record (1a) and (1b): recording type, the path node set S of the Business Stream0And industry
Be engaged in flow velocity rate Vin, number of time slots needed for each point meets Business Stream transmission is nc。
The present invention is the source node detection business feature in Business Stream, and notice carries out node, that is, business flow path of time slot allocation
The last one node on diameter avoids each node on path and repeats detection Business Stream, shorten Business Stream detection when
Between.
Embodiment 4:
Path-level dynamic time slot allocating method in TDMA ad hoc network based on Business Stream is obtained with embodiment 1-3 in step (1)
After obtaining service flow path information, the time slot that occupies of each node is summarized along path, wherein in step (2), described summarizing is each
The available time slot information of node simultaneously sorts, and carries out as follows:
(2a) obtains the time slot sets that node can occupy:
Each node in TDMA self-organizing network passes through the Time Slot Occupancy situation of this node of fixed time broadcast, safeguards in double bounce
The slot occupancy information of neighbors, the information are to realize that array index is timeslot number by an one-dimension array, are worth to occupy and being somebody's turn to do
The node number of time slot, -1, which represents the time slot, is not occupied by double bounce interior nodes, and other values represent the node number for occupying the time slot.Node
The time slot sets that this node can be reserved can be obtained according to the not conflict principles of time slot in this information and double bounce, node is by mark value
For -1 all time slots be added to node can be in reserving time slots set, UiaTime slot sets are occupied for node i.
The time slot sets that can be occupied are transferred to the last one node on path by (2b):
Routing information and the time slot sets that occupy of oneself are encapsulated and are sent to the next-hop node in path by source node,
After other nodes receive information, the time slot sets down hop together with the Information encapsulation received that occupies of oneself is sent,
Until the final jump node in path.
The each time slot of (2c) calculating distributes point set.
Final jump node on path receive other nodes occupy time slot sets after, since No. 0 time slot, according to
Node number ascending order traverse node occupies time slot sets, and the time slot sets that occupy of node i are UiaIf 0 ∈ Uia, then i is added
Add to time slot 0 can distribution node set S0k.Divide point set SjkWhen, according to time slot in double bounce, conflict principles and path are not believed
Breath, so that each node set SjkIn only one point can assigned slot j, node set SjkIndicate the kth of time slot j
A assignable node set.After all point sets for obtaining all time slots, it is ranked up, gathers according to the number put in set
When the number of interior point is identical, arranged according to timeslot number ascending order.
The present invention is by the last one node for occupying time slot and being aggregated on path of node each on path, according to outside double bounce
The principle that time slot can not conflict in time slot reusable and double bounce calculates the assignable node set of each time slot.On path most
The latter node carries out the distribution of time slot from the angle in path, shortens the time of node slot time distribution on path.
A more detailed example is given below, the present invention is further described:
Embodiment 5:
Path-level dynamic time slot allocating method in TDMA ad hoc network based on Business Stream with embodiment 1-4,
Step 1: source node detects Business Stream, obtains service rate and routing information:
1.1) length of each time slot is set as s, each multi-frame includes m time slot, then the period of timing detection is T=m*s,
The number of the traffic frame reached in detection cycle T is nin, then the rate of Business Stream is Vin, Vin=nin, each point meets business
Spread defeated required number of time slots nc, nc=Vin。
1.2) according to the transport layer header information of data frame, judge traffic flow types.If TCP traffic, nc=nc+2；It is no
Then, ncIt is constant.Path is obtained according to the source node address in TDMA self-organization network frame head portion and destination node address lookup routing table
The set S of upper all nodes0。
1.3) type, the path node set S of the Business Stream are recorded in source node0With business flow rate Vin。
Step 2: collection summarizes S0In each node occupy time slot sets, calculate the assignable node collection of each time slot
It closes:
2.1) time slot sets that node can occupy are obtained:
The slot occupancy information of neighbors in each node maintenance double bounce in network, the information are by a dimension
Group realizes that array index is timeslot number, is worth to occupy the node number of the time slot, and -1, which represents the time slot, is not accounted for by double bounce interior nodes
With other values represent the node number for occupying the time slot.Node can be obtained according to the not conflict principles of time slot in this information and double bounce
The time slot sets that this node can be reserved, node by all time slots that mark value is -1 be added to node can reserving time slots set
In, UiaTime slot sets are occupied for node i.
2.2) the last one node being transferred to the time slot sets that can be occupied on path:
Routing information and the time slot sets that occupy of oneself are encapsulated and are sent to the next-hop node in path by source node,
After other nodes receive information, the time slot sets down hop together with the Information encapsulation received that occupies of oneself is sent,
Until the final jump node in path, the final jump node in path refer to the upper hop node of destination node.
2.3) calculate each time slot can distribution node set.
Final jump node on path receive other nodes occupy time slot sets after, since No. 0 time slot, according to
Node number ascending order traverse node occupies time slot sets, and the time slot sets that occupy of node i are Uia, it is assumed that 0 ∈ U of time slotia,
Then point set S is distributed by what node i was added to time slot 00k.Partitioning site set SjkWhen, do not conflicted original according to time slot in double bounce
Then and routing information, so that each node set SjkIn only one point can assigned slot j, it is assumed that node 1,2,3
There can be a node to occupy time slot 0,7,8,9 only one time slot of node can occupy time slot 0, meanwhile, according to TDMA self-organizing
Double bounce exterior node can obtain egress 1,2,3 in net with multiplexing time slot does not influence 7,8,9 pairs of time slots 0 of node to the occupancy of time slot 0
Occupy, then node set { 1,2,3 } and node set { 7,8,9 } be two of time slot 0 can distribution node set, obtain sometimes
The all of gap can be ranked up, the number for gathering interior nodes is identical after distribution node set according to the number put in node set
When, it is arranged according to timeslot number ascending order.
Step 3: time slot is distributed for the node on service flow path:
3.1) initialization distribution round n is 1, empties the time slot sets d for distributing to nodei, set number of time slots niIt is 0, sets N
Value be path on node number, execute 3.2).
3.2) assigning process for starting the n-th wheel, setting the pre- number d for deleting point set is 0, by traversal position reset to first
3.3) set executes.
3.3) point set is traversed from traversal position, until set StkIn there are node is so that ni< n is set up, and will traverse position
It sets and is moved to set StkSubsequent position.The preemption of node i is set to t with time slot, by set StkPre- deleted marker be set to 1,
By niValue add the value of 1, d to add 1.Judge whether d is equal with N, if so, executing step 3.10)；Otherwise, judge all point sets
Whether traversal terminates, if so, executing step 3.4)；Otherwise, it executes 3.3).
3.4) all nodes in traverse path, will meet niThe node set of < n is set as SlIf set Sp=(S0-Sl), it holds
Row step 3.5).
3.5) S is traversedl, set up an office i ∈ Sl.The point set that pre- deleted marker is 1 is traversed, the collection containing node i is judged whether there is
It closes: if so, thering are all set of point i to be added to big collection S for containingi, execute step 3.6)；Otherwise, step 3.11) is executed.
3.6) S is traversediIf set Stk∈Si, traverse set Sp, obtain preempting the node j for being t with time slot, traverse all pre-
The node set that deleted marker position is 0, judges whether there is the set of the j containing node: if so, executing step 3.7), otherwise executing
Step 3.8).
3.7) j ∈ S is setmk, the preemption of node j is set to m with time slot, the preemption of node i is set to t with time slot, by Stk's
Pre- deleted marker is set to 2, by SmkPre- deleted marker be set to 1, by niValue add the value of 1, d to add 1, by point i from set SlIt deletes,
Judge SlIt whether is empty: if so, executing step 3.9)；Otherwise, step 3.5) is executed.
3.8) by node set StkFrom SiMiddle deletion, judges SiIt whether is empty: if so, executing step 3.11)；Otherwise it executes
Step 3.6).
3.9) preemption of each node is added to the time slot sets d of corresponding points with time sloti, execute step 3.11).
3.10) value for distributing round n is added 1, the preemption of each node is added to the time slot sets of corresponding points with time slot
di, all node preemptions are set to nothing with time slot, delete all point sets that pre- deleted marker position is not 0.Judge n whether and industry
Time slot n needed for business is flowedcIt is equal, if so, executing step 3.11), otherwise, execute step 3.2).
3.11) the allocation result d of this assigning process of each point is recordedi, by the corresponding section in allocation result notification path
Point, assigning process terminate.
Wherein, when this node needs other node calculated results in notification path, path point set S0It has been passed through step 1
It is handed to this node, the allocation result of this node is saved, for reserving corresponding time slot.By the distribution knot of other nodes on path
Fruit is sent to upper hop node, and after other nodes receive allocation result, the allocation result of oneself is saved, and deletes from data frame
It removes, by treated, allocation result continues to be sent to upper hop node, until the source node of Business Stream.
The present invention is to save in the decision of the final jump node progress path node reserving time slots of service flow path when corresponding
After point receives decision instruction, the allocation result of all nodes in entire path is calculated in the detection cycle of a node, Business Stream
Detection only source node carry out, individually detected without each node, shorten path resources distribution time.
It is object by wheel sub-distribution time slot that the present invention, which is using service flow path, calculates each node institute on service flow path
The dynamic slot that need to be reserved, when the available time slot of certain node on path is insufficient, when being unable to satisfy the rate of Business Stream, other nodes
The time slot for only needing to reserve the number that the bottleneck node can be reserved, without reducing with the rate reserving time slots of Business Stream
The invalid time interval resource of non-bottleneck node occupies.
The present invention negotiates the distribution of shared time interval resource from the angle in path between node, by complete trails by wheel sub-distribution
Method, avoid that invalid resource in non-bottleneck node distributes and distributed slot has been surveyed caused resource contention, thus
Improve the utilization rate and the supportability of QoS end to end of time interval resource.
In brief, the dynamic time slot allocating method based on service flow path in TDMA ad hoc network disclosed by the invention, it is main
Solve the problem of that the non-bottleneck node of dynamic time slot allocation overlong time occupies invalid time slot when multihop path transmission.Its scheme
It is: detects business feature in the source node of Business Stream, the dynamic slot occupancy situation of node each on path is aggregated into business
The last one node on flow path carries out the time slot allocation of all nodes；By the way of by wheel sub-distribution, guarantee to distribute
Be at the dynamic slot number that nodes all in rear path are got it is equal, by take turns distribution when take a step retract in the way of, increase
Big bottleneck node occupies number of time slots.Present invention design detects traffic characteristics, final jump on path comprising source node
Node summarizes the distribution that each nodal information on path carries out time slot, shortens the time of business detection and time slot allocation, proposes by wheel
The mode that sub-distribution and a step retract, avoids wooden pail effect, improves the utilization rate of time slot, increase and handle up end to end
Amount, can be widely used for the time slot allocation in TDMA self-organizing network.
Claims (4)
1. the path-level dynamic time slot allocating method in a kind of TDMA ad hoc network based on Business Stream, which is characterized in that including just like
Lower step:
(1) service rate and routing information are obtained according to Business Stream: in TDMA ad hoc network, node is reached according to each multi-frame
Frame number obtains business flow rate Vin, then number of time slots n needed for each node meets Business Stream transmissionc=Vin, according to business
The header information table of query and routing of frame obtains the node set S on service flow path0；
(2) summarize the available time slot information of each node and sort: the time slot sets that occupy of each node are sent to business flow path
The final jump node of diameter summarizes to obtain each available time slot sets U of node on pathia, according to the available time slot collection of each node
Close UiaCalculate the assignable node set S of each time slotjk, according to the number of node set interior joint by node set SjkIt carries out
Ascending sort；
(3) distribute time slot for the node on service flow path: using the method by wheel sub-distribution, each round sub-distribution makes on path
Each node respectively obtains a time slot；Each round distribute when, sequentially traverse each time slot can distribution node set, obtain node
The unallocated node for obtaining time slot in set distributes time slot for the node, and each round guarantees to distribute to every on path after being assigned
The number of time slots of one node be it is equal, when a certain node can not obtain time slot, this time slot allocation terminates；It is distributing
When time slot can be occupied and be preempted by occurring bottleneck node in the process, make non-bottleneck node that output time slot be allowed to supply by the way of step rollback
Bottleneck node occupies.
2. the path-level dynamic time slot allocating method in TDMA ad hoc network according to claim 1 based on Business Stream, special
Sign is, is wherein the node distribution time slot on service flow path described in step (3), comprises the following steps that
(3a) initialization distribution round n is 1, empties the time slot sets d for distributing to nodei, set node i number of time slots niIt is 0, sets N
Value be path on node number, execute (3b)；
(3b) starts the assigning process of the n-th wheel, and the number d for setting pre- deletion of node collection is 0, and traversal position reset is collected to first
It closes, executes (3c)；
(3c) from traversal position traverse node set, until node set StkIn there are node is so that ni< n is set up, and will be traversed
Position is moved to set StkThe preemption of node i is set to t with time slot by subsequent position, by set StkPre- deleted marker be set to
1, by niValue add the value of 1, d to add 1, judge whether d equal with N: if so, execute step (3j)；Otherwise, judge all node collection
Whether terminate: if so, executing step (3d) if closing to traverse；Otherwise, (3c) is executed；
All nodes in (3d) traverse path, will meet niThe node set of < n is set as SlIf set Sp=(S0-Sl), execute step
Suddenly (3e)；
(3e) traverses SlIf node i ∈ Sl, the node set that pre- deleted marker is 1 is traversed, the collection containing node i is judged whether there is
It closes: if so, all set containing node i are added to big collection Si, execute step (3f)；Otherwise, step (3k) is executed；
(3f) traverses SiIf set Stk∈Si, traverse set Sp, obtain preempting the node j for being t with time slot, traverse all pre- deletions
The node set that flag bit is 0, judges whether there is the set of the j containing node: if so, executing step (3g)；It is no to then follow the steps
(3h)；
(3g) sets j ∈ Smk, the preemption of node j is set to m with time slot, the preemption of node i is set to t with time slot, by StkPre- delete
Except mark is set to 2, by SmkPre- deleted marker be set to 1, by niValue add the value of 1, d to add 1, by node i from set SlIt deletes, sentences
Disconnected SlIt whether is empty: if so, executing step (3i)；Otherwise, step (3e) is executed；
(3h) is by node set StkFrom SiMiddle deletion, judges SiIt whether is empty: if so, executing step (3k)；It is no to then follow the steps
(3f)；
The preemption of each node is added to the time slot sets d of corresponding node by (3i) with time sloti, execute step (3k)；
The value for distributing round n is added 1 by (3j), and the preemption of each node is added to the time slot sets d of corresponding node with time sloti, will
All node preemptions are set to nothing with time slot, delete all node sets that pre- deleted marker position is not 0, judge n whether and business
Time slot n needed for flowingcIt is equal: if so, executing step (3k)；Otherwise, step (3b) is executed；
(3k) records the allocation result d of this assigning process of each nodei, hop-by-hop is by the corresponding section in allocation result notification path
Point, assigning process terminate.
3. the path-level dynamic time slot allocating method in TDMA ad hoc network according to claim 1 based on Business Stream, special
Sign is, described to obtain service rate and routing information according to Business Stream wherein in step (1), carries out as follows:
(1a) sets the length of each time slot as s, and each multi-frame includes m time slot, then the period of timing detection is T, T=m*s, inspection
The number for surveying the traffic frame reached in cycle T is nin, then the rate of Business Stream is Vin, Vin=nin, each node meets business
Spread defeated required number of time slots nc, nc=Vin；
(1b) judges traffic flow types according to the transport layer header information of data frame, if TCP traffic, nc=nc+2；Otherwise, nc
It is constant；The set of all nodes on path is obtained according to the source address in self-organization network frame head portion and destination address table of query and routing
S0；
(1c) records the type of the Business Stream, path node set and business flow rate Vin。
4. the path-level dynamic time slot allocating method in TDMA ad hoc network according to claim 1 based on Business Stream, special
Sign is, wherein in step (2), the available time slot information for summarizing each node simultaneously sorts, and carries out as follows:
(2a) obtains the time slot sets that node can occupy: the Time Slot Occupancy letter of neighbors in each node maintenance double bounce in network
Breath, the information are to realize that array index is timeslot number, is worth to occupy the node number of the time slot, -1 generation by an one-dimension array
The table time slot is not occupied by double bounce interior nodes, and other values represent the node number for occupying the time slot；Node can according to this information and
Time slot not conflict principles in double bounce, obtain the time slot sets that this node can be reserved, and node adds all time slots that mark value is -1
Add to node can be in reserving time slots set, UiaTime slot sets are occupied for node i；
The time slot sets that can be occupied are transferred to the last one node on path by (2b): source node by routing information and oneself
Time slot sets can be occupied and be encapsulated the next-hop node for being sent to path, after other nodes receive information, by accounting for for oneself
With time slot sets, down hop is sent together with the Information encapsulation received, until the final jump node in path；
What (2c) calculated each time slot can distribution node set: the final jump node on path receives occupying for other nodes
After time slot sets, since No. 0 time slot, according to the time slot sets that occupy of node number ascending order traverse node, node i is occupied
Time slot sets are UiaIf 0 ∈ Uia, then by node i be added to time slot 0 can distribution node set S0k；Partitioning site set Sjk
When, according to time slot in double bounce not conflict principles and routing information, so that each node set SjkIn only one node can
Assigned slot j；After all node sets for obtaining all time slots, it is ranked up according to the number of set interior nodes, in set
When the number of node is identical, arranged according to timeslot number ascending order.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910048626.2A CN109547148B (en) | 2019-01-18 | 2019-01-18 | Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910048626.2A CN109547148B (en) | 2019-01-18 | 2019-01-18 | Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109547148A CN109547148A (en) | 2019-03-29 |
| CN109547148B true CN109547148B (en) | 2019-11-15 |
Family
ID=65835782
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910048626.2A Active CN109547148B (en) | 2019-01-18 | 2019-01-18 | Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109547148B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110225593B (en) * | 2019-07-15 | 2022-05-03 | 桂林电子科技大学 | Random number idle time slot competition method in distributed TDMA protocol |
| CN111246580B (en) * | 2020-01-13 | 2022-03-22 | 西安电子科技大学 | Time slot distribution method for supporting multi-hop streaming service in self-organizing network |
| CN112153742B (en) * | 2020-08-31 | 2022-07-26 | 西安电子科技大学 | MANET network dynamic time slot distribution method, system, equipment and application |
| CN114599101B (en) * | 2022-03-15 | 2022-10-21 | 中国船舶集团有限公司系统工程研究院 | Time slot allocation and network control method for one-station multi-unmanned aerial vehicle measurement and control communication system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101345573A (en) * | 2008-08-22 | 2009-01-14 | 北京航空航天大学 | Time slot numbering management method for carrier channel in MF-TDMA system |
| CN103051410A (en) * | 2013-01-25 | 2013-04-17 | 南京航空航天大学 | Method for enhancing utilization ratio of time slot of self-organization time division multiple access protocol |
| CN106060949A (en) * | 2016-05-23 | 2016-10-26 | 西安电子科技大学 | Time and frequency synchronization full duplex wireless link scheduling method based on TDMA |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8351406B2 (en) * | 2009-12-21 | 2013-01-08 | Intel Corporation | Techniques for dynamic resource allocation |
-
2019
- 2019-01-18 CN CN201910048626.2A patent/CN109547148B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101345573A (en) * | 2008-08-22 | 2009-01-14 | 北京航空航天大学 | Time slot numbering management method for carrier channel in MF-TDMA system |
| CN103051410A (en) * | 2013-01-25 | 2013-04-17 | 南京航空航天大学 | Method for enhancing utilization ratio of time slot of self-organization time division multiple access protocol |
| CN106060949A (en) * | 2016-05-23 | 2016-10-26 | 西安电子科技大学 | Time and frequency synchronization full duplex wireless link scheduling method based on TDMA |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109547148A (en) | 2019-03-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109547148B (en) | Based on the dynamic time slot allocating method of service flow path in TDMA ad hoc network | |
| Wei et al. | Interference-aware IEEE 802.16 WiMax mesh networks | |
| CN105554887B (en) | A kind of Wireless MESH network distributed resource allocation method based on TDMA | |
| CN110366206A (en) | A kind of information transferring method and device | |
| CN104080112B (en) | A kind of method for improving wireless self-organization network service reliability | |
| CN105554888B (en) | More radio frequency multi-Channel Wireless Mesh Network channel allocation algorithms based on link multi tate | |
| CN101568164A (en) | Opportunistic routing algorithm of Ad hoc network based on node priority levels | |
| CN102932275A (en) | Priority message forwarding method applied to allowed time delay network | |
| CN101835099B (en) | Large-scale sensor network routing method based on cluster and RREP broadcast | |
| KR20060067401A (en) | Method for scheduling in a wireless network | |
| Chen et al. | Exploiting spectral reuse in routing, resource allocation, and scheduling for IEEE 802.16 mesh networks | |
| CN114374721A (en) | Power line and wireless communication fusion method and system for power internet of things | |
| CN104427412B (en) | A kind of method and device that bandwidth map updates | |
| CN102970392A (en) | Efficient and rapid address assignment method for LR-WPAN (low rate-wireless personal area network) Mesh network nodes | |
| CN108024228A (en) | A kind of vehicle-mounted net GPSR agreement improved methods based on road network and QOS models | |
| CN102118312B (en) | Hierarchical Ad hoc on-demand distance vector (AODV) routing method | |
| CN102386991B (en) | Timeslot interchange operating method for time division multiple address access system in wireless mobile self-organized network | |
| CN106792972B (en) | A kind of slot allocation method meeting real time data bandwidth demand | |
| KR20090114042A (en) | Method for scheduling packets in wireless mesh network | |
| CN101247327A (en) | Method for implementing dynamic resource obligation of wireless self-organizing network by elephant flow detection | |
| CN102026291B (en) | Cache admission control method in wireless multi-hop mesh network | |
| Zhu et al. | A distributed algorithm for congestion-minimized multi-path routing over ad-hoc networks | |
| Prasetya et al. | A pre-emptive traffic model with cluster-based TDMA for vehicular networks | |
| Wang et al. | Improving the data scheduling efficiency of the ieee 802.16 (d) mesh network | |
| Kim et al. | A novel adaptive routing scheme for the QoS-based multimedia services in mobile 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 |