CN106488561A - A kind of resource allocation methods in multihop network - Google Patents
A kind of resource allocation methods in multihop network Download PDFInfo
- Publication number
- CN106488561A CN106488561A CN201510542369.XA CN201510542369A CN106488561A CN 106488561 A CN106488561 A CN 106488561A CN 201510542369 A CN201510542369 A CN 201510542369A CN 106488561 A CN106488561 A CN 106488561A
- Authority
- CN
- China
- Prior art keywords
- resource
- node
- request
- resource request
- nodes
- 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.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
Abstract
The present invention proposes the resource allocation methods in a kind of multihop network, comprises the following steps：The resource pool that a maintenance continues for some time, records resource allocation status；B is periodically detected the buffer queue of different business, and records the respective resources request needing to initiate；C is periodically detected the resource request from other nodes, and carries out respective record；D periodicity is uniformly processed the resource request needing to initiate of described record and the resource request of other nodes receiving；E authorizes according to the result corresponding resource request of initiation being uniformly processed and/or to the resource request of other nodes.
Description
Technical field
The present invention relates to wireless communication field, the resource allocation methods in more particularly, to a kind of multihop network.
Background technology
Wireless multi-hop network provides the peer-to-peer communicationss of self-organizing, self-coordinating between a kind of node, and each node has
There is forwarding capability, it is possible to achieve the multi-hop transmission between node, there is flattening and transmission range than larger
Feature.In multi-hop transmission, the link-quality often jumped might have larger difference, if resource allocation is not
Rationally, then the message transmission rate that may result between different jump has larger difference.In data is activation
Source node at be not aware that the data transmission scenarios of middle each jump, so can lead to the business at source node
Issue speed inconsistent with overall link transmission rate in fact it could happen that intermediate node can receive mass data
But have no ability to situation about sending completely, ultimately result in a large amount of packet losses, this partial data bag has accounted for
With interface-free resources transmission, so the waste of interface-free resources can be led to, can carry if necessary to if retransmitting simultaneously
Carry out same problem, interface-free resources waste more serious.
In order to avoid the wasting of resources, existing common practice is using the way in similar computer network, that is, lead to
The congestion control policy crossing high level carries out flow-control, and it is disadvantageous in that：High-rise congestion control relies on
In ACK (Acknowledgement) feedback message of receiving terminal, transmission is not needed to the industry of ACK feedback
Business cannot be carried out flow-control, and high-rise congestion control is poor to the change adaptability of channel simultaneously.Also have
Way is to carry out resource allocation in advance for each node, but is unable to adaptive tracing to the change of business.
Content of the invention
For the problems referred to above, the present invention proposes the resource allocation methods in a kind of multihop network, walks including following
Suddenly：The resource pool that a maintenance continues for some time, records resource allocation status；B is periodically detected not of the same trade or business
The buffer queue of business, and record the respective resources request needing to initiate；C is periodically detected from other nodes
Resource request, and carry out respective record；D periodicity is uniformly processed the resource needing to initiate of described record
Request and the resource request of other nodes receiving；E initiates corresponding resource according to the result being uniformly processed please
Ask and/or the resource request of other nodes is authorized.
Further, also include：Described node, after receiving mandate, is sent out in the resource enterprising row data authorizing
Send.
Further, also include：After each receive information of each node, also upper hop node feeding back channel matter
Amount, selects suitable modulation coding mode for upper hop node.
Further, the maintenance in described step a includes：According to from neighbors occupation condition and
The occupation condition of this node carries out the renewal of resource pool occupancy situation.
Further, the number of resources asked is needed to be calculated according to following manner in described step b：
For GBR traffic,
For NGBR business,
Wherein,
Nslotreq is the number of time slots needing in the resource window safeguarded to ask；
Bit (GBR) is to need to pass in the resource window that calculates of GBR speedometer being required according to particular traffic type
Defeated bit number；
Bit (NGBR) is data bit number in the corresponding caching of NGBR business；
g(Imcs) by the bit number that carried in this node current modulation coding mode next one time slot；
K is weighter factor.
Further, described be uniformly processed including：Calculate the resource request needing to initiate and the receipts of described record
To the resource request of other nodes priority go forward side by side row major level sequence.
Further, described priority calculates according to equation below：
Wherein, Se be on the path of corresponding requests spectrum efficiency, HistoryThpt is corresponding requests
Business historical speed, coefficient alpha and beta is configuration parameter.
The present invention passes through the resource allocation of MAC (Medium Access Control) layer, more reasonably not
Carrying out resource allocation between same node, thus reducing the wasting of resources, improving the spectrum efficiency of overall network.
Specific embodiment
Purpose, technical scheme and advantage for making the embodiment of the present invention are clearer, below will be real to the present invention
The technical scheme applied in example is clearly and completely described.
One embodiment of the present of invention proposes the resource allocation methods in a kind of multihop network, comprises the following steps：
The resource pool that a maintenance continues for some time, records resource allocation status；
B is periodically detected the buffer queue of different business, and records the respective resources request needing to initiate；
C is periodically detected the resource request from other nodes, and carries out respective record；
D periodicity is uniformly processed the resource request needing to initiate of described record and other nodes receiving
Resource request；
E initiates corresponding resource request and/or the resource request to other nodes according to the result being uniformly processed
Authorized.
In one alternate embodiment, also include：Described node after receiving mandate, authorize resource on
Carry out data is activation.
In one alternate embodiment, also include：After each receive information of each node, also upper hop node
Feedback channel quality, selects suitable modulation coding mode for upper hop node.
In one alternate embodiment, the maintenance in step a includes：According to the resource occupation from neighbors
The occupation condition of situation and this node carries out the renewal of resource pool occupancy situation.
In one alternate embodiment, the number of resources asked is needed to be calculated according to following manner in step b：
For GBR traffic,
For NGBR business,
Wherein,
Nslotreq is the number of time slots needing in the resource window safeguarded to ask；
Bit (GBR) is to need to pass in the resource window that calculates of GBR speedometer being required according to particular traffic type
Defeated bit number；
Bit (NGBR) is data bit number in the corresponding caching of NGBR business；
g(Imcs) by the bit number that carried in this node current modulation coding mode next one time slot；
K is weighter factor.
In one alternate embodiment, be uniformly processed including：The resource needing to initiate calculating described record please
Sue for peace receive other nodes resource request priority go forward side by side row major level sequence；
In one alternate embodiment, described priority calculates according to equation below：
Wherein, Se be on the path of corresponding requests spectrum efficiency, HistoryThpt is corresponding requests
Business historical speed, coefficient alpha and beta is configuration parameter.
The present invention passes through the resource allocation of MAC (Medium Access Control) layer, more reasonably not
Carrying out resource allocation between same node, thus reducing the wasting of resources, improving the spectrum efficiency of overall network.
Embodiment one
The present embodiment to illustrate the resource allocation methods of the present invention taking a multihop network as a example, and node 1 gives section
Point N sends the data of GBR traffic, and intermediate demand node 2,3 ... N-1 are forwarded：
1) resource status in each node maintenance resource pool, determine which resource is available；
2) node 1 carries out having detected whether that packets need sends, if there are the then service class according to data
It is that type judges for which type of business；
3) if node 1 is GBR according to the judged result of type of service, being calculated according to following formula needs to ask
Number of resources：
Wherein Nslotreq is the number of time slots needing in the resource window safeguarded to ask, and Bit (GBR) represents according to spy
The bit number transmitting, g (I is needed in the resource window that calculates of GBR speedometer determining type of service requirementmcs) for originally
The bit number being carried in node current modulation coding mode next one time slot, k is weighter factor, is one
The empirical value of the individual conservative degree increasing extra resource, is set to 1 in this example；
4) node 2 is after receiving the request of node 1, according to resource in the resource pool that own node is safeguarded
Service condition, resource authorization is carried out to node 1；
5) data is activation is carried out after node 1 receives mandate on corresponding authorization resources；
6) each node calculates upper hop node to the chain of oneself according to the upper hop broadcast message receiving
Road quality (the present embodiment is CQI, Channel quality indication) simultaneously feeds back to upper hop node,
Upper hop node selects a suitable MCS (Modulation and Coding according to this link-quality
Scheme, modulation coding mode), so each node can determine and oneself send data to neighbors and be somebody's turn to do
Using which kind of MCS；
7) after node 2 receives data, then continue to initiate resource request to node 3, in the process,
Node 2 also can receive the resource request of node 1, so node 2 is to the request of the node 1 receiving with to section
The request of point 3 transmission carries out prioritization, according to the result of prioritization, determines the request of process
Sequentially, carry out prioritization as follows：
Wherein, Se be on the path of corresponding requests spectrum efficiency, HistoryThpt is corresponding requests
Business historical speed, coefficient alpha and beta is configuration parameter, is defaulted as 1 in this example；
8) node after adopts as above step successively, realizes data transfer, realizes money in transmitting procedure
The reasonable distribution in source is it is ensured that the GBR speed of user.
Embodiment two
The present embodiment to illustrate the resource allocation methods of the present invention taking a multihop network as a example, and node 1 gives section
The data of point 2 transmission NGBR business, node 2 sends NGBR data to node 1：
1) resource status in each node maintenance resource pool, determine which resource is available；
2) node 1 carries out having detected whether that packets need sends, if there are the then service class according to data
It is that type judges for which type of business；
3) if node 1 is NGBR according to the judged result of type of service, being calculated according to following formula needs to ask
The number of resources asked：
Wherein Nslotreq is the number of time slots needing in the resource window safeguarded to ask, and Bit (NGBR) represents
Data bit number in NGBR business corresponding caching buffer, g (Imcs) it is the current modulating-coding side of this node
The bit number being carried in formula next one time slot, k is weighter factor, is the guarantor of an increase extra resource
The empirical value of degree of keeping；, it is set to 1 in this example；
4) node 2 is after receiving the request of node 1, according to resource in the resource pool that own node is safeguarded
Service condition, resource authorization is carried out to node 1；
5) data is activation is carried out after node 1 receives mandate on corresponding authorization resources；
6) node 2 equally carries out step 2) and step 3) process；
7) node 1 is after receiving the request of node 2, according to resource in the resource pool that own node is safeguarded
Service condition, resource authorization is carried out to node 2；
8) each node calculates upper hop node to the chain of oneself according to the upper hop broadcast message receiving
Road quality simultaneously feeds back to upper hop node, and upper hop node selects a suitable MCS according to this link-quality
(Modulation and Coding Scheme, modulation coding mode), so each node can determine
Oneself sends data to neighbors, and which kind of MCS this adopts；
9) data is activation is carried out after node 2 receives mandate on corresponding authorization resources；
10) node 1 and node 2, after receiving the resource request of peer node transmission, will send with itself
Request carry out prioritization, according to the result of prioritization, determine the order of the request processing, press
Carry out prioritization according to following manner：
Wherein, Se be on the path of corresponding requests spectrum efficiency, HistoryThpt is corresponding requests
Business historical speed, coefficient alpha and beta is configuration parameter, is defaulted as 1 in this example；
Adopt as above step successively afterwards, realize data transfer, transmitting procedure is realized rationally dividing of resource
Join, final result is node 1 and node 2 each accounts for using half resource.
The resource allocation by MAC layer for the present invention, can have stronger channel adaptability and business to adapt to
Property, and do not need high-rise message feedback, only rely upon MAC layer statistics and the measurement feedback of bottom；
Rational Resources allocation among the nodes, effectively improves the fairness between node；Can more ensure many
Speed between jump is more consistent, reduces the situation appearance shining into the wasting of resources and packet loss.
One of ordinary skill in the art will appreciate that：The all or part of step realizing said method embodiment can
Completed with the hardware related by programmed instruction, aforesaid program can be stored in an embodied on computer readable and deposit
In storage media, this program upon execution, executes the step including said method embodiment；And aforesaid storage
Medium includes：ROM, RAM, magnetic disc or CD etc. are various can be with the medium of store program codes.
Finally it should be noted that：Above example is only in order to illustrating technical scheme, rather than it is limited
System；Although being described in detail to the present invention with reference to the foregoing embodiments, those of ordinary skill in the art
It should be understood that：It still can be modified to the technical scheme described in foregoing embodiments, or to it
Middle some technical characteristics carry out equivalent；And these modifications or replacement, do not make appropriate technical solution
Essence departs from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (7)
1. the resource allocation methods in a kind of multihop network are it is characterised in that comprise the following steps：
The resource pool that a maintenance continues for some time, records resource allocation status；
B is periodically detected the buffer queue of different business, and records the respective resources request needing to initiate；
C is periodically detected the resource request from other nodes, and carries out respective record；
D periodicity is uniformly processed the resource request needing to initiate of described record and other nodes receiving
Resource request；
E initiates corresponding resource request and/or the resource request to other nodes according to the result being uniformly processed
Authorized.
2. method according to claim 1 is it is characterised in that also include：Described node is receiving
After mandate, the resource authorizing carries out data is activation.
3. method according to claim 1 is it is characterised in that also include：Each node receives every time
After information, also upper hop node feeding back channel quality, select suitable modulating-coding side for upper hop node
Formula.
4. it is characterised in that step a, described maintenance includes method according to claim 1：According to
Carry out resource pool occupancy situation from the occupation condition of neighbors and the occupation condition of this node
Update.
5. method according to claim 1 is it is characterised in that need request in described step b
Number of resources calculates according to following manner：
For GBR traffic,
For NGBR business,
Wherein,
Nslotreq is the number of time slots needing in the resource window safeguarded to ask；
Bit (GBR) is to need to pass in the resource window that calculates of GBR speedometer being required according to particular traffic type
Defeated bit number；
Bit (NGBR) is data bit number in the corresponding caching of NGBR business；
g(Imcs) by the bit number that carried in this node current modulation coding mode next one time slot；
K is weighter factor.
6. method according to claim 1 it is characterised in that described be uniformly processed including：
Calculate the resource request needing to initiate of described record and the preferential of the resource request receiving other nodes
Level go forward side by side row major level sequence.
7. method according to claim 6 is it is characterised in that described priority is according to equation below
Calculate：
Wherein, Se be on the path of corresponding requests spectrum efficiency, HistoryThpt is corresponding requests
Business historical speed, coefficient alpha and beta is configuration parameter.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510542369.XA CN106488561A (en) | 2015-08-28 | 2015-08-28 | A kind of resource allocation methods in multihop network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510542369.XA CN106488561A (en) | 2015-08-28 | 2015-08-28 | A kind of resource allocation methods in multihop network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN106488561A true CN106488561A (en) | 2017-03-08 |
Family
ID=58234804
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510542369.XA Withdrawn CN106488561A (en) | 2015-08-28 | 2015-08-28 | A kind of resource allocation methods in multihop network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106488561A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110741703A (en) * | 2018-01-04 | 2020-01-31 | Oppo广东移动通信有限公司 | resource allocation method and device, computer storage medium |
| CN113873473A (en) * | 2021-09-24 | 2021-12-31 | 中车青岛四方机车车辆股份有限公司 | Method, system, equipment and train for realizing low-delay resource scheduling |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101291473A (en) * | 2007-04-20 | 2008-10-22 | 中兴通讯股份有限公司 | Resource scheduling method of multi-hop relaying network |
| CN101296060A (en) * | 2007-04-23 | 2008-10-29 | 中兴通讯股份有限公司 | Downlink transmission method for mixed automatic retransmission request burst in multi-hop relay network |
| CN101335971A (en) * | 2007-06-28 | 2008-12-31 | 联想(北京)有限公司 | Resource scheduling method of multi-hop wireless network based on relay station |
| CN101554076A (en) * | 2006-10-27 | 2009-10-07 | 诺基亚西门子通信有限责任两合公司 | Method of connection based scheduling with differentiated service support for multi-hop wireless networks |
| KR101460946B1 (en) * | 2014-06-02 | 2014-11-17 | 울산대학교 산학협력단 | Network system and routing method thereof |
-
2015
- 2015-08-28 CN CN201510542369.XA patent/CN106488561A/en not_active Withdrawn
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101554076A (en) * | 2006-10-27 | 2009-10-07 | 诺基亚西门子通信有限责任两合公司 | Method of connection based scheduling with differentiated service support for multi-hop wireless networks |
| CN101291473A (en) * | 2007-04-20 | 2008-10-22 | 中兴通讯股份有限公司 | Resource scheduling method of multi-hop relaying network |
| CN101296060A (en) * | 2007-04-23 | 2008-10-29 | 中兴通讯股份有限公司 | Downlink transmission method for mixed automatic retransmission request burst in multi-hop relay network |
| CN101335971A (en) * | 2007-06-28 | 2008-12-31 | 联想(北京)有限公司 | Resource scheduling method of multi-hop wireless network based on relay station |
| KR101460946B1 (en) * | 2014-06-02 | 2014-11-17 | 울산대학교 산학협력단 | Network system and routing method thereof |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110741703A (en) * | 2018-01-04 | 2020-01-31 | Oppo广东移动通信有限公司 | resource allocation method and device, computer storage medium |
| CN113873473A (en) * | 2021-09-24 | 2021-12-31 | 中车青岛四方机车车辆股份有限公司 | Method, system, equipment and train for realizing low-delay resource scheduling |
| CN113873473B (en) * | 2021-09-24 | 2024-01-09 | 中车青岛四方机车车辆股份有限公司 | Method, system, equipment and train for realizing low-delay resource scheduling |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10142909B2 (en) | Artificial intelligence-augmented, ripple-diamond-chain shaped rateless routing in wireless mesh networks with multi-beam directional antennas | |
| US8089970B2 (en) | Method and apparatus for managing admission and routing in multi-hop 802.11 networks taking into consideration traffic shaping at intermediate hops | |
| CN103166995B (en) | A kind of video transmission method and device | |
| CN102369778B (en) | Buffer status reporting in a mobile communication system | |
| JP2010514275A5 (en) | ||
| US9374807B2 (en) | Uplink transmission scheduling for wireless communication networks | |
| Shaikh et al. | TRCCIT: tunable reliability with congestion control for information transport in wireless sensor networks | |
| CN101686497A (en) | Cell load equalization method, and cell load evaluation method and device | |
| CN103369674B (en) | The distribution method of interface-free resources and equipment | |
| CN104981017B (en) | Uplink resource allocating method and base station | |
| CN106134130A (en) | The system and method estimated for the dynamic effective speed of real-time video flow | |
| CN108064058B (en) | Congestion control method and device and base station | |
| CN107113851A (en) | The method and apparatus for selecting upstream data | |
| US8923156B1 (en) | Quality of service aware channel quality indicator | |
| CN101536602B (en) | Method of supporting measurement in a mobile communication system | |
| CN108260160A (en) | Dispatch the method and system of user | |
| CN103369690B (en) | The distribution method of a kind of Radio Resource and device | |
| CN105471763A (en) | Control message transmission method and device | |
| CN106488561A (en) | A kind of resource allocation methods in multihop network | |
| CN106465387A (en) | Discovery of multi-hop capabilities and routing on a per link basis | |
| CN104639568A (en) | Data transmission method based on UDP (user datagram protocol) | |
| Kesavan et al. | A proportional fair scheduling strategy using multiobjective gradient‐based African buffalo optimization algorithm for effective resource allocation and interference minimization | |
| Levasseur et al. | Impact of acknowledgments on application performance in 4G LTE networks | |
| CN107432025A (en) | Scheduling in cellular network | |
| CN102612060A (en) | Evaluation method based on entropy value calculation and used for compatibility of cross-layer design |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20170308 |
|
| WW01 | Invention patent application withdrawn after publication |