摘要:
In one embodiment, the method includes determining, at a receiver, a total average received power over N resource elements and the L antennas, where N and L are integers greater than or equal to 1. The method further includes determining, at the receiver, a first bias in a first estimate of average received power for a received desired signal based on the determined total average received power; and generating, at the receiver, a first refined estimate of the average received power for the received desired signal based on the first estimate and the determined first bias.
摘要:
Various methods and network nodes (e.g., base stations or base transceiver nodes) are provided to address the need for enhanced uplink performance. In a first method, a virtual soft handoff network node receives (501), from a serving network node, information related to uplink communications of user equipment (UE) served by the serving network node, wherein a soft handoff is not established between the virtual soft handoff network node and the UE. The virtual soft handoff network node receives (502) uplink communications between the UE and the serving network node and processes (503) the uplink communications to determine decoded uplink data from the UE. In a second method, a serving network node sends (401) to a virtual soft handoff network node, information related to uplink communications of user equipment (UE), the UE being served by the serving network node but not in soft handoff with the virtual soft handoff network node.
摘要:
Improved ranking and grouping techniques are disclosed for communication systems such as a multiple input multiple output system. For instance, techniques are disclosed for ranking and grouping users that are eligible for single-user and/or multiple-user transmissions. In one case, ranking and grouping are performed independently and, in another case, ranking and grouping are performed jointly.
摘要:
In a wireless communications system which hops from frequency to frequency, rather than hopping according to a fixed dwell interval and a pre-determined pseudo-random hop sequence, a quality-based frequency hopping methodology is defined in which a new frequency is hopped to when the channel quality on the current frequency degrades based on the measured value or values of one or more predetermined metrics that are associated with channel quality. When triggered to hop to a next frequency, the hop-to-frequency may be the next frequency in the pseudo-random hop sequence known to both the transmitter and receiver or, in order to improve the reliability of communications, may be determined based on channel quality measurements on different potential hop-to-frequencies.
摘要:
In an ad hoc wireless network, for purposes of neighbor discovery, a transmitting node transmits a beacon within a timeslot and at a frequency that varies from timeslot-to-timeslot according to one or more associated and known pseudo-random or cyclical frequency hopping sequences. When, during a timeslot, the frequency hopping sequence would select a beacon frequency that if transmitted would violate spectrum policy that is in place during that timeslot, then, during that timeslot, a beacon is not transmitted during that timeslot. During each timeslot, a neighbor receiving node attempts to detect and decode a transmitted beacon at a frequency specified by the frequency hopping sequence that it expects a transmitting node to be using. When a receiving node successfully detects and decodes a beacon transmitted by a transmitting node, neighbor discovery between the transmitting and receiving nodes is achieved.
摘要:
In a floor control system for a network, a floor control server controls a floor-based application for communications between multiple participant terminals. The server carries out a floor determination process that includes an adaptive waiting function. Upon receiving an initial floor request message, the server waits for additional requests before determining the floor winner. The wait time is a function of the floor request load. When the system is lightly loaded, the wait time is generally small. For heavier request loads, the wait time is generally longer, to ensure that a reasonable number of requests are received before awarding the floor. The wait time may be limited by a maximum wait time, which is a function of the floor request load. If a designated number of floor requests is received before the maximum wait time expires, a temporary floor winner is granted the floor if its priority is sufficiently high.
摘要:
Information is transmitted over selected, Orthogonal Frequency Division Multiplexed (OFDM) sub-channels to avoid frequencies with unacceptable congestion, noise or interference levels. Using frequency hopping, selected non-contiguous OFDM sub-channels used for transmission may vary with time. Once a group of OFDM sub-channels is selected, a power level and modulation technique may also be selected based on channel quality.
摘要:
In a method of tracking a user in a communication network supporting a broadcast-multicast service, the network classifies groups of users into tracking areas. Movement of a user may be tracked as the user crosses a boundary between two tracking areas in the network. The method may enable a balance to be achieved between use of uplink overhead and the level or granularity of tracking desired, so as to conserve radio resources.
摘要:
Methods for jointly determining tones, power, scheduling and routing of links in a multi-carrier, multi-hop network to achieve certain desired throughput objectives between source and destination nodes. The methods effectively enhance or optimize throughput received by each destination router under node traffic constraints such as power, scheduling and flow constraints that apply to each link between each of a plurality of nodes within the mesh network.
摘要:
In a multiple node network, the method includes waking up at least one node from a sleep mode during at least one associated slot of a time-slotted frame, the sleep mode being a low power consumption mode. Also, in at least one node of a multiple node network, the period of time a node sleeps is based on the residual energy of the node, the residual energy of the nodes in the neighborhood, neighborhood node density, and combinations thereof.