CN105792371A - Non-competitive conflict-free dynamic resource allocation method based on distributed network - Google Patents
Non-competitive conflict-free dynamic resource allocation method based on distributed network Download PDFInfo
- Publication number
- CN105792371A CN105792371A CN201610120708.XA CN201610120708A CN105792371A CN 105792371 A CN105792371 A CN 105792371A CN 201610120708 A CN201610120708 A CN 201610120708A CN 105792371 A CN105792371 A CN 105792371A
- Authority
- CN
- China
- Prior art keywords
- node
- resource
- privilege
- broadcast
- network
- 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
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 invention provides a non-competitive conflict-free dynamic resource allocation method based on a distributed network. The method can adjust the network resource allocation situation in real time according to the number of current network nodes, is an improved fixed resource allocation mode, does not cause conflicts of resource use, and is thus referred to as a semi-dynamic pattern; and the method can allocate more resources than the average to a user under a special situation based on the specific requirement of the user, and the resources are acquired by application, so the method is a non-competitive resource use mode, referred to as a dynamic pattern. The two patterns are used together to fulfill the purpose of greatly using network resources. Thus, the method can adapt to the current network capacity, and can guarantee the resource request of a specific user; and the method is simple, low in overhead and conflict-free, and is very suitable for a distributed self-organizing network with flexible nodes.
Description
Technical field
The present invention relates to Internet resources distribution technique field, particularly relate to a kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network.
Background technology
Common distributed network resource allocative decision is mainly by following several classes:
Fixed resource distribution is also called static resource allocation, according to network heap(ed) capacity mean allocation Internet resources, the method realizes simple, there is good fairness, but shortage motility, and when network present node number is fewer serious waste of resources, be relatively specific for the network scenarios that number of network node is fewer and relatively more fixing.
Based on the resource allocation policy competed not in advance to network node Resources allocation, when node has business to adopt the method for competition to obtain the right to use of Internet resources when sending demand, if have multiple node to initiate business at synchronization simultaneously, now will cause completing because of competition conflict.This strategy is simple, and when network capacity is less, efficiency is higher, but the increase counted along with net internal segment, conflict can sharp deterioration, have a strong impact on network performance.
Dynamic processing capacity allocation policy was required for carrying out resource bid before net interior nodes transmission business, do not result in competition conflict, flexibility and reliability, but resource bid signalling interactive process is complicated and control overhead is big, distributed network is increased the weight of to the burden of conservation of resources node, also reduced network communication efficiency simultaneously.
Semi-persistent resource allocation strategy has taken into account the feature of static resource allocation and Dynamic Resource Allocation for Multimedia, reserved part resource is for dynamically applying for obtaining, all the other static resources are averagely allocated to user in net, compare above-mentioned strategy and accomplish a degree of motility, but there will be the situation of the wasting of resources equally, it is achieved get up 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, the method is adaptive to present network capacity, existing resource can be utilized to greatest extent, and can guarantee that the resource request of specific user, method is simple and expense is little, Lothrus apterus, is highly suitable for the distributed ad-hoc network that node is flexible and changeable.
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, it comprises the following steps:
Step 1, the wireless network of current distributed network is indicated map information RntiMap by all nodes in broadcast announcement distributed network by cluster head temporarily；Wherein, the value of RntiMap correspondence position is that this RNTI node of 1 expression exists, and is that 0 expression RNTI node is absent from；RNTI is Radio Resource temporary mark, the value of RNTI and the position of corresponding bit, represent node networks after successfully be its distribution net in ID；All nodes include ordinary node and privilege node；
Step 2, after arbitrary node receives the broadcast of cluster head, is broadcasted the information that broadcast is carried by the broadcast frame of self；
Step 3, after arbitrary node receives the broadcast of cluster head or the broadcast of other nodes, the RNTI of the node total number M in current network and M node is calculated according to the RntiMap carried in broadcast message, and the node number N less than self RNTI value, then the cycle of the dedicated channel resource DCH that this node uses is M, skew is the resource granule of N, completes the resource distribution of half dynamic mode；
Step 4, if producing burst service without node, step 1-step 3 is utilized to proceed the resource distribution of half dynamic mode, if arbitrary node produce burst service need more multiple resource time, then the resource of half dynamic mode is distributed and switches to the resource of dynamic mode distribute, execution step 5-7；
Step 5, produces the node of burst service as application node, carries the resource amounts of particles self needing application privileged resource, and be broadcasted in privilege request signaling；
Step 6, after cluster head receives all privilege request signalings, it is judged that in current network, whether the number of institute's privileged trading node is more than 1, if more than 1, disagreeing distribution, otherwise agrees to distribution；For agreeing to distribution, carry out privilege to reply, described privilege carries the respective resources granule of application node id and distribution in replying, and this privilege return information as the part of cluster head broadcast message in upper broadcast frame broadcast transmission once to the whole network node, and this application node is changed into privilege node, after terminating the life cycle that described privilege node takies resource granule, this privilege Node is ordinary node；For disagreeing distribution, carry out privilege reply, described privilege reply in without any information of application node, and this privilege return information as the part of cluster head broadcast message in upper broadcast frame broadcast transmission once to the whole network node；Simultaneously cluster head updates privilege node i d and privilege node number information in RntiMap, and sends a switch indicating information and notify that the whole network node at the appointed time completes resource switch；
Step 7, arbitrary node detects when in broadcast, RntiMap is different from the RntiMap in last broadcast, privilege node i d in new RntiMap and privilege node number information is preserved；And after this node receives switch indicating information, record switching time, and when arriving switching time, carry out resource switch according to privilege node i d in the RntiMap that this locality preserves and privilege node number information, the resource to complete dynamic mode is distributed.
Compared with prior art, the invention has the beneficial effects as follows:
The non-competing Lothrus apterus dynamic resource allocation method that the present invention proposes can adjust Internet resources distribution condition in real time according to current network node number, is the fixed resource method of salary distribution of a kind of improvement, does not result in resource and uses conflict, is referred to as half dynamic mode；For the specific needs of user, its resource more than par can be distributed under special circumstances, adopt the mode of application to obtain, belong to non-competing resource using mode, be referred to as dynamic mode.Both of which with the use of, reach very big limit use Internet resources purpose.
Accompanying drawing explanation
Fig. 1 be the present invention based on frame structure schematic diagram in the non-competing Lothrus apterus dynamic resource allocation method of distributed network；
Fig. 2 be the present invention based on privileged resource application process schematic diagram in the non-competing Lothrus apterus dynamic resource allocation method of distributed network.
Detailed description of the invention
In order to make the purpose of the present invention, technical scheme and advantage clearly understand, below in conjunction with drawings and Examples, the present invention is further elaborated.Should be appreciated that specific embodiment described herein is only in order to explain the present invention, is not intended to limit the present invention.
Distributed network is a kind of network morphology being different from centralized network, and it is mainly characterized by net can directly communicating between all nodes but not must flow through Network Central Node forwarding operation.Therefore one of key technology of distributed network is exactly distribution and the use strategy of resource.
As it is shown in figure 1, in resource frame structure, DCH (dedicated channel) resource of instruction uses for distributing to the node in network.Under half dynamic mode, the DCH channel resource in resource frame, according to the node number in current network, is averagely allocated to all nodes in network by cluster head node (for network resource management).As schemed to have 392 available DCH resource granules in this system-frame.
A kind of non-competing Lothrus apterus dynamic resource allocation method based on distributed network, comprising:
Step 1, the RntiMap information (wireless network indicates mapping table temporarily) of current distributed network is notified all nodes in network by system broadcasts by cluster head.Wherein, RNTI (Radio Resource temporary mark) represent node network after successfully for its distribution net in ID, the value of RntiMap correspondence position is that this RNTI node of 1 expression exists, and is that 0 expression RNTI node is absent from, and all nodes include ordinary node and privilege node.
Step 2, after any node receives the broadcast of cluster head, the RNTI (value of RNTI is the position of corresponding bit) of the node total number in current network and these nodes is calculated according to the RntiMap information carried in broadcast message, and by broadcasting the broadcast message that this information is broadcasted also receiving from cluster head node farther out cluster head at self broadcast frame with guarantee.
Step 3, after any node receives the broadcast of cluster head, calculate in network at net node total number M and the node number N less than self RNTI value, then the DCH resource that this node uses is the cycle is M, offsets the resource granule into N.
Step 4, if producing burst service without node, step 1-step 3 is utilized to carry out the resource distribution of half dynamic mode, if arbitrary node produce burst service need more multiple resource time, then the resource of half dynamic mode is distributed and switches to the resource of dynamic mode distribute, execution step 5-7；
Step 5, produces the node of burst service as application node, carries the resource amounts of particles self needing application privileged resource, and be broadcasted in PRIVILIGE_REQ (privilege request) signaling；
Step 6, as in figure 2 it is shown, after cluster head reception all PRIVILIGE_REQ (privilege request) signaling, it is judged that in current network, whether the number of institute's privileged trading node is more than 1, if more than 1, disagreeing distribution, otherwise agrees to distribution；For agreeing to distribution, sending privilege and reply to all of node, described privilege carries the respective resources granule of application node id and distribution in replying, and this application node transfers privilege node to, after terminating the life cycle that described privilege node takies resource granule, this privilege Node is ordinary node；For disagreeing distribution, then send privilege and reply to all of node, without any information of application node in described privilege reply；Cluster head updates privilege node i d and privilege node number information in RntiMap simultaneously, will carry up-to-date resource information in upper broadcast message once.Occurring to prevent net interior nodes from receiving the asynchronous situation that resource service condition is inconsistent caused of broadcast, cluster head can send a specific SWITCH_IND (switching instruction) message informing the whole network node simultaneously and at the appointed time complete resource switch.
Step 7, it is as follows that resource switch specifically performs process:
Arbitrary node detects when in broadcast, RntiMap is different from the RntiMap in last broadcast, or PrivilegeNode (privilege node i d) and PriviligeNum (franchise node number) information different from the information in last time broadcast time, new RntiMap, PrivilegeNode, PrivilegeNum are preserved, and non-immediate uses up-to-date resource distribution.This node records switching time after receiving SWITCH_IND, when arriving switching time, carries out resource switch according to new RntiMap, PrivilegeNode, PrivilegeNum information that this locality preserves.
The resource location that wherein each category node uses can obtain according to following method:
Ordinary node according to RntiMap calculate in network at net nodes M and and the node number N less than self RNTI；If the RNTI of PrivilegeNode is less than self RNTI, then the DCH resource granule that node uses is the cycle is M+PriviligeNum, offsets the resource granule into N+PriviligeNum；If the RNTI of PrivilegeNode is more than self RNTI, then the DCH resource granule that node uses is the cycle is M+PriviligeNum, offsets the resource granule into N；
The DCH resource granule that power node uses be the cycle is M+PriviligeNum, offset into N, N+1 ..., N+PriviligeNum-1 resource granule.The whole network is up to two franchise nodes.
The cluster head node of the present invention safeguards the RNTI information of the whole network active node, by periodically sending the RntiMap instruction notice network node carried in broadcast message；The net interior nodes of the present invention calculates the respective resource use moment according to the RntiMap in broadcast according to the method that the cycle adds skew；The present invention has the node of burst service can use request to cluster head application additional resource, and cluster head is asked according to network node application situation response node, and carries up-to-date RntiMap and PrivilegeNode in upper broadcast message once；The cluster head of the present invention sends SWITCH_IND signaling message, indicates the moment of switching in the message, and net interior nodes, according to the resource information self stored and the SWITCH_IND instruction received, completes resource switch in the same time.The distribution method of such present invention can maximize the whole network resource utilization, Signalling exchange is few, reach the reasonable combination of semi-persistent scheduling and dynamic dispatching, the off line interior nodes of normal condition can be met and divide equally the whole network resource, wasting without slack resources, can meet again some node has the special circumstances dynamically obtaining available temporary resource during burst service.
The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all any amendment, equivalent replacement and improvement etc. made within the spirit and principles in the present invention, should be included within protection scope of the present invention.
Claims (1)
1. the non-competing Lothrus apterus dynamic resource allocation method based on distributed network, it is characterised in that comprise the following steps:
Step 1, the wireless network of current distributed network is indicated map information RntiMap by all nodes in broadcast announcement distributed network by cluster head temporarily；Wherein, the value of RntiMap correspondence position is that this RNTI node of 1 expression exists, and is that 0 expression RNTI node is absent from；RNTI is Radio Resource temporary mark, the value of RNTI and the position of corresponding bit, represent node networks after successfully be its distribution net in ID；All nodes include ordinary node and privilege node；
Step 2, after arbitrary node receives the broadcast of cluster head, is broadcasted the information that broadcast is carried by the broadcast frame of self；
Step 3, after arbitrary node receives the broadcast of cluster head or the broadcast of other nodes, the RNTI of the node total number M in current network and M node is calculated according to the RntiMap carried in broadcast message, and the node number N less than self RNTI value, then the cycle of the dedicated channel resource DCH that this node uses is M, skew is the resource granule of N, completes the resource distribution of half dynamic mode；
Step 4, if producing burst service without node, step 1-step 3 is utilized to proceed the resource distribution of half dynamic mode, if arbitrary node produce burst service need more multiple resource time, then the resource of half dynamic mode is distributed and switches to the resource of dynamic mode distribute, execution step 5-7；
Step 5, produces the node of burst service as application node, carries the resource amounts of particles self needing application privileged resource, and be broadcasted in privilege request signaling；
Step 6, after cluster head receives all privilege request signalings, it is judged that in current network, whether the number of institute's privileged trading node is more than 1, if more than 1, disagreeing distribution, otherwise agrees to distribution；For agreeing to distribution, carry out privilege to reply, described privilege carries the respective resources granule of application node id and distribution in replying, and this privilege return information as the part of cluster head broadcast message in upper broadcast frame broadcast transmission once to the whole network node, and this application node is changed into privilege node, after terminating the life cycle that described privilege node takies resource granule, this privilege Node is ordinary node；For disagreeing distribution, carry out privilege reply, described privilege reply in without any information of application node, and this privilege return information as the part of cluster head broadcast message in upper broadcast frame broadcast transmission once to the whole network node；Simultaneously cluster head updates privilege node i d and privilege node number information in RntiMap, and sends a switch indicating information and notify that the whole network node at the appointed time completes resource switch；
Step 7, arbitrary node detects when in broadcast, RntiMap is different from the RntiMap in last broadcast, privilege node i d in new RntiMap and privilege node number information is preserved；And after this node receives switch indicating information, record switching time, and when arriving switching time, carry out resource switch according to privilege node i d in the RntiMap that this locality preserves and privilege node number information, the resource to complete dynamic mode is distributed.
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 true CN105792371A (en) | 2016-07-20 |
| CN105792371B 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) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018024016A1 (en) * | 2016-08-05 | 2018-02-08 | 电信科学技术研究院 | Wireless-network access method and device |
| 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 |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2018024016A1 (en) * | 2016-08-05 | 2018-02-08 | 电信科学技术研究院 | Wireless-network access method and device |
| US11297561B2 (en) | 2016-08-05 | 2022-04-05 | Datang Mobile Communications Equipment Co., Ltd. | Access method and device for radio network |
| CN108156097A (en) * | 2016-12-06 | 2018-06-12 | 电信科学技术研究院 | A kind of method and device of resource allocation |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105792371B (en) | 2019-04-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104994583B (en) | Multi-channel MAC protocols method based on cluster mechanism in vehicular ad hoc network | |
| CN101094433B (en) | Method and device for scheduling resource for services of multicast and grouped cast in wireless access network | |
| US20100014429A1 (en) | Method of reporting measurement information in packet based on cellular system | |
| CN101155395B (en) | Band width distribution method, system and device based on wireless system | |
| CN101496438A (en) | Access network broadcast control-signaling channel | |
| KR20120023795A (en) | Method, apparatus and system for configuring multimedia broadcast multicast service(mbms) control information | |
| JP5681207B2 (en) | Multicast broadcast service information processing method | |
| EP3926839A1 (en) | Base station system, radio unit and wireless communication apparatus | |
| US8385247B2 (en) | Communication systems and methods with resource management for overlapping multicast and broadcast service zones | |
| CN103248463B (en) | A kind of method and apparatus of transmission frame information | |
| CN101849420A (en) | Wireless resource scheduling method and occupied information sending method for multi base station MBS | |
| CN105792371A (en) | Non-competitive conflict-free dynamic resource allocation method based on distributed network | |
| US9615355B2 (en) | Group resource release method, device and system | |
| CN101965694B (en) | For identifying the method for connection, mobile station and base station | |
| CN103929820A (en) | Network scheduling terminal and terminal response scheduling method and device | |
| CN101583082A (en) | Method, device and base station for dynamically adjusting multicast single frequency network area | |
| CN103139880B (en) | Paging method | |
| CN104579547A (en) | Data transmission method | |
| CN107710849A (en) | Self-adapting time slot distribution in TSCH cordless communication networks | |
| CN101500312A (en) | Available resource allocation method | |
| CN104285391B (en) | Method for controlling interference and base station | |
| CN101090528A (en) | Channel resource allocating method in trunking service and trunking communication system | |
| CN102378372A (en) | Carrier component scheduling method | |
| CN103763778A (en) | Method for allocating wireless network channels | |
| CN111385744A (en) | Dynamic channel access method based on polling |
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 |