Nokia Corporation

Nokia Technologies Oy

Nokia Solutions and Networks Oy

Jens Steiner

Klaus Ingemann Pedersen

Jeroen Wigard

Daniela Laselva

Troels Emil Kolding

Mads Lauridsen

Rafhael Amorim

Nuno Pratas

Kim Nielsen

Beatriz Soret

István Kovács

In accordance with an example embodiment of the present invention, a method comprising: receiving from a network node, by a user equipment of a plurality of user equipment associated with more than one communication beam of a communication network, information comprising locations in time of the user equipment during paging occasions with at least one cell of the communication network associated over more than one communication beam, wherein the information identifies any provided order of the more than one communication beam covering the locations in time of the user equipment during the paging occasions; and based on the information, identifying by the user equipment at least one communication beam and timing of at least one paging occasion, of the paging occasions, for the user equipment.

Paging on narrow beam and alignment with default DRX

The disclosure relate to interference coordination in wireless communications. A first level station can obtain information for interference coordination with a second level station to protect the second level station from interference in arrangement where the second level station provides a smaller coverage area than the first level station and is at least partially located in the area of the first level station. Use of directional antenna beams by the first level station and/or communications by the second level station can then be controlled accordingly.

Interference coordination by means of directional antenna beams in a wireless system

Apparatus, methods and computer program products provide fast instantaneous overload control during scheduling operations involving users in a wireless communications network who are candidates to be scheduled in a next transmission time interval. Apparatus detect congestion conditions in a wireless communications network by determining an instantaneous operating region of a scheduler (e.g., a medium access control-high speed scheduler) based on required activity detection and prioritize users in a scheduling candidate set based on the cost of a user. In a variant, this may be implemented by combining part of the required activity detection algorithm with a per-bearer cost function. In one implementation, this will limit the number of users that suffer during momentary congestion in the wireless communications network.

Fast bearer prioritization in a scheduler using activity detection

Growing community of inventors

Klarup, Denmark

Jens Steiner