CN102387547B - ALOHA-based control method of time slots (TSs) of base station (BS) - Google Patents
ALOHA-based control method of time slots (TSs) of base station (BS) Download PDFInfo
- Publication number
- CN102387547B CN102387547B CN201110332268.1A CN201110332268A CN102387547B CN 102387547 B CN102387547 B CN 102387547B CN 201110332268 A CN201110332268 A CN 201110332268A CN 102387547 B CN102387547 B CN 102387547B
- Authority
- CN
- China
- Prior art keywords
- frame
- flag
- users
- user
- length
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses an ALOHA-based control method of time slots (TSs) of a base station (BS). The control method comprises the following steps: S1. estimating the number of terminals to which information needs to be sent, namely the number of users for next frame; S2. estimating the length T of a dynamic frame according to the number of the users for next frame; S3. estimating the number WT of the TSs to be resent according to the length T of the dynamic frame; and S4. taking the obtained T and WT as setting standards of next frame. By adopting the control method, the frame length can be reasonably adjusted and the resource utilization ratio can be improved, wherein, the frame length can be dynamically adjusted according to the use condition of the previous frame so as to reduce the probability of collision and idleness of the TSs of the frame. Compared with a plurality of common ALOHA-related algorithms in the prior art, the control method has the characteristics of higher throughput and shorter average delay.
Description
Technical field
The present invention relates to the communications field of time division multiple access (TDMA) wireless communication system, particularly about the control method of a kind of base station time slot ALOHA of terrestrial radio broadcast channel contention.
Background technology
DMR is the abbreviation of Digital Mobile Radio, is the consensus standard that European digital handset is used.ETSI?TS?102?361X。
DMR consensus standard is used for special-purpose digital handset.Simultaneously for the dPMR consensus standards that use of common number intercom more.The definite digital handset radio-frequency (RF) index of the Ministry of Information Industry is be applicable to three frequency ranges such as 137-167MHZ, 403-425MHz and 915-917MHz and adopt 12.5kHz and two kinds of channel spacings of 6.25kHz, and the former is TDMA2 time slot, and the latter is FDMA.
Traditional analog-interphone shortcoming is outstanding: frequency efficiency is low, phase mutual interference is serious, business function is more single, communication less stable and management are controlled more difficult, and the shortcoming that these are enumerated out, but be all exactly the advantage of digital handset, after intercom digitlization, there is many functions and business, be all analog-interphone cannot realize at all.Following intercom is by the world that is digital handset.
ALOHA agreement is that 20 century 70s are invented by Norman Abramson and colleague thereof in University of Hawaii, and object is for solving the contention problem of terrestrial radio broadcast channel.It is a kind of distribution according to need time division multiple access way designing for interactive computer transfer of data, or is Random Multi-Access Method, is that the form with procotol realizes.ALOHA algorithm is from pure ALOHA algorithm, time slot A LOHA algorithm, and Frame Slotted Aloha algorithm, dynamically Frame Slotted Aloha algorithm progressively develops.
Pure ALOHA algorithm is random select time point transmission information within one continuous period, and this system is very simple, but collision is many with idle time of channel, therefore channel utilization is low.
Time slot A LOHA algorithm is that channel distribution is become to discrete time gap, selects at random time slot to send information.But, the frequency halving that the purer ALOHA algorithm collision of time slot A LOHA algorithm occurs, data throughput performance increases.But when having a large number of users arrival to send, efficiency is not high.
Frame slot Aloha algorithm is the improvement of Slot-aloha, and it is that channel is represented with information frame, and information frame is divided into many time slots (slot), and each user selects a time slot to send the data of oneself at random.In actual applications, each user only allows to select equably at random time slot in the beginning of every frame, waits for that a random timeslot number retransmits if bump, and after the certain number of times failure of retry, selects to abandon.But all frame lengths of Frame Slotted Aloha algorithm equate, when number of users is counted much larger than frame slot, in a frame, all time slots all bump, and this situation can be extended to next frame, when number of users is counted much smaller than frame slot, have a lot of time slots and be wasted.
For reducing collision and idle chance, can dynamically adjust frame length according to the service condition of former frame, i.e. dynamic Frame Slotted Aloha algorithm, but dynamic Frame Slotted Aloha algorithm is an abstract concept, is only a kind of thought, is not a kind of concrete algorithm.Owing to not having at present a kind of unified method of adjustment, each manufacturer is all realizing according to a set of theory of oneself, and the effect of its realization is unsatisfactory.
Summary of the invention
In order to overcome the defect of prior art, the invention discloses the control method of a kind of base station time slot ALOHA, it is a kind of method that realizes dynamic Frame Slotted Aloha algorithm, its core is reasonably to adjust frame length, improves resource utilization; It can dynamically adjust frame length according to the service condition of former frame, thereby reduces frame slot collision and idle chance.
Technical scheme of the present invention is as follows:
A control method of base station time slot ALOHA, is characterized in that, comprises the following steps:
S1: estimation need to send the number of terminals of information, estimates next frame number of users User;
S2: according to next frame number of users User, estimate dynamic frame size T;
S3: according to dynamic frame size T, estimate to wait for repeating transmission timeslot number WT;
S4: the established standards using the T obtaining and WT as next frame.
Preferably, in described step S1, next frame number of users equals previous frame conflict number of users and the new number of users sum that arrives; If conflict timeslot number is Ncoll in frame, sending successful timeslot number is Nsuc;
Wherein, when having a plurality of users to be chosen in to send on same time slot, collision will occur, these users are called as conflict user, and this time slot is called as conflict time slot simultaneously;
Set each user in each information frame and select time slot to meet the Poisson distribution of λ=1, the time slot average user number of respectively conflicting in information frame is about 2.39, thereby conflict user forecast is 2.39*Ncoll.
Preferably, described step S1 calculates according to the method for moving average, and described S1 further comprises:
S11, initialization λ o(1), λ 1(1), T (1);
S12, estimates that flag frame conflict number of users is 2.39*Ncoll (flag);
S13, estimates flag frame λ o, as follows:
λ1（flag）=(2.39*Ncoll(flag)+Nsuc（flag）)/T(flag-1)
λo（flag）=(λ1（flag）+λ1（flag-1）+……+λ1（flag-NUM+1）)/T(flag)；
S14, estimates that (flag+1) framed user counts User, as follows:
User（flag+1）=alpha*（2.39*Ncoll(flag)）+beta*（λo（flag）*T(flag)）；
Wherein, flag represents present frame label, i.e. present frame sequence number;
T (flag) represents the length of present frame;
λ o(flag) represent arrival rate, it equals the newly arrived number of users of next frame divided by the length of present frame;
λ 1(flag) represent input arrival rate; It equals just to distribute at previous frame, and present frame has just started the moment sending, and the number of users of required transmission is divided by the length of previous frame;
λ o(1), λ 1(1), T (1) corresponding flag=1 respectively, the i.e. length of corresponding arrival rate, input arrival rate, the first frame during the first frame;
λ 1(flag-1) ..., λ 1(flag-NUM+1) and are all input arrival rates of corresponding different frame label;
T(flag-1) represent the length of previous frame;
Ncoll(flag) represent the conflict timeslot number of present frame;
Nsuc(flag) represent the transmission success timeslot number of present frame;
User(flag+1) represent the number of users that next frame need send;
Alpha, beta have been mainly the effects of weighting at this, because number of users is to estimate to come, so need to add that alpha, two coefficients of beta regulate;
NUM refers to that the method for moving average averages front NUM constantly, estimates current time.
Preferably, alpha=1, beta=1, NUM=5.
Preferably, described step S2 further comprises:
S201, provides the mapping table that reflects frame length T and number of users User, and described mapping table is number of users and frame length mapping table in DMR agreement, and its specific practice comprises:
In DMR, T is some fixing values.The number of users of the different numbers to number of users in 135, selects different frame lengths, calculates the throughput of a frame theory, and establishing N is number of users, and a frame theory throughput S is:
To different user number, select the maximum corresponding frame length T of throughput as the estimation of next frame, obtain number of users and frame length mapping table;
S202, mapping table in inquiry S201, searches corresponding frame length according to known number of users User.
Preferably, described step S3 further comprises:
Estimate after T, can obtain waiting for the estimation of retransmitting timeslot number WT, for
Wherein floor (.) table is less than or equal to the maximum integer of T/2.
Preferably, the arrival of setting new user is a Poisson process, and arrival rate λ o is an amount only changing slowly in time.
Preferably, in described step S2, described frame length T is an amount changing with number of users.
Compared with prior art, the beneficial effects of the utility model are as follows:
The first, the invention discloses the control method of a kind of base station time slot ALOHA, it also can be described as dynamic Frame Slotted Aloha algorithm, and its core is reasonably to adjust frame length, improves resource utilization; It can dynamically adjust frame length according to the service condition of former frame, thereby reduces frame slot collision and idle chance.
The second, the present invention is compared with the several frequently seen ALOHA related algorithm of prior art, and it has larger throughput, less average delay.
Accompanying drawing explanation
Fig. 1 is number of users and throughput graph of a relation in DMR;
Fig. 2 is number of users and average delay graph of a relation in DMR.
Embodiment
Below with the drawings and specific embodiments, the present invention will be further described.
Embodiment
A control method of base station time slot ALOHA, comprises the following steps:
S1: estimation need to send the number of terminals of information, estimates next frame number of users User;
S2: according to next frame number of users User, estimate dynamic frame size T;
S3: according to dynamic frame size T, estimate to wait for repeating transmission timeslot number WT;
S4: the established standards using the T obtaining and WT as next frame.
Wherein, in described step S1, next frame number of users equals previous frame conflict number of users and the new number of users sum that arrives; If conflict timeslot number is Ncoll in frame, sending successful timeslot number is Nsuc;
When having a plurality of users (over 1) to be chosen in to send on same time slot, will there is collision, these users are called as conflict user, and this time slot is called as conflict time slot simultaneously.
In the present embodiment, set each user in each information frame and select time slot to meet the Poisson distribution of λ=1, the time slot average user number of respectively conflicting in information frame is about 2.39, thereby conflict user forecast is 2.39*Ncoll.
From the angle of probability theory, analyze, it is mutually independently that each user selects time slot to send, and the selection of time slot is random.Such model can be analyzed with binomial distribution conventionally, and Poisson distribution is the limiting form of binomial distribution, processes simplyr at this with Poisson distribution, also tallies with the actual situation.Certainly Poisson distribution λ can get a lot of values, but λ=1st is here the most general, also approaches the most.The 2.39th, according to the Poisson distribution of λ=1, calculate.
The Poisson distribution function of λ=1 is
if this time slot is empty slot, not having user to be chosen in this time slot sends, x=0, the probability of this situation is p (0), in like manner, if only have a user to be chosen in this time slot, sends, probability is p (1), if there are two users to be chosen in this time slot, send, probability is p (2), such the like.When bumping, be, have at least two users to be chosen in this time slot and send, probability be p (2)+p (3)+p (4)+..., I calculate in situation about bumping now, collision user's number,
Illustrate the implementation procedure of step S1 below, here some identifiers that relate in process are made an explanation.
Wherein, flag represents present frame label, i.e. present frame sequence number;
T (flag) represents the length of present frame;
λ o(flag) represent arrival rate, it equals the newly arrived number of users of next frame divided by the length of present frame;
λ 1(flag) represent input arrival rate; It equals just to distribute at previous frame, and present frame has just started the moment sending, and the number of users of required transmission is divided by the length of previous frame;
λ o(1), λ 1(1), T (1) corresponding flag=1 respectively, the i.e. length of corresponding arrival rate, input arrival rate, the first frame during the first frame;
λ 1(flag-1) ..., λ 1(flag-NUM+1) and are all input arrival rates of corresponding different frame label;
T(flag-1) represent the length of previous frame;
Ncoll(flag) represent the conflict timeslot number of present frame;
Nsuc(flag) represent the transmission success timeslot number of present frame;
User(flag+1) represent the number of users that next frame need send;
Alpha, beta have been mainly the effects of weighting at this, because number of users is to estimate to come, so need to add that alpha, two coefficients of beta regulate.
Here the arrival of setting new user is a Poisson process, and arrival rate λ o (number of users/time slot) is an amount only changing slowly in time, and just available certain simple method goes to estimate, uses the method for moving average to estimate herein.The estimation of new user's arrival rate depends on the estimation of input arrival rate λ 1, and the user that estimation criterion is next frame comes from the new arrival of previous frame and conflict user, has ignored here and has waited for the impact of retransmitting time slot WT.Then utilize the mean value of λ 1 to estimate λ o.
The basic thought of the method for moving average is: according to seasonal effect in time series data, pass item by item, mean value while calculating the order that comprises certain item number successively, to reflect the method for long-term trend.Popular, be exactly the data according to nearest several moment, predict the situation in the moment that will arrive.The method of moving average is often used in the situation that some slowly change in time.Object at this by the method for moving average is: the first, calculate simple, easy to operate; The second, meet the background of applying the method for moving average, number of users temporal evolution is slow, there is no clear and definite seasonality.
If retransmit timeslot number, refer to that user data sends unsuccessfully, need by the time to retransmit after timeslot number WT, could again send.
Step S1 calculates according to the method for moving average, and this step specifically comprises:
S11, initialization λ o(1), λ 1(1), T (1).In the present embodiment, get λ o(1)=0, λ 1(1)=0, T (1)=4.
S12, estimates that flag frame conflict number of users is 2.39*Ncoll (flag).
S13, estimates flag frame λ o, as follows:
λ1（flag）=(2.39*Ncoll(flag)+Nsuc（flag）)/T(flag-1)
λo（flag）=(λ1（flag）+λ1（flag-1）+……+λ1（flag-NUM+1）)/T(flag)。
S14, estimates that (flag+1) framed user counts User, as follows:
User（flag+1）=alpha*（2.39*Ncoll(flag)）+beta*（λo（flag）*T(flag)）。
NUM refers to that the method for moving average averages front NUM constantly, estimates current time.In the present embodiment, alpha=1, beta=1, NUM=5.
Alpha, beta have been mainly the effects of weighting at this, because number of users is to estimate to come, so need to add that alpha, two coefficients of beta regulate, make estimated value closer to actual value, alpha=1, beta=1 meet most according to theory, but actual conditions are intricate, may be subject to various interference, the present invention does not carry out emulation discussion to these two coefficients, only gets alpha=1, beta=1 the most general this situation.NUM refers to that the method for moving average averages front NUM constantly, estimates current time, and at this, getting 5 is a kind of relatively following the example of of compromise, between computation complexity and accuracy, compromises, and does not pass through emulation, and these 3 parameters are little on the overall performance impact of algorithm.
Explanation about arrival rate is more abstract, illustrates herein: suppose that at present just the 8th frame distributes, just preparing to send out the 9th frame, we need to estimate the number of users of the 9th frame, thereby can reasonably distribute the length of the 9th frame.Clearly two parts are divided in the number of users of the 9th frame source, and first does not have the successfully number of users of transmission owing to colliding in the 8th frame, and second portion is in the 8th frame process of transmitting, newly arrived number of users.Arrival rate λ o (8) just refer to newly arrived user divided by the 8th frame length.And input arrival rate λ 1 (8) just refers to and just distributed at the 7th frame, the 8th frame has just started the moment sending, and the number of users of required transmission is divided by the length of the 7th frame.
Introduce in detail step S2 below according to next frame number of users User, estimate dynamic frame size T.It estimates dynamic frame size T, can be by DMR agreement.
Described frame length T is an amount changing with number of users.
By DMR agreement, estimate dynamic frame size T, it specifically comprises the following steps:
S201, provides the mapping table (as table 1) of the corresponding relation of reflection frame length T and number of users User, and wherein, described mapping table is number of users and frame length mapping table in DMR agreement, and its specific practice comprises:
In DMR, T is some fixing values.The number of users of the different numbers to number of users in 135, selects different frame lengths, calculates the throughput of a frame theory, and establishing N is number of users, and a frame theory throughput S is:
To different user number, select the maximum corresponding frame length T of throughput as the estimation of next frame, obtain number of users and frame length mapping table;
S202, the mapping table (table 1) in inquiry S201, searches corresponding frame length according to known number of users User.
Table 1
Introduce in detail step S3 below, it further comprises:
According to step S2, estimate after T, can obtain waiting for the estimation of retransmitting timeslot number WT, for
Wherein floor (.) table is less than or equal to the maximum integer of T/2.
In step S4, by the T that step obtains above; When bumping between user, in current time slots, just all can not successfully send, after need to waiting for WT time slot, then reselect time slot transmission.
Below by an emulation experiment, by relatively throughput, the minimum average B configuration time delay of four kinds of methods.
Throughput is that average every time slot is successfully processed number of users, and average delay is the required average timeslot number of the successful user of access.These two is the good and bad most important standard of measurement system, and throughput is large, represents that the number of users that average every time slot can successfully process is just many, and average retardation is little, represents processed fast of user profile.
Model assumption only produces a secondary data for each user, bumps, and retransmits after waiting for WT time slot, and when access number of times, to reach Retry still failed, selects to abandon; Process the user who arrives with speed λ in the T0 time, heretofore between in all users of arriving be disposed.
Here initial frame length is made as 4, and experiment number is 200, and reference time T0 is 100 time slots, and user's arrival rate of T0 in the time is λ=0.1:0.1:4, and Retry is variable for access number of times, under DMR agreement, respectively following four kinds of methods is carried out to emulation comparison.The λ is here an extraneous input variable, is inventor's variable for user's arrival rate input in emulation, be used for simulating user under current environment number.
Illustrate: λ=0.1:0.1:4 represents that λ is since 0.1, according to step-length 0.1, is increased to 4.
These four kinds of methods are as follows:
Method 1: the control method of a kind of base station time slot ALOHA of the embodiment of the present invention.
Method 2:T=8, WT=1.
Method 3: as number of collisions Ncoll>T/2, frame length takes a step forward, and works as Ncoll<T/6, and frame length takes a step back, otherwise frame length is constant, WT=floor (T/2)-1.
Method 4: as number of collisions Ncoll>0, frame length takes a step forward, when successful timeslot number Nsuc is less than T, frame length takes a step back, otherwise frame length is constant, WT=floor (T/2)-1.
These four kinds of methods are all by the method that solves the random division multiple accessing access of multi-user's collision, wherein method 1 is the method for the embodiment of the present invention, method 2 is Frame Slotted Aloha algorithms, method 3-4 is also dynamic Frame Slotted Aloha algorithm, the method but realizing with the present invention is different, by respectively these 4 kinds of methods being carried out to emulation, illustrate that the present invention is with respect to the superiority of other several ALOHA algorithms.
In emulation, will using λ as abscissa, and this is that retransmitting user does not have fixing distribution form, therefore can not get accurate offered load G because new user will be with speed λ poisson arrival.
Throughput, average delay Performance Ratio that Fig. 1, Fig. 2 are respectively two kinds of methods in DMR are.Simulation result shows that method in this paper (1) has maximum throughput, minimum average delay.
The preferred embodiment of the present invention is just for helping to set forth the present invention.Preferred embodiment does not have all details of detailed descriptionthe, and also not limiting this invention is only described embodiment.Obviously, according to the content of this specification, can make many modifications and variations.These embodiment are chosen and specifically described to this specification, is in order to explain better principle of the present invention and practical application, thereby under making, technical field technical staff can utilize the present invention well.The present invention is only subject to the restriction of claims and four corner and equivalent.
Claims (6)
1. a control method of base station time slot ALOHA, is characterized in that, comprises the following steps:
S1: estimation need to send the number of terminals of information, estimates next frame number of users User;
S2: according to next frame number of users User, estimate dynamic frame size T;
S3: according to dynamic frame size T, estimate to wait for repeating transmission timeslot number WT;
S4: the established standards using the T obtaining and WT as next frame;
In described step S1, next frame number of users equals previous frame conflict number of users and the new number of users sum that arrives; If conflict timeslot number is Ncoll in frame, sending successful timeslot number is Nsuc;
Wherein, when having a plurality of users to be chosen in to send on same time slot, collision will occur, these users are called as conflict user, and this time slot is called as conflict time slot simultaneously;
Set each user in each information frame and select time slot to meet the Poisson distribution of λ=1, the time slot average user number of respectively conflicting in information frame is about 2.39, thereby conflict user forecast is 2.39*Ncoll;
Described S1 further comprises:
S11, initialization λ o(1), λ 1(1), T (1);
S12, estimates that flag frame conflict number of users is 2.39*Ncoll (flag);
S13, estimates flag frame λ o, as follows:
λ1（flag）=(2.39*Ncoll(flag)+Nsuc（flag）)/T(flag-1)
λo（flag）=(λ1（flag）+λ1（flag-1）+……+λ1（flag-NUM+1）)/T(flag)；
S14, estimates that (flag+1) framed user counts User, as follows:
User（flag+1）=alpha*（2.39*Ncoll(flag)）+beta*（λo（flag）*T(flag)）；
Wherein, flag represents present frame label, i.e. present frame sequence number;
T (flag) represents the length of present frame;
λ o(flag) represent arrival rate, it equals the newly arrived number of users of next frame divided by the length of present frame;
λ 1(flag) represent input arrival rate; It equals just to distribute at previous frame, and present frame has just started the moment sending, and the number of users of required transmission is divided by the length of previous frame;
λ o(1), λ 1(1), T (1) corresponding flag=1 respectively, the i.e. length of corresponding arrival rate, input arrival rate, the first frame during the first frame;
λ 1(flag-1) ..., λ 1(flag-NUM+1) and are all input arrival rates of corresponding different frame label;
T(flag-1) represent the length of previous frame;
Ncoll(flag) represent the conflict timeslot number of present frame;
Nsuc(flag) represent the transmission success timeslot number of present frame;
User(flag+1) represent the number of users that next frame need send;
Alpha, beta have been mainly the effects of weighting at this, because number of users is to estimate to come, so need to add that alpha, two coefficients of beta regulate;
NUM refers to that the method for moving average averages front NUM constantly, estimates current time.
2. the control method of a kind of base station time slot ALOHA according to claim 1, is characterized in that, alpha=1, beta=1, NUM=5.
3. the control method of a kind of base station time slot ALOHA according to claim 1, is characterized in that, described step S2 further comprises:
S201, provides the mapping table that reflects frame length T and number of users User, and wherein, described mapping table is number of users and frame length mapping table in DMR agreement, and its specific practice comprises:
In DMR, T is some fixing values, and the number of users of the different numbers to number of users in 135, selects different frame lengths, calculates the throughput of a frame theory, and establishing N is number of users, and a frame theory throughput S is:
To different user number, select the maximum corresponding frame length T of throughput as the estimation of next frame, obtain number of users and frame length mapping table;
S202, the mapping table in inquiry S201, searches corresponding frame length according to known number of users User.
4. the control method of a kind of base station time slot ALOHA according to claim 1, is characterized in that, described step S3 further comprises:
Estimate after T, can obtain waiting for the estimation of retransmitting timeslot number WT, for
Wherein floor (.) represents to be less than or equal to the maximum integer of T/2.
5. the control method of a kind of base station time slot ALOHA according to claim 1, is characterized in that, the arrival of setting new user is a Poisson process, and arrival rate λ o is an amount only changing slowly in time.
6. according to the control method of a kind of base station time slot ALOHA described in claim 1 or 3, it is characterized in that, in described step S2, described frame length T is an amount changing with number of users.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110332268.1A CN102387547B (en) | 2011-10-27 | 2011-10-27 | ALOHA-based control method of time slots (TSs) of base station (BS) |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110332268.1A CN102387547B (en) | 2011-10-27 | 2011-10-27 | ALOHA-based control method of time slots (TSs) of base station (BS) |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102387547A CN102387547A (en) | 2012-03-21 |
| CN102387547B true CN102387547B (en) | 2014-04-16 |
Family
ID=45826375
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110332268.1A Expired - Fee Related CN102387547B (en) | 2011-10-27 | 2011-10-27 | ALOHA-based control method of time slots (TSs) of base station (BS) |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102387547B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103840979B (en) * | 2012-11-22 | 2015-04-22 | 腾讯科技（深圳）有限公司 | Data processing apparatus and method for bump detection |
| US9626829B2 (en) | 2012-11-22 | 2017-04-18 | Tencent Technology (Shenzhen) Company Limited | Data processing device and method for interaction detection |
| WO2016033724A1 (en) * | 2014-09-01 | 2016-03-10 | 华为技术有限公司 | Channel selecting method and sending end |
| CN105162554B (en) * | 2015-09-14 | 2018-04-13 | 北京理工大学 | Real-time interpretation method and device in a kind of coding slotted ALOHA system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1562332A1 (en) * | 2004-02-06 | 2005-08-10 | Siemens Mobile Communications S.p.A. | Mapping adhoc MAC protocol layer onto existing formats of the slotted channel |
| KR100567963B1 (en) * | 2004-10-20 | 2006-04-05 | 아주대학교산학협력단 | Method for providing high-speed access of tag identification by using partial response framed slotted aloha algorithm in rfid system |
| CN101178764A (en) * | 2006-11-10 | 2008-05-14 | 中兴通讯股份有限公司 | Regulation means of frame dimension based on frames time slot Aloha algorithm |
| CN101286192A (en) * | 2008-06-05 | 2008-10-15 | 复旦大学 | Time slot ALOHA anticollision algorithm suitable for dynamic environment |
| CN101715629A (en) * | 2007-05-23 | 2010-05-26 | Sk电信有限公司 | Method for determining optimal frame size for tag collision prevention in RFID system |
-
2011
- 2011-10-27 CN CN201110332268.1A patent/CN102387547B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1562332A1 (en) * | 2004-02-06 | 2005-08-10 | Siemens Mobile Communications S.p.A. | Mapping adhoc MAC protocol layer onto existing formats of the slotted channel |
| KR100567963B1 (en) * | 2004-10-20 | 2006-04-05 | 아주대학교산학협력단 | Method for providing high-speed access of tag identification by using partial response framed slotted aloha algorithm in rfid system |
| CN101178764A (en) * | 2006-11-10 | 2008-05-14 | 中兴通讯股份有限公司 | Regulation means of frame dimension based on frames time slot Aloha algorithm |
| CN101715629A (en) * | 2007-05-23 | 2010-05-26 | Sk电信有限公司 | Method for determining optimal frame size for tag collision prevention in RFID system |
| CN101286192A (en) * | 2008-06-05 | 2008-10-15 | 复旦大学 | Time slot ALOHA anticollision algorithm suitable for dynamic environment |
Non-Patent Citations (3)
| Title |
|---|
| 改进的RFID 动态帧时隙ALOHA 算法;程文青;《华中科技大学学报》;20070630;第35卷(第6期);第14-16页 * |
| 王彬,罗海彬.数字集群中信道争用问题的ALOHA 协议研究.《通信技术》.2008,第41卷(第07期),第150-152页. * |
| 程文青.改进的RFID 动态帧时隙ALOHA 算法.《华中科技大学学报》.2007,第35卷(第6期),第14-16页. |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102387547A (en) | 2012-03-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7586890B2 (en) | Airlink allocation in a wireless network | |
| CN102474883B (en) | In half random back method of wireless local network resource reservation | |
| EP3972184A1 (en) | System and method for wlan ofdma design of uplink transmissions | |
| CN101248622B (en) | System and method for multiprotocol wireless communication | |
| US8982930B2 (en) | Communication apparatus, communication method, computer program, and communication system | |
| MX2011006200A (en) | Space division multiple access for wireless lan, and channel estimation for the same. | |
| CN102387547B (en) | ALOHA-based control method of time slots (TSs) of base station (BS) | |
| CN105359605B (en) | The system and method for the primary resource block allocation plan based on greedy algorithm of cellular network with self-organizing link terminal | |
| WO2023005448A1 (en) | Wireless resource utilization rate determination method and apparatus, electronic device and storage medium | |
| CN105450274B (en) | Based on the extensive multiple antennas relay system number of users optimization method that efficiency is optimal | |
| WO2022067726A1 (en) | Communication method and apparatus for resource scheduling | |
| CN105309018A (en) | Transmission method and device | |
| CN104936233A (en) | Resource scheduling distribution method and device | |
| CN107040952A (en) | A kind of ascending transmission method and device | |
| CN111030771A (en) | User equipment selection method in non-orthogonal multiple access system and base station thereof | |
| US20240097842A1 (en) | Ppdu transmission method and related apparatus | |
| CN108811176A (en) | A kind of centralized contention resolution of wireless internet of things random multi-access channel | |
| Tuysuz et al. | A beacon-based collision-free channel access scheme for IEEE 802.11 WLANs | |
| CN103458470A (en) | QoS-based transmission method in cognitive relay system | |
| Ettefagh et al. | Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks | |
| WO2024077615A1 (en) | Ranging method and apparatus | |
| CN102740480B (en) | Method and device for interference suppression of paired users | |
| Toor et al. | Online control of random access with splitting | |
| Gau | Tree/stack splitting with remainder for distributed wireless medium access control with multipacket reception | |
| CN108513359A (en) | A kind of interface-free resources distribution 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 | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20140416 Termination date: 20201027 |