Future Wei Technologies, Inc.

Apple Inc.

Nortel Networks Corporation

Huawei Technologies Co., Limited

Microsoft Technology Licensing, LLC

Blackberry Corporation

Gamini Senarath

Peiying Zhu

Hang Zhang

David G Steer

Aaron Callard

Wen Tong

Derek Yu

Ho Ting Cheng

Halim Yanikomeroglu

Israfil Bahceci

Mo-Han Fong

Liqing Zhang

Vahid Tarokh

Yoon Chae Cheong

Ho-Ting Cheng

Alex Stephenne

James Mark Naden

Akram Bin Sediq

Zhijun Chao

Ramy Gohary

Mohammadhadi Baligh

Shalini Suresh Periyalwar

Mark Earnshaw

Keyvan Zarifi

Kelvin Kar-Kin Au

Philippe Leroux

Bassam M Hashem

Ngoc-Dung Dao

Guo-Qiang Q Wang

Mark Andrew Hawryluck

Wei Huang

Rainer Schoenen

Eman A Fituri

Yegui Cai

Yaser Fouad

Yoon Chae Choong

Fei Richard Yu

Hoting Cheng

Ting Ho Cheng

There is disclosed a system for maintaining content lists. The system includes nodes interconnected by at least one data network. The nodes are organized hierarchically to comprise a root node and at least two child nodes. The root node stores a list of content items expected to be of interest to a particular user; transmits data reflective of an update for a subset of the list to at least one of the child nodes, the subset selected based on at least a predicted future location of the particular user and a geographic location of that child node; and receives data reflective of an update for the subset of the list from at least one of the child nodes. The at least one of the child nodes stores the subset of the list; determines an update for the subset of the list; and transmits data reflective of the update to the root node.

Systems, devices and methods for distributed content interest prediction and content discovery

Embodiments are provided for assessing radio resource requirements using virtual bin virtualization. An embodiment method includes receiving a service request from a user equipment (UE) in a geographical bin. Resource requirements are then obtained, from a lookup table (LUT), for a serving radio node and neighbor radio nodes associated with the geographic bin of the UE. The LUT comprises a plurality of entries that map combinations of path losses of wireless links for the serving radio node and neighbor radio nodes to corresponding combinations of resource requirements. The entries of the path losses further include one or more service specific and network node parameters for the serving radio nodes and neighbor radio nodes, which are also mapped to the resource requirements. The obtained resource requirements are then assessed, including deciding whether to serve the UE according to the resource requirements and to resource availability.

System and method for using a super bin for radio resource requirement assessment

Various devices and methods are disclosed to support clustering optimization in a communication system. For example, multiple nodes of the communication system can be segmented into multiple clustering plans. Each clustering plan can include multiple clusters that do not overlap with one another within that clustering plan. At least one of the clusters of one clustering plan can overlap at least one of the clusters of at least one other clustering plan. Each node could be a non-boundary node in at least one cluster of at least one clustering plan. Multiple nodes of the communication system can alternatively be segmented into clusters having expanding and contracting borders.

Systems and methods for clustering optimization to help resolve boundary problems in communication systems

Security in wireless communication networks that employ relay stations to facilitate communications between base stations and mobile stations is enhanced. In one embodiment, resource information provided to one or more relay stations from a base station or another relay station is encrypted prior to being delivered to the one or more relay stations. Only authorized relay stations are allocated an appropriate key necessary to decrypt the resource information. As such, only appropriate relay stations are able to access and use the resource information to effect communications directly or indirectly between the base stations and the mobile stations. In certain embodiments, the resource information is delivered between the various base and relay stations using either unicast or multicast delivery techniques.

Wireless access point security for multi-hop networks

In one embodiment, method for controlling multiple wireless access nodes includes receiving, by a central controller from a base station (BS), a message indicating a channel state information (CSI) and determining a state transition function in accordance with the message. The method also includes determining a belief state in accordance with the state transition function and determining cooperation for a plurality of BSs including the BS in accordance with the belief state to produce a cooperation decision. Additionally, the method includes transmitting, by the central controller to the BS, the cooperation decision.

System and method for controlling multiple wireless access nodes

Embodiments are provided for scheduling resources considering data rate-efficiency and fairness trade-off. A value of Jain's fairness index (JFI) is determined for transmitting a service to a plurality of users, and accordingly a sum of throughputs is maximized for transmitting the service to the users. Alternatively, a sum of throughputs is determined first and accordingly the JFI is maximized. Maximizing the sum of throughputs or JFI includes selecting a suitable value for a tuning parameter in an efficiency and fairness trade-off relation model. In accordance with the values of sum of throughputs and JFI, a plurality of resources are allocated for transmitting the service to the users. For static or quasi-static channels, the relation model is a convex function with a monotonic trade-off property. For ergodic time varying channels, the tuning parameter is selected by solving the relation model using a gradient-based approach.

System and methods to achieve optimum efficiency-jain fairness in wireless systems

Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.

System and method for greedy-based autonomous resource block assignment scheme for cellular networks with self-organizing relaying terminals

A method for dynamically determining power and scheduling assignments in a communications network includes selecting, by a controller, a mobile station in each cell to define a mobile station set, determining, by the controller, a power allocation for each of the mobile stations in the mobile station set, calculating, by the controller, a global utility function by evaluating a contribution from each of the mobile stations in the mobile station set in accordance with the power allocation, repeating, by the controller, the selecting, the determining, and the calculating steps a predetermined number of times to generate additional ones of the global utility function, and choosing, by the controller, the mobile station set corresponding to the global utility function having a particular value for a resource block of a frame. The method may also include repeatedly dividing a user set into clusters to obtain a best power allocation.

Method and system for dynamic, joint assignment of power and scheduling of users for wireless systems

A method for pilot sequence design in a communications system includes selecting an initial cell in the communications system, and grouping other cells in the communications system relative to the initial cell into one of a neighbor group and a non-neighbor group in accordance with a neighborness measure of each of the other cells to the initial cell. The method also includes designing pilot sequences that are substantially orthogonal to one another for the initial cell and the other cells in the neighbor group, and providing information about the pilot sequences to the initial cell and the other cells in the communications system.

System and method for pilot sequence design in a communications system

The present invention uses a portion of an orthogonal spreading code space in a CDMA spectrum for uplink from a user element to a base station. By assigning the user elements one or more codes, which are orthogonal to those used to spread data, to use for uplink , the present invention significantly reduces interference between channels, and between the data channels and the channels, while supporting additional capacity. The codes may be individually assigned to user elements or assigned to groups of user elements. Further, different length codes may be assigned to the user elements to support different rates depending on Quality of Service (QoS) requirements.

Orthogonal signaling for CDMA

Methods and systems for facilitating uplink power control (PC) and scheduling in a wireless network are provided. In one example, common interference patterns are obtained from long term channel statistics, and used to perform local PC and scheduling by distributed base stations (eNBs). In some implementations, the common interference patterns are obtained through statistical narrowing techniques that identify common ones out of a plurality of potential interference patterns. The common interference patterns may specify maximum interference thresholds and/or individual eNB-to-eNB interference thresholds which may govern the local PC and scheduling decisions of the distributed eNBs.

Systems and methods for uplink power control and scheduling in a wireless network

Methods and systems for providing joint power control (PC) and scheduling in a wireless network are provided. In one example, a method includes generating a near-optimal power pattern for PC and scheduling in accordance with long term channel statistics. The near-optimal PC solution may be generated by first generating a set of possible power patterns in accordance with likely scheduling scenarios, then statistically narrowing the set of possible power patterns to identify the most commonly used power patterns, and finally selecting one of the most commonly used power patterns as the near-optimal power pattern. In another example, a table of optimal PC solutions are provided for performing distributed PC and scheduling in an adaptive and/or dynamic manner.

Systems and methods for downlink power control and scheduling in a wireless network

A wireless network includes a base station which can serve terminals directly, or via multi-hop transmission paths via relay stations. The base station transmits a downlink sub-frame which includes a first set of frame control information and a second set of frame control information. The second set of frame control information occupies a different position within the downlink sub-frame compared to the first set of frame control information. A relay station is able to transmit a downlink sub-frame to a terminal, or another relay station, while still being able to receive a set of frame control at a different time during the downlink sub-frame. The invention is especially useful in a wireless network in which the downlink transmissions of a base station and a relay station are synchronized to one another and where the downlink transmissions of a base station and relay station occupy the same, or similar, frequency bearer.

Frame structure for a multi-hop wireless system

For each base station, transmit power level variables (I values) for each resource block allocated by the base station are initialized. The I values are used in a model to find sub-gradients for each base station. Neighboring base stations exchange the sub-gradients. For each base station, the base station's sub-gradient and the base station's neighbors' sub-gradients are used in the model to update the I values. Neighboring base stations then exchange the updated I values. For each base station, the base station's updated I value and the base station's neighbors' updated I values are used in the model to update the initial sub-gradients. The updated sub-gradients are then exchanged and used for another update of the I values. After a number of iterations, the I values are used to establish a transmit power level per resource block.

Inter-cell interference coordination for wireless communication systems

A method of operating base station includes determining a first transmit power of a user equipment (UE), which includes determining a serving base station receive power, determining a path loss of the UE to the base station, determining a downlink signal to noise and interference ratio (SNIR) at the UE, and forming the first UE transmit power. Forming the first UE transmit power comprises summing the serving base station receive power, the path loss of the UE to the base station and the downlink SNIR. The method further includes instructing the UE to transmit at the first UE transmit power.

System and method for power control

Growing community of inventors

Nepean, Canada

Gamini Senarath