This application relates to the 802.16m standard and the fragmentation and defragmentation of packets under the 802.16m standard.
WiMAX, short for worldwide interoperability for microwave access, is currently defined by the Institute of Electrical and Electronics Engineers, or IEEE, 802.16-series specification. The advanced air interface standard is defined under 802.16m.
Packets known as service data units (SDUs) travel wirelessly between a transmitter and a receiver, such as between a base station and a mobile station, using the advanced air interface standard. Sometimes, these SDUs are fragmented into two, three, or hundreds of fragments before transmission. A fragmentation state machine at the transmitter and a defragmentation state machine at the receiver process these fragmented SDUs.
Currently under 802.16m, if a first SDU, SDU1, is being fragmented, a second, higher-priority SDU, SDU2, would have to wait in queue until all the fragments of SDU1 have been transmitted before SDU2 may be fragmented and transmitted. Particularly where large, low-priority SDUs are transmitted, this leads to undesirable results. For example, a power control request, which involves only a few bytes, is unprocessed while waiting for a very large management message, such as is used with PKM (about two Kbytes) to be processed. The power control message may be delayed indefinitely while the large PKM message is being fragmented and transmitted.
Also, as currently defined under the 802.16m standard, SDUs are dropped under certain operating conditions, namely, for non-automatic repeat request (non-ARQ) media access controller (MAC) connections that only use hybrid automatic repeat request (HARQ). “Upon loss, the receiver shall discard all SDU fragments on the connection until a new first SDU fragment is detected . . . ”. HARQ operations may temporarily miss a burst that contains some fragment of a SDU because HARQ does not guarantee in-order delivery. If the 802.16m standard does not define a mechanism to restore the order of the protocol data units (PDUs)/bursts before such a defragmentation mechanism, it will drop SDUs even though all of its fragments are correctly received (just not in order). This is especially crucial for MAC management connections where ARQ is not used and only HARQ is used.
Thus, there is a continuing need for a method to overcome the shortcomings of the prior art.
The foregoing aspects and many of the attendant advantages of this document will become more readily appreciated as the same becomes better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein like reference numerals refer to like parts throughout the various views, unless otherwise specified.
In accordance with the embodiments described herein, a preemption system is disclosed for successfully transmitting multiple SDUs across a wireless interface. The preemption system addresses out-of-order transmissions of fragments of SDUs, such that the receiver is able to process each SDU successfully. The preemption system enables a higher-priority SDU to simultaneously be transmitted with a lower-priority SDU, so that delays in processing the lower-priority SDU does not negatively affect processing of the higher-priority SDU. The preemption system also addresses non-ARQ MAC connections that only use HARQ, in which the HARQ transmission may cause out-of-order delivery of SDU fragments.
In the following detailed description, reference is made to the accompanying drawings, which show by way of illustration specific embodiments in which the subject matter described herein may be practiced. However, it is to be understood that other embodiments will become apparent to those of ordinary skill in the art upon reading this disclosure. The following detailed description is, therefore, not to be construed in a limiting sense, as the scope of the subject matter is defined by the claims.
The transmitter 20 of the preemption system 500 includes a fragmentation state machine 100 for preparing the SDUs for wireless transmission. The fragmentation state machine 100 includes fragment characterization 22, which utilizes header fields 72, 82, 84, and 86 to communicate information about each SDU fragment to the receiver 30, such that the receiver does not discard fragments due to out-of-order transmission of SDU fragments. The header fields are described in more detail in
The receiver 30 of the preemption system 500 includes a defragmentation state machine 200, for processing the wirelessly received SDU fragments. The defragmentation state machine 200 includes a channel identifier 32, a discard timer 34, and up to N buffers 42A, 42B, . . . , 42C (collectively, buffers 42), where N is an integer. The channel identifier 32 uses the header fields, populated by the transmitter 20 with information about each SDU, as indexes into different buffers, as needed, enabling the receiver 30 to process the out-of-order SDU fragments. The defragmentation state machine 200 is described in more detail in
Under the 802.16m standard, there are scenarios in which SDUs are either not processed at all (failure) or are processed in an undesirably slow manner (inefficient). The preemption system 500 enables these SDUs to be successfully and efficiently decoded at the receiver 30 following transmission over the WiMAX network. Under the current 802.16m standard, there exist multiple scenarios in which such processing failure or inefficiency may arise. For example, if a first SDU, SDU1, is fragmented before being transmitted, then a higher priority SDU, SDU2, waits in a queue until all the fragments of SDU1 have been transmitted before SDU2 can be fragmented and transmitted. Where SDU1 is very large, this can cause a significant delay in transmitting SDU2. Where SDU2 is a high-priority SDU, such as a power control request, the delay may be undesirable.
In some embodiments, the fragmentation state machine 100 of the transmitter 20 includes a mechanism to preempt the transmission of the fragments of SDU1 with the fragments of the higher priority SDU2 on the same MAC layer connection. The fragment characterization 22 utilizes an already defined field of one header and defines three new fields in a second header, where both headers are used under WiMAX for wirelessly transmitting the SDUs.
In some embodiments, the FPEH 80 includes three newly defined fields, a fixed-sized (two-bit) fragmentation control (FC) field 82, a variable-sized (n-bit) channel identifier (channel ID, or CID) field 84, and an m-bit sequence identifier (sequence ID, or SID) 86. The CID field 84 indicates which of 2n channels is used to transmit the SDU. For n=1, there are two available channels, for n=2, there are four available channels, and so on.
The other two fields, the FC field 82 and the SID field 86 are used by the fragment characterization engine 22 to explicitly characterize each fragment of each SDU. The FC field 82 identifies whether the SDU is fragmented or not. If the SDU is fragmented, the FC field 82 indicates whether this fragment is the first fragment (01), the last fragment (10), or a middle fragment (11) of the fragmented SDU. The SID field 86 then specifies the first, middle, and last fragments. In a preferred embodiment, the SID is added also for an unfragmented SDU, where the SID is incremented for any fragment and for any unfragmented SDU that is sent on the specific channel. An SDU may be fragmented into three fragments while a second SDU may include 512 fragments. In the latter case, the SID field 86 helps the receiver to identify each SDU fragment, even if they are received out of sequence.
The SID field 86 is also helpful when fragments are received out of order when two SDUs are sent on the same channel (one after the other) and each is fragmented into three parts. For example, SDU2f1 (second SDU, first fragment) could be received before any fragment of SDU1. SDU1f2 could be received next, followed by the remaining segments. To make sense of this, the defragmentation machine needs the SID to be incremented for each fragment that is sent, including the first and last fragments. Then, a distinction between SDU1f1 and SDU2f2 can be made, and it would be clear that SDU1f2 does not come after SDU1f1.
Similarly,
Each SDU fragment is coupled with the headers illustrated in
At the transmitter 20, the fragmentation state machine 100 begins to transmit the first SDU, SDU1, which is divided into fragments, denoted SDUF1, SDUF3, . . . , SDUFj. These fragments are transmitted wirelessly to the receiver 30 using a first channel, denoted channel 0. Before transmission of all SDU1 fragments is complete, the transmitter receives a request to send a second SDU, SDU2. It turns out that SDU2 has a higher priority than SDU1. As an example, SDU2 may be a power control request having only a few fragments while SDU1 may have hundreds of fragments. In prior art WiMAX implementations, the power control request is processed only after SDU1 is completely transmitted. Alternatively, the channel select mechanism 24 of the fragmentation state machine 100 establishes a second channel, channel 1, for transmitting SDU2. This enables SDU2 and SDU1 to be processed simultaneously.
On the receiver side, the defragmentation state machine 200 includes 2N separate buffers 42 for storing SDU fragments from different channels. In the configuration of
Returning to
In some embodiments, the defragmentation state machine 200 is enhanced for non-ARQ MAC connections that only use HARQ. As described above, these types of connections can lead to out-of-order transmissions that, under the current 802.16m standard, are not resolved at the receiver, leading to SDUs being dropped. The preemption system 500 solves this problem by explicitly identifying each fragment of each SDU, allowing each SDU to be transmitted on a separate channel, and buffering each SDU fragment in a separate buffer at the receiver 30, with the different buffers being indexed by the channel ID field. So, in the example of
Further, the other newly defined header field, the sequence ID 86, will explicitly identify each segment of each SDU. In this manner, the receiver 30 will not be confused if the fragment, c, of SDU1 follows fragment, b, of SDU2, which follows fragment c+1 of SDU1, for integers b and c.
Further, the discard timer 34 will track the fragments of an SDU during transmission. Whenever a fragment, c, of the SDU is received on the non-ARQ connection, the discard timer for this SDU is started. In some embodiments, if all the fragments of the SDU don't arrive before the expiry of the discard timer 34, then all the fragments of that SDU that were already received are discarded. Since there is no ARQ, the MAC layer will no longer retransmit this SDU. Instead, the retransmission will be left to higher layers (if such capability exists in the higher layers).
In some embodiments, the value of the discard timer 34 is set by taking different parameters into account, such as the maximum delay time for a PDU (before the receiver gives up on receiving the missing sequence numbers, or SNs) and/or reordering buffer limitations in the receiver (which may be declared by the advanced mobile station, and influence the advanced base station's behavior on the downlink).
The SDU1 fragments transmitted over the first MAC channel are received and stored in the first buffer 42A, at which point the defragmentation state machine 200 sets a first discard timer 34A (block 202). While the discard timer 34A is not expired (block 204) and before all SDU1 fragments have been received (block 208), the defragmentation state machine 200 receives additional SDU1 fragments into the first buffer 42A (block 212). Control returns to block 204 such that, before each succeeding fragment of SDU1 is received, the discard timer 34A is checked (block 204) and whether all SDU1 segments have been received is checked (block 208). Recall that the fragmentation control bits 82, found in the FPEH 80 of data SDUs and in the FEH 90 of management SDUs, indicates the last fragment of the SDU (
If, on the other hand, the discard timer expires before the last fragment is received, the defragmentation state machine 200 empties the first buffer 34A, thus discarding all the fragments of the SDU1 (block 206). Where the discard timer has not expired, if all SDU1 segments have been received, the receiver 30 is able to identify each fragment, even where the fragments were obtained out-of-order, and decode SDU1 (block 210). For either the case where the buffer 42A is emptied of all fragments (block 206) or SDU1 is successfully decoded (block 210), the discard timer 34A is reset (block 214). For SDU1, the operations of the defragmentation state machine 200 is thus complete.
The operations for receiving the fragments of SDU2 mirror those of SDU1. The SDU fragments are stored in the second buffer 42B and the second discard timer 34B is set (block 222), and further SDU2 fragments are received (block 232) if the discard timer has not expired (block 224) and the receiver has not received all fragments (block 228). These operations are repeated until either the discard timer expires (block 224), in which case the second buffer 42B is emptied (block 226), causing all received SDU2 fragments to be discarded. Where all fragments have been successfully received, the receiver 30 decodes SDU2 (block 230) and the discard timer 34B is reset (block 234).
In some embodiments, there exists a single fragmentation state machine 100 and a single defragmentation state machine 200 for each connection. Also, in some embodiments, the defragmentation state machine 200 drops all fragments associated with the same SDU if any of them is treated as a loss at the HARQ layer.
The preemption system 500 of
While the application has been described with respect to a limited number of embodiments, those skilled in the art will appreciate numerous modifications and variations therefrom. It is intended that the appended claims cover all such modifications and variations as fall within the true spirit and scope of the invention.
This application claims priority under 35 U.S.C. 119(e) to U.S. Provisional Patent Application No. 61/259,086, filed on Nov. 6, 2009.
Number | Name | Date | Kind |
---|---|---|---|
7391776 | Venkatachalam et al. | Jun 2008 | B2 |
7414976 | Venkatachalam et al. | Aug 2008 | B2 |
7499426 | Venkatachalam | Mar 2009 | B2 |
7548507 | Pandoh et al. | Jun 2009 | B2 |
7633904 | Venkatachalam | Dec 2009 | B2 |
7636577 | Mohanty et al. | Dec 2009 | B2 |
7693555 | Srinivasan et al. | Apr 2010 | B2 |
7720490 | Venkatachalam | May 2010 | B2 |
7725115 | Venkatachalam | May 2010 | B2 |
7746896 | Venkatachalam | Jun 2010 | B2 |
7782817 | Yang et al. | Aug 2010 | B2 |
7787891 | Taaghol et al. | Aug 2010 | B2 |
7804799 | Venkatachalam et al. | Sep 2010 | B2 |
7809355 | Mohanty et al. | Oct 2010 | B2 |
7826404 | Puthenkulam et al. | Nov 2010 | B2 |
7852794 | Venkatachalam | Dec 2010 | B2 |
7860469 | Mohanty et al. | Dec 2010 | B2 |
7885210 | Yang et al. | Feb 2011 | B2 |
7894449 | Mohanty | Feb 2011 | B2 |
20050010676 | Venkatachalam et al. | Jan 2005 | A1 |
20050129020 | Doyle et al. | Jun 2005 | A1 |
20060221978 | Venkatachalam | Oct 2006 | A1 |
20070081513 | Torsner | Apr 2007 | A1 |
20070086434 | Venkatachalam et al. | Apr 2007 | A1 |
20070087767 | Pareek et al. | Apr 2007 | A1 |
20070097205 | Venkatachalam | May 2007 | A1 |
20070104132 | Rajagopalan et al. | May 2007 | A1 |
20070105567 | Mohanty et al. | May 2007 | A1 |
20070105600 | Mohanty et al. | May 2007 | A1 |
20070121567 | Venkatachalam et al. | May 2007 | A1 |
20070191031 | Mohanty et al. | Aug 2007 | A1 |
20070245025 | Venkatachalam | Oct 2007 | A1 |
20070259692 | Venkatachalam | Nov 2007 | A1 |
20070297435 | Bucknell et al. | Dec 2007 | A1 |
20070298806 | Venkatachalam | Dec 2007 | A1 |
20080014981 | Venkatachalam | Jan 2008 | A1 |
20080019312 | Venkatachalam et al. | Jan 2008 | A1 |
20080019394 | Rengarajan et al. | Jan 2008 | A1 |
20080037460 | Venkatachalam | Feb 2008 | A1 |
20080037480 | Venkatachalam | Feb 2008 | A1 |
20080056219 | Venkatachalam | Mar 2008 | A1 |
20080080371 | Liu et al. | Apr 2008 | A1 |
20080084814 | Venkatachalam | Apr 2008 | A1 |
20080084941 | Mohanty et al. | Apr 2008 | A1 |
20080096614 | Venkatachalam | Apr 2008 | A1 |
20080101213 | Mohanty et al. | May 2008 | A1 |
20080101285 | Venkatachalam et al. | May 2008 | A1 |
20080107092 | Taaghol et al. | May 2008 | A1 |
20080108321 | Taaghol et al. | May 2008 | A1 |
20080108336 | Venkatachalum et al. | May 2008 | A1 |
20080151789 | Venkatachalam et al. | Jun 2008 | A1 |
20080159220 | Kitchin et al. | Jul 2008 | A1 |
20080165755 | Marinier et al. | Jul 2008 | A1 |
20080165805 | Terry et al. | Jul 2008 | A1 |
20080186946 | Marinier et al. | Aug 2008 | A1 |
20080198830 | Mohanty et al. | Aug 2008 | A1 |
20080214213 | Etemad et al. | Sep 2008 | A1 |
20080219189 | Kitchin et al. | Sep 2008 | A1 |
20080219195 | Pani et al. | Sep 2008 | A1 |
20080219216 | Taaghol et al. | Sep 2008 | A1 |
20080225765 | Marinier et al. | Sep 2008 | A1 |
20080225893 | Cave et al. | Sep 2008 | A1 |
20080232288 | Venkatachalam et al. | Sep 2008 | A1 |
20080232401 | Ahmadi et al. | Sep 2008 | A1 |
20080259835 | Venkatachalam et al. | Oct 2008 | A1 |
20080279127 | Venkatachalam et al. | Nov 2008 | A1 |
20080279136 | Taaghol et al. | Nov 2008 | A1 |
20080310381 | Taaghol et al. | Dec 2008 | A1 |
20080310386 | Venkatachalam | Dec 2008 | A1 |
20080311881 | Taaghol et al. | Dec 2008 | A1 |
20080311891 | Venkatachalam et al. | Dec 2008 | A1 |
20080311909 | Taaghol et al. | Dec 2008 | A1 |
20080311931 | Venkatachalam et al. | Dec 2008 | A1 |
20090003255 | Mohanty et al. | Jan 2009 | A1 |
20090003285 | Mohanty et al. | Jan 2009 | A1 |
20090034526 | Ahmadi et al. | Feb 2009 | A1 |
20090040970 | Ahmadi et al. | Feb 2009 | A1 |
20090086659 | Pani et al. | Apr 2009 | A1 |
20090086708 | Pani et al. | Apr 2009 | A1 |
20090086709 | Pani et al. | Apr 2009 | A1 |
20090088177 | Yang et al. | Apr 2009 | A1 |
20090154457 | Kolekar et al. | Jun 2009 | A1 |
20090161591 | Ahmadi et al. | Jun 2009 | A1 |
20090168745 | Ahmadi et al. | Jul 2009 | A1 |
20090168770 | Mohanty | Jul 2009 | A1 |
20090168907 | Mohanty et al. | Jul 2009 | A1 |
20090257389 | Mohanty et al. | Oct 2009 | A1 |
20090274105 | Choi et al. | Nov 2009 | A1 |
20090323602 | Li et al. | Dec 2009 | A1 |
20090323770 | Venkatachalam et al. | Dec 2009 | A1 |
20100005354 | Zhu et al. | Jan 2010 | A1 |
20100008325 | Hartman et al. | Jan 2010 | A1 |
20100056154 | Venkachalam | Mar 2010 | A1 |
20100056182 | Venkatachalam | Mar 2010 | A1 |
20100103825 | Taaghol et al. | Apr 2010 | A1 |
20100111047 | Yang et al. | May 2010 | A1 |
20100128704 | Taaghol et al. | May 2010 | A1 |
20100157906 | Yang et al. | Jun 2010 | A1 |
20100166183 | Johnston et al. | Jul 2010 | A1 |
20100172291 | Kim et al. | Jul 2010 | A1 |
20100173631 | Kim et al. | Jul 2010 | A1 |
20100202394 | Zhang et al. | Aug 2010 | A1 |
20100208831 | Zhu et al. | Aug 2010 | A1 |
20100226311 | Yang et al. | Sep 2010 | A1 |
20100227618 | Yang et al. | Sep 2010 | A1 |
20100232356 | Maheshwari et al. | Sep 2010 | A1 |
20100275085 | Venkatachalam et al. | Oct 2010 | A1 |
20100279717 | Venkatachalam et al. | Nov 2010 | A1 |
20100316030 | Venkatachalam et al. | Dec 2010 | A1 |
20100331000 | Zhu et al. | Dec 2010 | A1 |
20110002239 | Venkatachalam | Jan 2011 | A1 |
20110002297 | Jain et al. | Jan 2011 | A1 |
20110002298 | Venkatachalam et al. | Jan 2011 | A1 |
20110002299 | Venkatachalam | Jan 2011 | A1 |
20110003591 | Venkatachalam et al. | Jan 2011 | A1 |
20110004747 | Venkatachalam | Jan 2011 | A1 |
20110004760 | Sharaga et al. | Jan 2011 | A1 |
20110016369 | Bergman | Jan 2011 | A1 |
20110044213 | Venkatachalam et al. | Feb 2011 | A1 |
20110044229 | Etemad et al. | Feb 2011 | A1 |
20110044266 | Shrivastava et al. | Feb 2011 | A1 |
20110044307 | Mohanty et al. | Feb 2011 | A1 |
20110045763 | Mohanty et al. | Feb 2011 | A1 |
20110047289 | Venkatachalam et al. | Feb 2011 | A1 |
20110188464 | Shinohara et al. | Aug 2011 | A1 |
20110205945 | Cave et al. | Aug 2011 | A1 |
20120057530 | Marinier et al. | Mar 2012 | A1 |
20120089721 | Day | Apr 2012 | A1 |
20120176971 | Pani et al. | Jul 2012 | A1 |
Entry |
---|
Yang et al., “Techniques to assign multiple identifiers in a Wireless Network”, U.S. Appl. No. 12/851,841, filed Aug. 6, 2010, pp. 1-29. |
Yang, et al., “Coordinating broadcast operations in a mobile wireless network with Overlaid cells”, U.S. Appl. No. 12/633,853, filed Dec. 9, 2009, pp. 1-27. |
Venkatachalam, et al., “Uplink Contention Based Access With Quick Access Channel”, U.S. Appl. No. 12/890,819, filed Sep. 27, 2010, pp. 1-22. |
Zhu, et al., “Configurable Common Rerfernce Signal Port for Reference Signal Received Power in Distributed Antenna Systems”, U.S. Appl. No. 12/928,758, filed Dec. 17, 2010, pp, 1-16. |
Yang, et al., “Techniques to Assign Identifiers in a Wireless Network”, U.S. Appl. No. 12/851,756, filed Aug. 6, 2010, pp. 1-19. |
Venkatachalam, et al., “Cell Reselection Mechanism for a Base Station with Closed Subscriber Group”,U.S. Appl. No. 12/886,764, filed Sep. 21, 2010, pp. 1-27. |
Venkatachalam, “Mechanisms to Update a Serving Base Station With the CSG Memberships of a Mobile Station”, U.S. Appl. No. 12/911,394, filed Oct. 25, 2010, pp. 1-20. |
Venkatachalam, et al., “Techniques for Timing Optimization in Wireless Networks That Utilize a Universal Services Interface”, U.S. Appl. No. 13/006,605, filed Jan. 14, 2011. |
Venkatachalam, “Managing Interference Due to Low Power BSs”, U.S. Appl. No. 12/889,025, filed Sep. 23, 2010, pp. 1-25. |
Venkatachalam, “Femtocell Architecture and Network”, U.S. Appl. No. 12/645,045, filed Dec. 22, 2009, pp. 1-18. |
Venkatachalam, “Airlink Techniques Enabling Dynamic Optimization and Configuration of Wireless Network Base Stations”, U.S. Appl. No. 12/906,488, filed Oct. 18, 2010, pp. 1-18. |
Venkatachalam, et al., “Management of Ids for Closed Subscriber Group (CSG) Base Stations”, U.S. Appl. No. 12/882,924, filed Sep. 15, 2010. |
Shan, et al., “Wimax Voip Service Architecture”, U.S. Appl. No. 12/940,288, filed Nov. 5, 2010, pp. 1-40. |
Srinivasan, et al., “Sleep-mode wireless cell reselection Apparatus, systems, and methods”, U.S. Appl. No. 12/650,157, filed Dec. 30, 2009, pp. 1-24. |
Bergman, “Techniques Utilizing ARQ Feedback for Efficient Transmitter Buffer Usage”, U.S. Appl. No. 12/890,020, filed Sep. 24, 2010, pp. 1-26. |
Yang, et al., “Improved Radio-Link Reliability Using Multi-Carrier Capability in Wireless Broadband Systems”,U.S. Appl. No. 12/822,643, filed Jun. 24, 2010, pp. 1-29. |
Mohanty, et al, “Sleep Optimization for Mobile Devices in a Weless Nework”, U.S. Appl. No. 12/955,060, filed Nov. 29, 2010, pp. 1-40. |
Venkatachalam et al., “Legacy and Advanced Access Service Network Internetworking”, U.S. Appl. No. 12/889,285, filed Sep. 23, 2010, pp. 1-25. |
Yang, et al., “Security Update Procedure for Zone Switching in Mixed-Mode Wimax Network”, U.S. Appl. No. 12/855,400, filed Aug. 12, 2010, pp. 1-35. |
Ahmadi, et al., “Transmission of System Configuration Information in Mobile Networks”, U.S. Appl. No. 12/638,846, filed Dec. 15, 2009, pp. 1-37. |
Venkatachalam, et al., “Apparatus and Methods for Upgrading an Airlink in a Wireless System”, U.S. Appl. No. 12/890,179, filed Sep. 24, 2010, pp. 1-25. |
Venkatachalam, et al., “Coverage Loss Recovery in a Wireless Communication Network”, U.S. Appl. No. 12/826,639, filed Jun. 29, 2010, pp. 1-38. |
Venkatachalam, et al., “Wireless Device and Method for Efficiently Paging Idle-mode Mobile Stations in Multicarrier Systems”, U.S. Appl. No. 12/862,120, filed Aug. 24, 2010, pp. 1-19. |
Yang, et al., “Relay Data Path Architecture for a Wireless Network”, U.S. Appl. No. 12/872,808, filed Aug. 31, 2010, pp. 1-27. |
Zhu, et al., “Physical Uplink Control Channel Interference Mitigation in Heterogenous Networks”, U.S. Appl. No. 12/930,001, filed Dec. 23, 2010, pp. 1-32. |
Venkatachalam, et al., “Distributed Control Architecture for Relays in Broadband Wireless Networks”, U.S. Appl. No. 12/889,938, filed Sep. 24, 2010, pp. 1-33. |
Jain, et al., “Single Radio Wimax Interworking”, U.S. Appl. No. 12/862,512, filed Aug. 24, 2010, pp. 1-37. |
Yang, et al., “Uplink Power Headroom Calculation and Reporting for OFDMA Carrier Aggregation Communication System”, U.S. Appl. No. 12/889,318, filed Sep. 23, 2010, pp. 1-20. |
Zhu, et al., “Techniques for formatting signals for transmission using a wireless network”, U.S. Appl. No. 12/962,045, filed Dec. 7, 2010, pp. 1-30. |
Yang, et al., “Base Station Selection Method for Heterogeneous Overlay Networks”, U.S. Appl. No. 12/977,797, filed Dec. 23, 2010, pp. 1-30. |
Sharaga, et al., “Neighbor List Broadcasting Techniques”, U.S. Appl. No. 12/914,097, filed Oct. 28, 2010, pp. 1-29. |
Number | Date | Country | |
---|---|---|---|
20110110343 A1 | May 2011 | US |
Number | Date | Country | |
---|---|---|---|
61259086 | Nov 2009 | US |