Abstract: Certain aspects of the present disclosure provide techniques and apparatus for startup and recovery of a radio link between a relay node and a donor base station. According to certain aspects, a relay node may perform a random access procedure utilizing a random access channel (RACH) to transition between Uu interface operations and Un interface operations. According to certain aspects, the relay node may perform radio link failure (RLF) recovery utilizing RACH procedures for a Un interface. The procedures described herein, according to certain aspects, may utilize a dedicated relay RACH resource and a Relay Physical Downlink Control Channel (R-PDCCH).

Abstract: Certain aspects of the present disclosure provide techniques and apparatuses for managing radio bearers during traffic congestion in a wireless communications networks having relays. According to certain aspects, a donor base station may detect traffic congestion on a Un radio bearer configured to interface between the relay node and the donor base station, where the Un radio bearer carries a plurality of Uu bears configured to interface between the relay node and at least one user equipment (UE). According to certain aspects, the donor base station may take one or more actions to trigger removal of at least one of the Uu bearers carried on the Un bearer.

Abstract: Certain aspects of the present disclosure relate to techniques for operating a relay having a first plurality of radio bearers (RBs) that interface with a donor base station and having a second plurality of RBs that interface with at least one user equipment (UE). According to certain aspects, the techniques generally include mapping each of the second plurality of RBs to one of the first plurality of RBs based on a QoS class identifier (QCI) associated therewith.

Abstract: A CS fallback procedure handles conflict that may arise when handover operations occur during CS fallback. If CS fallback is initiated for an access terminal and handover of that access terminal is then initiated before the CS fallback completes, the target for the handover is informed of the CS fallback so that the target may perform the appropriate CS fallback operations.

Abstract: Seamless communication handoff is achieved by establishing a protocol tunnel to route leftover packets between network access nodes during the handoff. For example, in a mobile IP-based system, a mobile node may perform a handoff from a first access node that is associated with a first routing node to a second access node that is associated with a second routing node. To prevent the loss of any packets that may be in route for delivery to or from the first routing node during the handoff, the mobile node establishes a protocol tunnel with the first access node via the second access node. On the forward-link, packets being delivered from the first routing node are routed over the protocol tunnel to the second access node and then to the mobile node. On the reverse-link, packets being sent to the first routing node are routed over the protocol tunnel from the mobile node to the second access node and then to the first routing node.

Abstract: In order to mitigate the security risk posed by the insertion of a relay node within a communication network, both device authentication and subscriber authentication are performed on the relay node. Device and subscriber authentication may be bound together so that a relay node is granted access to operate within the network only if both device and subscriber authentication are successful. Additionally, a communication network (or authentication node) may further verify that a subscriber identifier (received as part of subscriber authentication) is associated with the corresponding device type (identified by the device identifier in the corresponding device authentication) as part of the subscriber authentication process.

Abstract: An apparatus for accessing an access network includes a processing system configured to maintain an active set comprising a plurality of network functions, the processing system being further configured to support a handoff of a network layer attachment point from a first one of the network functions to a second one of the network functions by sending a message to each of the network functions which identifies the second one of the network functions as a target of the handoff and performing a binding update for the second one of the network functions with a home agent.

Abstract: Methods and apparatus for tunneling packets between remote and serving Access points for delivery to an access terminal (AT) are described. Methods and apparatus for communicating control values and/or information in addition to information to be delivered to an AT over an airlink are also described. An AT uses the received control information to recover communicated packets. Some features support the use of various headers and/or indicators in the headers, e.g., RLP and/or Packet Correlation Protocol (PCP) headers, which may be used to control routing of communicated payloads to an RLP processing module corresponding to an AP which was the source of the communicated payload.

Abstract: Systems and methodologies are described that facilitate compressing headers for relay nodes. In particular, a robust header compression (RoHC) profile can be defined for general packet radio service (GPRS) tunneling protocol (GTP) headers. Upon receiving a packet with one or more GTP headers, an access point or relay node can determine whether the one or more GTP headers are compressible and can apply the RoHC profile to compress the one or more GTP headers. In addition, the packet can include a baseheader encapsulated by the one or more GTP headers, which can also be compressed according to a RoHC profile specific to the baseheader. Moreover, RoHC compressed headers can be decompressed according to the GTP RoHC profile.

Abstract: Techniques for sending control information in the header of multiple packets are described. The techniques may allow more control information to be sent using a small number of overhead bits per packet. In one design, a first node (e.g., a network entity) may determine control information to send to a second node (e.g., a UE or another network entity). The first node may send the control information in the header of multiple packets toward the second node. In one design, the control information may include congestion information indicative of traffic congestion at the first node. The congestion information may be sent using Explicit Congestion Notification (ECN) bits in the header of IP packets. The first node may send the control information with or without coding and for all packets or a specific data flow. The first node may also send a synchronization sequence prior to the control information.

Abstract: Systems and methodologies are described that facilitate compressing headers for relay nodes. In particular, a plurality of internet protocol (IP) headers, tunneling protocol headers, and/or other routing headers in a packet can be compressed to facilitate efficient communications of packets between relay nodes and/or a donor access point. An access point receiving packets to be compressed can provide a disparate access point with a compression context and an uncompressed packet. The disparate access point can generate a decompression context related to subsequent packets having similar header values and can store the decompression context with the context identifier. The access point can subsequently compress received packets having similar header values and communicate the compressed packets with the context identifier to the disparate access point. The disparate access point can apply the previously generated decompression context associated with the context identifier to decompress the packets.

Abstract: Systems and methodologies are described that facilitate compressing multiple headers in wireless communication networks that utilize relay nodes. Relay nodes and/or other access points can insert headers in packets related to routing the packets. The multiple headers can be compressed at a transmitter and decompressed at a receiver to save bandwidth over a radio interface. Recursive compression and/or decompression can be utilized at least in part by recursively calling a compression/decompression engine or context, such that no modification is required of the engine or context. The recursive compression/decompression can compress and/or decompress packet headers until a certain type of header is reached (or a certain type of header is no longer found in the packet), according to a tunnel depth, according to newly defined compression and/or decompress profiles, and/or the like.

Abstract: The disclosed embodiments provide for methods and systems for monitoring a paging channel. In one aspect, a method for monitoring a paging channel includes monitoring a paging channel for a page message at scheduled paging slots, determining that an error has occurred at a given paging slot, and monitoring the paging channel for a re-page message at least one scheduled re-paging slot, where the re-paging slots occur after the given paging slot but before the next scheduled paging slot. In another aspect, a method for monitoring a paging channel includes monitoring a first one of a plurality of paging channels for a page message at scheduled paging slots, determining that an error has occurred at a given paging slot, and monitoring at least a second one of the plurality of paging channels for the page message.

Abstract: Scheduling real-time Quality of Service (QoS) data flows in a large-scale wireless communications system uses credit allocation to active QoS flows based on quality-of-service weights, and the credits are measured in dimensionless units of air interface slot capacity. Scheduling addresses inactive QoS flows with no data pending for transmission that may accumulate up to a burst credits limit based upon a fair share of all credits that would be allocated in a 100% busy system. Intermittent flows such as echo requests or keyboard input can thereby get immediate service by using their burst credits. The flow with the highest credit accumulation is serviced first and may use up to a full time slot (or system quanta) of air interface time reducing header encapsulation overhead when payload sizes (and spectral efficiency) are low. Additive and multiplicative aspects age the negative credits back to zero whenever a flow overspends its credit allocation.

Abstract: Described herein is methodologies for efficient utilization of backhaul resources of a network for delivering paging data to an access terminal (AT) without sacrificing delay performance. A location that buffers data for an AT can be adaptively changed based on factors such as the location of the AT, applications utilized by the AT, and a recent activity level of the AT. To facilitate this determination, an AT can be configured with one or more registration boundaries. An AT can be configured with a small registration radius such that if the AT does not move outside of the small registration radius, data can be delivered directly to a data attachment point for the AT. If the AT moves outside of the small registration radius, the registration radius can be switched to a large registration radius and the access gateway can instead locally buffer data for the AT.

Abstract: Receiver diversity in a wireless device is controlled in response to operating conditions, transmission requirements, and control settings. The control of diversity reduces power consumption by enabling receive diversity on given conditions. Operating conditions, transmission requirements, and control settings are used separately or used in conjunction to determine whether benefits of multi-antenna receive diversity, such as higher link capacity, higher data throughput, lower transmit power, and lower error rate, warrant the higher power cost of the diversity.

Abstract: The disclosure is directed to an access point in a wireless access network and methods for using an access point. The access point includes a transceiver function and a network function. The network function is configured to route packets between a packet-based network and the transceiver function. The transceiver function is configured to support a wireless connection with an access terminal, and provide protocol translation between the packets and physical frames transported over the wireless connection.

Abstract: Systems and methodologies are described that facilitate compressing headers for relay nodes. In particular, a plurality of internet protocol (IP) headers, tunneling protocol headers, and/or other routing headers in a packet can be compressed to facilitate efficient communications of packets between relay nodes and/or a donor access point. A donor or other upstream access point can be provided with a filter mask, bit stream, and filter mask identifier generated by a related relay node for packets having given static header data. Thus, the donor or other upstream access point can apply the filter mask to incoming packet headers, and where a resulting bit stream matches the received bit stream, can replace at least a portion of the packet headers with the filter mask identifier. The relay node can subsequently decompress the packet headers based on the filter mask identifier. Similar functionality can be used for compressing uplink communications.

Abstract: Aspects describe indicating to a mobile station whether an access point supports local Internet Protocol (IP) access. The indication can be sent through utilization of common signaling, which allows the mobile station to have information about the local IP access availability before connecting to the access point. The indication can be sent through utilization of dedicated signaling, which allows the mobile station to find out about availability of local IP access after the mobile station connects to the access point.

Abstract: Systems and methodologies are described that facilitate providing user plane support for internet protocol (IP) relays. Service data units (SDU) received at a radio communication layer can be provided to an upper communication layer, such as a packet data convergence protocol (PDCP) layer, without regard to sequence numbers. The upper communication layer can handle reordering of the received protocol data units. Since communications related to a plurality of devices through one or more IP relays can be mapped over a single bearer, allowing reordering at the upper communication layer can mitigate delay caused where a donor or other upstream access point is delayed in providing a sequential SDU related to one of a plurality of devices downstream. In this regard, SDUs related to other devices can be processed by the upper communication layer while waiting for the sequential SDU.