CN109873723A - Bandwidth on-demand distribution method based on node traffic priority - Google Patents
Bandwidth on-demand distribution method based on node traffic priority Download PDFInfo
- Publication number
- CN109873723A CN109873723A CN201910147957.1A CN201910147957A CN109873723A CN 109873723 A CN109873723 A CN 109873723A CN 201910147957 A CN201910147957 A CN 201910147957A CN 109873723 A CN109873723 A CN 109873723A
- Authority
- CN
- China
- Prior art keywords
- node
- data
- central controller
- frame
- 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 20
- 230000005540 biological transmission Effects 0.000 claims abstract description 29
- 238000011144 upstream manufacturing Methods 0.000 claims abstract description 14
- 230000006855 networking Effects 0.000 claims abstract description 6
- 238000012546 transfer Methods 0.000 claims abstract description 6
- 238000005538 encapsulation Methods 0.000 claims description 4
- 230000004044 response Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 230000004069 differentiation Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 230000008901 benefit Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of bandwidth on-demand distribution methods based on node traffic priority, comprising: networking stage, central controller record the service priority of node；Data transfer phase, central controller send request of data frame to node, sequentially poll node；After node receives request of data frame, judge whether present node has upstream data to need to send, if nothing, then return to acknowledgement frame, and no data label is carried out, continue poll next node, if having, then send data to central controller, if still there is data transmission, data markers have been carried out, and will confirm that frame is sent to central controller together with data, continue the poll node, until the node no data sends or reach maximum transmission opportunity limitation；It repeats the above steps to all node polls and finishes, by distinguishing the different service priority of node, ensure the demand of high bandwidth business to a certain extent, guarantee the relative fairness of bandwidth allocation between each priority, improve bandwidth availability ratio.
Description
Technical field
The present invention relates to network communication technology fields, and in particular to a kind of bandwidth on-demand based on node traffic priority point
Method of completing the square.
Background technique
The rapid development of Internet is so that the type of business transmitted in network increases, in the situation that Internet resources are limited
Under, when a large amount of transmission simultaneously of multiple business data, it is likely to result in the congestion of network, traditional network, which only provides, does one's best
Service, cannot be effectively ensured the demand of the high business of requirement of real-time, when different business priority distinguishes, in competitive way
Under, the probability to collide increases, and causes channel utilization low, is unable to satisfy the network performance demand of real time business.It is concentrating
In formula network environment, node by the way of poll in single polled network, efficiency is inefficient.
How in the case where limited bandwidth resource, the utilization rate of bandwidth is improved, to multiple business in centralized network
The differentiation for carrying out priority distributes transmission opportunity by service priority, to guarantee that the transmission quality of high-priority service, balance are each
A priority service occupied bandwidth, to guarantee the relative fairness of bandwidth allocation between each priority.
But the bandwidth allocation methods fixed according to priority, it is be easy to cause the waste of bandwidth, i.e. bandwidth resources cannot get
Adequately utilize.For example high-priority service distributes excessive bandwidth, it is possible that no data transmits in data transmission procedure
The case where, this will result in the waste of resource.
Summary of the invention
In order to solve the above technical problems, the invention proposes a kind of bandwidth on-demand distribution sides based on node traffic priority
Method guarantees the relative fairness of bandwidth allocation between each priority, improves bandwidth to reach the demand for ensureing high bandwidth business
The purpose of utilization rate.
In order to achieve the above objectives, technical scheme is as follows: a kind of bandwidth on-demand based on node traffic priority
Distribution method, which comprises
Step 1, networking stage: the service priority of central controller record node；
Step 2, data transfer phase: central controller sends request of data frame to node, sequentially poll node；
Step 3, after node receives request of data frame, judge whether present node has upstream data to need to send, if
Present node does not have upstream data transmission, then present node only returns to acknowledgement frame to central controller, and to the number in acknowledgement frame
No data label is carried out according to tag field, central controller continues poll next node, if present node has upstream data hair
It send, then sends data to central controller, if still thering is upstream data to send in node, to the data mark in acknowledgement frame
Note field has carried out data markers, and the acknowledgement frame after label is sent to central controller, central controller together with data
Continue the poll node, until the node no data sends or reach maximum transmission opportunity limitation；
Step 4, step 1-3 is repeated until all node polls finish.
Further, the service priority of central controller record node specifically: node is by the industry of node itself
Business precedence information is encapsulated into access request frame, and access request frame is sent to central controller, central controller note by node
Record the service priority of node.
Further, it is by data markers field mark that the data markers field in acknowledgement frame, which carries out no data label,
Be denoted as 0, to the data markers field in acknowledgement frame carried out data markers be by data markers field mark be 1.
The present invention has the advantage that
(1) the present invention ensures the need of high bandwidth business by distinguishing the different service priority of node to a certain extent
It asks, guarantees the relative fairness of bandwidth allocation between each priority, improve the handling capacity of network data transmission.
(2) the present invention is by judging whether node has more data to transmit, to improve bandwidth availability ratio.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described.
Fig. 1 is the bandwidth on-demand distribution method flow chart disclosed by the embodiments of the present invention based on node traffic priority；
Fig. 2 is acknowledgement frame form schematic diagram disclosed by the embodiments of the present invention；
Fig. 3 is tree network topology schematic diagram disclosed by the embodiments of the present invention.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description.
The present invention provides a kind of bandwidth on-demand distribution method based on node traffic priority, principle is to pass through differentiation
The different service priority of node ensures the demand of high bandwidth business to a certain extent, guarantees bandwidth between each priority
The relative fairness of distribution improves the handling capacity of network data transmission, to reach the demand for ensureing high bandwidth business, guarantees each
The relative fairness of bandwidth allocation between priority, improves the purpose of bandwidth availability ratio.
Below with reference to embodiment and specific embodiment, the present invention is described in further detail.
As shown in Figure 1, a kind of bandwidth on-demand distribution method based on node traffic priority, which comprises
Step 1, networking stage: the service priority of central controller record node；
Step 2, data transfer phase: central controller sends request of data frame to node, sequentially poll node；
Step 3, after node receives request of data frame, judge whether present node has upstream data to need to send, if
Present node does not have upstream data transmission, then present node only returns to acknowledgement frame to central controller, and to the number in acknowledgement frame
No data label is carried out according to tag field, central controller continues poll next node, if present node has upstream data hair
It send, then sends data to central controller, if still thering is upstream data to send in node, to the data mark in acknowledgement frame
Note field has carried out data markers, and the acknowledgement frame after label is sent to central controller, central controller together with data
Continue the poll node, until the node no data sends or reach maximum transmission opportunity limitation；
Step 4, step 1-3 is repeated until all node polls finish.
Wherein, data markers field is more-data field, and 1 bit is accounted in acknowledgement frame.
Wherein, the service priority of the central controller record node specifically: node is excellent by the business of node itself
For first grade Information encapsulation into access request frame, access request frame is sent to central controller, central controller record section by node
The service priority of point.
Wherein, it is to be by data markers field mark that the data markers field in acknowledgement frame, which carries out no data label,
0, to the data markers field in acknowledgement frame carried out data markers be by data markers field mark be 1.
Wherein, frame format is as shown in Fig. 2, frame control domain is described as follows: type: accounting for 2 bits, frame can be divided into 4 kinds
Type uses control frame, management frame, data frame at present.
Subtype: accounting for 4 bits, for distinguishing the frame of same type difference subtype.
Type of service: 2 bits are accounted for, are distinguished according to the different service types of node, totally 4 kinds of types of service.
JS: 4 bits are accounted for, for the hop count for marking present node also to need to destination node.
SA, DA, DA1-DA3: each accounting for 12 bits, for marking source address and destination address, DA1-DA3 table
Show the address of relay node.
Length: 10 bits are accounted for, denotable range is 0~1023, for the length of flag data part.
The part DATA:DATA is used to store the data portion information of various types of frames.
Whether More-data: accounting for 1 bit, have more data to transmit for flag node, 0 expression no data, and 1
Indicate data.
Wherein, the length of each field is parametrization in frame format, can be adjusted according to specific scene and application.
Wherein, frame type declaration is as follows: as shown in Table 1,
Table one
For the current algorithm main definitions frame of three types: data frame, control frame and management frame.
The types value of data frame is 00, and the subtype value of request of data frame is defined as 0000, the subtype of data response frame
Value is defined as 0001.The types value of control frame is that the subtype value of 01, ACK is defined as 0000.The types value of management frame is 10, is connect
The subtype value for entering claim frame is 0000.
Request of data (Data Request) --- in data transfer phase, CCO sends number by each node of poll
According to claim frame, encapsulation CCO is needed to be handed down to the information of node in the part its payload.
Data respond (Data Response) --- when node receives the request of data frame of CCO transmission and the node has
Data will send this frame when being sent to CCO, and encapsulation node is sent to the data of CCO in the part its payload.
Acknowledgement frame (ACK) --- ACK is used to the response to the CCO request of data frame sent, different from data response frame, when
ACK is returned to when node does not have data to be sent to CCO.
Access request (Access Request) --- when node begins to move back after receiving the beacon frame of COO broadcast
It keeps away, when backoff value is 0 just to send the frame to CCO, the frame flag different service types of node.
As shown in Figure 3, it is assumed that in multihop network, the sequence that CCO is stored according to networking stage node sequentially poll node,
According to business to the difference of requirement of real-time, CCO records node priority, for the node of different business priority, in poll
CCO distributes different maximum transmitted chances to it in the process.Priority is higher, and the maximum transmitted chance of acquisition is more；Priority
Lower, the maximum transmitted chance of acquisition is fewer.
Business Stream is divided into 4 different priority with reference to IEEE 802.11e, as shown in Table 2,
Table two
CCO matches maximum transmitted chance by score according to node traffic priority, it is assumed that maximum from high to low according to priority
Transmission opportunity distribution ratio is 4:3:2:1, and transmission opportunity is equivalent to poll degree of node in data transmission procedure.Node traffic class
Type is 0 if Voice, i.e. priority, then at most distributes 4 transmission opportunities to it；Node traffic type is if Video, i.e., excellent
First grade is 1, then at most distributes 3 transmission opportunities to it；Node traffic type is 2 if Best-effort, i.e. priority, then
At most 3 transmission opportunities are distributed to it；Node traffic type is 3 if Background, i.e. priority, then at most gives its distribution
1 transmission opportunity.By this distribution principle, guarantees each node fair transmission as far as possible and improve the utilization rate of bandwidth.
The detailed process of data transmission is as follows:
Step 1, in the networking stage of node, node is marked in access request frame when sending access request frame in node
Service priority information, CCO records its service priority
Step 2, data transfer phase, CCO send request of data frame to destination node 7
Step 3, it after node A, 3 receive request of data frame, examines whether destination address matches, mismatches, then turn by address
Request of data frame is sent out to node 7；After node 7 receives request of data frame, destination address matching turns to step 4
Step 4, node 7 is Video according to its type of service, and priority 1, obtaining corresponding maximum transmitted chance is 3
Secondary, node 7 is sent without upstream data, then more-data is labeled as 0, CCO poll next node 8 to CCO by feeding back ACK
Step 5, node 8 is Video according to its type of service, and priority 1, obtaining corresponding maximum transmitted chance is 3
It is secondary, if node 8 has data transmission, more-data is labeled as 1, CCO is incidentally sent in data, if node 8 still there are data
It sends, the message that this node has data to send incidentally is sent to CCO in data, CCO poll node 8, poll node 8 is twice
No data retransmits afterwards, and more-data is labeled as 0, and CCO is incidentally sent in data, and CCO continues poll next node 9
Step 6, node 9 is Voice according to its type of service, and priority 0, obtaining corresponding maximum transmitted chance is 4
It is secondary, if node 9 has data transmission, CCO is sent the data to, if node 9 still has data transmission, more-data is labeled as 1,
CCO is incidentally sent in data, node 9 has always data transmission, after reaching maximum wrap count 4 times, a section under CCO poll
Point
Step 7, by the complete all nodes of step 2-6 poll, so far a polling cycle terminates.
Above-described is only a kind of bandwidth on-demand distribution method based on node traffic priority disclosed in this invention
Preferred embodiment, it is noted that for those of ordinary skill in the art, do not departing from the invention design
Under the premise of, various modifications and improvements can be made, and these are all within the scope of protection of the present invention.
Claims (3)
1. a kind of bandwidth on-demand distribution method based on node traffic priority, which is characterized in that the described method includes:
Step 1, networking stage: the service priority of central controller record node；
Step 2, data transfer phase: central controller sends request of data frame to node, sequentially poll node；
Step 3, after node receives request of data frame, judge whether present node has upstream data to need to send, if currently
Node does not have upstream data transmission, then present node only returns to acknowledgement frame to central controller, and to the data mark in acknowledgement frame
Remember that field carries out no data label, central controller continues poll next node, if present node has upstream data transmission,
Central controller is sent data to, if still thering is upstream data to send in node, to the data markers word in acknowledgement frame
Duan Jinhang has data markers, and the acknowledgement frame after label is sent to central controller together with data, and central controller continues
Poll node, until the node no data sends or reach maximum transmission opportunity limitation；
Step 4, step 1-3 is repeated until all node polls finish.
2. the bandwidth on-demand distribution method according to claim 1 based on node traffic priority, which is characterized in that described
Central controller record node service priority specifically: node by the service priority Information encapsulation of node itself to access
In claim frame, access request frame is sent to central controller by node, and central controller records the service priority of node.
3. the bandwidth on-demand distribution method according to claim 1 based on node traffic priority, which is characterized in that described
It carries out no data to the data markers field in acknowledgement frame to mark being by data markers field mark being 0, to the number in acknowledgement frame
According to tag field carried out data markers be by data markers field mark be 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910147957.1A CN109873723B (en) | 2019-02-28 | 2019-02-28 | On-demand bandwidth allocation method based on node service priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910147957.1A CN109873723B (en) | 2019-02-28 | 2019-02-28 | On-demand bandwidth allocation method based on node service priority |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109873723A true CN109873723A (en) | 2019-06-11 |
| CN109873723B CN109873723B (en) | 2022-02-18 |
Family
ID=66919436
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910147957.1A Active CN109873723B (en) | 2019-02-28 | 2019-02-28 | On-demand bandwidth allocation method based on node service priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109873723B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112188639A (en) * | 2020-09-07 | 2021-01-05 | 珠海格力电器股份有限公司 | Communication method, device, equipment and computer readable medium based on WiFi Mesh network |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4829297A (en) * | 1987-05-08 | 1989-05-09 | Allen-Bradley Company, Inc. | Communication network polling technique |
| CN1859184A (en) * | 2005-12-30 | 2006-11-08 | 华为技术有限公司 | Method for increasing communication link layer protocol efficiency |
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN103795597A (en) * | 2014-03-03 | 2014-05-14 | 西南大学 | ZigBee network control system and network-induced delay computing method thereof |
| CN104066094A (en) * | 2014-06-19 | 2014-09-24 | 云南大学 | Wireless cognitive network spectrum access method based on two-level roll polling |
| CN106130824A (en) * | 2016-07-22 | 2016-11-16 | 杨志军 | Integration of three networks broadband access priority polling control method and system |
| US20170085456A1 (en) * | 2015-09-22 | 2017-03-23 | Ca, Inc. | Key network entity detection |
| CN107733689A (en) * | 2017-09-15 | 2018-02-23 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Dynamic weighting polling dispatching strategy process based on priority |
-
2019
- 2019-02-28 CN CN201910147957.1A patent/CN109873723B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4829297A (en) * | 1987-05-08 | 1989-05-09 | Allen-Bradley Company, Inc. | Communication network polling technique |
| CN1859184A (en) * | 2005-12-30 | 2006-11-08 | 华为技术有限公司 | Method for increasing communication link layer protocol efficiency |
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN103795597A (en) * | 2014-03-03 | 2014-05-14 | 西南大学 | ZigBee network control system and network-induced delay computing method thereof |
| CN104066094A (en) * | 2014-06-19 | 2014-09-24 | 云南大学 | Wireless cognitive network spectrum access method based on two-level roll polling |
| US20170085456A1 (en) * | 2015-09-22 | 2017-03-23 | Ca, Inc. | Key network entity detection |
| CN106130824A (en) * | 2016-07-22 | 2016-11-16 | 杨志军 | Integration of three networks broadband access priority polling control method and system |
| CN107733689A (en) * | 2017-09-15 | 2018-02-23 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Dynamic weighting polling dispatching strategy process based on priority |
Non-Patent Citations (1)
| Title |
|---|
| 韩国栋等: "一种基于优先级的综合接入系统自适应I/O调度方案", 《电子与信息学报》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112188639A (en) * | 2020-09-07 | 2021-01-05 | 珠海格力电器股份有限公司 | Communication method, device, equipment and computer readable medium based on WiFi Mesh network |
| CN112188639B (en) * | 2020-09-07 | 2022-08-19 | 珠海格力电器股份有限公司 | Communication method based on WiFi Mesh network and related equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109873723B (en) | 2022-02-18 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103929823B (en) | Electric power wireless private network channel access control method based on business classification | |
| CN100461752C (en) | Wireless communication apparatus and wireless communication method | |
| US7920586B2 (en) | System and method for selecting a medium access technique for transmitting packets over a network | |
| Long et al. | QoS-aware cross-layer mechanism for multiple instances RPL | |
| WO2022095182A1 (en) | Wireless communication method and system for node devices in internet of things of power transmission and transformation device | |
| CN101584234A (en) | Method of congestion management in a wireless mesh network | |
| CN109962760B (en) | Service scheduling method suitable for wireless TDMA ad hoc network | |
| CN105050117A (en) | Ad-hoc network communication method based on business type competition and coordination time division multiple access (TDMA) | |
| CN113950104B (en) | Satellite network service deterministic scheduling method based on dynamic period mapping | |
| Yu et al. | STDMA for vehicle-to-vehicle communication in a highway scenario | |
| CN112543040B (en) | Efficient BPLC network networking method | |
| Park et al. | Frame-type-aware static time slotted channel hopping scheduling scheme for large-scale smart metering networks | |
| CN106533833A (en) | Method for reducing conflict of carrier interception multipath accessing resources | |
| Fang et al. | A synchronous, reservation based medium access control protocol for multihop wireless networks | |
| CN101247327B (en) | Method for implementing dynamic resource obligation of wireless self-organizing network by elephant flow detection | |
| Soldo et al. | Streaming media distribution in VANETs | |
| CN109873723A (en) | Bandwidth on-demand distribution method based on node traffic priority | |
| CN104066094B (en) | A kind of wireless cognition network frequency spectrum access method based on two-stage poll | |
| CN103428772B (en) | The wireless medium cut-in method of DCF/PCF based on residual time delay | |
| CN107426822A (en) | Exempt from the resource reallocation of expense in a kind of wireless network | |
| CN113079578A (en) | Smart screen wireless screen projection data priority transmission method and system | |
| Liu et al. | A scheme for supporting voice over IEEE 802.11 wireless local area network | |
| CN105227491B (en) | A kind of resource regulating method in electricity consumption wireless access network | |
| KR20130093711A (en) | Method and apparatus for providing a voice service in a communication system | |
| CN110138683B (en) | QoS-supported Internet of things data transmission method and system |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231116 Address after: 903-261, 9th Floor, Building 17, No. 30 Shixing Street, Shijingshan District, Beijing, 100043 Patentee after: Beijing Xunlian Intelligent Technology Co.,Ltd. Address before: Room 119, Zhongchuang building, No.2 DARUI Road, Guandong Industrial Park, Donghu New Technology Development Zone, Wuhan, Hubei 430000 Patentee before: WUHAN SHENGLIAN ZHIRONG MICROELECTRONICS TECHNOLOGY CO.,LTD. |