Patents by Inventor Enzo Mingozzi

Enzo Mingozzi has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9307413
    Abstract: 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).
    Type: Grant
    Filed: April 9, 2012
    Date of Patent: April 5, 2016
    Assignee: FLUIDMESH NETWORKS S.R.L.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
  • Patent number: 8355368
    Abstract: 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?K<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.
    Type: Grant
    Filed: April 9, 2012
    Date of Patent: January 15, 2013
    Assignee: Fluidmesh Networks S.R.L.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
  • Patent number: 8320320
    Abstract: 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.
    Type: Grant
    Filed: December 31, 2008
    Date of Patent: November 27, 2012
    Assignee: Telecom Italia S.p.A.
    Inventors: Marco Caretti, Claudio Cicconetti, Ivano Salvatore Collotta, Paolo Tongiani, Luciano Lenzini, Enzo Mingozzi
  • Publication number: 20120258749
    Abstract: 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).
    Type: Application
    Filed: April 9, 2012
    Publication date: October 11, 2012
    Applicant: FLUIDMESH NETWORKS S.R.L.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
  • Publication number: 20120257572
    Abstract: 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?K<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.
    Type: Application
    Filed: April 9, 2012
    Publication date: October 11, 2012
    Applicant: FLUIDMESH NETWORKS S.R.L.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Luca Bisti, Torquato Bertani, Alessandro Erta, Umberto Malesci
  • Patent number: 8180359
    Abstract: 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.
    Type: Grant
    Filed: February 2, 2007
    Date of Patent: May 15, 2012
    Assignee: Nokia Corporation
    Inventors: Luciano Lenzini, Enzo Mingozzi
  • Publication number: 20110261778
    Abstract: 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.
    Type: Application
    Filed: December 31, 2008
    Publication date: October 27, 2011
    Inventors: Marco Caretti, Claudio Cicconetti, Ivano Salvatore Collotta, Paolo Tongiani, Luciano Lenzini, Enzo Mingozzi
  • Patent number: 8031660
    Abstract: 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.
    Type: Grant
    Filed: July 31, 2003
    Date of Patent: October 4, 2011
    Assignee: Nokia Corporation
    Inventors: Luciano Lenzini, Enzo Mingozzi
  • Patent number: 7801152
    Abstract: 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.
    Type: Grant
    Filed: April 26, 2004
    Date of Patent: September 21, 2010
    Assignee: Telecom Italia S.p.A.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Massimo Sassi, Enrico Scarrone, Giovanni Stea, Vinicio Vercellone
  • Patent number: 7764659
    Abstract: 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.
    Type: Grant
    Filed: June 27, 2002
    Date of Patent: July 27, 2010
    Assignee: Nokia Corporation
    Inventors: Luciano Lenzini, Enzo Mingozzi
  • Patent number: 7626955
    Abstract: 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.
    Type: Grant
    Filed: May 2, 2005
    Date of Patent: December 1, 2009
    Assignee: Nokia Corporation
    Inventors: Luciano Lenzini, Enzo Mingozzi, Andrea Bacioccola, Claudio Cicconetti, Alessandro Erta
  • Patent number: 7349331
    Abstract: Each synchronous flow (h=1, 2, Ns) is associated to a respective synchronous capacity value (Hh) 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, NA) 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.
    Type: Grant
    Filed: October 19, 2001
    Date of Patent: March 25, 2008
    Assignee: Telecom Italia S.p.A.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
  • Patent number: 7336610
    Abstract: Each synchronous flow (i=1, 2 . . . , Ns) is associated to a respective synchronous capacity value (Hi) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, . . . , NA) s is associated to a respective first value indicating the delay to be made up so that the respective queues has the right to be serviced and to another value indicating the instant in which the server visited the respective queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment.
    Type: Grant
    Filed: July 1, 2002
    Date of Patent: February 26, 2008
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
  • Publication number: 20080025301
    Abstract: 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.
    Type: Application
    Filed: April 26, 2004
    Publication date: January 31, 2008
    Applicant: TELECOM ITALIA S.P.A.
    Inventors: Luciano Lenzini, Enzo Mingozzi, Massimo Sassi, Enrico Scarrone, Giovanni Stea, Vinicio Vercellone
  • Publication number: 20070133461
    Abstract: 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.
    Type: Application
    Filed: February 2, 2007
    Publication date: June 14, 2007
    Inventors: Luciano Lenzini, Enzo Mingozzi
  • Publication number: 20060245380
    Abstract: 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.
    Type: Application
    Filed: May 2, 2005
    Publication date: November 2, 2006
    Inventors: Luciano Lenzini, Enzo Mingozzi, Andrea Bacioccola, Claudio Cicconetti, Alessandro Erta
  • Publication number: 20050174971
    Abstract: 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 optimised to meet both QoS and half-duplex requirements.
    Type: Application
    Filed: June 27, 2002
    Publication date: August 11, 2005
    Inventors: Luciano Lenzini, Enzo Mingozzi
  • Publication number: 20050147030
    Abstract: Each synchronous flow (i=1, 2 . . . , Ns) is associated to a respective synchronous capacity value (Hi) that is related the period of time for which a synchronous flow can be serviced before the server moves on. This value can be selected either according to a local allocation criteria or according to a global allocation criteria. Each asynchronous flow (i=1, 2, . . . , NA) s is associated to a respective first value indicating the delay to be made up so that the respective queues has the right to be serviced and to another value indicating the instant in which the server visited the respective queue associated to a synchronous flow (h) is then serviced for a period of time that is related to be aforesaid synchronous capacity value, while each queue associated to an asynchronous flow (i) is serviced only if the server's visit occurs before the expected moment.
    Type: Application
    Filed: July 1, 2002
    Publication date: July 7, 2005
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea
  • Publication number: 20040228296
    Abstract: 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.
    Type: Application
    Filed: July 31, 2003
    Publication date: November 18, 2004
    Inventors: Luciano Lenzini, Enzo Mingozzi
  • Publication number: 20040014470
    Abstract: Each synchronous flow (h=1, 2, Ns) is associated to a respective synchronous capacity value (Hh) 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, NA) 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.
    Type: Application
    Filed: May 9, 2003
    Publication date: January 22, 2004
    Inventors: Luciano Lenzini, Enzo Mingozzi, Enrico Scarrone, Giovanni Stea