USRE40077E1 - Window-based polling scheme for a wireless communications protocol - Google Patents
Window-based polling scheme for a wireless communications protocol Download PDFInfo
- Publication number
- USRE40077E1 USRE40077E1 US11/247,003 US24700305A USRE40077E US RE40077 E1 USRE40077 E1 US RE40077E1 US 24700305 A US24700305 A US 24700305A US RE40077 E USRE40077 E US RE40077E
- Authority
- US
- United States
- Prior art keywords
- value
- transmitter
- polling
- sequence number
- transmitting window
- 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 - Lifetime, expires
Links
- 238000004891 communication Methods 0.000 title claims description 23
- 238000012360 testing method Methods 0.000 claims abstract description 30
- 230000001960 triggered effect Effects 0.000 claims abstract description 12
- 238000000034 method Methods 0.000 claims description 22
- 230000005540 biological transmission Effects 0.000 description 29
- 238000010586 diagram Methods 0.000 description 10
- 230000011664 signaling Effects 0.000 description 9
- 230000008569 process Effects 0.000 description 6
- 230000008901 benefit Effects 0.000 description 3
- 230000000737 periodic effect Effects 0.000 description 2
- 230000004075 alteration Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000004044 response Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/04—Scheduled access
- H04W74/06—Scheduled access using polling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
- H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
- H04L1/1607—Details of the supervisory signal
- H04L1/1685—Details of the supervisory signal the supervisory signal being transmitted in response to a specific request, e.g. to a polling signal
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W80/00—Wireless network protocols or protocol adaptations to wireless operation
Definitions
- the present invention relates to a wireless communications protocol. More specifically, the present invention discloses a method and system that properly triggers a polling operation for a transmitter to request a receiving status of a receiver.
- FIG. 1 is a block diagram of the three layers in such a communications protocol.
- a first station 10 is in wireless communications with one or more second stations 20 .
- An application 13 on the first station 10 composes a message 11 and has it delivered to the second station 20 by handing the message 11 to a layer 3 interface 12 .
- the layer 3 interface 12 may also generate layer 3 signaling messages 12 a for the purpose of controlling layer 3 operations between the first station 10 and the second station 20 .
- the layer 3 interface 12 delivers either the message 11 or the layer 3 signaling message 12 a to a layer 2 interface 16 in the form of layer 2 service data units (SDUs) 14 .
- the layer 2 SDUs 14 may be of any length.
- the layer 2 interface 16 composes the SDUs 14 into one of more layer 2 protocol data units (PDUS) 18 .
- PDUS layer 2 protocol data units
- Each layer 2 PDU 18 is of a fixed length, and is delivered to a layer 1 interface 19 .
- the layer 1 interface 19 is the physical layer, transmitting data to the second station 20 .
- the transmitted data is received by the layer 1 interface 29 of the second station 20 and reconstructed into one or more PDUs 28 , which are passed up to the layer 2 interface 26 .
- the layer 2 interface 26 receives the PDUs 28 and builds up one or more layer 2 SDUs 24 .
- the layer 2 SDUs 24 are passed up to the layer 3 interface 22 .
- the layer 3 interface 22 converts the layer 2 SDUs 24 back into either a message 21 , which should be identical to the original message 11 that was generated by the application 13 on the first station 10 , or a layer 3 signaling message 22 a, which should be identical to the original signaling message 12 a generated by the layer 3 interface 12 and which is then processed by the layer 3 interface 22 .
- the received message 21 is passed to an application 23 on the second station 20 .
- FIG. 2 is a diagram of a transmission/reception process from a layer 2 perspective.
- a layer 2 interface 32 of a transmitter 30 which may be either a base station or a mobile unit, receives a string of layer 2 SDUs 34 from a layer 3 interface 33 .
- the layer 2 SDUs 34 are sequentially ordered from 1 to 5, and are of an unequal length.
- the layer 2 interface 32 converts the string of layer 2 SDUs 34 into a string of layer 2 PDUs 36 .
- the layer 2 PDUs 36 are sequentially ordered from 1 to 4, and are all of an equal length.
- the string of layer 2 PDUs 36 is then sent off to the layer 1 interface 31 for transmission.
- a reverse process occurs at the receiver end 40 , which may also be either a base station or a mobile unit, with a receiver layer 2 interface 42 converting a received sting of layer 2 PDUs 46 into a received sting of layer 2 SDUs 44 .
- the multi-layered protocol assures that the receiver layer 2 interface 42 present the layer 2 SDUs to the layer 3 interface 43 in order. That is, the layer 2 interface 42 must present the SDUs 44 to the layer 3 interface 43 in the sequential order of the SDUs 44 , beginning with SDU 1 and ending with SDU 5 .
- the ordering of the SDUs 44 may not be scrambled, nor may a subsequent SDU be delivered to layer 3 until all of the prior SDUs have been delivered.
- the receiver 40 In line transmissions, such a requirement is relatively easy to fulfill. In the noisy environment of wireless transmissions, however, the receiver 40 , be it a base station or a mobile unit, often misses data. Some layer 2 PDUs in the received string of PDUs 46 will therefore be missing. Thus, ensuring that the layer 2 SDUs 44 are presented in order can pose a significant challenge. Wireless protocols are carefully designed to address such problems.
- acknowledged mode data the receiver 40 sends a special layer 2 acknowledging signal to the transmitter 30 to indicate successfully received layer 2 PDUs 46 . No such signaling is performed for UM data. For purposes of the present invention, only acknowledged mode data is considered.
- FIG. 3 is a simplified block diagram of an acknowledged mode data PDU 50 , as defined in the 3GPPTM TS 25.322 specification.
- PDUs there are two types of PDUs: a control PDU or a data PDU.
- Control PDUs are used by the layer 2 interfaces 16 and 26 to control data transmission and reception protocols, such as the above-mentioned layer 2 acknowledging signal. This is somewhat analogous to the exchange of the signaling messages 12 a and 22 a of the layer 3 interfaces 12 and 22 .
- the layer 2 interfaces 16 and 26 do not interpret or recognize the layer 3 signaling messages 12 a and 22 a, whereas the layer 2 interfaces 16 and 26 do recognize layer 2 control PDUs, and do not hand layer 2 control PDUs up to the layer 3 interfaces 12 and 22 .
- Data PDUs are used to transmit acknowledged mode data, which is then reassembled and presented to layer 3 .
- the example PDU 50 is data PDU, and is divided into several fields, as defined by the layer 2 protocol.
- the first field 51 is a single bit indicating that the PDU 50 is either a data or a control PDU. As the data/control bit 51 is set (i.e., equal to 1), the PDU 50 is marked as an acknowledged mode data PDU.
- the second field 52 is a sequence number field, and is twelve bits long. Successive PDUs 18 , 28 have successively higher sequence numbers, and in this way the second station 20 can properly reassembled layer 2 PDUs 28 to form layer 2 SDUs 24 . That is, if a first PDU 18 is transmitted with a sequence number equal to 536, a next PDU 18 would be transmitted with a sequence number equal to 537, and so forth.
- a single polling bit 53 follows the sequence number field 52 , and when set indicates that the receiver (i.e., the second station 20 ) should respond with an acknowledgment status PDU, which is one kind of control PDU, and which will be introduced later.
- the first station 10 sets the polling bit 53 to 1 to request the second station 20 to send an acknowledgment status control PDU.
- Bit 54 is reserved and is set to zero.
- the next bit 55 a is an extension bit, and when set indicates the presence of a following length indicator (LI).
- An LI may be either 7 bits long or 15 bits long, and is used to indicate the ending position of a layer 2 SDU within the layer 2 PDU 50 .
- LI 56 a has an extension bit 55 b that is set, indicating the presence of another LI, LI 2 in field 56 b.
- LI 2 56 b indicates the ending position of the SDU_ 2 57 b, and has an extension bit 55 c that is cleared, signifying that there are no more LIs, and that the data region 58 is thus beginning.
- FIG. 4 is a simplified block diagram of a receiver 64 and a transmitter 65 in a wireless communications system 60 . Both the receiver 64 and the transmitter 65 have windows within which they expect to receive the PDUs 50 and transmit the PDUs 50 , respectively.
- the receiver 64 has a receiving window 61 that is delimited by two state variables: VR(R) 62 , and VR(MR) 63 .
- VR(R) 62 marks the beginning of the receiving window 61
- VR(MR) 63 marks the end of the receiving window 61 .
- the receiver 64 will only accept PDUs 50 that have sequence numbers 52 that are sequentially on or after VR(R) 62 and sequentially before VR(MR) 63 .
- the sequence number value held in VR(MR) 63 is not considered to be within the receiving window 61 .
- the transmitter 65 has a transmitting window 66 that is delimited by two state variables: VT(A) 67 and VT (MS) 68 .
- VT(A) 67 marks the beginning of the transmitting window 66
- VT (MS) 68 marks the end of the transmitting window 66 .
- the transmitter 65 will only transmit PDUs 50 that have sequence numbers 52 that are within the range of the transmitting window 66 , i.e., that are sequentially on or after VT(A) 67 , and sequentially before VT(MS) 68 .
- the receiving window 61 has a fixed receiving window size.
- the transmitting window 66 has a transmitting window size state variable VT(WS) 66 a, which indicates the number of sequence number values spanned by the state variables VT(A) 67 and VT(MS) 68 .
- the receiver 64 may explicitly request the transmitter 65 to change the value of VT(WS) 66 a.
- the requested value of VT(WS) 66 a cannot be greater than the original configured transmitting window size.
- the receiver 64 will update that value of the state variable VR(R) 62 to reflect the sequentially earliest sequence number 52 before which all preceding PDUs 50 have been successfully received. Put another way, VR(R) 62 always holds the sequence number 52 of the sequentially earliest PDU 50 that the receiver 64 is waiting to receive.
- the receiver 64 advances the state variable VR(R) 62 to the sequence number value 52 of the next PDU 50 that needs to be received, and the state variable VR(MR) 63 is updated using equation (1) accordingly.
- the receiving window 61 is advanced by the receiver 64 as the PDUs 50 stream in from the transmitter 65 .
- the transmitter 65 may explicitly request the receiver 64 to advance the receiving window 61 with a layer 2 signaling PDU, but this has no bearing on the present invention.
- the transmitting window 66 is advanced when the transmitter 65 receives a layer 2 acknowledgment status PDU from the receiver 64 .
- the layer 2 acknowledgment status PDU holds the most current value of the state variable VR(R) 62 , and is sent at periodic intervals by the receiver 24 , or in response to an explicit request from the transmitter 65 .
- the transmitter 65 will then set the state variable VT(A) 67 equal to the value held in the acknowledgment status PDU, which in effect sets VT(A) 67 equal to VR(R) 62 .
- the transmitter 65 updates the state variable VT(MS) 68 using equation ( 2 ) accordingly. In this manner, the transmitting window 66 and the receiving window 61 move forward with each other in lock step.
- the transmitter 65 has an additional state variable VT(S) 69 .
- the transmitter 65 begins transmitting the PDUs 50 that lie within the transmitting window 66 , the transmitter 65 begins with a PDU 50 having a sequence number 52 given by the state variable VT(A) 67 , and works sequentially forward until it reaches a PDU 50 having a sequence number 52 that is just prior to VT(MS) 68 .
- the state variable VT(S) 69 holds the sequence number 52 of the next PDU 50 to be transmitted.
- the PDUs 50 with sequence numbers 52 on or sequentially after VT(A), and on or sequentially before VT(S)-1 have been transmitted at least one time, and are stored in a retransmission buffer 66 b until they are acknowledged by the receiver 64 by way of an acknowledgment status PDU. Note that if a PDU 50 with a sequence number 52 equal to VT(A) 67 is acknowledged, VT(A) 67 is updated to the next sequentially earliest sequence number value within the retransmission buffer 66 b. PDUs 50 with sequence numbers 52 on or after VT(S) 69 have not yet been transmitted by the transmitter 69 .
- the transmitter 65 To insure that the transmitting window 66 advances, the transmitter 65 must, at intervals, request the receiver 64 to send an acknowledgment status PDU. This is termed polling, and is implemented by way of the polling bit 53 .
- polling the transmitter 65 will send the next outgoing PDU 50 , i.e., the PDU 50 indicated by the state variable VT(S) 69 , with the polling bit 53 set to one.
- the receiver 64 Upon reception of this PDU 50 with the polling bit 53 set, the receiver 64 will respond by sending an acknowledgment status PDU.
- the acknowledgment status PDU will contain the most recent value of the state variable VR(R) 62 , which the transmitter 65 will subsequently use for the state variable VT(A) 67 to advance the transmitting window 66 .
- Various methods may be used by the transmitter 65 to determine when to poll the receiver 64 .
- the transmitter 65 may, for example, use timer-based polling, in which polling is performed at regular, periodic intervals.
- the transmitter 65 may use window-based polling, in which the transmitter 65 polls the receiver 64 when a certain percentage of the transmitting window 66 has been transmitted.
- the prior art utilizes the following equation to determine if polling should be triggered: t ⁇ 1 ⁇ (VT(WS)+VT(MS) ⁇ VT(S) ⁇ 1)mod VT(WS) ⁇ /VT(WS) (3)
- “mod” indicates the modulus operation, which returns the remainder of a division operation.
- the value of t is compared against a polling value, and if t exceeds the polling value then a polling event is triggered by the transmitter 65 .
- the polling value indicates a percentage of the transmitting window 66 that has been transmitted.
- the polling value is a supplied value and may be set, for example, by layer 3 .
- equation (3) indicates that the transmission percentage is 50%. If the polling value is 30%, then equation (3) will cause the transmitter 65 to poll the receiver 64 before polling is actually required. Indeed, for the above example with the state variable VT(WS) 66 a equal to 2, and the polling value set to 30%, equation (3) will cause the transmitter 65 to poll the receiver 64 with every sent PDU 50 . The receiver 64 will thus continuously send acknowledgment status PDUs, which may significantly impair the overall transmission efficiency of the wireless communications system 60 . Equation (3) will also return incorrect transmission percentages that may cause unwanted polls to be triggered when the state variable VT(MS) 68 has cycled through 4095, thus overflowing and returning back to zero, and VT(S) 69 has not yet cycled past 4095. That is to say, overflow of the 12-bit sequence numbers held within the state variables VT(MS) 68 and VT(S) 69 can lead to unwanted triggering of polling.
- the preferred embodiment of the present invention discloses a transmitter capable of transmitting layer 2 protocol data units (PDUs).
- PDUs layer 2 protocol data units
- Each PDU has an n-bit sequence number.
- a base sequence number VT(A) is obtained that marks a beginning sequence number of a transmitting window of the transmitter.
- a current sequence number VT(S) is obtained that marks a sequence number of a PDU that is next to be transmitted by the transmitter.
- 2 n is added to a difference of the current sequence number VT(S) and the base sequence number VT(A) to yield a first value.
- a second value is obtained that is a modulus of the first value with 2 n .
- a test value is then obtained that is the second value divided by a size of the transmitting window. Polling is triggered when the test value is greater than or equal to a polling value.
- the polling value represents a percentage of the transmitting window that has been transmitted.
- test value accurately returns the percentage of the transmitting window that has been transmitted. Consequently, erroneous polls are avoided, and desired polls are assured.
- FIG. 1 is a block diagram of a three-layer communications protocol.
- FIG. 2 is a simplified diagram of a transmission/reception process from a layer 2 perspective.
- FIG. 3 is a block diagram of an acknowledged mode data (AMD) protocol data unit (PDU).
- AMD acknowledged mode data
- PDU protocol data unit
- FIG. 4 is a simplified block diagram of a receiver and a transmitter in a wireless communications system.
- FIG. 5 is a simplified block diagram of a wireless communications system according to the present invention.
- FIG. 6 is a flow chart of the method of the present invention.
- a communications protocol as disclosed in the 3GPPTM specification TS 25.322, V3.5.0 is used by way of example.
- any wireless communications protocol that requires polling to acknowledge the reception of transmitted data may utilize the poll-triggering method of the present invention.
- transmitters and receivers in the following detailed description can include cellular telephones, personal data assistants (PDAs), personal computers (PCs), or any other devices that utilize a wireless communications protocol.
- It is the method of the present invention to determine triggering of a polling request for a transmitter by using the following equation: t ⁇ (2 n +VT(S) ⁇ VT(A))mod 2 n ⁇ /VT(WS) (4)
- FIG. 5 is a simplified block diagram of a wireless communications system 70 that utilizes the method of the present invention.
- the wireless communication system 70 includes a receiver 80 and a transmitter 90 . Both the transmitter 90 and the receiver 80 utilize a 3 -tiered communications protocol.
- a layer 3 interface 93 passes layer 2 service data units (SDUs) 93 a to a layer 2 interface 92 for transmission.
- the layer 2 interface 92 composes the SDUs 93 a into layer 2 protocol data units (PDUs) 92 a that are passed to the layer 1 interface 91 for transmission.
- SDUs layer 2 service data units
- the PDUs 92 a have a format that is identical to that discussed in the Description of the Prior Art, and thus need not be detailed any further here.
- each PDU 92 a has an n-bit sequence number that identifies the sequential order of the PDU 92 a in a stream of transmitted PDUs 92 a.
- n is 12
- the sequence numbers for the PDUs 92 a have a cyclical range from zero to 4095 .
- Each PDU 92 a also has a polling bit that may be set by the transmitter 90 to poll the receiver 80 . As discussed in the prior art, the receiver 80 responds to a set polling bit with an acknowledgment status PDU so that the transmitter 90 may advance its transmitting window 94 .
- the transmitting window 94 is defined by state variables VT(A) 95 , VT(MS) 97 .
- the transmitter 90 will only transmit PDUs 92 a with sequence numbers that are within the transmitting window 94 .
- the state variable VT(A) 95 marks the beginning value of the transmitting window 94 .
- the state variable VT(WS) 96 marks the size of the transmitting window 94 , which is simply the number of sequence number values spanned by the transmitting window 94 .
- the state variable VT(MS) 97 marks the end of the transmitting window 94 , and is thus just the sum of VT(A) 95 and VT(WS) 96 .
- VT(MS) 97 Due to overflow, the value held within VT(MS) 97 need not be greater than a value held within VT (A) 95 .
- a state variable VT(S) 98 holds the sequence number of a PDU 92 a that is next in line to be transmitted. VT(S) 98 will always be sequentially on or after VT(A), and sequentially on or before VT(MS) 97 .
- the state variables VT(A) 95 , VT(WS) 96 , VT(MS) 97 and VT(S) 98 are identical in function to those discussed in the Description of the Prior Art.
- the transmitter 90 also includes a calculation unit 99 that is used to calculate a test value t 99 a.
- the value of t 99 a is compared against a polling value 93 b, that is supplied by the layer 3 interface 93 , to determine if the transmitter 90 should poll the receiver 80 .
- the polling bit is set in a subsequently transmitted PDU 92 a if polling is to be performed.
- the test value t 99 a is used for window-based polling, and to generate a value for t 99 a, the calculation unit utilizes the state variables VT(A) 95 , VT(WS) 96 and VT(S) 98 , and equation ( 4 ).
- the polling value 93 b indicates a transmission percentage of the transmitting window 94 , i.e., the polling value 93 b indicates the percentage of PDUs 92 a in the transmitting window 94 that have been transmitted by the transmitter 90 . If the value of t 99 a exceeds the polling value 93 b, then a polling request is triggered.
- FIG. 6 is a flow chart of the method of the present invention, which is implemented by the calculation unit 99 to determine if polling should be triggered by the transmitter 90 . The steps are explained below:
- the method of the present invention has the advantage that is accurately represents the transmission percentage of the transmission window 94 .
- the transmission percentage should be zero.
- equation (4) works equally well when the state variable VT(MS) 97 is less than VT(S) 98 , which occurs due to overflow.
- Equation (5) “min” indicates the minimum value choosing operation, which returns the minimum value of its arguments.
- Equation (5) has the benefit that equation (5) both accurately provides the transmission percentage of the transmitting window 94 , and equation (5) will never exceed 1.0.
- Both equation (4) and equation (5) provide correct transmission percentages regardless of whether VT(S) 98 is greater than VT(A) 95 , or VT(A) 95 is greater than VT(S) 98 .
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Communication Control (AREA)
Abstract
Description
VR(MR)=VR(R)+receiving window size (1)
VT(MS)=VT(A)+VT(WS) (2)
t−1−{(VT(WS)+VT(MS)−VT(S)−1)mod VT(WS)}/VT(WS) (3)
t=1−{(2+2−0−1)mod 2}/2−0.50
t={(2n+VT(S)−VT(A))mod 2n}/VT(WS) (4)
-
- 100: Obtain the current values for the transmitting
window 94, which include the values from the state variables VT(A) 95, VT(WS) 96 and VT(S) 98. - 110: A first value x is computed. The value x is 2n added to the difference of the state variable VT(S) 98 and the state variable VT(A) 95. The value of n is the bit size of the sequence numbers for the
PDUs 92a, and thus in the preferred embodiment is 12. Consequently, 4095 is added to VT(S)−VT(A). - 120: A second value y is computed. The value of y is the modulus of the first value x with 2n.The second value y is thus x mod 4096.
- 130: The
test value t 99a is obtained by dividing the second value y by the state variable VT(WS) 96. Thetest value t 99a indicates the current transmission percentage of the transmittingwindow 94 in fractional form. - 140: Compare the
test value t 99a to thepolling value 93b. As the polling value is stored as a percentage in the form of zero to 100, the value oft 99a is multiplied by 100 to perform this comparison. - 150: If the transmission percentage as represented by
t 99a is greater than or equal to thepolling value 93b, then polling is triggered for thetransmitter 90. For thenext PDU 92a to be transmitted or retransmitted, i.e., thePDU 92a with a sequence number value between the state variables VT(A) 94 and VT(S) 98, the polling bit is set. After transmission of thissubsequent PDU 92a, the poll-triggering testing process is repeated.
- 100: Obtain the current values for the transmitting
t={(4096+0−0)mod 4096}/2=0
t=min{((2n+VT(S)−VT(A)) mod 2n), VT(WS)}/VT(WS) (5)
t=min{((2n+VT(S)−VT(A))mod 2n), VT(WS)}/VT(WS)
or
t={(2n+VT(S)−VT(A))mod 2n}/VT(WS)
Claims (16)
t=((2n+VT(S)−VT(A))mod 2n)VT(WS);
t=min(((2n+VT(S)−VT(A))mod 2n), VT(WS))/VT(WS);v
t=(( 2 n +VT(S)−VT(A))mod 2 n)/VT(WS).
t=min((( 2n+VT(S)−VT(A))mod 2n), VT(WS))/VT(WS).
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/247,003 USRE40077E1 (en) | 2001-04-02 | 2005-10-11 | Window-based polling scheme for a wireless communications protocol |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US09/822,238 US6888816B2 (en) | 2001-04-02 | 2001-04-02 | Window-based polling scheme for a wireless communications protocol |
US11/247,003 USRE40077E1 (en) | 2001-04-02 | 2005-10-11 | Window-based polling scheme for a wireless communications protocol |
Related Parent Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/822,238 Reissue US6888816B2 (en) | 2001-04-02 | 2001-04-02 | Window-based polling scheme for a wireless communications protocol |
US11/222,628 Continuation-In-Part US7495540B2 (en) | 2004-09-13 | 2005-09-09 | Fusible switching disconnect modules and devices |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/603,454 Continuation-In-Part US7561017B2 (en) | 2004-09-13 | 2006-11-22 | Fusible switching disconnect modules and devices |
Publications (1)
Publication Number | Publication Date |
---|---|
USRE40077E1 true USRE40077E1 (en) | 2008-02-19 |
Family
ID=25235532
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/822,238 Ceased US6888816B2 (en) | 2001-04-02 | 2001-04-02 | Window-based polling scheme for a wireless communications protocol |
US11/247,003 Expired - Lifetime USRE40077E1 (en) | 2001-04-02 | 2005-10-11 | Window-based polling scheme for a wireless communications protocol |
Family Applications Before (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/822,238 Ceased US6888816B2 (en) | 2001-04-02 | 2001-04-02 | Window-based polling scheme for a wireless communications protocol |
Country Status (1)
Country | Link |
---|---|
US (2) | US6888816B2 (en) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10743307B2 (en) | 2014-12-12 | 2020-08-11 | Qualcomm Incorporated | Traffic advertisement in neighbor aware network (NAN) data path |
US10820314B2 (en) | 2014-12-12 | 2020-10-27 | Qualcomm Incorporated | Traffic advertisement in neighbor aware network (NAN) data path |
Families Citing this family (9)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6996063B2 (en) * | 2001-11-16 | 2006-02-07 | Asustek Computer Inc. | Applicable PDU range test and calculation for window-based polling |
KR100765121B1 (en) * | 2001-11-24 | 2007-10-11 | 엘지전자 주식회사 | Polling method of Protocol Data Unit of transmission buffer |
KR100434054B1 (en) * | 2002-04-26 | 2004-06-04 | 엘지전자 주식회사 | Polling method of radio link control |
KR100802619B1 (en) * | 2002-11-07 | 2008-02-13 | 엘지전자 주식회사 | Method for receiving data in a receiver under radio link control protocolprocessing method for rlc reception window |
KR100486033B1 (en) * | 2002-12-02 | 2005-05-03 | 아스텍 컴퓨터 인코퍼레이티드 | Applicable pdu range test and calculation for window-based polling |
US7283531B2 (en) * | 2003-07-22 | 2007-10-16 | Lucent Technologies Inc. | Enhanced recovery action in service specific connection orientation protocol |
US20060002306A1 (en) * | 2004-06-30 | 2006-01-05 | Ronald Brown | Failure detection of path information corresponding to a transmission path |
JP4454516B2 (en) * | 2005-02-16 | 2010-04-21 | 富士通株式会社 | Fault detection device |
JP2009049993A (en) * | 2007-08-16 | 2009-03-05 | Asustek Computer Inc | Method and apparatus for triggering polling function in radio communication system |
Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5896561A (en) | 1992-04-06 | 1999-04-20 | Intermec Ip Corp. | Communication network having a dormant polling protocol |
US20030095534A1 (en) * | 2001-11-16 | 2003-05-22 | Jiang Sam Shiaw-Shiang | Applicable PDU range test and calculation for window-based polling |
US6640268B1 (en) | 1998-08-28 | 2003-10-28 | Intel Corporation | Dynamic polling mechanism for wireless devices |
US6697331B1 (en) | 1999-11-17 | 2004-02-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Link layer acknowledgement and retransmission for cellular telecommunications |
US6721285B1 (en) | 1999-03-30 | 2004-04-13 | International Business Machines Corporation | Polling system for a duplex asymmetrical communications link |
US6947394B1 (en) * | 1999-04-09 | 2005-09-20 | Telefonaktiebolaget Lm Ericsson (Publ) | Flexible radio link control protocol |
US6950422B2 (en) * | 2001-03-19 | 2005-09-27 | Motorola, Inc. | Interference reduction within a communication system |
-
2001
- 2001-04-02 US US09/822,238 patent/US6888816B2/en not_active Ceased
-
2005
- 2005-10-11 US US11/247,003 patent/USRE40077E1/en not_active Expired - Lifetime
Patent Citations (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5896561A (en) | 1992-04-06 | 1999-04-20 | Intermec Ip Corp. | Communication network having a dormant polling protocol |
US6640268B1 (en) | 1998-08-28 | 2003-10-28 | Intel Corporation | Dynamic polling mechanism for wireless devices |
US6721285B1 (en) | 1999-03-30 | 2004-04-13 | International Business Machines Corporation | Polling system for a duplex asymmetrical communications link |
US6947394B1 (en) * | 1999-04-09 | 2005-09-20 | Telefonaktiebolaget Lm Ericsson (Publ) | Flexible radio link control protocol |
US6697331B1 (en) | 1999-11-17 | 2004-02-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Link layer acknowledgement and retransmission for cellular telecommunications |
US6950422B2 (en) * | 2001-03-19 | 2005-09-27 | Motorola, Inc. | Interference reduction within a communication system |
US20030095534A1 (en) * | 2001-11-16 | 2003-05-22 | Jiang Sam Shiaw-Shiang | Applicable PDU range test and calculation for window-based polling |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10743307B2 (en) | 2014-12-12 | 2020-08-11 | Qualcomm Incorporated | Traffic advertisement in neighbor aware network (NAN) data path |
US10820314B2 (en) | 2014-12-12 | 2020-10-27 | Qualcomm Incorporated | Traffic advertisement in neighbor aware network (NAN) data path |
US10827484B2 (en) | 2014-12-12 | 2020-11-03 | Qualcomm Incorporated | Traffic advertisement in neighbor aware network (NAN) data path |
Also Published As
Publication number | Publication date |
---|---|
US6888816B2 (en) | 2005-05-03 |
US20020142731A1 (en) | 2002-10-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
USRE40077E1 (en) | Window-based polling scheme for a wireless communications protocol | |
US6996063B2 (en) | Applicable PDU range test and calculation for window-based polling | |
US7554963B2 (en) | Method for handling data discard timer after an RLC reset or re-establishment in a wireless communications system | |
US8767703B2 (en) | Enhanced polling method for preventing deadlock in a wireless communications system | |
US6687248B2 (en) | Sequence number ordering in a wireless communications system | |
US6798842B2 (en) | Retransmission range for a communications protocol | |
US20070064668A1 (en) | Method and apparatus for improving transmission delay of status report in a wireless communications system | |
US6922393B2 (en) | Data discarding request acknowledgement in a wireless communications protocol | |
KR20060113566A (en) | Method and apparatus for polling transmission status in a wireless communication system | |
US20050066255A1 (en) | Status report missing detection in a communication system | |
EP1424815B1 (en) | Method for requesting status reports in acknowledged mode data transfer | |
JP3862648B2 (en) | Protocol data unit range testing and calculation method applied to window-based polling | |
KR100486033B1 (en) | Applicable pdu range test and calculation for window-based polling |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: ASUSTEK COMPUTER INC., TAIWAN Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:JIANG, SAM SHIAW-SHIANG;REEL/FRAME:018932/0910 Effective date: 20050725 |
|
AS | Assignment |
Owner name: INNOVATIVE SONIC LIMITED, VIRGIN ISLANDS, BRITISH Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:ASUSTEK COMPUTER INC.;REEL/FRAME:020129/0800 Effective date: 20071112 |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
FEPP | Fee payment procedure |
Free format text: PAT HOLDER NO LONGER CLAIMS SMALL ENTITY STATUS, ENTITY STATUS SET TO UNDISCOUNTED (ORIGINAL EVENT CODE: STOL); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
SULP | Surcharge for late payment | ||
FPAY | Fee payment |
Year of fee payment: 8 |
|
RR | Request for reexamination filed |
Effective date: 20120907 |
|
CONR | Reexamination decision confirms claims |
Kind code of ref document: C1 Free format text: REEXAMINATION CERTIFICATE Filing date: 20120907 Effective date: 20160906 |
|
FPAY | Fee payment |
Year of fee payment: 12 |