CN108156595B - Preamble resource allocation method based on timing advance command in machine communication - Google Patents
Preamble resource allocation method based on timing advance command in machine communication Download PDFInfo
- Publication number
- CN108156595B CN108156595B CN201711269260.9A CN201711269260A CN108156595B CN 108156595 B CN108156595 B CN 108156595B CN 201711269260 A CN201711269260 A CN 201711269260A CN 108156595 B CN108156595 B CN 108156595B
- Authority
- CN
- China
- Prior art keywords
- cell
- timing advance
- access
- preamble
- machine communication
- 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
- 238000004891 communication Methods 0.000 title claims abstract description 42
- 238000000034 method Methods 0.000 title claims abstract description 20
- 238000013468 resource allocation Methods 0.000 title claims abstract description 12
- 238000013139 quantization Methods 0.000 claims abstract description 8
- FGUUSXIOTUKUDN-IBGZPJMESA-N C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 Chemical compound C1(=CC=CC=C1)N1C2=C(NC([C@H](C1)NC=1OC(=NN=1)C1=CC=CC=C1)=O)C=CC=C2 FGUUSXIOTUKUDN-IBGZPJMESA-N 0.000 claims description 6
- GNFTZDOKVXKIBK-UHFFFAOYSA-N 3-(2-methoxyethoxy)benzohydrazide Chemical compound COCCOC1=CC=CC(C(=O)NN)=C1 GNFTZDOKVXKIBK-UHFFFAOYSA-N 0.000 claims description 4
- 238000005457 optimization Methods 0.000 description 5
- 238000005516 engineering process Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a preamble resource allocation method based on a timing advance command in machine communication, which comprises the following steps: 1) designing cell radius as an integer multiple of a timing advance quantization interval according to the characteristics of a timing advance command, and dividing the cells into K groups according to the timing advance quantization interval, wherein the timing advance command represents propagation delay from a machine communication device to a base station; 2) the base station combines the available maximum preamble quantity according to the quantity of the communication equipment of the machine to be accessed in the cell and obtains the actual used preamble quantity in the cell according to the principle of maximum access efficiency; 3) and the base station obtains the number of the machine communication equipment which is allowed to be accessed in the cell according to the number of the actually used preambles in the cell and the principle of the maximum access efficiency.
Description
Technical Field
The invention relates to the technical field of preamble resource management of machine type communication in an Internet of things environment, in particular to a preamble resource allocation method based on a timing advance command in machine type communication.
Background
Machine type communication, also called machine-to-machine communication, is a key technology for developing internet of things networks, and can provide connection between machines without human intervention and achieve harmonious coexistence with human-to-human communication. However, such communication method includes a large number of access devices, and due to the shortage of preamble resources, if such a large number of access devices directly access to the existing wireless access network, the access efficiency is low, the random access load is large, the access is congested, and even the communication between people is disturbed. The access efficiency can be effectively improved by using the technology of timing advance command comparison, but when the number of access devices is small, the preamble number is not controlled, so that the preamble resources are wasted; when the number of the access devices is larger, the number of the access devices is not controlled, and the access efficiency is still lower. Therefore, the invention provides the dynamic control of the number of the access devices and the preamble resources on the basis of applying the timing advance command, and can effectively improve the access efficiency.
Disclosure of Invention
According to the preamble resource allocation method based on the timing advance command in the machine communication, which is provided by the invention, the efficiency of random access is increased by using a timing advance command comparison method; based on the principle of "maximum access efficiency", the maximum available preamble number is used as a constraint, and the control of the number of access devices and the allocation of preamble resources are performed on the cell, specifically as follows:
step one, according to the characteristic of a timing advance command, designing the radius of a cell as integral multiple of a timing advance quantization interval, and dividing the cell into K groups according to the timing advance quantization interval, wherein the timing advance command represents the propagation delay from a machine communication device to a base station.
Step two, the base station combines the available maximum preamble quantity according to the quantity of the communication equipment of the machine to be accessed in the cell and obtains the actual used preamble quantity in the cell according to the principle of maximum access efficiency;
and step three, the base station obtains the number of the machine communication equipment allowed to be accessed in the cell according to the number of the actually used preambles in the cell and the principle of the maximum access efficiency.
As a further optimization scheme of the preamble resource allocation method based on the timing advance command in the machine communication, in the first step, the radius of the cell is designed as follows:
R＝K*d＝16KTsc/2
wherein, K is an integer, represents the control coefficient of the size of the radius of the cell that needs actually, also represent the quantity of grouping; t issRepresents the basic time unit of the system, and is 0.0325 mu s; c represents the speed of light; d represents the inter-group distance of the packet.
As a further optimization scheme of the preamble resource allocation method based on the timing advance command in machine communication, in step two, the control of the preamble number takes the available maximum preamble number as a constraint factor, and according to the principle of "maximum access efficiency", the final actually used preamble number in the cell is:
0＜m≤mmax
wherein m ismaxRepresents the maximum number of preambles available in the cell, and m represents the number of preambles actually used in the cell;
a variable x representing a value corresponding to the maximum value of f (x);
denotes the access efficiency, where pACBIndicates the probability of Access Class Barring (ACB), and N indicates the number of machine communication devices which want to Access.
As a further optimization scheme of the preamble resource allocation method based on the timing advance command in the machine communication, in the second step, the number of preambles actually used in the cell is obtained according to the following steps:
step a), setting iteration times mmaxLet n equal to 1, mt emp＝1，pACB＝1，Reff,temp＝0；
Step b), calculating
And judging whether the value is greater than Reff,tempIf the judgment result is yes, then let mt emp＝n，
Carrying out step d);
step c), if the judgment result in the step b) is negative, not performing any operation, and performing the step d);
step d), making n equal to n +1, judging n equal to mmaxIf yes, go to step f);
step e) and returning to the step b) if the judgment result in the step d) is negative;
step f), let m*＝mtempThe routine is terminated.
As a further optimization scheme of the preamble resource allocation method based on the timing advance command in machine communication according to the present invention, in step three, the number of machine communication devices allowed to access is based on the principle of "access efficiency is the largest", that is:
0＜C≤N
where C represents the number of machine communication devices allowed to access.
As a further optimization scheme of the preamble resource allocation method based on the timing advance command in machine communication, in step three, the number of machine communication devices allowed to access in a cell is performed according to the following steps:
step a), judging whether the number of the actually used preambles in the cell obtained in the step two is equal to m or notmaxIf the judgment result is negative, the number of the machine communication equipment allowed to be accessed in the cell is N, and the program is terminated;
if the judgment result in the step b) is yes, setting the iteration number N, and enabling N to be 1, Ct emp＝1，Reff,temp＝0；
Step c), calculating
And judging whether the value is greater than Reff,tempIf the judgment result is yes, then let Ct emp＝n，
Carrying out step e);
step d), if the judgment result in the step c) is negative, not performing any operation, and performing the step e);
step e), enabling N to be N +1, judging whether N is N +1, and if so, executing step g);
step f), if the judgment result in the step e) is negative, returning to the step c);
step g), let C*＝CtempThe routine is terminated.
Compared with the prior art, the invention adopting the technical scheme has the following technical effects:
(1) the method adopts a timing advance command comparison method to increase the efficiency of random access;
(2) the method is based on the principle of maximum access efficiency, the maximum available preamble number is used as the constraint, the control of the number of the access devices and the allocation of the preamble resources are carried out on the cell, and the higher access efficiency can still be kept under the condition of the change of the number of the access devices.
Drawings
Fig. 1 is a flowchart of a preamble resource allocation method based on a timing advance command in machine communication according to an embodiment of the present invention.
FIG. 2 is a flowchart illustrating an embodiment of step 102 shown in FIG. 1.
FIG. 3 is a flowchart illustrating an embodiment of step 103 shown in FIG. 1.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in detail with reference to the accompanying drawings and specific embodiments.
As shown in fig. 1, an embodiment of the present invention provides a flowchart of a method for controlling access devices and allocating preamble resources based on a timing advance command in a machine-type communication system, where the method includes the following steps:
step 101: the cell radius is designed to be an integer multiple of the timing advance quantization interval according to the characteristics of the timing advance command indicating the propagation delay intended to access the machine communication device to the base station, and the cells are divided into K groups according to the timing advance quantization interval. The radius of the cell is designed to be:
R＝K*d＝16KTsc/2
wherein, K is an integer, represents the control coefficient of the size of the radius of the cell that needs actually, also represent the quantity of grouping; t issRepresents the basic time unit of the system, and is 0.0325 mu s; c represents the speed of light; d represents the inter-group distance of the packet.
Step 102: the control of the preamble number is that the available maximum preamble number is used as a constraint factor, and according to the principle of 'maximum access efficiency', the actual preamble number used in the final cell is as follows:
0＜m≤mmax
wherein m ismaxRepresents the maximum number of preambles available in the cell, and m represents the number of preambles actually used in the cell;
a variable x representing a value corresponding to the maximum value of f (x);
denotes the access efficiency, where pACBIndicates the probability of Access Class Barring (ACB), and N indicates the number of machine communication devices which want to Access.
Step 103: the number of machine communication devices allowed to access is based on the principle of "access efficiency is maximum", namely:
0＜C≤N
where C represents the number of machine communication devices allowed to access.
As shown in fig. 2, the flowchart of the specific implementation steps of step 102 in fig. 1 includes the following steps:
step 201: setting iteration number mmax+1, let n equal 1, Ct emp＝1，pACB＝1，Reff,temp＝0。
Step 202: calculating the access efficiency when the number of preambles is n
And judging whether the value is greater than Reff,temp。
Step 203: let mt emp＝n，
Step 204: let n be n +1, judge n be mmax+1 is true.
Step 205: let m*＝mtempThe routine is terminated.
As shown in fig. 3, the flowchart of the specific implementation steps of step 103 in fig. 1 includes the following steps:
step 301: determining whether the number of actually used preambles in a cell obtained in claim 4 equals mmax。
Step 302: setting iteration number N +1, making N equal to 1, Ct emp＝1，Reff,temp＝0。
Step 303: calculating the access efficiency when the number of accesses is n
And judging whether the value is greater than Reff,temp。
Step 304: let Ct emp＝n，
Step 305: let N be N +1, judge whether N be N + 1.
Step 306: let C*＝CtempThe routine is terminated.
The above description is only for the specific embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention.
Claims (1)
1. A preamble resource allocation method based on timing advance command in machine communication is characterized in that a timing advance command comparison method is applied to increase the efficiency of random access; based on the principle of "maximum access efficiency", the maximum available preamble number is used as a constraint, and the control of the number of access devices and the allocation of preamble resources are performed on the cell, specifically as follows:
step one, according to the characteristic of a timing advance command, designing the radius of a cell as integral multiple of a timing advance quantization interval, and dividing the cell into K groups according to the timing advance quantization interval, wherein the timing advance command represents the propagation delay from a machine communication device to a base station;
step two, the base station combines the available maximum preamble quantity according to the quantity of the communication equipment of the machine to be accessed in the cell and obtains the actual used preamble quantity in the cell according to the principle of maximum access efficiency;
thirdly, the base station obtains the number of the machine communication equipment which is allowed to be accessed in the cell according to the number of the actually used preambles in the cell and the principle of the maximum access efficiency;
in the first step, the radius of the cell is designed as follows:
R＝K*d＝16KTsc/2
wherein, K is an integer, represents the control coefficient of the size of the radius of the cell that needs actually, also represent the quantity of grouping; t issRepresents the basic time unit of the system, and is 0.0325 mu s; c represents the speed of light; d represents the inter-group distance of the packet;
in the second step, the control of the preamble number takes the available maximum preamble number as a constraint factor, and according to the principle of "maximum access efficiency", the final preamble number actually used in the cell is:
0＜m≤mmax
wherein m ismaxRepresents the maximum number of preambles available in the cell, and m represents the number of preambles actually used in the cell;
the acquisition of the number of preambles actually used in the cell in the step two is performed according to the following steps:
step a), setting iteration times mmaxLet n equal to 1, mt emp＝1，pACB＝1，Reff,temp＝0；
Step b), calculating
And judging whether the value is greater than Reff,tempIf the judgment result is yes, then let mt emp＝n，
Carrying out step d);
step c), if the judgment result in the step b) is negative, not performing any operation, and performing the step d);
step d), making n equal to n +1, judging n equal to mmaxIf yes, go to step f);
step e) and returning to the step b) if the judgment result in the step d) is negative;
step f), let m*＝mtempThe routine is terminated;
in step three, the number of the machine communication devices allowed to access is based on the principle of "access efficiency is maximum", that is:
wherein C represents the number of machine communication devices allowed to access;
the number of machine communication devices allowed to access in the cell in step three is as follows:
step a), judging whether the number of preambles actually used in the cell obtained in claim 4 is equal to mmaxIf the judgment result is negative, the number of the machine communication equipment allowed to be accessed in the cell is N, and the program is terminated;
if the judgment result in the step b) is yes, setting the iteration number N, and enabling N to be 1, Ct emp＝1，Reff,temp＝0；
Step c), calculating
And judging whether the value is greater than Reff,tempIf the judgment result is yes, then let Ct emp＝n，
Carrying out step e);
step d), if the judgment result in the step c) is negative, not performing any operation, and performing the step e);
step e), enabling N to be N +1, judging whether N is N +1, and if so, executing step g);
step f), if the judgment result in the step e) is negative, returning to the step c);
step g), let C*＝CtempThe routine is terminated.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269260.9A CN108156595B (en) | 2017-12-05 | 2017-12-05 | Preamble resource allocation method based on timing advance command in machine communication |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711269260.9A CN108156595B (en) | 2017-12-05 | 2017-12-05 | Preamble resource allocation method based on timing advance command in machine communication |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108156595A CN108156595A (en) | 2018-06-12 |
| CN108156595B true CN108156595B (en) | 2020-07-03 |
Family
ID=62465961
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711269260.9A Active CN108156595B (en) | 2017-12-05 | 2017-12-05 | Preamble resource allocation method based on timing advance command in machine communication |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108156595B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112655252B (en) * | 2018-10-10 | 2023-07-11 | Oppo广东移动通信有限公司 | Synchronization indication method, terminal device, network device, chip and storage medium |
| CN112788532A (en) | 2019-11-07 | 2021-05-11 | 索尼公司 | Electronic device, user equipment, wireless communication method, and storage medium |
| CN114143757B (en) * | 2022-02-08 | 2022-05-31 | 南京邮电大学 | Time delay guaranteed mass machine type communication access control method and system |
Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101448325A (en) * | 2007-11-27 | 2009-06-03 | 大唐移动通信设备有限公司 | Processing method and base station for random access process |
| CN101834659A (en) * | 2005-10-26 | 2010-09-15 | 三菱电机株式会社 | Be used for method and apparatus at semi-duplex communication system communicating downlink and uplink sub-frames |
| CN101854646A (en) * | 2008-12-31 | 2010-10-06 | 上海华为技术有限公司 | Uplink detection method, as well as uplink synchronization method, device and system of LTE (Long Term Evolution) |
| CN102036359A (en) * | 2009-09-29 | 2011-04-27 | 大唐移动通信设备有限公司 | Method and equipment for transmitting uplink transmission information |
| CN102238752A (en) * | 2010-04-30 | 2011-11-09 | 电信科学技术研究院 | Random access control method of machine type communication (MTC) equipment and MTC equipment |
| CN102656929A (en) * | 2009-10-29 | 2012-09-05 | 阿尔卡特朗讯 | Method for range extension in wireless communication systems |
| CN103379656A (en) * | 2012-04-13 | 2013-10-30 | 普天信息技术研究院有限公司 | Random access method and related device |
| CN103582112A (en) * | 2012-08-08 | 2014-02-12 | 中兴通讯股份有限公司 | Method for determining time advance, user equipment and base station |
| CN103889069A (en) * | 2014-03-27 | 2014-06-25 | 武汉邮电科学研究院 | Random access signal sending and receiving method applied to large coverage area |
| CN105493584A (en) * | 2014-09-30 | 2016-04-13 | 华为技术有限公司 | Transmission timing adjustment method and device |
| CN106793147A (en) * | 2017-03-02 | 2017-05-31 | 西安电子科技大学 | Pilot tone accidental access method based on timing-advance information |
| CN107017971A (en) * | 2011-06-28 | 2017-08-04 | Lg电子株式会社 | Send and receive method, user equipment and the base station of downlink data |
| CN107040875A (en) * | 2017-03-28 | 2017-08-11 | 南京邮电大学 | The leader resource distribution method of low-power consumption in a kind of machine-type communication system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9730250B2 (en) * | 2013-04-11 | 2017-08-08 | Lg Electronics Inc. | Method and user equipment for transmitting uplink signal |
-
2017
- 2017-12-05 CN CN201711269260.9A patent/CN108156595B/en active Active
Patent Citations (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101834659A (en) * | 2005-10-26 | 2010-09-15 | 三菱电机株式会社 | Be used for method and apparatus at semi-duplex communication system communicating downlink and uplink sub-frames |
| CN101448325A (en) * | 2007-11-27 | 2009-06-03 | 大唐移动通信设备有限公司 | Processing method and base station for random access process |
| CN101854646A (en) * | 2008-12-31 | 2010-10-06 | 上海华为技术有限公司 | Uplink detection method, as well as uplink synchronization method, device and system of LTE (Long Term Evolution) |
| CN102036359A (en) * | 2009-09-29 | 2011-04-27 | 大唐移动通信设备有限公司 | Method and equipment for transmitting uplink transmission information |
| CN102656929A (en) * | 2009-10-29 | 2012-09-05 | 阿尔卡特朗讯 | Method for range extension in wireless communication systems |
| CN102238752A (en) * | 2010-04-30 | 2011-11-09 | 电信科学技术研究院 | Random access control method of machine type communication (MTC) equipment and MTC equipment |
| CN107017971A (en) * | 2011-06-28 | 2017-08-04 | Lg电子株式会社 | Send and receive method, user equipment and the base station of downlink data |
| CN103379656A (en) * | 2012-04-13 | 2013-10-30 | 普天信息技术研究院有限公司 | Random access method and related device |
| CN103582112A (en) * | 2012-08-08 | 2014-02-12 | 中兴通讯股份有限公司 | Method for determining time advance, user equipment and base station |
| CN103889069A (en) * | 2014-03-27 | 2014-06-25 | 武汉邮电科学研究院 | Random access signal sending and receiving method applied to large coverage area |
| CN105493584A (en) * | 2014-09-30 | 2016-04-13 | 华为技术有限公司 | Transmission timing adjustment method and device |
| CN106793147A (en) * | 2017-03-02 | 2017-05-31 | 西安电子科技大学 | Pilot tone accidental access method based on timing-advance information |
| CN107040875A (en) * | 2017-03-28 | 2017-08-11 | 南京邮电大学 | The leader resource distribution method of low-power consumption in a kind of machine-type communication system |
Non-Patent Citations (1)
| Title |
|---|
| Lower-power consumption spacial group based random access scheme for MTC devices;Zhenya Shao;《2017 IEEE/CIC International Conference on Communications in China》;20171024;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108156595A (en) | 2018-06-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108156595B (en) | Preamble resource allocation method based on timing advance command in machine communication | |
| CN108901075B (en) | GS algorithm-based resource allocation method | |
| CN110233755B (en) | Computing resource and frequency spectrum resource allocation method for fog computing in Internet of things | |
| CN109743713B (en) | Resource allocation method and device for electric power Internet of things system | |
| CN103916867A (en) | Method and apparatus for determining capacity of control channel | |
| CN104780016A (en) | Data resource transmission method and data resource transmission equipment | |
| CN112188551A (en) | Computation migration method, computation terminal equipment and edge server equipment | |
| Tian et al. | Accurate sensor traffic estimation for station grouping in highly dense IEEE 802.11 ah networks | |
| CN102413476A (en) | Dynamic combination and allocation method of CRB (Cognitive Resource Block) resource in cognitive LTE (Long-Term Evolution) system | |
| CN105101214A (en) | Resource virtualizing mapping method of ultra-dense wireless network | |
| CN106874108B (en) | Technology for minimizing number of micro clouds in mobile cloud computing | |
| CN104968051A (en) | Cell broadband up link resource distribution method and apparatus | |
| CN105472714A (en) | Energy optimization method of mobile cloud computing uplink data transmission | |
| CN103049326A (en) | Method and system for managing job program of job management and scheduling system | |
| CN107040875B (en) | Preamble resource allocation method for low power consumption in machine type communication system | |
| CN107948330A (en) | Load balancing based on dynamic priority under a kind of cloud environment | |
| CN107484111B (en) | M2M communication network association and power distribution algorithm | |
| CN104468379B (en) | Virtual Hadoop clustered nodes system of selection and device based on most short logical reach | |
| CN102076105B (en) | Polling method for point-to-multipoint communication system | |
| Pinagapany et al. | Solving channel allocation problem in cellular radio networks using genetic algorithm | |
| CN104507150A (en) | Method for clustering virtual resources in baseband pooling | |
| CN103269519A (en) | Method and system for allocating processing resource in centralized-type base station architecture | |
| CN103516624B (en) | Network resource allocation method and device | |
| CN103796226A (en) | Network optimizing method and apparatus | |
| CN106856627A (en) | It is adapted to the SR collocation methods of fast dispatch |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Zhu Hongbo Inventor after: Shao Zhenya Inventor after: Zhang Jun Inventor after: Sun Xinghua Inventor before: Zhu Hongbo Inventor before: Shao Zhenya Inventor before: Zhang Jun Inventor before: Zhang Xinghua |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |