Lucent Technologies Inc.

Alcatel Lucent

Nokia Technologies Oy

Bulin B Zhang

Joe Huang

Sudheer A Grandhi

Krishnan Kumaran

Simon C Borst

Anjana Agarwal

Philip Lamoureux

Awinash Trimbak Talwalkar

Yang Yang

Terry Si-Fong Cheng

Myles Patrick Murphy

Gurudutt Hosangadi

Methods, apparatuses, and computer program products are described for a user equipment in a wireless communication system with a plurality of user equipment where reference weight vectors orthogonal to each other are selected from a predefined set of directions for reference beams. The inner products of a UE-specific beam weight vector with all reference weight vectors is performed and UE-specific beams are mapped to the set of reference beams. From the set of reference beams, based on the reference beam with largest magnitude of inner product, the direction of the user equipment is determined. Based on that determined direction, the user equipment is instructed in to pair with another user equipment of the plurality.

UE-specific beam mapping with reference weight vectors

In one embodiment, the method includes determining loads on control channel resources of at least two of the multiple carriers, and assigning the access terminal to one of the multiple carriers based on the determined loads.

Method of assigning an idle state access terminal to a carrier in a multiple carrier wireless communication system based on load on control channel resources

In one embodiment, at least one grouping message is broadcast from a network element. The grouping message causes an access terminal (AT) in the communications network to regard the at least first and second subnets as both being members of a same subnet group. Location information and a maximum distance parameter associated with at least one area and configured to create a buffer zone along a border between the first and second subnets are broadcasted from the network element to the AT. The AT is prevented from sending a subnet identifier request message when the AT has, as an origin area, an area of the first subnet in the buffer zone and the AT travels to an area of the second subnet in the buffer zone. Session transfers are performed outside the buffer zone triggered by distance based location update messages, thus preventing session transfer ping-ponging.

Method of providing hand-off hysteresis for subnet borders

According to certain embodiments of the present invention, cryptosynchronization values are calculated on an initiating and/or responding device in a communications system such that cryptosynchronization-based procedures might succeed even when the discrepancy between the system times of the initiating and responding devices exceeds the cryptosync constraints imposed by the communications system. In one embodiment, the initiating device add/subtracts a cryptosynchronization adjustment value x to/from the initiating device's system time to yield an adjusted initiator cryptosynchronization value. In another embodiment, the receiving device adjusts the receiving device's system time to yield an adjusted receiver cryptosynchronization value.

Timing adjustment for session security protocol

The frequency reuse scheme for downlink power channels in a sectorized network assigns transmit power for control channels transmitted by cell blocks in a cell layout such that cell blocks aligned in a particular direction have an incrementally higher transmit power.

Frequency reuse scheme for downlink power channels in a sectorized network

One embodiment of the present invention is a method for controlling the number of mobile-telephones transmitting acknowledgments to broadcast short messages (BSM) over a same set of random access channels at a same time. In this embodiment, the transmissions of BSM acknowledgments is controlled by the wireless communication system using random access channel restrictions and random access techniques. Specifically, the random access channel restrictions reduce collisions among acknowledging mobile-telephones and call processing mobile-telephones by allocating one or more specific random access channels over which a BSM acknowledgment can be transmitted, and the random access techniques reduce collisions among acknowledging mobile-telephones by distributing transmissions of the BSM acknowledgments over a period of time.

Random access channel congestion control for broadcast teleservice acknowledgement messages

Sharing the existing sector antennas at the base station each of which corresponds to one sector of the outer communication coverage area to create an omnidirectional inner communication coverage area. When transmitting or receiving data from a mobile in one sector of the outer communication coverage area only one antenna is used, and when transmitting or receiving data from a mobile in the inner communication coverage area all the antennas are used. This allows an increase in capacity of the hybrid inner/outer sectored cell without the additional cost of adding further antennas.

Antenna configuration for a hybrid inner/outer sectored cell

In a cellular system, channels are assigned for new calls using a flexible channel allocation algorithm that is a hybrid of a measurement-based dynamic channel assignment (MBDCA) algorithm and a reuse-distance criterion algorithm, such as a cost-function-based DCA (CFBDCA). In one embodiment, the MBDCA algorithm is implemented at each cell site in the cellular system and generates a list of candidate channels for each new call. The list is transmitted to the mobile switching center (MSC), which implements the CFBDCA algorithm to select a particular channel from the list of candidate channels for the new call.

Flexible channel allocation for a cellular system based on a hybrid

Operations in a cellular system are controlled based on cost values that are generated using neighbor association. In neighbor association, each cost value corresponds to a cost of assigning a candidate channel to a first cell in the cellular system, assuming that the candidate channel is already assigned to a second cell in the cellular system and each cost value is based on an average power attenuation for all of the cells in the cellular system that share the same tier as the second cell with respect to the first cell, wherein the average power attenuation is based on the reuse distances between the first cell and the cells in the same tier. In one embodiment, the cost values are used in a cost-function-based dynamic channel assignment (DCA) algorithm that is, but does not have to be, applied to a list of candidate channels generated using a measurement-based DCA algorithm.

Controlling operations in a cellular system using neighbor

In a cellular system, a new cell measures signal strengths of different channels being used by existing cells. The new cell generates a list of candidate channels corresponding to the channels with the greatest signal strength and transmits the list to the mobile switching center (MSC) of the cellular system. The MSC determines which of the candidate channels correspond to beacons in existing cells and transmits configuration information to the new cell for those corresponding existing cells. In this way, the new cell automatically receives configuration information on its neighbor cells. If the MSC determines that the number of candidate channels that are beacons is too small, the MSC will ask the new cell to transmit additional candidate channels (i.e., those having even lower signal strength).

Automatic neighbor identification in a cellular system

In a cellular system, channels are assigned for new calls using a cost-function-based dynamic channel assignment (CFBDCA) algorithm. In one embodiment, the CFBDCA algorithm is implemented in the cellular system's mobile switching center (MSC), which maintains a database containing one or more cost tables and a busy channel table. The entries in the cost tables reflect the costs of using a candidate channel in one particular cell of the cellular system, assuming that the channel is already being used in another particular cell. The entries in the busy channel table identify which channels are currently being used in which cells. The CFBDCA algorithm uses the cost tables and the busy channel table to generate cost of reusing the channel (CORC) values. Depending on the implementation, the CFBDCA algorithm of the present invention may or may not be used in conjunction with a measurement-based DCA (MBDCA) algorithm. If so, then the CFBDCA algorithm may be applied to a list of candidate channels generated using the MBDCA algorithm.

Growing community of inventors

Branchville, NJ, United States of America

Bulin B Zhang