CN105792371B - A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network - Google Patents
A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network Download PDFInfo
- Publication number
- CN105792371B CN105792371B CN201610120708.XA CN201610120708A CN105792371B CN 105792371 B CN105792371 B CN 105792371B CN 201610120708 A CN201610120708 A CN 201610120708A CN 105792371 B CN105792371 B CN 105792371B
- Authority
- CN
- China
- Prior art keywords
- node
- resource
- privilege
- broadcast
- rnti
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/53—Allocation or scheduling criteria for wireless resources based on regulatory allocation policies
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/70—Admission control; Resource allocation
- H04L47/76—Admission control; Resource allocation using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The present invention proposes a kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network, Internet resources distribution condition can be adjusted in real time according to current network node number, it is a kind of improved fixed resource method of salary distribution, does not will cause resource and use conflict, referred to as half dynamic mode；It can be directed to the specific needs of user under special circumstances, distribute to its resource for being more than par, obtained by the way of application, belong to non-competing resource using mode, referred to as dynamic mode.Both of which is used cooperatively, and achievees the purpose that very big limit uses Internet resources.Therefore, the present invention can be adaptive to present network capacity, and can guarantee the resource request of specific user, and method is simple and expense is small, Lothrus apterus, be highly suitable for the flexible and changeable distributed ad-hoc network of node.
Description
Technical field
The present invention relates to Internet resources distribution technique field more particularly to a kind of non-competing no punchings based on distributed network
Prominent dynamic resource allocation method.
Background technique
Common distributed network resource allocation plan is mainly by following several classes:
Fixed resource distribution is also known as static resource allocation, according to network maximum capacity mean allocation Internet resources, the party
Method realizes simply there is good fairness, but lack flexibility, and the resource in the case where network present node number is fewer
Waste is serious, is relatively specific for the fewer and more fixed network scenarios of number of network node.
Resource allocation policy competition-based does not distribute resource to network node in advance, when node has business to send demand
The right to use that Internet resources are obtained using the method for competition, if having multiple nodes in synchronization while initiating business, at this time
It will lead to not complete because of competition conflict.This strategy is simple, and efficiency is higher in the lesser situation of network capacity, but with net
The increase of internal segment points, conflict meeting sharp deterioration, seriously affects network performance.
Dynamic processing capacity allocation policy requires to carry out resource bid before net interior nodes transmission business, not will cause competition
Conflict, flexibility and reliability, but resource bid signalling interactive process are complicated and control overhead is big, have aggravated resource for distributed network
It safeguards the burden of node, while also reducing network communication efficiency.
Semi-persistent resource allocation strategy has taken into account the characteristics of static resource allocation and dynamic resource allocation, reserved part resource
Apply obtaining for dynamic, remaining static resource is averagely allocated to user in net, has accomplished compared to above-mentioned strategy a degree of
Flexibility, but the case where equally will appear the wasting of resources, it implements more complicated.
Summary of the invention
The present invention provides a kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network, and this method is adaptive
Existing resource can should be utilized to greatest extent, and can guarantee the resource request of specific user in present network capacity, method letter
List and expense is small, Lothrus apterus, is highly suitable for the flexible and changeable distributed ad-hoc network of node.
The present invention is achieved through the following technical solutions:
A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network comprising following steps:
Step 1, the wireless network of current distributed network is temporarily indicated map information RntiMap and passes through broadcast by cluster head
All nodes in distribution of notifications formula network；Wherein, the value of RntiMap corresponding position is 1 expression this RNTI node presence, is 0 table
Show that RNTI node is not present；RNTI is radio resource temporary identifier, and value, that is, corresponding bit position of RNTI indicates that node is entering
It is ID in the net of its distribution after netting successfully；It include ordinary node and franchise node in all nodes；
Step 2, after arbitrary node receives the broadcast of cluster head, the information that broadcast is carried is broadcasted by the broadcast frame of itself
It goes out；
Step 3, after arbitrary node receives the broadcast of cluster head or the broadcast of other nodes, according to what is carried in broadcast message
RntiMap calculates the RNTI of node total number M and M node in current network, and than itself small node number of RNTI value
The period of N, then the dedicated channel resource DCH that this node uses are M, deviate the resource particle for N, complete the money of half dynamic mode
Source distribution；
Step 4, continue the resource point of half dynamic mode using step 1- step 3 if generating burst service without node
Match, if arbitrary node generation burst service needs more resources, the resource allocation of half dynamic mode is switched to dynamic analog
The resource allocation of formula executes step 5-7；
Step 5, the node of burst service is generated as application node, is carried in privilege request signaling and itself is needed to apply
The resource particle quantity of privileged resource, and be broadcasted；
Step 6, after cluster head receives all privilege request signalings, judge institute's privileged trading node in current network number whether
Greater than 1, distribution is disagreed if more than 1, otherwise agrees to distribution；For distribution is agreed to, franchise reply is carried out, the privilege is returned
Carry the respective resources particle of application node id and distribution in multiple, and one as cluster head broadcast message of the privilege return information
Divide in broadcast frame broadcast transmission next time to the whole network node, and this application node is changed into franchise node, the privilege node
After the life cycle for occupying resource particle, which is ordinary node；For distribution is disagreed, privilege is carried out
Reply, it is described privilege reply in any information without application node, and the privilege return information as cluster head broadcast message one
Part is in broadcast frame broadcast transmission next time to the whole network node；Cluster head updates privilege node i d and privilege in RntiMap simultaneously
Node number information, and send a switch indicating information and the whole network node is notified at the appointed time to complete resource switch；
It step 7, will be new when arbitrary node detects the RntiMap difference in broadcast in RntiMap and last broadcast
Privilege node i d and franchise node number information preservation in RntiMap；And it is recorded after the node receives switch indicating information
Switching time, and when switching time arrives, according to privilege node i d in the RntiMap locally saved and franchise node number letter
Breath carries out resource switch, to complete the resource allocation of dynamic mode.
Compared with prior art, the beneficial effects of the present invention are:
Non-competing Lothrus apterus dynamic resource allocation method proposed by the present invention can be real-time according to current network node number
Internet resources distribution condition is adjusted, is a kind of improved fixed resource method of salary distribution, not will cause resource using conflict, referred to as
Half dynamic mode；It can be directed to the specific needs of user under special circumstances, distribute to its resource for being more than par, use
The mode of application obtains, and belongs to non-competing resource using mode, referred to as dynamic mode.Both of which is used cooperatively, and is reached
Very big limit uses the purpose of Internet resources.
Detailed description of the invention
Fig. 1 is frame structure signal in the non-competing Lothrus apterus dynamic resource allocation method of the invention based on distributed network
Figure；
Fig. 2 is privileged resource Shen in the non-competing Lothrus apterus dynamic resource allocation method of the invention based on distributed network
It please process schematic.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
Distributed network is a kind of network morphology for being different from centralized network, be mainly characterized by net in all nodes it
Between can direct communication and nonessential pass through Network Central Node forwarding operation.Therefore one of key technology of distributed network is exactly
The distribution of resource and use strategy.
As shown in Figure 1, DCH (dedicated channel) resource of instruction is used to distribute to the node in network in resource frame structure
It uses.Under half dynamic mode, cluster head node (being used for network resource management) is according to the node number in current network, by resource
DCH channel resource in frame is averagely allocated to all nodes in network.As schemed to share 392 available DCH moneys in this system-frame
Source particle.
A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network comprising:
Step 1, cluster head, which passes through the RntiMap information (wireless network temporarily indicates mapping table) of current distributed network, is
All nodes in system broadcast notice network.Wherein, RNTI (radio resource temporary identifier) indicates that node is it after networking successfully
The value of ID in the net of distribution, RntiMap corresponding position is 1 expression this RNTI node presence, is not present for 0 expression RNTI node,
It include ordinary node and franchise node in all nodes.
Step 2, it after any node receives the broadcast of cluster head, is calculated according to the RntiMap information carried in broadcast message
The RNTI (value of RNTI is the position of corresponding bit) of node total number and these nodes in current network, and it is passed through extensively
The information is broadcasted to guarantee that the broadcast that can also receive cluster head from the farther away node of cluster head is believed by the broadcast frame broadcast at itself
Breath.
Step 3, after any node receives the broadcast of cluster head, calculate in network net node total number M and than from
The small node number N of body RNTI value, then the DCH resource that this node uses be M in the period, deviate the resource particle for N.
Step 4, the resource allocation of half dynamic mode is carried out using step 1- step 3 if generating burst service without node,
If arbitrary node generation burst service needs more resources, the resource allocation of half dynamic mode is switched to dynamic mode
Resource allocation executes step 5-7；
Step 5, the node of burst service is generated as application node, in PRIVILIGE_REQ (privilege request) signaling
The resource particle quantity for itself needing to apply privileged resource is carried, and is broadcasted；
Step 6, as shown in Fig. 2, judging current net after all PRIVILIGE_REQ (privilege request) signalings of cluster head reception
Whether the number of institute's privileged trading node is greater than 1 in network, disagrees distribution if more than 1, otherwise agrees to distribution；It is distributed for agreement
, it sends privilege and replies to all nodes, the respective resources particle of application node id and distribution is carried in the privilege reply,
And this application node switchs to franchise node, after the life cycle that the privilege node occupies resource particle, which turns
Turn to ordinary node；For distribution is disagreed, then send privilege and reply to all nodes, the privilege reply in without application
Any information of node；Cluster head updates privilege node i d and privilege node number information in RntiMap simultaneously, wide next time
Newest resource information will be carried by broadcasting in information.Feelings are used to resource caused by net interior nodes reception broadcast is asynchronous in order to prevent
The inconsistent situation of condition occurs, and cluster head can send specific SWITCH_IND (switching instruction) message informing the whole network section simultaneously
Point at the appointed time completes resource switch.
Step 7, the specific implementation procedure of resource switch is as follows:
When arbitrary node detects the RntiMap difference in broadcast in RntiMap and last broadcast, or
PrivilegeNode (the letter in franchise node i d) and PriviligeNum (franchise node number) information and last time broadcast message
When ceasing different, new RntiMap, PrivilegeNode, PrivilegeNum are saved, and the newest resource of non-immediate use
Distribution.The node records switching time after receiving SWITCH_IND, new according to what is locally saved when switching time arrives
RntiMap, PrivilegeNode, PrivilegeNum information carry out resource switch.
The resource location that wherein all kinds of nodes use can obtain according to the following method:
Ordinary node according to RntiMap calculate in network in net number of nodes M and the node number smaller than itself RNTI
N；If the RNTI of PrivilegeNode be less than itself RNTI, then the DCH resource particle that node uses be M+ in the period
PriviligeNum deviates the resource particle for N+PriviligeNum；If the RNTI of PrivilegeNode is greater than itself
RNTI, then the DCH resource particle that node uses be M+PriviligeNum in the period, deviate the resource particle for N；
The DCH resource particle that franchise node uses be M+PriviligeNum in the period, deviate for N, N+1 ..., N+
The resource particle of PriviligeNum-1.At most there are two franchise nodes for the whole network.
Cluster head node of the invention safeguards the RNTI information of the whole network active node, by taking in periodicity sending broadcast message
The RntiMap instruction notice network node of band；Net interior nodes of the invention are according to the RntiMap in broadcast according to period biasing
The method of shifting calculates respective resource and uses the moment；The present invention has the node of burst service can be to cluster head application additional resource
Using request, cluster head is requested according to network node application situation response node, and is carried in broadcast message next time newest
RntiMap and PrivilegeNode；Cluster head of the invention sends SWITCH_IND signaling message, in the message instruction switching
At the time of, the resource information that net interior nodes are stored according to itself is indicated with the SWITCH_IND received, completes to provide in the same time
Source switching.Distribution method of the invention in this way can maximize the whole network resource utilization, and Signalling exchange is few, reach semi-persistent scheduling with
The reasonable combination of dynamic dispatching had both been able to satisfy net interior nodes under normal circumstances and has divided equally the whole network resource, no slack resources waste, and energy
Meeting certain nodes when having burst service, dynamic acquisition can use the special circumstances of temporary resource.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention, all in essence of the invention
Made any modifications, equivalent replacements, and improvements etc., should all be included in the protection scope of the present invention within mind and principle.
Claims (1)
1. a kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network, which is characterized in that including following step
It is rapid:
Step 1, the wireless network of current distributed network is temporarily indicated map information RntiMap and is notified by broadcast by cluster head
All nodes in distributed network；Wherein, the value of RntiMap corresponding position is 1 expression this RNTI node presence, is indicated for 0
RNTI node is not present；RNTI is radio resource temporary identifier, and value, that is, corresponding bit position of RNTI indicates that node is networking
It is ID in the net of its distribution after success；It include ordinary node and franchise node in all nodes；
Step 2, after arbitrary node receives the broadcast of cluster head, the information that broadcast carries is broadcast out by the broadcast frame of itself
It goes；
Step 3, after arbitrary node receives the broadcast of cluster head or the broadcast of other nodes, according to what is carried in broadcast message
RntiMap calculates the RNTI of node total number M and M node in current network, and than itself small node number of RNTI value
The period of N, then the dedicated channel resource DCH that this node uses are M, deviate the resource particle for N, complete the money of half dynamic mode
Source distribution；
Step 4, continue the resource allocation of half dynamic mode using step 1- step 3 if generating burst service without node,
If arbitrary node generation burst service needs more resources, the resource allocation of half dynamic mode is switched to dynamic mode
Resource allocation executes step 5-7；
Step 5, the node of burst service is generated as application node, is carried in privilege request signaling and itself is needed to apply for privilege
The resource particle quantity of resource, and be broadcasted；
Step 6, after cluster head receives all privilege request signalings, judge whether the number of institute's privileged trading node in current network is greater than
1, distribution is disagreed if more than 1, otherwise agrees to distribution；It is distributed for agreement, the franchise reply of progress, in the privilege reply
The respective resources particle of application node id and distribution is carried, and the privilege return information exists as a part of cluster head broadcast message
Broadcast frame broadcast transmission next time is to the whole network node, and this application node is changed into franchise node, and the privilege node occupies
After the life cycle of resource particle, which is ordinary node；For distribution is disagreed, carries out privilege and return
It is multiple, the privilege reply in any information without application node, and one as cluster head broadcast message of the privilege return information
Divide in broadcast frame broadcast transmission next time to the whole network node；Cluster head updates privilege node i d and privilege section in RntiMap simultaneously
Point number information, and send a switch indicating information and the whole network node is notified at the appointed time to complete resource switch；
It step 7, will be new when arbitrary node detects the RntiMap difference in broadcast in RntiMap and last broadcast
Privilege node i d and franchise node number information preservation in RntiMap；And it is recorded after the node receives switch indicating information
Switching time, and when switching time arrives, according to privilege node i d in the RntiMap locally saved and franchise node number letter
Breath carries out resource switch, to complete the resource allocation of dynamic mode；
The resource allocation of the dynamic mode are as follows:
Ordinary node according to RntiMap calculate in network in the net number of nodes M and node number N smaller than itself RNTI, such as
The RNTI of fruit privilege node i d be less than itself RNTI, then the DCH resource particle that node uses be the period be M+ privilege node number,
Offset is the resource particle of N+ privilege node number, if the RNTI of franchise node i d is greater than itself RNTI, what node used
DCH resource particle be the period be M+ privilege node number, offset be N resource particle；
The DCH resource particle that franchise node uses be M+ privilege node number in the period, deviate for N, N+1 ..., N+ privilege node
The resource particle of number -1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610120708.XA CN105792371B (en) | 2016-03-03 | 2016-03-03 | A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610120708.XA CN105792371B (en) | 2016-03-03 | 2016-03-03 | A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105792371A CN105792371A (en) | 2016-07-20 |
| CN105792371B true CN105792371B (en) | 2019-04-16 |
Family
ID=56387758
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610120708.XA Active CN105792371B (en) | 2016-03-03 | 2016-03-03 | A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105792371B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107690172B (en) * | 2016-08-05 | 2019-12-20 | 电信科学技术研究院 | Access method and device in wireless network |
| CN108156097A (en) * | 2016-12-06 | 2018-06-12 | 电信科学技术研究院 | A kind of method and device of resource allocation |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009084760A1 (en) * | 2008-01-02 | 2009-07-09 | Korea Advanced Institute Of Science And Technology | Cdma code based bandwidth request and allocation method for ofdma multi-hop system |
| CN101399833B (en) * | 2008-12-09 | 2011-06-01 | 中国人民解放军理工大学 | Hybrid media access control method based on collaborative collision decomposition |
| CN103929818A (en) * | 2014-04-22 | 2014-07-16 | 北京航空航天大学 | Time slot allocation protocol of aircraft autonomous formation supporting network |
| CN105188149A (en) * | 2015-08-12 | 2015-12-23 | 重庆大学 | Method for implementing aeronautical Ad hoc network STDMA (Self Organizing Time Division Multiple Access) protocol based on directional antenna |
-
2016
- 2016-03-03 CN CN201610120708.XA patent/CN105792371B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009084760A1 (en) * | 2008-01-02 | 2009-07-09 | Korea Advanced Institute Of Science And Technology | Cdma code based bandwidth request and allocation method for ofdma multi-hop system |
| CN101399833B (en) * | 2008-12-09 | 2011-06-01 | 中国人民解放军理工大学 | Hybrid media access control method based on collaborative collision decomposition |
| CN103929818A (en) * | 2014-04-22 | 2014-07-16 | 北京航空航天大学 | Time slot allocation protocol of aircraft autonomous formation supporting network |
| CN105188149A (en) * | 2015-08-12 | 2015-12-23 | 重庆大学 | Method for implementing aeronautical Ad hoc network STDMA (Self Organizing Time Division Multiple Access) protocol based on directional antenna |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105792371A (en) | 2016-07-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Ning et al. | Mobile edge computing-enabled 5G vehicular networks: Toward the integration of communication and computing | |
| CN110381602A (en) | Method, the network equipment and the user equipment of random access | |
| CN108353384A (en) | The use of non-anchor carrier | |
| CN102088775A (en) | Method, system and device for distributing contention resources | |
| CN104508996B (en) | Connect method for building up, apparatus and system | |
| CN109155902A (en) | A kind of multi-broadcast communication method, the network equipment, user equipment and system | |
| CN106470399B (en) | The method and system of semi-continuous scheduling reactivation in cluster multi call business | |
| JP2012501612A (en) | Method and apparatus for requesting and processing uplink resource allocation in a radio access network | |
| WO2017167078A1 (en) | Carrier wave prb resource allocation method, device, and computer storage medium | |
| CN110113792A (en) | Source master base station, target master base station and target prothetic group station | |
| US8385247B2 (en) | Communication systems and methods with resource management for overlapping multicast and broadcast service zones | |
| CN101110659B (en) | Method for distributing subdistrict frequency band and network appliance thereof | |
| US8660048B2 (en) | Wireless resource scheduling method and occupied information sending method for multi base station MBS | |
| CN108811121A (en) | A kind of method and device of adjustment operation bandwidth of terminal | |
| CN105792371B (en) | A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network | |
| US10757703B2 (en) | LTE cluster system co-channel group network resource scheduling method and device | |
| CN104285391B (en) | Method for controlling interference and base station | |
| CN102348164B (en) | eMBMS (evolved multimedia broadcast/multicast service) releasing method and eMBMS system | |
| CN106130705A (en) | A kind of band resource distribution indicating means under frequency division multiple access transmission mode | |
| CN104754754B (en) | Delay access method under semi-persistent scheduling | |
| JP5379302B2 (en) | Multicast broadcasting service load instruction method and apparatus | |
| CN102857995B (en) | A kind of cut-in method of cluster user equipment, message method and user equipment | |
| CN107548078B (en) | Control method for measurement gap resource and multi-mode terminal | |
| CN109104756A (en) | Awakening method, access point and website | |
| CN109041244A (en) | SR resource multiplexing method and device |
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 |