Patents by Inventor Bastien Mainaud

Bastien Mainaud 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).

  • Publication number: 20130195022
    Abstract: Techniques for broadcasting data in a multi-channel network having a control channel and multiple data channels are described. A node wishing to broadcast data may determine a particular data channel from among the multiple data channels, a modulation technique, and a data rate to be utilized to broadcast the data. The broadcasting node may transmit a message over the control channel indicating that the data will be broadcast on the particular data channel using the modulation technique and at the determined data rate. The broadcasting node and a node wishing to receive the data may switch to the particular data channel. The broadcast node may broadcast the data over the particular data channel, while the receiving node may receive the data. After broadcasting the data or a predetermined time period has expired, the broadcasting node and receiving node may switch to the control channel.
    Type: Application
    Filed: February 2, 2012
    Publication date: August 1, 2013
    Applicant: Itron, Inc.
    Inventors: Viet-Hung Nguyen, Jerome Bartier, Fabrice Monier, Bastien Mainaud
  • Publication number: 20130121263
    Abstract: Techniques for communicating via a control channel, determining a particular data channel based on the communicating, and transferring data via the particular data channel are described. One or more messages are communicated via the control channel between first and second nodes. The one or more messages may indicate a particular data channel from multiple data channels that may be utilized to transfer data between the first and second nodes. The one or more messages may also indicate a modulation technique and/or data rate that may be implemented on the particular data channel. The one or more messages may be utilized to determine the particular data channel that will be utilized to transfer the data. The first and second nodes may switch to the particular data channel based on the determination and transfer the data via the particular data channel.
    Type: Application
    Filed: February 6, 2012
    Publication date: May 16, 2013
    Applicant: Itron, Inc.
    Inventors: Viet-Hung Nguyen, Jerome Bartier, Bastien Mainaud, Fabrice Monier, Daniel Popa, Hartman Van Wyk
  • Publication number: 20130121337
    Abstract: A node receives information that is to be transmitted to a destination. Upon receipt of the information, the node may query a busy device list to determine an availability of one or more neighbor nodes. The node may then identify a neighbor node that, according to the busy device list, is available to receive transmissions and is capable of propagating the information to the destination. The node may then transmit the information to the identified neighbor node.
    Type: Application
    Filed: February 1, 2012
    Publication date: May 16, 2013
    Applicant: Itron, Inc.
    Inventors: Viet-Hung Nguyen, Bastien Mainaud, Fabrice Monier, Jerome Bartier
  • Publication number: 20130121178
    Abstract: A node may determine a link quality between the node and multiple neighbor nodes. For each of the multiple neighbor nodes, the node compares the determined link quality between the node and each respective neighbor node to a predetermined threshold quality. If the link quality meets the predetermined threshold quality, the node may qualify the link and add the link to a list of qualified links that meet the threshold link quality. The node may then route communications to neighbor nodes with which the node has a qualified link.
    Type: Application
    Filed: February 2, 2012
    Publication date: May 16, 2013
    Applicant: Itron, Inc.
    Inventors: Bastien Mainaud, Viet-Hung Nguyen
  • Publication number: 20130107999
    Abstract: Techniques for synchronization of clocks in nodes in a network are described. In one example, a node times or measures a synchronization timeout period. During the synchronization timeout period, the node may hear a beacon. In that event, the node may reset its clock using a time indicator found within the beacon. If the node does not hear a beacon before the end of the synchronization timeout period, the node may send a beacon request to one of its parents. In response, the parent node will broadcast a beacon, which may be heard by other nodes in the vicinity of the parent node. Upon receipt of the beacon and an included time indicator, the node will update its clock. Upon clock update, another synchronization timeout period is then started and the cycle is repeated, thereby maintaining synchronization of the clock with clocks of other nodes.
    Type: Application
    Filed: February 2, 2012
    Publication date: May 2, 2013
    Applicant: Itron, Inc.
    Inventors: Bastien Mainaud, Viet-Hung Nguyen, Fabrice Monier, Jerome Bartier
  • Publication number: 20130107724
    Abstract: Techniques for quick advertisement of a failure of a cellular router in a network are described herein. In one example, problems with the cellular router in the network are recognized, such as by the cellular router itself, or by a node in communication with the cellular router. In response, one or more cellular router failure notification packets are sent by the cellular router prior to failure and/or one or more nodes within a cell served by the failing cellular router. The cellular router failure notification packets indicate that the cellular router is failing, thereby starting a discovery process in each node, wherein an attempt is made to discover a new cellular router.
    Type: Application
    Filed: February 2, 2012
    Publication date: May 2, 2013
    Applicant: Itron, Inc
    Inventor: Bastien Mainaud