CN105813218A - Service scheduling method of wireless Ad hoc network - Google Patents
Service scheduling method of wireless Ad hoc network Download PDFInfo
- Publication number
- CN105813218A CN105813218A CN201610248027.1A CN201610248027A CN105813218A CN 105813218 A CN105813218 A CN 105813218A CN 201610248027 A CN201610248027 A CN 201610248027A CN 105813218 A CN105813218 A CN 105813218A
- Authority
- CN
- China
- Prior art keywords
- node
- scheduling
- business
- control centre
- service priority
- 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 33
- 238000004891 communication Methods 0.000 claims abstract description 6
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 claims description 28
- 235000007164 Oryza sativa Nutrition 0.000 claims description 9
- 235000021186 dishes Nutrition 0.000 claims description 9
- 235000009566 rice Nutrition 0.000 claims description 9
- 238000000205 computational method Methods 0.000 claims description 3
- 239000000203 mixture Substances 0.000 claims description 3
- 240000007594 Oryza sativa Species 0.000 claims 1
- 230000009191 jumping Effects 0.000 description 17
- 241000209094 Oryza Species 0.000 description 8
- 230000001737 promoting effect Effects 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 7
- 238000012423 maintenance Methods 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 230000010354 integration Effects 0.000 description 3
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000002347 injection Methods 0.000 description 1
- 239000007924 injection Substances 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012913 prioritisation Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
- 238000001228 spectrum Methods 0.000 description 1
- 238000011282 treatment Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
- H04W72/23—Control channels or signalling for resource management in the downlink direction of a wireless link, i.e. towards a terminal
-
- 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
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
- H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
- H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
Abstract
The invention relates to a scheduling method, and particularly is a service scheduling method of a wireless Ad hoc network, belonging to the technical field of wireless communication networks. According to the method, a specified main node collects network topology information, and selects/updates a scheduling center node; the scheduling center node collects current information of request nodes to complete intermediate speed scheduling for air interface resource of each request node; a local scheduler of each request node performs fast local service scheduling based on the obtained air interface resource, hereby, guarantee capability of QoS (Quality of Service) is promoted based on reduction of scheduling delay of the wireless Ad hoc network, and finally, quality of service of the whole network is promoted.
Description
Technical field
The present invention relates to a kind of dispatching method, the business scheduling method of especially a kind of wireless self-organization network, belong to the technical field of cordless communication network.
Background technology
Wireless self-organization network has two obvious characteristics: the bandwidth resources that channel error rate is high and rare, it is ensured that QoS (QualityOfService) index of wireless self-organization network, and traffic scheduling is a very important problem.It is required for the two problem, designs and not only can guarantee that throughput of system but also can ensure that the dispatching algorithm of fairness.
At present, three class dispatching algorithms: poll RR (RoundRobin), max carrier to interference scheduling algorithm MaxC/I (MaximumCarriertoInterference), proportional fair algorithm PF (ProportionalFairness) it are primarily present in point-to-multipoint field.
In RR guarantee system, all users have identical chance to obtain system resource, and this algorithm does not account for subscriber channel situation, and reliability when user carries out data transmission is not high, it is thus achieved that throughput of system not high yet.Max carrier to interference scheduling algorithm MaxC/I, in each time slot scheduling, always selects the good best user of wireless channel conditions to be scheduling, it is possible to be well adapted for the time variation of wireless channel, but it cannot be guaranteed that fairness between user.Proportional fair algorithm PF obtains the compromise of throughput of system and fairness two indices, make full use of the time-frequency characteristic good user of scheduling channel situation as far as possible of channel, and being dispatched to each user as far as possible, the method does not consider period of reservation of number, it is impossible to ensure Time Delay of Systems.
In mobile Ad hoc network field, due to each node status equity, therefore adopt distributed scheduling, it is a kind of idea naturally that each point fights for resource, but distributed scheduling is relatively difficult to ensure the QoS of card each point business, and additionally, due to hold consultation with periphery neighbor node, therefore scheduling delay is also relatively long.And there is nodal information transmission expense relatively greatly in centralized scheduling, the problem that round trip transmission delay is longer, therefore also less employing in actual applications.
Summary of the invention
It is an object of the invention to overcome the deficiencies in the prior art, it is provided that the business scheduling method of a kind of wireless self-organization network, it can reduce the supportability promoting QoS on the basis of wireless self-organization network scheduling delay, the final service quality promoting whole net.
According to technical scheme provided by the invention, the business scheduling method of described wireless self-organization network, some nodes to composition wireless self-organization network, the communication frequency of each node synchronizes, and the radio frame boundaries of eating dishes without rice or wine of each node synchronizes, and wireless self-organization network adopts time division way step, time-domain resource is divided into continuous print time frame, each time frame includes controlling time frame and data frame, controls time frame and data frame interval in time occurs, and each node all adopts identical time the frame style；
In all nodes of wireless self-organization network, it is determined that control centre's node；When there being service needed to send, except all the other nodes of control centre's node are as requesting node in wireless self-organization network, scheduling request information is reported control centre's node by requesting node on the control time slot belong to described requesting node, when control centre's node also has service needed to send, control centre's node preserves the scheduling request information of described control centre node self；
The scheduling request information that control centre's node each requesting node of collection reports, and the service priority of each requesting node is determined according to collected scheduling request information, and the service priority determining requesting node is ranked up, to obtain scheduling service priority queue；Control centre's node distributes bandwidth of air-interface resource according to scheduling service priority queue, and scheduling result is sent back to each requesting node by control centre's node, and described requesting node receives and preserves scheduling result；
Requesting node determines the link pending of self and the service priority of business, and the service priority determined is ranked up, to form local service priority query；Request results preserves the data slot resource in scheduling result and distributes to the business of correspondence according to local service priority query one by one.
In all nodes of wireless self-organization network, it is determined that the process of control centre's node comprises the steps:
Step s1, in all nodes of wireless self-organization network, it is intended that a node is as host node, and is safeguarded the network topology of wireless self-organization network by host node；
In step s2, described wireless self-organization network, all the other nodes except host node periodically report nodal information to host node, described in the nodal information that reports include node identification, a hop neighbor node identification and two-hop neighbor node mark；
Step s3, host node are according to the nodal information collecting each node, determine each node distance sum Disti to other all nodes, and all distance sum Disti in minimum range sum Disti, node corresponding for minimum range sum Disti is defined as control centre's node by host node；
The nodal information of control centre's node, after determining control centre's node, is sent to each node, so that control centre's node can receive the scheduling request information that requesting node reports by step s4, host node.
In the scheduling request information that requesting node reports, if the service priority of requesting node is calculated by described requesting node oneself, then scheduling request information includes treating scheduling service priority, treats the link belonging to scheduling business, treats the channel quality information of schedule link, treats that scheduling business sends demand and treats the schedule constraints of scheduling business；
If the service priority of requesting node is calculated by control centre's node, then scheduling request information include treating scheduling node Congestion Level SPCC, treat schedule link channel quality, treat scheduling business first packet time delay, treat scheduling business demand, treat the scheduled speed of scheduling business, the scheduling bucket size treating scheduling business and actual amount of water.
The computational methods of described service priority are:
SchPri=eff/r (t) × DgBlock × Delay × VolumRemin/Volum
Wherein, SchPri is service priority, eff is the channel quality information treating schedule link, r (t) is for treating the scheduled speed of scheduling business, DgBlock is for treating scheduling node Congestion Level SPCC, Delay is the first packet time delay treating scheduling business, and VolumRemin is actual amount of water, and Volum is the scheduling bucket size treating scheduling business；
Described service priority, after the service priority determining each requesting node, is arranged by control centre's node from high to low, to obtain scheduling service priority queue.
The scheduling result that described control centre node sends includes the data slot position/length information of the node identification of requesting node, distribution.
After all business have all been dispatched, or after all available time interval resources are all assigned, requesting node is according to schedule link, the time interval resource of reformation each of the links.
Advantages of the present invention: by the host node collection network topology information specified, selects/updates control centre's node；Control centre's node completes the middling speed to each requesting node interface-free resources by the information that collection requesting node is current to be dispatched；The scheduler that each requesting node is local, based on the interface-free resources got, carries out quick local service scheduling, is reducing, with this, the supportability promoting QoS on the basis of wireless self-organization network scheduling delay, the final service quality promoting whole net.
Accompanying drawing explanation
Fig. 1 is the node topology schematic diagram of the present invention.
Fig. 2 is traffic scheduling schematic diagram of the present invention.
Fig. 3 is traffic scheduling process schematic of the present invention.
Fig. 4 is traffic scheduling flow chart of the present invention.
Fig. 5 is resource of the present invention distribution schematic diagram.
Detailed description of the invention
Below in conjunction with concrete drawings and Examples, the invention will be further described.
In order to enable to reduce the supportability promoting QoS on the basis of wireless self-organization network scheduling delay, the final service quality promoting whole net, the business scheduling method of the wireless self-organization network of the present invention, specifically include: the some nodes to composition wireless self-organization network, the communication frequency of each node synchronizes, and the radio frame boundaries of eating dishes without rice or wine of each node synchronizes, wireless self-organization network adopts time division way step, time-domain resource is divided into continuous print time frame, each time frame includes controlling time frame and data frame, control time frame and data frame interval in time occurs, and each node all adopts identical time the frame style；
In all nodes of wireless self-organization network, it is determined that control centre's node；When there being service needed to send, except all the other nodes of control centre's node are as requesting node in wireless self-organization network, scheduling request information is reported control centre's node by requesting node on the control time slot belong to described requesting node, when control centre's node also has service needed to send, control centre's node preserves the scheduling request information of described control centre node self；
The scheduling request information that control centre's node each requesting node of collection reports, and the service priority of each requesting node is determined according to collected scheduling request information, and the service priority determining requesting node is ranked up, to obtain scheduling service priority queue；Control centre's node distributes bandwidth of air-interface resource according to scheduling service priority queue, and scheduling result is sent back to each requesting node by control centre's node, and described requesting node receives and preserves scheduling result；
Requesting node determines the link pending of self and the service priority of business, and the service priority determined is ranked up, to form local service priority query；Request results preserves the data slot resource in scheduling result and distributes to the business of correspondence according to local service priority query one by one.
Specifically, in wireless self-organization network, the communication frequency of all nodes synchronizes, and the radio frame boundaries of eating dishes without rice or wine of each node synchronizes, and namely the initial radio frame boundaries of different nodes exists the contact set, absolute deviation in preset range, 2 times of time delay of such as eating dishes without rice or wine.In the embodiment of the present invention, the resource of scheduling is the time-domain resource eated dishes without rice or wine, minimum scheduling granularity is a time slot, multiple time slots can form a time frame, time frame can be divided into control time frame and data frame based on purposes, controlling time frame and data frame interval in time occurs, all nodes all adopt identical data slot pattern.
Further, in all nodes of wireless self-organization network, it is determined that the process of control centre's node comprises the steps:
Step s1, in all nodes of wireless self-organization network, it is intended that a node is as host node, and is safeguarded the network topology of wireless self-organization network by host node；
In step s2, described wireless self-organization network, all the other nodes except host node periodically report nodal information to host node, described in the nodal information that reports include node identification, a hop neighbor node identification and two-hop neighbor node mark；
Step s3, host node are according to the nodal information collecting each node, determine each node distance sum Disti to other all nodes, and all distance sum Disti in minimum range sum Disti, node corresponding for minimum range sum Disti is defined as control centre's node by host node；
The nodal information of control centre's node, after determining control centre's node, is sent to each node, so that control centre's node can receive the scheduling request information that requesting node reports by step s4, host node.
In the embodiment of the present invention, the function of control centre's node is by scheduling, provides resource for all the other nodes in wireless self-organization network.For reducing each node scheduling relevant control signalling expense to control centre's node, and reducing each node propagation delay time to control centre's node, the selection of control centre needs to consider the immediate neighbor node number of each node and whole net topology.
Specify the node that can network at first as the node of host node or the minimum node of the whole network physical address for the whole network, it is possible to for other modes, such as network management configuration, each system can confirm voluntarily.It is determined by each node distance sum Disti to other all nodes, it is possible to obtain the distance sum Disti of all nodes；When the distance sum Disit that there is multiple node identical and all minimum time, it is possible to optionally one of them node is as control centre's node.When carrying out scheduling of resource, control centre's node can also arrange different selection schemes based on different demands, and such as: the node that in the whole network, a hop neighbor number is maximum, but this scheme empty overhead and whole net scheduling delay are larger.After control centre's node is chosen successfully, it is possible to upgrading becomes new host node, it is also possible to maintain original host node constant,
In the scheduling request information that requesting node reports, if the service priority of requesting node is calculated by described requesting node oneself, then scheduling request information includes treating scheduling service priority, treats the link belonging to scheduling business, treats the channel quality information of schedule link, treats that scheduling business sends demand and treats the schedule constraints of scheduling business；
If the service priority of requesting node is calculated by control centre's node, then scheduling request information include treating scheduling node Congestion Level SPCC, treat schedule link channel quality, treat scheduling business first packet time delay, treat scheduling business demand, treat the scheduled speed of scheduling business, the scheduling bucket size treating scheduling business and actual amount of water.
In the embodiment of the present invention, the capability value of scheduling bucket characterizes the heap(ed) capacity that a class business is dispatched every time, and its occurrence, according to concrete traffic set, is designated as Volum, one scheduling bucket of each class service maintenance.Requesting node safeguards the speed of certain class business in a period of time by dispatching bucket water filling, i.e. the maintenance schedule bucket water yield.If note after the water yield (in injected water volume+bucket original water yield) less than this scheduling bucket size, then actual amount of water namely note after the water yield；If the water yield is more than or equal to this scheduling bucket size after note, then namely actual amount of water dispatches a barrel size.Represent the Mean Speed of this business by actual amount of water, be designated as VolumRemin.
Do not arrive when controlling time slot, and when node currently has data slot can use, for accelerating schedule speed, dispatch request can also send with data.
The computational methods of described service priority are:
SchPri=eff/r (t) × DgBlock × Delay × VolumRemin/Volum
Wherein, SchPri is service priority, eff is the channel quality information treating schedule link, r (t) is for treating the scheduled speed of scheduling business, DgBlock is for treating scheduling node Congestion Level SPCC, Delay is the first packet time delay treating scheduling business, and VolumRemin is actual amount of water, and Volum is the scheduling bucket size treating scheduling business；
Described service priority, after the service priority determining each requesting node, is arranged by control centre's node from high to low, to obtain scheduling service priority queue.
In the embodiment of the present invention, from scheduling service priority queue, take out business successively according to priority order from high to low, distribute interface-free resources.The resource quantity of concrete distribution is by treating the scheduling bucket actual amount of water of scheduling business, treating the quality and treat that the data available time interval resource of scheduling node together decides on of eating dishes without rice or wine of schedule link.
After having dispatched, all Resources allocation of each scheduled requesting node are sued for peace by control centre's node, undertaken integrating distribution by an all allocated service resources of requesting node, reduce time-domain resource at internodal switching times with this, finally promote air-interface efficiency.After scheduling completes, if also having valid data time slot unallocated, then these time interval resources are all given each node, to ensure the real-time of business.
The scheduling result that described control centre node sends includes the data slot position/length information of the node identification of requesting node, distribution.In the embodiment of the present invention, requesting node, after preserving scheduling result, starts local resource scheduling after the local scheduling time arrives.
When local resource is dispatched, detailed process is: oneself link pending and business are carried out priority calculating and sort by requesting node, and this priority calculates and adopts the priority calculation that above-mentioned control centre node is identical to carry out.And after sequence, obtain local service priority query.
The data slot resource obtained in scheduling result is distributed to each business according to local first level queue order from high to low by requesting node one by one, and the number of resources of concrete distribution needs to consider treat the quality of schedule link and treat the outgoing data amount of scheduling business.After all business have all been dispatched, or after all available time slot resources is all assigned, requesting node according to treating schedule link, the time interval resource of reformation each of the links, to reduce empty overhead, finish node is according to each of the links transport service on the corresponding time interval resource eated dishes without rice or wine.
After local service scheduling of resource completes, it is necessary to updating the scheduling bucket water yield, for each business, its actual amount of water is updated to former actual amount of water and deducts the part dispatched away.
As shown in Fig. 1～Fig. 5, the present invention is described in detail in conjunction with specific embodiments.
Fig. 1 is a radio self-organized network nodes example topology, and wherein lightning mark representation node transmission information can reach.Being the traffic scheduling process that the present invention is introduced in representative with this figure, the traffic scheduling mechanism of the present invention is not limited thereto topological structure.
Fig. 2 is the schematic diagram of traffic scheduling, the first half shows eight nodes (Node0～7) published picture in a topology, each node has business (representing with CID) needs not of the same race to send to other nodes, the node that each two is jumped at a distance of one constitutes a link (representing with Link), this figure does not represent each node this five kinds of service needed transmissions, these business and scheduler object；The data slot resource that the latter half display systems has, this system resource is very limited amount of, it is necessary to or even it reasonably distributes to the node a certain business of node, it is ensured that the service quality of each Business Stream and fairness.
Table one illustrates the business information classification of scheduling, in the embodiment of the present invention, according to different five classes that business is divided into of type of service, different system can carry out the division of kind according to the business of oneself, the five class business that this example divides are respectively: control class message, voice, time-frequency, service broadcast and best-effort traffic, its priority reduces successively, for one scheduling bucket of each service maintenance.Such as controlling class message, the scheduling bucket size that this example is its maintenance is 10KB, and this size can change, shown in table specific as follows.
Table 1
| CID | Class of business | Scheduling bucket size |
| 3 | Control class message | 10KB |
| 4 | Speech information | 400KB |
| 5 | Video traffic | 500KB |
| 6 | Service broadcast | 4MB |
| 7 | Best-effort traffic | 5MB |
Business scheduling process is introduced, particularly as follows: the first step is selection scheduling Centroid for the topological structure of Fig. 1.First designated host, owing to node 0 physical address is minimum, it is intended that for host node；When arrival node reports nodal information, each node reports nodal information (including node identification, a jumping and two-hop neighbors mark) to host node；Reporting end, host node selection scheduling Centroid, it is minimum to other nodal distance sums for selecting rule, namely minimum with the jumping figure sum of all nodes.Topology for Fig. 1, between node 0 and node 1, jumping figure is 1, with jumping figure is 2 between node 2, with jumping figure is 2 between node 3, with jumping figure is 2 between node 4, and between node 5, jumping figure is 1, and between node 6, jumping figure is 1, with jumping figure is 2 between node 7, node 0 and all node jumping figure summations are 11；Node 1 and all node jumping figure summations are 11；Node 2 and all node jumping figure summations are 11；Node 3 and all node jumping figure summations are 11；Node 4 and all node jumping figure summations are 13；Node 5 and all node jumping figure summations are 8；Node 6 and all node jumping figure summations are 13；Node 7 and all node jumping figure summations are 14.So node 5 becomes control centre's node；This result is told each node by node 0 in a broadcast manner.
Next to that centralized node scheduling process, this example interior joint 2 to send to node 3 and to control class business information, will send business to node 5, also have node 1 to send other demands such as information to node 0 and node 7.Each node to be sent needs to apply for resource to control centre's node 5, different according to the position that service priority calculates, and is divided into two kinds to realize method, requesting node oneself calculate priority and calculated priority by control centre's node, introducing respectively at this.Detailed process is as it is shown on figure 3, comprise the following steps:
A), dispatching priority is calculated by requesting node oneself:
1), requesting node (node 2,1,3,4 etc.) send dispatch request at the control time slot of oneself to node 5, dispatch request carries following information: treat scheduling service priority, treat schedule link channel quality information (eff), treat scheduling business send demand (Demand), scheduling bucket actual amount of water (VolumRemin).Treat that scheduling service priority is calculated by below equation for each business:
SchPri=eff/r (t) × DgBlock × Delay × VolumRemin/Volum
Wherein, treat that scheduling node Congestion Level SPCC (DgBlock) can be calculated by the ratio of the past period interior nodes busy channel；The time interval resource got until this business in the last scheduling slot of scheduled speed (r (t)) i.e. of scheduling business remove physical layer overhead and MAC layer expense after net data rate；Treat that the channel quality (eff) of schedule link can be determined jointly according to physical layer transmission pattern and antenna mode；Each business packet arrives MAC layer, is all preserved itself and its time of advent, and Delay and current time deduct the time of advent arriving bag in this type of service the earliest；Demand i.e. this type of service treats scheduling business packet size；Volum is every kind of service maintenance by each node according to traffic table；According to the portfolio size Demand in scheduling request information to the scheduling bucket water filling of each business, the water yield after injection not can exceed that the heap(ed) capacity of bucket.After water filling, the actual amount of water in bucket is: VolumRemin=Min ((VolumRemin+Demand), Volum), its priority result is preserved by requesting node for every kind of business.
2), control centre's node 5 receive the request message of requesting node, treating scheduling service priority in asking according to each node scheduling, all business being carried out prioritization, obtains scheduling service priority queue.
3), to the ranked business completed; it is its Resources allocation from high to low from priority; the resource size of distribution is this traffic scheduling bucket actual amount of water; reject distributing business completely from this priority query; if adjacent two kinds of business belong to different node; then need to increase protection interval GAP, the lower a kind of business of reallocation, until existing system resource is all assigned or business demand is all assigned (priority query is sky)；If there is some business of node be not yet assigned to the situation of resource, then continue the request of this traffic scheduling is sent to control centre's node in upper once dispatch request；If there is this service request to be all assigned, existing resource also has remaining situation, then these time interval resources are all given each requesting node, to ensure the real-time of business.
4), control centre's node 5 resource that all business of same requesting node are distributed sue for peace, the different business resource being scattered in diverse location by a node carries out comprehensively, being integrated into the whole resource of a node.The order that integration method can be incremented by according to time slot, in units of node, adds up the time slot size of each scheduled business of node each of the links, the time slot size that the time slot of this sub-distribution is assigned with according to each node is reassigned to each node.Fig. 5 provides an example, in one frame, data slot block is given to the different business of different node, integrate and the different business of node same in this frame is put together, this Integration Mode be by with this to reduce internodal switching, reduce internodal protection interval, eight block protection intervals are comprised before Fig. 5 integrates, five pieces are become after integration, the resource at the protection interval reduced distributes to the another kind of business that the priority of last node is lower slightly, or distribute to the highest priority traffic of also unassigned resource in priority query, each system can adopt Different treatments, make full use of frequency spectrum resource in this way.
5), this scheduling result is sent by control centre's node 5 at control time slot.
B), dispatching priority is calculated by control centre's node:
1), requesting node send dispatch request at the control time slot of oneself to node 5, dispatch request carries following information: treats scheduling node Congestion Level SPCC (DgBlock), treat the link belonging to scheduling business, treat the channel quality (eff) of schedule link, treat scheduling type of service, treat the scheduled speed (r (t)) of scheduling business, treat scheduling business first packet time delay (Delay), treat scheduling business demand (Demand), scheduling bucket size (Volum) treating scheduling business and actual amount of water (VolumRemin).
2), control centre's node 5 receive the request message of requesting node, when arriving the time being scheduling, adopt and requesting node calculate priority same procedure and calculates service priority, step afterwards is consistent with said method.
This information is preserved by each requesting node after receiving scheduling result, opens local service scheduling process after the local scheduling time arrives.Oneself link pending and business are carried out priority calculating and sort (if centralized dispatching adopts requesting node to calculate priority by requesting node, now need not calculate priority again), this priority calculates and adopts the priority calculation that above-mentioned control centre node is identical to carry out.From high to low the business of request is ranked up according to the service priority calculated, forms a local service priority query.
The data slot resource obtained in scheduling result is distributed to each business according to local first level queue by requesting node one by one.The order from high to low of business in priority query is taken out by requesting node successively, and the resource size for its distribution is the actual amount of water in scheduling bucket, until after the resource having is assigned or all available time slot resources are all assigned.After all business have all been dispatched, node is according to treating schedule link, the time interval resource of reformation each of the links, the business of each link is all integrated together by the method reallocated resources according to centralized dispatching, to reduce empty overhead, finish node is according to each of the links transport service on the corresponding time interval resource eated dishes without rice or wine.
Adopt the mode that requesting node calculates service priority can reduce the information size of transmission, reduce the size controlling time slot further, save resource；Reduce amount of calculation and the amount of storage of control centre's node simultaneously.
The present embodiment only sets forth traffic dispatch for a kind of topological structure, and all the other situations can similar process, and does not elaborate at this.
The present invention host node collection network topology information by specifying, selects/updates control centre's node；Control centre's node completes the middling speed to each requesting node interface-free resources by the information that collection requesting node is current to be dispatched；The scheduler that each requesting node is local, based on the interface-free resources got, carries out quick local service scheduling, with this to reduce the supportability promoting QoS on the basis of wireless self-organization network scheduling delay, and the final service quality promoting whole net.
Claims (6)
1. the business scheduling method of a wireless self-organization network, it is characterized in that: the some nodes to composition wireless self-organization network, the communication frequency of each node synchronizes, and the radio frame boundaries of eating dishes without rice or wine of each node synchronizes, wireless self-organization network adopts time division way step, and time-domain resource is divided into continuous print time frame, and each time frame includes controlling time frame and data frame, control time frame and data frame interval in time occurs, and each node all adopts identical time the frame style；
In all nodes of wireless self-organization network, it is determined that control centre's node；When there being service needed to send, except all the other nodes of control centre's node are as requesting node in wireless self-organization network, scheduling request information is reported control centre's node by requesting node on the control time slot belong to described requesting node, when control centre's node also has service needed to send, control centre's node preserves the scheduling request information of described control centre node self；
The scheduling request information that control centre's node each requesting node of collection reports, and the service priority of each requesting node is determined according to collected scheduling request information, and the service priority determining requesting node is ranked up, to obtain scheduling service priority queue；Control centre's node distributes bandwidth of air-interface resource according to scheduling service priority queue, and scheduling result is sent back to each requesting node by control centre's node, and described requesting node receives and preserves scheduling result；
Requesting node determines the link pending of self and the service priority of business, and the service priority determined is ranked up, to form local service priority query；Request results preserves the data slot resource in scheduling result and distributes to the business of correspondence according to local service priority query one by one.
2. the business scheduling method of wireless self-organization network according to claim 1, is characterized in that: in all nodes of wireless self-organization network, it is determined that the process of control centre's node comprises the steps:
Step s1, in all nodes of wireless self-organization network, it is intended that a node is as host node, and is safeguarded the network topology of wireless self-organization network by host node；
In step s2, described wireless self-organization network, all the other nodes except host node periodically report nodal information to host node, described in the nodal information that reports include node identification, a hop neighbor node identification and two-hop neighbor node mark；
Step s3, host node are according to the nodal information collecting each node, determine each node distance sum Disti to other all nodes, and all distance sum Disti in minimum range sum Disti, node corresponding for minimum range sum Disti is defined as control centre's node by host node；
The nodal information of control centre's node, after determining control centre's node, is sent to each node, so that control centre's node can receive the scheduling request information that requesting node reports by step s4, host node.
3. the business scheduling method of wireless self-organization network according to claim 1, it is characterized in that: in the scheduling request information that requesting node reports, if the service priority of requesting node is calculated by described requesting node oneself, then scheduling request information includes treating scheduling service priority, treats the link belonging to scheduling business, treats the channel quality information of schedule link, treats that scheduling business sends demand and treats the schedule constraints of scheduling business；
If the service priority of requesting node is calculated by control centre's node, then scheduling request information include treating scheduling node Congestion Level SPCC, treat schedule link channel quality, treat scheduling business first packet time delay, treat scheduling business demand, treat the scheduled speed of scheduling business, the scheduling bucket size treating scheduling business and actual amount of water.
4. the business scheduling method of wireless self-organization network according to claim 3, is characterized in that: the computational methods of described service priority are:
SchPri=eff/r(t)×DgBlock×Delay×VolumRemin/Volum
Wherein, SchPri is service priority, eff is the channel quality information treating schedule link, r (t) is for treating the scheduled speed of scheduling business, DgBlock is for treating scheduling node Congestion Level SPCC, Delay is the first packet time delay treating scheduling business, and VolumRemin is actual amount of water, and Volum is the scheduling bucket size treating scheduling business；
Described service priority, after the service priority determining each requesting node, is arranged by control centre's node from high to low, to obtain scheduling service priority queue.
5. the business scheduling method of wireless self-organization network according to claim 1, is characterized in that: the scheduling result that described control centre node sends includes the data slot position/length information of the node identification of requesting node, distribution.
6. the business scheduling method of wireless self-organization network according to claim 1, is characterized in that: after all business have all been dispatched, or after all available time interval resources are all assigned, requesting node is according to schedule link, the time interval resource of reformation each of the links.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610248027.1A CN105813218B (en) | 2016-04-20 | 2016-04-20 | The business scheduling method of wireless self-organization network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610248027.1A CN105813218B (en) | 2016-04-20 | 2016-04-20 | The business scheduling method of wireless self-organization network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105813218A true CN105813218A (en) | 2016-07-27 |
| CN105813218B CN105813218B (en) | 2019-05-07 |
Family
ID=56458207
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610248027.1A Active CN105813218B (en) | 2016-04-20 | 2016-04-20 | The business scheduling method of wireless self-organization network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105813218B (en) |
Cited By (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107888639A (en) * | 2016-09-30 | 2018-04-06 | 电信科学技术研究院 | Resource reservation cycle granularity P configuration, instruction and determination method, apparatus |
| CN110113787A (en) * | 2019-05-23 | 2019-08-09 | 深圳市烽云技术有限公司 | Wireless self-networking resource dynamic on-demand distribution method, apparatus and system |
| CN110213833A (en) * | 2019-06-14 | 2019-09-06 | 辰芯科技有限公司 | Star-like ad-hoc network uplink scheduling request dispatching method and its star-like ad-hoc network |
| CN110446264A (en) * | 2019-08-15 | 2019-11-12 | 深圳市烽云技术有限公司 | A kind of wireless self-networking multi-hop broadcast scheduling method and device |
| CN110737521A (en) * | 2019-10-14 | 2020-01-31 | 中国人民解放军32039部队 | Disaster recovery method and device based on task scheduling center |
| CN111954267A (en) * | 2020-08-25 | 2020-11-17 | 无锡职业技术学院 | Method for improving transmission efficiency of wireless ad hoc network |
| CN113709884A (en) * | 2021-09-26 | 2021-11-26 | 中车青岛四方机车车辆股份有限公司 | Communication resource allocation method and device |
| CN114257594A (en) * | 2021-12-21 | 2022-03-29 | 四川灵通电讯有限公司 | Method for distributing network resources to user network side in distributed system |
| CN114630402A (en) * | 2021-11-23 | 2022-06-14 | 杭州安脉盛智能技术有限公司 | Wireless sensor data synchronous acquisition system and method |
| CN115442313A (en) * | 2022-07-20 | 2022-12-06 | 中通服咨询设计研究院有限公司 | Wide-area deterministic service flow online scheduling system |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360028A (en) * | 2008-07-24 | 2009-02-04 | 华中科技大学 | Real-time scheduling method suitable for industrial sensor network |
| CN103281793A (en) * | 2013-05-30 | 2013-09-04 | 重庆邮电大学 | Node dynamic dispatching method suitable for wireless body area network under emergency condition |
| CN103974423A (en) * | 2014-05-08 | 2014-08-06 | 江苏物联网研究发展中心 | Wireless frame length self-adaption communication method and node equipment |
-
2016
- 2016-04-20 CN CN201610248027.1A patent/CN105813218B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101360028A (en) * | 2008-07-24 | 2009-02-04 | 华中科技大学 | Real-time scheduling method suitable for industrial sensor network |
| CN103281793A (en) * | 2013-05-30 | 2013-09-04 | 重庆邮电大学 | Node dynamic dispatching method suitable for wireless body area network under emergency condition |
| CN103974423A (en) * | 2014-05-08 | 2014-08-06 | 江苏物联网研究发展中心 | Wireless frame length self-adaption communication method and node equipment |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107888639B (en) * | 2016-09-30 | 2020-08-04 | 电信科学技术研究院 | Method and device for configuring, indicating and determining resource reservation period granularity P |
| CN107888639A (en) * | 2016-09-30 | 2018-04-06 | 电信科学技术研究院 | Resource reservation cycle granularity P configuration, instruction and determination method, apparatus |
| CN110113787A (en) * | 2019-05-23 | 2019-08-09 | 深圳市烽云技术有限公司 | Wireless self-networking resource dynamic on-demand distribution method, apparatus and system |
| CN110113787B (en) * | 2019-05-23 | 2022-05-03 | 深圳市烽云技术有限公司 | Method, device and system for dynamically allocating wireless ad hoc network resources according to needs |
| CN110213833A (en) * | 2019-06-14 | 2019-09-06 | 辰芯科技有限公司 | Star-like ad-hoc network uplink scheduling request dispatching method and its star-like ad-hoc network |
| CN110446264A (en) * | 2019-08-15 | 2019-11-12 | 深圳市烽云技术有限公司 | A kind of wireless self-networking multi-hop broadcast scheduling method and device |
| CN110737521A (en) * | 2019-10-14 | 2020-01-31 | 中国人民解放军32039部队 | Disaster recovery method and device based on task scheduling center |
| CN111954267A (en) * | 2020-08-25 | 2020-11-17 | 无锡职业技术学院 | Method for improving transmission efficiency of wireless ad hoc network |
| CN113709884A (en) * | 2021-09-26 | 2021-11-26 | 中车青岛四方机车车辆股份有限公司 | Communication resource allocation method and device |
| CN113709884B (en) * | 2021-09-26 | 2023-11-10 | 中车青岛四方机车车辆股份有限公司 | Communication resource allocation method and device |
| CN114630402A (en) * | 2021-11-23 | 2022-06-14 | 杭州安脉盛智能技术有限公司 | Wireless sensor data synchronous acquisition system and method |
| CN114257594A (en) * | 2021-12-21 | 2022-03-29 | 四川灵通电讯有限公司 | Method for distributing network resources to user network side in distributed system |
| CN114257594B (en) * | 2021-12-21 | 2023-12-01 | 四川灵通电讯有限公司 | Method for distributing network resource to user network side in distributed system |
| CN115442313A (en) * | 2022-07-20 | 2022-12-06 | 中通服咨询设计研究院有限公司 | Wide-area deterministic service flow online scheduling system |
| CN115442313B (en) * | 2022-07-20 | 2023-09-19 | 中通服咨询设计研究院有限公司 | Online scheduling system for wide area deterministic service flow |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105813218B (en) | 2019-05-07 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105813218A (en) | Service scheduling method of wireless Ad hoc network | |
| CN101111070B (en) | Fairness resource scheduling method based on resource scheduling in broadband wireless access system | |
| CN105657843B (en) | A kind of outbound capacity is limited the outbound resource regulating method of asymmetric satellite channel and device | |
| CN101286946B (en) | Method of service flow access control and bandwidth allocation based on OFDM system | |
| CN101262651B (en) | Base station downlink data dispatching method and system in broadband wireless MAN | |
| CN101883380B (en) | Method and device for selecting terminal during congestion processing | |
| CN105263143B (en) | The slot allocation method of adaptive session dot density and load in self-organizing network | |
| CN104301933B (en) | A kind of method for being used for computation bandwidth and distribution bandwidth in wireless self-networking | |
| CN104507172A (en) | Upstream resource dispatching method and device directed at 3G (the 3rd generation telecommunication)/4G (the fourth generation telecommunication) satellite mobile communication network | |
| CN108093485B (en) | Resource allocation method and device | |
| KR20040051007A (en) | Apparatus and method for dynamic resource allocation in interactive satellite multimedia system | |
| CN103067985A (en) | Super-speed wireless local area network channel binding and allocation method based on channel quality | |
| CN109561513A (en) | A kind of distribution Lothrus apterus ad hoc network multiple access protocol | |
| CN103096415A (en) | Route optimizing device and method catering to perceive wireless mesh network | |
| CN110113787A (en) | Wireless self-networking resource dynamic on-demand distribution method, apparatus and system | |
| CN111510926A (en) | Visible light communication and WiFi heterogeneous convergence network and resource scheduling method | |
| CN102076097B (en) | Resource scheduling method and base station | |
| CN109618375A (en) | UAV ad hoc network timeslot scheduling algorithm based on service priority and channel interruption probability | |
| CN102131298B (en) | Method for allocating downlink resources | |
| CN102378261B (en) | Method and device for coordinating downlink interference of long term evolution system | |
| CN105554886A (en) | Method and device for resource scheduling | |
| CN100356812C (en) | Method for dynamic channel allocation of multi carrier time division duplex communication system | |
| CN102256214A (en) | Dynamic channel allocation method for comprehensive services and transmission characteristics of CDMA (Code Division Multiple Access) cluster system | |
| CN101662419A (en) | Method, device and system for realizing resource reservation | |
| US20110134891A1 (en) | WiMAX Scheduling Algorithm for Co-Located WiFi and WiMAX Central Points |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| PP01 | Preservation of patent right |
Effective date of registration: 20230905 Granted publication date: 20190507 |
|
| PP01 | Preservation of patent right | ||
| PD01 | Discharge of preservation of patent |
Date of cancellation: 20240119 Granted publication date: 20190507 |
|
| PD01 | Discharge of preservation of patent |