Download presentation
Presentation is loading. Please wait.
1
Contention-based Random Access BR Procedure
Document Number: IEEE C802.16m-09/1070 Date Submitted: Source: Heejeong Cho, Jinyoung Chun, Youngsoo Yuk, Kiseon Ryu, Ronny Kim, Binchul Ihm LG Electronics Re: IEEE m-09/0020 -Call for Contributions on Project m Amendment Working Document (AWD) Content, on the topic of m AWD – Bandwidth Request Procedure Purpose: For discussion and adoption in section 15.2.y Quick access message format of the IEEE C802.16m-09/0846 – Connection Management and QoS DG AWD text proposal Notice: This document does not represent the agreed views of the IEEE Working Group or any of its subgroups. It represents only the views of the participants listed in the “Source(s)” field above. It is offered as a basis for discussion. It is not binding on the contributor(s), who reserve(s) the right to add, amend or withdraw material contained herein. Release: The contributor grants a free, irrevocable license to the IEEE to incorporate material contained in this contribution, and any modifications thereof, in the creation of an IEEE Standards publication; to copyright in the IEEE’s name any IEEE Standards publication even though it may include portions of this contribution; and at the IEEE’s sole discretion to permit others to reproduce in whole or in part the resulting IEEE Standards publication. The contributor also acknowledges and accepts that this contribution may be made public by IEEE Patent Policy: The contributor is familiar with the IEEE-SA Patent Policy and Procedures: < and < Further information is located at < and < >.
2
Why we need partition of BR sequence?
We propose that 24 BR sequences should be divided into 3 classes. Priority_Class1_Sequence used only for 3-step BR procedure Priority_Class2_Sequence Priority_Class3_Sequence used only for 5-step regular BR procedure The number of sequences of each class is transmitted in S-SFH. When AMS requests UL bandwidth for a service flow, AMS should use the class negotiated in DSx transaction for the service flow, but cell-edge users may use Priority_Class3_Sequence.
3
BR Information BR sequence Quick access message
Priority, BR size An example of partition of BR sequence Quick access message Station ID 12 bits Class Sequence index BR size (bytes) Priority_Class1_Sequence (e.g., 8) 0 ~ 1 20 2 ~ 3 30 4 ~ 5 50 6 ~ 7 80 Priority_Class2_Sequence ….
4
Grant for data though UL Assignment A-MAP IE
3-step BR procedure Case 1 (All of the BR sequence and message are received successfully) AMS’s operation Step 1-1 : AMS sends a quick access message with a sequence selected from Priority_Class1_Sequence or Priority_Class2_Sequence. Step 2-1 : AMS starts differentiated timer of the value corresponding to the class. Step 2-4 : AMS waits for grant until the timer is expired. If grant is received within the timer, AMS stops the timer. Otherwise, AMS retries BR procedure (including back-off algorithm) ABS’s operation Step 1-2 : ABS detects a sequence. If the sequence is Priority_Class1_Sequence/Priority_Class2_Sequence, it tries to decode a quick access message. Step 2-1 : ABS starts the differentiated timer of the same value as AMS. Step 2-2 : ABS grants UL resource for data through UL Assignment A-MAP IE before the timer is expired. Step 2-3 : ABS stops the timer. AMS ABS BR indicator + Quick access message BR sequence & message success ACK (success) Grant for data though UL Assignment A-MAP IE Timer stop Timer stop Data
5
Grant for data though CDMA Allocation A-MAP IE
3-step BR procedure Case 2 (only the BR sequence is received successfully) AMS’s operation Step 1-1 : AMS sends a quick access message with a sequence selected from Priority_Class1_Sequence or Priority_Class2_Sequence. Step 2-1 : AMS starts differentiated timer of the value corresponding to the class. Step 2-4 : AMS waits for grant until the timer is expired. If grant is received within the timer, AMS stops the timer. Otherwise, AMS retries BR procedure (including back-off algorithm) ABS’s operation Step 1-2 : ABS detects a sequence. If the sequence is Priority_Class1_Sequence/Priority_Class2_Sequence, it tries to decode a quick access message, but fails. Step 2-1 : ABS starts the differentiated timer of the same value as AMS. Step 2-2 : ABS grants UL resource for data through CDMA Allocation A-MAP IE before the timer is expired. Step 2-3 : ABS stops the timer. AMS ABS BR indicator + Quick access message BR sequence success Message failure ACK (success) Grant for data though CDMA Allocation A-MAP IE Timer stop Timer stop Data with STID
6
3-step BR procedure Case 3 (All of the BR sequence and message are not received successfully) AMS’s operation Step 1-1 : AMS sends a quick access message with a sequence selected from Priority_Class1_Sequence or Priority_Class2_Sequence. Step 2-1 : If AMS receives acknowledgement indicating fail BR, it retries BR procedure (including back-off algorithm). If AMS doesn’t receives any acknowledgement, it starts the BR timer and waits for grant until the timer is expired. After expired, AMS retries BR procedure. AMS ABS BR indicator + Quick access message BR sequence & message failure ACK (failure) BR indicator + Quick access message
7
Grant for BW-REQ message though CDMA Allocation A-MAP IE
5-step BR procedure Case 1 (only the BR sequence is received successfully) AMS’s operation Step 1-1 : AMS sends a sequence selected from Priority_Class3_Sequence. Step 2-1 : AMS starts differentiated timer of the value corresponding to Priority_Class3_Sequence. Step 2-4 : AMS waits for grant until the timer is expired. If grant is received within the timer, AMS stops the timer. Otherwise, AMS retries BR procedure (including back-off algorithm) ABS’s operation Step 1-2 : ABS detects a Priority_Class3_Sequence. Step 2-1 : ABS starts the differentiated timer of the same value as AMS. Step 2-2 : ABS grants UL resource for BW-REQ message through CDMA Allocation A-MAP IE before the timer is expired. Step 2-3 : ABS stops the timer. AMS ABS BR indicator BR sequence success ACK (success) Grant for BW-REQ message though CDMA Allocation A-MAP IE Timer stop Timer stop BW-REQ message
8
5-step procedure Case 2 (the BR sequence is not received successfully)
AMS’s operation Step 1-1 : AMS sends a sequence selected from Priority_Class3_Sequence. Step 2-1 : If AMS receives acknowledgement indicating fail BR, it stops the timer and retries BR procedure (including back-off algorithm). If AMS doesn’t receives any acknowledgement, it starts the BR timer and waits for grant until the timer is expired. After expired, AMS retries BR procedure AMS ABS BR indicator BR sequence failure ACK (failure) BR indicator
9
BR (Priority_Class1_Sequence & message)
Latency estimation When Only the BR sequence is received successfully in 3-step BR procedure. Assume that Priority_Class1_Sequence’s timer value is 4 frames, default timer value is 12 frames When ABS knows priority (by sequence partition) Message is not decodable Grant BR (Priority_Class1_Sequence & message) Priority_Class1_Sequence Timer Message is not decodable When ABS does not knows priority …… BR (sequence & message) Grant Default Timer 1st frame 2nd frame 3rd frame 4th frame 5th frame 13th frame
10
Proposed text 15.2.y.1.5.1 quick access message format
24 BWREQ sequences are divided into 3 classes. These classes are Priority_Class1_Sequence, Priority_Class2_Sequence and Priority_Class3_Sequence. Priority_Class1_Sequence, Priority_Class2_Sequence are used only for the 3-step BR procedure and Priority_Class3_Sequence is used only for the 5-step BR procedure. The number of BWREQ sequences of each class is transmitted in S-SFH. When AMS requests UL bandwidth for a service flow, AMS shall use the class negotiated in DSx transaction for the service flow, but cell-edge users may use Priority_Class3_Sequence. The ABS shall try to decode a quick access message only if the detected sequence is Priority_Class1_Sequence or Priority_Class2_Sequence. 12-bit STID is carried in the quick access message and bandwidth request size is carried in BWREQ sequence.
11
Appendix I: Analysis of Probability of Code Success
12
Analysis of Probability of sequence Success
Assumption Perfect Power Control All UL powers of the signals received at the ABS are same. No capturing effect If more than two AMS send same sequence, collision is always detected. No bias to select sequence Comparison Cases Case 1 : No sequence partition All sequences (Nseq) can be used by all (N0) AMSs Case 2 : sequence Partition All sequences (Nseq) are divided into M partitions, Ns,m is the number of sequences assigned for partition m The probability that an AMS uses a sequence in the partition m is Pm.
13
Probability of BR success with case 1
Probability of BR success for i-th AMS with case 1 The conditions of BR success in this case are i-th AMS chooses sequence s All the others choose the other sequences The probability of BR success is
14
Probability of BR success with case 2
Probability of BR success for i-th AMS with case 2 The probability of BR success when Nm AMSs choose partition m i-th AMS use partition m, and chooses a sequence s The other Nm-1 AMSs choose the sequence among Ns,m-1 remained sequences The probability of Nm -1 AMSs choose partition m If Pm is the probability that a AMS uses the partition m, the probability that Nm-1 other AMSs among N0 -1 AMSs use the partition m is, Final Probability
15
Comparison of the result of the cases
If Pm =1/M, Ns,m = Nseq/M, For example, if service distribution is uniform for 3 different BR classes, and 24 sequences are divided into three 8 sequences, then the probability is the same as that of the case 1. Additional Gain from sequence partitioning If the distributions of the services are different, we can change the number of sequences for each service according to its distribution. In addition, if you want to enhance some type of services, more sequences can be allocated to the service with the loss of the other services. : same as the case 1
16
Differentiated Services
According to the number of sequences for service, we can provide different value of probability of success Total Number of AMSs trying to send BWR to an BR opportunity Number of sequences for each service class Probability of BR success for each service class N1 N2 N3 Ps1 Ps2 Ps3 2 24 0.958 8 10 0.967 12 4 0.972 0.917 16 0.979 5 0.843 6 0.873 0.796 0.893 0.706 0.919 0.682 0.737 0.776 0.457 0.827 15 0.551 0.622 0.449 0.674 0.296 0.745
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.