Nokia Corporation

Telecom Italia

Fluidmesh Networks S.r.l.

Nokia Technologies Oy

Luciano Lenzini

Enzo Mingozzi

Alessandro Erta

Luca Bisti

Giovanni Stea

Umberto Malesci

Torquato Bertani

Claudio Cicconetti

Enrico Scarrone

Marco Caretti

Ivano Salvatore Collotta

Vinicio Vercellone

Andrea Bacioccola

Massimo Sassi

Paolo Tongiani

In a wireless or hybrid mesh communication system, radio frequencies are managed by assigning an in-use frequency channel to each local family of nodes, distributing spare frequency channel(s) among the local families of nodes, and changing the in-use frequency channel of at least one selected local family of nodes to a new frequency channel selected among its spare frequency channel(s), if any, or among the spare frequency channel(s) of another local family of nodes if said at least one selected local family of nodes has no spare frequency channel(s), and/or as the in-use frequency channel of another local family of nodes if none of said local families of nodes has spare frequency channel(s).

Management of radio frequencies in a wireless or hybrid mesh network

Method of detour path determination for data packets re-routing in a mesh network comprising a plurality of N nodes, arranged according to a network topology, each node has a K-hops neighborhood knowledge of the network topology, with 1&#x2266;K&#x3c;N, primary paths are predefined for routing data packets within the mesh network. Detour paths are automatically discovered and set up while expending relatively few resources in terms of processing complexity, signaling and information spreading. The method is particularly advantageous when used in a wireless mesh network wherein the available bandwidth and the node resources and capabilities are much more limited than in wired networks.

Method and system for automatic selection of detour paths in a wireless mesh network

A method of scheduling transmissions in a multi-carrier transmission system, includes, for each downlink transmission frame: partitioning the downlink transmission frame into a plurality of data regions each including an equal number of slots, each data region corresponding to a respective logical band; for a currently active connection: a) creating a first set of logical bands not fully occupied for transmission and having a minimum boosting level making the transmission receivable by a receiving terminal; b) extracting from the first set, a second set of logical bands available for allocating a maximum number of slots for downlink transmission to the active connection; and c) selecting the logical band for downlink transmission to the active connection from the second set as the logical band that, after allocating the slots to the considered connection, leaves a residual number of slots equal to or smaller than a predetermined minimum residual in the logical band, e.g., the smallest residual number of slots.

Method and system for downlink transmission scheduling in multi-carrier networks

A data transmission method in a communication system including transmitting at least one capacity request message from a subscriber station, granting capacity subscriber station-specific by a base station, transmitting at least one capacity grant message from the base station, allocating granted capacity connection-specific by the subscriber station, transmitting from the subscriber station at least one message, which includes information on previous capacity requests, transmitting data from the subscriber station according to capacity allocation, monitoring by the base station request messages, capacity grant messages and received transmissions.

Data transmission method, system, base station and subscriber station, a data processing unit, computer program product, computer program distribution medium and baseband module

Data transmission method, system, base station, subscriber station, data processing unit, computer program product, computer program distribution medium and baseband module

A system for scheduling utilization of a service resource by a plurality of flows of information packets, wherein the flows include rate-guaranteed synchronous flows and best-effort asynchronous flows, the asynchronous flows exploiting the service capacity of the resource left unexploited by the synchronous flows. A server visits the flows, in subsequent rounds, by visiting first the synchronous flows followed by the asynchronous flows. The server is configured for detecting any backlogged synchronous flow, and when the server visits any said backlogged synchronous flow, it allows the backlogged synchronous flow to utilize the resource for a given time, whereby the synchronous flows have a guaranteed transmission window on each round. When the server visits any asynchronous flow, the time elapsed since the last visit by the server to the same asynchronous flow is determined. If the visit to the asynchronous flow occurs later than expected based on a reference round time, the asynchronous flow being visited is restrained from utilizing the resource for the ongoing round, and if the visit occurs earlier than expected based on the reference round time the asynchronous flow being visited is allowed to utilize the resource for a respective given time.

Method and system for scheduling utilization of resources, related communication network and computer program product

The present invention relates to a method and apparatus for scheduling data for transmission via at least two half-duplex time division multiple access connections, wherein for each connection respective capacities of data portions to a transmission frame are allocated so that the total capacity of all data portions of the transmission frame does not exceed a predetermined capacity for each transmission direction, and that the sum of capacities of data portions of each connection of the transmission frame in both transmission directions does not exceed the predetermined capacity. Then, the transmission timing of the data portions within the transmission frame is set in such a manner that transmission and reception intervals of each connection do not overlap. Accordingly, scheduling can be optimized to meet both QoS and half-duplex requirements.

Scheduling method and apparatus for half-duplex transmission

A system and method for scheduling uplink and downlink burst data transmissions for half-duplex terminals in a communication system. After the first half duplex terminal capacity allocation is scheduled for a plurality of half duplex terminals, all available second half duplex terminals are placed in the same relative order as that of the half duplex terminal first capacity allocation. An iterative process is used in order to determine a final second frame layout. Once a set of potential solutions are determined, one solution is selected, and a final second frame structure is determined.

System and method for providing a fast and optimized uplink and downlink scheduling algorithm for use in FDD communication systems with half-duplex stations

Each synchronous flow (h=1, 2, N) is associated to a respective synchronous capacity value (H) indicative of the maximum amount of time for which a synchronous flow can be served before relinquishing the token. Each asynchronous flow (I=1, 2, N) is, on the other hand, associated to a respective indicative value of the delay to be recovered so that the respective queue has the right to be served and to another value indicating the instant in which the server visited the respective queue in the pervious cycle. Each queue associated to a synchronous flow (h) is therefore served for a maximum amount of time that is equal to the aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is only served if the server's visit takes place with anticipation with respect to the expected instant. This anticipation is determined as the difference between the expected rotation time, needed by the server () to complete a visit cycle (T) of the queues associated to the aforesaid flows (h, i), and the time that has passed since the server's previous visit () and the delay accumulated. This difference, if positive, defines the maximum service time for the asynchronous queue. If the queue is empty when the server visits it, the server () moves on to the next queue even before the relative maximum service time has passed.

Growing community of inventors

Leghorn, Italy

Luciano Lenzini