• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    DEVICE, METHOD AND SYSTEM TO DISTRIBUTE BROADCAST MESSAGES IN VARIOUS NETWORKS. The present invention relates to methods and systems for sending a broadcast message in frequency hopping systems and other systems. Instead of sending a complete message separately to each device, a relatively small or "chirp" packet is sent. These chirps are either directed to known devices or sent in a way to scan the RF band. The devices that listen to the chirps obtain information about the channel and / or time that the broadcast data will be sent. These devices then perceive the broadcast data as instructed, for example, at the time specified on the specified channel. A system may alternatively, or in addition, use a programmed jump sequence interruption as a diffusion moment. Such a diffusion moment can be programmed to periodically interrupt node jump sequences so that, at such times, many or all nodes are programmed to be on the same channel for potential diffusions.
    公开号:BR112012006928B1
    申请号:R112012006928-4
    申请日:2010-09-27
    公开日:2020-11-10
    发明作者:John Bettendorff；Chris Calvert
    申请人:Landis+Gyr Innovations, Inc；
    IPC主号:
    专利说明:

    RELATED ORDER
    [0001] This document claims the benefit of the Provisional Application for serial number US 61 / 247,110, entitled "Methods and Systems for Broadcasting in a Frequency Hopping Network" and filed on September 30, 2009, the total content of which is incorporated into reference title. FIELD
    [0002] This description refers in general to improved radio communication, including methods and systems used in frequency hopping networks and advanced measurement infrastructure (AMI) systems, among other environments. BACKGROUND
    [0003] Networks based on radio communication are expanded and used for a variety of applications. Such networks are commonly used in AMI systems that measure, collect, and / or analyze public use of electricity, gas, water, and other measures through various means of communication. In these and other networks, some messages can be sent as broadcasts, that is, sent to two or more receivers simultaneously. Broadcast messages can be intended for final receipt by most or all nodes in the network. In an AMI system, for example, broadcast messages can be used to send charging shield, new rate, and other generally applicable information. Regardless of the purpose, broadcasting a message typically involves a transmitter that sends a message and one or more devices that receive the message at approximately the same time.
    [0004] "Broadcasting" a message involves sending a message to two or more potential recipients simultaneously. Unlike broadcasting on a single channel or wire channel radio frequency (“RF”) system in which they can be relatively simple, broadcasting messages across multiple frequency hopping systems can be difficult. Since the receiving devices can be on different channels at any point in time, such devices will not receive the same broadcast message. Since the devices on a frequency hopping network can be on different channels, such sending needs to be repeated by different devices on different frequencies. In many circumstances, the time required to send and resend a confirmed broadcast message is too long to be practical. Additional problems complicate diffusion in frequency hopping systems. Various regulations can further restrict broadcasting options available on frequency hopping networks, for example, preventing uneven channel usage. In addition, it is generally desirable that the addition of any broadcast capabilities that are added to a system have minimal impact on regular transmissions (ie, non-broadcast). SUMMARY OF THE INVENTION
    [0005] Various techniques for sending a broadcast message quickly and effectively on frequency hop networks and other networks are revealed. Rather than sending a complete message separately to each device on the network, a relatively small or "chirp" packet is sent. These chirps are either intended for known devices or are sent in a way to scan the radio frequency band ("RF"). Devices that sense the chirps will typically receive information about the channel and / or time at which the actual broadcast data will be sent. These receiving devices will then accept the broadcast data as instructed, for example, at the specified point in time on the specified channel.
    [0006] An exemplary embodiment uses a device with data storage to store a broadcast message to be distributed to receiving devices. The device also has transmission hardware to distribute the broadcast message to the receiving devices by sending a chirp packet and then the broadcast message. The chirp packet indicates to any receiving devices that receive the chirp packet that the broadcast message will be sent subsequently. For example, the chirp packet can identify a channel on which the broadcast message will be sent, at which time the broadcast message will be sent, and / or provide information that allows the receiving devices to avoid receiving duplicate broadcast messages. . In one embodiment, these devices are part of a frequency hopping network in which the network nodes communicate based on one or more frequency hopping sequences. The device can send the chirp packet on multiple (and possibly all) channels used in the frequency hopping network.
    [0007] Another exemplary modality is a method that involves receiving a broadcast message on a first device for distribution to receiving devices. A chirp packet is then sent to potential receiving devices indicating that a broadcast message will be sent subsequently. The broadcast message is then sent over a channel and time that the recipients of the chirp pack will perceive.
    [0008] Yet another modality involves a mesh network that has a plurality of devices configured to communicate using a frequency hopping sequence. A first device of the plurality of devices is configured to store and send a broadcast message and send a chirp packet that indicates that the broadcast message will be sent subsequently. The first device can be configured to scan a frequency hop sequence with the chirp pack, that is, to send the chirp packet on each channel of the frequency hop sequence. A second device of the plurality of devices is configured to receive the twitter message, and, in response to the twitter message, perceive the broadcast message on a first channel other than a second channel specified by the frequency hopping sequence. The first device may have received the broadcast message in a variety of ways. In one embodiment, the first device receives the broadcast message periodically, perceiving a channel not specified by the frequency hopping sequence of the first device. At least some devices of the plurality of devices can then send chirp packets that indicate to any receiving devices that the broadcast message will be sent subsequently. Additional techniques and combinations of techniques for distributing a broadcast message can also be used.
    [0009] These modalities are mentioned to provide examples and aid to understanding. Additional modalities and advantages are also discussed in the Detailed Description and will be easily perceived by those skilled in the art. As will be perceived, the invention is capable of other and different modalities, and its diverse details are not essential, but, on the contrary, they are capable of modifications in several aspects, all without departing from the invention. In this way, the drawings and the description must be understood as illustrative in nature, and not as restrictive. BRIEF DESCRIPTION OF THE FIGURES
    [0010] The above and other features, aspects and advantages of the present disclosure are best understood when the following Detailed Description is read with reference to the accompanying drawings, in which:
    [0011] Figure 1 is a system diagram that illustrates an exemplary network environment;
    [0012] Figure 2 is a flowchart that shows the communication between nodes of an exemplary network;
    [0013] Figure 3 is an illustration of exemplary differences in jump sequence between two radios;
    [0014] Figure 4 is an illustration of an exemplary chirp pack; and
    [0015] Figure 5 is a flow chart that illustrates an exemplary method of using a chirp packet to indicate that a broadcast message will subsequently be sent. DETAILED DESCRIPTION
    [0016] Figure 1 is a system diagram that illustrates an exemplary network environment. Other modalities may involve alternative networks and systems. The network 10 shown in Figure 1 comprises access points 20, 21 and other devices, referred to in the present invention as nodes 30 to 41. Nodes 30 to 41 work together to create a mesh network in which each node generally comprises a radio that can talk to and respond to neighboring radio devices from neighboring nodes. In the case of an AMI system, each such node may comprise or connect to an endpoint device such as a meter or public tool, or it may itself not understand or connect to an endpoint device. Thus, in general, a node can interact with an endpoint device, act as part of the network, or both, and can do it simultaneously. Each node's radio can have a programmable logic controller (PLC) - as a device. Such a device can allow the radio to function as a small computer, performing appropriate computing and command functions. Thus, intelligence on some or all of the radios can be used to delegate and distribute commands across the entire network 10. The radio can, but does not necessarily need to allow two-way communication.
    [0017] As an example of a public monitoring network, each node of network 10 that understands or connects to an endpoint can collect information on public consumption at that endpoint and send that information over network 10 to a access 20, 21, where these can be collected by a public company, for example, for billing and / or monitoring purposes. As a more specific example, an endpoint device radio can generate a data packet that is transmitted to some destination, such as an access point destination. The packet can be addressed to the destination and inserted into the network. The data packet traverses the network by radio hopping from radio (node to node) in the direction of the addressed destination radio. The route chosen to cross the network may be dynamic and / or may employ routing. In general, network 10 will attempt to minimize the number of hops to increase transmission speed.
    [0018] The radio and / or other components on a network node can be powered by battery, powered by line or powered by any other suitable power source and secured via any suitable connection. The nodes will also generally comprise a time control component such as a crystal oscillator.
    [0019] Figure 2 is a flow chart showing communication between nodes 200, 210. The first node 200 comprises a data storage component 201, a crystal oscillator 202, transmission hardware 203 such as a radio, and a source of 204 power supply such as a battery or AC connection. Similarly, second node 210 also comprises a data storage component 211, a crystal oscillator 212, and a transmitter 213 such as a radio, and a power supply 214 such as a battery or AC connection. The first node 200 can receive messages and send those messages to other nodes, such as the second node 210, using transmission hardware 203, for example, after temporary storage, use, and even modification of such messages in the storage component. data 201. The first node 200 can also generate new messages, such as twitter messages, and send such messages to the second node 210 and / or other neighboring nodes. The second node 210 can also be configured to receive and send messages.
    [0020] Figure 3 is an illustration of exemplary differences in jump sequences between two radios. The radios use a multichannel communication scheme that is supported by precise timing in each radio node. At any given point in time, a radio is passing through its jump sequence. For example, RADIO 1 in Figure 3 has a frequency jump sequence Fi 301, F2 302, F3 303, F4 304, Fs 305, Fe 306, F7 307 and RADIO 2 has a similar frequency sequence Fi 311, F2 312, F3 313, F4 314, Fs 315, Fe 316, F7 317. Each block of the jump sequence represents an increase in contact time or time 310, for example, 700 milliseconds, in which the radio will receive for a given channel or at a given frequency. In some circumstances, the respective jump sequences from different radios can be synchronized.
    [0021] However, radios can jump out of sync with neighboring nodes and can even jump according to independent jump sequences. For example, Figure 3 illustrates that the RADIO 1 skip sequence is slightly out of sync with the RADIO 2 skip sequence. Thus, a frequency skip system can be employed by not keeping all radios in sync as they move through the jump sequence. In addition, a skip sequence for the first radio may be different from a skip sequence for the second radio. Allowing radios to jump independently can provide advantages over using the entire spectrum effectively. A radio can, however, track where each of its neighboring radios is in its own skip sequences.
    [0022] Certain modalities disclosed in the present invention facilitate the sending of broadcast messages in frequency hopping networks, advanced measurement infrastructure (AMI) systems, and other systems. Various techniques can be used to send a broadcast message quickly and effectively in a frequency hopping system. In some embodiments, a relatively small or "chirp" packet is sent to provide channel and / or time information about a broadcast message that will subsequently be sent. These chirps are either intended for known devices or are sent in a way to scan the RF band (that is, to many or all of the frequencies used). Devices that sense the chirps will receive information about the channel and / or time that the actual broadcast data will be sent. These receiving devices will then perceive the broadcast data as instructed, for example, at the specified point in time on the specified channel.
    [0023] A chirp is a small package that contains a minimal amount of information and is considerably less than the subsequent broadcast message it announces. Sending the chirps first instead of the broadcast message can provide several efficiencies. A chirp can be sent to many or all of the different frequencies employed by a frequency hopping system. Such sending can be referred to as sending a "scan", that is, a message that scans most or all of the frequencies that are used. For example, a device can receive a broadcast and send a corresponding chirp on each frequency that is used on the network. In circumstances where the chirp is less than the subsequent broadcast message, sending the chirps first to scan the frequencies and then sending one or a few broadcast messages (that is, on a few frequencies) may be more effective than sending the broadcast message itself. diffusion in more frequencies. Another advantage of targeting the jump sequence is that a device is now targeting all devices that are outside, which can improve scaling.
    [0024] In alternative modalities, chirps can be sent in other ways instead of scanning frequencies. A combination of scan-based and non-scan-based twitter distribution techniques can also be used. Some nodes can send chirps based on scanning and other nodes can send chirps in other ways. For example, some or all of the nodes can simply send chirps to known receiving devices. If the number of known nodes is close to, or exceeds, the number of channels in the jump sequence, then it may be better to direct the jump sequence with chirps instead of individual nodes. In general, chirps are sent in advance to the broadcast messages they advertise and can be sent in a variety of ways.
    [0025] An exemplary modality provides a method of communicating with multiple radio devices to inform those radio devices that a broadcast packet will be sent, so that the radio devices will perceive on a specified channel at a specified time when the packet is broadcast. broadcast is sent. In one embodiment, the chirp is referred to as a fast-touch non-confirmation packet ("no ack" (no acknowledgment)) and is sent to "n" target devices. Such a chirp can identify the channel on which the broadcast packet will be transmitted and / or the time when the transmission will occur. A chirp is preferably, but not necessarily, made as small as possible to facilitate the sending of several chirps in a short period of time. For example, the sender's LAN address may not be important and thus, in some circumstances, is not included.
    [0026] In general, a chirp packet can be as simple as a 1-byte message that identifies itself as a chirp packet. Based on this information, a receiving device can retrieve information about a subsequent broadcast message. For example, the receiving device for interpreting the chirp packet to determine that a broadcast message will occur in the next interval of a pre-configured interval and in a particular channel. Alternatively, the chirp pack can provide several other combinations of information used by receiving devices to facilitate receiving the subsequent broadcast packet. For example, the chirp can expressly identify a particular channel and / or a particular time for the broadcast message. In addition, a tweet can provide information that can be used to determine if the broadcast message has already been received by the tweet recipient.
    [0027] As shown in Figure 4, an exemplary twitter packet 400 comprises a packet identifier 402, a channel identifier 404 which specifies on which channel the subsequent broadcast packet will be transmitted, a time identifier 406 which specifies the time or the time range in which the subsequent broadcast packet will be transmitted, and a CRC 408 of other information (for example, source address, message ID, fragment number, etc.). If the packet identifier is 1 byte, the channel identifier is 1 byte, the time identifier is 1 byte, and the CRC is 2 bytes, and the 5-byte packets are transmitted at 9600 baud, each will take about 20 milliseconds. This estimate counts for the overload to reach the channel, increase the strength of the RF and emit the low-level characters necessary to properly identify the message. The device allocates a fixed amount of time to send the chirps. After sending the chirps, the device sends the actual data packet, that is, the broadcast message, at an appropriate subsequent time. In one example, a device spends up to 500 milliseconds sending the chirp packet, which at 9600 baud allows up to 25 chirps.
    [0028] At 9600 baud, it can take about 225 milliseconds to send a packet of 100 bytes from one radio to another. In one example, in the time it takes to transmit 3 broadcast packets to specific target devices, the same device could send 25 chirps and the actual data packet to multiple devices. You may have increased your probability 8 times or more about simply sending the package directly. The number of devices that could actually perceive the data is limited only by the number of real devices that can perceive the radio's RF signal.
    [0029] In general, among other things, a chirp can include information about the slot or channel in which a subsequent broadcast packet will be sent, the maximum time until the subsequent broadcast packet is sent, the baud rate, for example , in 32 millisecond increments, and a packet ID (for example, as part of a Layer 3 CRC). A skip sequence opening can be used in place of actual channel information. For example, a transmitter and receiver can observe the opening in its jump sequence and map it to a physical channel. The packet ID and / or other information such as LAN, Message ID, and Fragment IDS can be used for dual verification.
    [0030] Following the distribution of chirps, broadcast packets can be sent in accordance with the information provided by the chirp. In one embodiment, a broadcast packet can be sent once as a non-data ack packet as a receiving device may have many opportunities to perceive a broadcast packet. Since the device only needs to receive the broadcast packet once, after the device has perceived the broadcast packet, subsequent chirps can be ignored. A chirp can identify the broadcast packet so that the receiver can identify whether it has already been received. As an example, a package ID field described above can be used to identify whether a package has been perceived before.
    [0031] Using chirps followed by a broadcast message can provide significant improvement with respect to the speed and effectiveness of delivering a broadcast message. As an example, if the window for sending chirps is 480 milliseconds, 20 milliseconds per chirp and 9600 baud, 24 attempts can be made to send the chirp, followed by approximately 160 milliseconds to send the 100-byte broadcast packet as a non-data ack packet. Although the success rate is probably not 100%, a radio could make 3 or 4 passes and stop, and the receiving devices could then pass the message on to its own targets. In a relatively dense network, each radio on the network will likely have many opportunities to receive the broadcast packet. Additional speed and effectiveness can be achieved by increasing the baud rate, for example, to 38400 baud or more.
    [0032] In a dense network, steps can be taken to avoid interference. Receivers may not be able to perceive an actual broadcast packet where there is a high probability that one of the other devices is sending a chirp packet on the same channel. These types of problems can be treated in several ways. For example, the data in the twitter message can be used to select a subset of the number of channels in the skip sequence instead of forcing all receivers to use a single channel. Only those channels that are in that subset will be destined for distribution of the message. In another example, chirp packets can be transmitted on one set of channels and broadcast packets can be transmitted on a different set. The physical channels can be divided into four groups. In one embodiment, two bits of a Layer 3 Message ID field can be used to decide which group of channels to use. This allows the radio to have equal use of channels and can facilitate meeting the Federal Communications Commission ("FCC") and other requirements. The packet can then be transmitted on a channel that is, for example, 2 away from the chirp. For example, if the 2 bits of the Message ID are 01, chirps can go out on physical channels: 904.1, 904.5, 904.9, etc., and data packets can go out on a channel that could be 2 away from this: 904.3, 904.7, 905.1, etc. A transmitter can determine which channel a node is currently on. If you are on a channel that is in the active group, a chirp is sent. If not, it moves to the next node. The transmitter can also choose the channel for transmitting data based on the active group plus technique 2. In general, to meet the requirements for using channels equally over time, something in the changing broadcast package can be used to choose channels.
    [0033] Certain modalities provide various techniques to determine how and to whom the chirps will be sent. For example, if the package is intended for placed radios, then only placed radios will be targeted. As another example, a radio can be assigned to target radios based on node level, for example, only radios with Node Level 0 & 1. As another example, a radio can only address nodes in a node list. active. If there are many nodes, it may be more effective to just send to the various frequencies used in the jump sequence (that is, scan the jump sequence), instead of individual target nodes. So, with all of the examples above, if the number of potential nodes is greater than the number of channels in the jump sequence (or a fixed number as may be appropriate), then chirps can be sent through the jump sequence instead of for individual nodes.
    [0034] After receiving a tweet packet, a radio receiver can keep the tweet packet to check for duplicate messages. This history, in one modality, is maintained based on the chirp packet time for live field, which is the amount of time that a receiving radio will keep a packet before discarding it. In another mode, the message history for twitter is limited to a maximum number of messages.
    [0035] Figure 5 is a flow chart illustrating an exemplary method 500 of using a chirp packet to indicate that a broadcast message will subsequently be sent. Exemplary method 500 involves a first device that delivers a broadcast message to a plurality of receiving devices. For example, the first device and the receiving devices may be a part of a frequency hop network in which the network nodes communicate based on one or more frequency hop sequences and the broadcast message may be a message that it is intended to be received by all nodes in the network.
    [0036] Method 500 comprises receiving a broadcast message on a first device for distribution to the receiving devices, as shown in block 510. The first device may have received the broadcast message in a variety of ways. In one embodiment, the first device receives the broadcast message periodically perceiving in a channel not specified by the frequency hopping sequence of the first device. This type of periodic transmitter diffusion moment distribution technique is described in more detail below.
    [0037] Method 500 further comprises sending a chirp packet that indicates to any receiving devices that receive the chirp pack that a broadcast message will be sent subsequently, as shown in block 520. The chirp pack can identify a channel on which the broadcast message will be sent and a time when the broadcast message will be sent. The chirp pack can also provide information that allows receiving devices to avoid receiving duplicate broadcast messages. For example, you can provide a broadcast message identifier that receivers can use to compare to determine whether a broadcast message has already been received.
    [0038] In the case of a frequency hopping network, the first device sends the chirp packet on each channel used in the frequency hopping network. This type of scan can help to ensure that many potential recipients become aware of the subsequent broadcast message being sent, regardless of where in a frequency hopping sequence those receivers may be.
    [0039] After sending the chirp packet, method 500 further comprises sending the broadcast message, as shown in block 530. In the case of a particular channel and particular time window, the first device will send the broadcast packet on the appropriate channel at the appropriate time. Although some modalities use the various chirping and / or channel scanning techniques described above, other modalities may additionally or alternatively use various techniques of periodic transmission. Periodic Transmitter Diffusion Moment
    [0040] An additional or alternative diffusion technique particularly useful in frequency hop networks involves a periodic transmitter “diffusion moment”, which is a periodically programmed interruption of the use of hop sequences. A broadcast time can be programmed to interrupt the jump sequences so that, at such times, some or all of the nodes are programmed to be on the same channel for potential broadcasts. Such a periodic transmitter provides a way to send a packet to a large audience quickly. For example, once a second, each node can move to a specified channel and broadcast if there is a broadcast to broadcast message. The specified channel can change over time so that the channels are used equally. There is a potential cost for this type of technique, since, for example, receivers can stop a current activity every second to notice. This cost can be treated by less frequent diffusion. Alternatively or additionally, this cost can be treated by configuring the nodes to only send and / or perceive if the node is not busy. So, while using such a broadcast time may not have a high success rate, it can provide a relatively quick mechanism for sending a broadcast to a large group all at once.
    [0041] The interval to perform a periodic transmitter diffusion moment can be determined to suit the circumstances of the particular system in which the technique is used. In a frequency hopping system in general, since each device on the network must stop and perceive in times based on the length of the interval, the shorter the interval, the longer all radios are out of the channel and unavailable for communication normal. In addition, the periodic transmitter may emit excessive RF noise in the system. If the broadcast transmitter transmits a packet in each broadcast cycle, then that noise has to be factored as an extra load on the system.
    [0042] Periodic broadcast transmission may be appropriate in various circumstances. For example, some devices can communicate with thousands of other devices (for example, routers), many of which may be able to perceive, but not transmit back. A system can be configured so that each broadcast packet has a fixed number of chances, for example, five chances, to be broadcast before being discarded. For example, a "mode" packet that has no value during a broadcast, can be used to specify how many attempts a periodic transmitter should make for the packet. Periodically, for example, every 2 hours, the transmitter can issue a maintenance packet in the broadcast queue to be transmitted. This can be used to allow receivers to update their delta tags, among other things. If a radio is in the middle of receiving or transmitting a packet, the device may lose broadcast. For a recipient, this will be insignificant as the recipient may have multiple chances of receiving the message. Similarly, for transmitters, this is not a problem as long as they do not lose several in a row.
    [0043] The diffusion cycle interval can be determined to allow an appropriate amount of diffusion perception time. In an exemplary system, an interval of 5 seconds requires that each radio that is perceiving has to stop once every 7 channels of its jump and perception sequence for 75 milliseconds for each interval. In this example, these amounts up to about 1.5% of your time. However, if awareness is needed at each broadcast time, a radio may have to neglect additional receiving time to ensure that it is not busy when the broadcast time arrives. Thus, to ensure that an interval is not missed, regular activity can be stopped for a greater percentage of the device's time, which may be unacceptable for some purposes. For example, the perception for extended intervals at each moment of diffusion could add up to more than 10% of a regular receiving time of the device being lost. If a radio is not needed for perception at each transmission, however, the radio is occupied for shorter intervals and only used for such messages when the device is not busy with regular activity.
    [0044] A receiving device can start receiving a fixed amount of time, for example, 25 milliseconds, before the expected broadcast time counts for a potential trend. Similarly, the time, for example, another 25 milliseconds, can be added to generate any incoming packet time to start receiving. Once this time has elapsed, the receiver will continue to receive only if a packet continues to be received. Once the receiver becomes idle, the receiver resumes its normal skip sequence.
    [0045] In a periodic broadcast system, transmitters may need to inform other radios when and where the next transmission may occur. Devices that are enabled to transmit may include this information, for example, in their acquisition sync packages and some other key packages. Thus, when a device first starts, if it acquires a periodic transmitter, the device obtains that information immediately.
    [0046] In an exemplary modality, a value of 2 bytes indicates where in the transmitter's jump sequence the next transmission will occur. This value can be in, as an example, 4 millisecond increments. If the receiver is tracking the other delta mark on the radio, this value does not need to be updated, as long as the receiver continues to move it forward with each transmission interval. A value of 2 bytes can be used to indicate the interval between transmissions and can also be in increments of 4 milliseconds. This information is attached at the end of an acquisition synchronization, for example, using Layer 2 indication functionality. The data must be in the acquisition synchronization package. In one example, to make it easy for receivers to give up a radio if they can no longer perceive the packets of the radio, the receivers are activated to leave one broadcast transmitter in favor of another if they have not perceived an acquisition sync in a given amount of time, for example, in the last 24 hours. A receiver can link to the best transmitters, for example, based on the indication of received signal strength ("RSSI").
    [0047] In addition, a periodic transmitter diffusion moment technique can be used with the various twitter and / or channel scan techniques described above. For example, a periodic transmitter broadcast timing technique can be used to deliver a broadcast message to a large percentage (for example, 50%) of potential recipients and then each of these receivers can still deliver that message using the techniques twitter and / or channel scan. In a network, nodes can be configured with multiple broadcast message distribution algorithms. For example, a given node can be configured to send broadcast messages using either a broadcast message technique or a periodic transmitter technique. In a network, such as an AMI system, the routing infrastructure can be configured to use periodic transmitter techniques and meter nodes can be configured to use chirp then diffusion techniques. Various combinations of techniques can be used, including combinations involving different techniques that are described in the present invention. In general, all distribution techniques provide some advantages and disadvantages. Those advantages and disadvantages, as well as considerations regarding how much transmission / message success is needed, can be used to select the appropriate combination of one or more delivery techniques. General
    [0048] The previous description of the modalities of the invention has been presented only for purposes of illustration and description and is not intended to be exhaustive or to limit the invention to the exact forms disclosed. The techniques of the invention are not limited to AMI systems, meshed networks, or any other particular network configuration. Thus, in general, numerous modifications and adaptations are noticeable to those skilled in the art without departing from the spirit and scope of the invention.
    权利要求:
    Claims (12)
    [0001]
    1. Method comprising: i) receiving (510) a broadcast message on a first device (200) for distribution to the second devices (210), wherein the first device and the second device of a plurality of devices are part of a network of frequency hop loop (10) in which the nodes (30-41) of the network communicate based on one or more frequency hop sequences; and, ii) send (530) the broadcast message; characterized by the step of: iii) sending (520) a chirp packet, in which the chirp packet indicates to any second devices (210) that receive the chirp packet that a broadcast message will subsequently be sent, in which the first device ( 200) sends the chirp packet on multiple channels used in the frequency hop mesh network (10).
    [0002]
    2. Method, according to claim 1, characterized by the fact that the chirp packet identifies a channel in which the broadcast message will be sent and a time in which the broadcast message will be sent.
    [0003]
    3. Method, according to claim 1 or claim 2, characterized by the fact that the chirp packet that identifies the channel on which the broadcast message will be sent comprises identifying a channel of a frequency hopping sequence used by the first device ( 200) and the second device (210).
    [0004]
    4. Method according to any one of claims 1 to 3, characterized by the fact that the chirp packet identifies a maximum period of time within which the broadcast message will be sent.
    [0005]
    5. Method according to any one of claims 1 to 4, characterized by the fact that the chirp packet provides information that allows a second device (210) to avoid receiving duplicate broadcast messages.
    [0006]
    6. Method according to any one of claims 1 to 5, characterized by the fact that the first device (200) sends the chirp packet on each channel used in the frequency hop mesh network (10).
    [0007]
    7. First device, characterized by the fact that it comprises: i) data storage (201) to store a broadcast message to be distributed to the second device, in which the first device and a second device are part of a hop mesh network frequency (10) in which the network nodes communicate based on one or more frequency hop sequences; and, ii) transmission hardware (203) to distribute the broadcast message to a second device by sending a chirp packet and the broadcast message, in which the chirp packet is organized and arranged to enable the compliant method defined in any claims 1 through 6 to take effect.
    [0008]
    8. Device according to claim 7, characterized by the fact that the first device (200) and the second device (210) are part of a data collection system to collect data related to consumption of goods.
    [0009]
    9. System, characterized by the fact that it comprises: i) a network of frequency hopping mesh (10) that comprises a plurality of devices configured to communicate with the use of one or more frequency hop sequences; ii) a first device (200) of the plurality of devices as defined in claim 7 or claim 8; and, iii) a second device (210) of the plurality of devices configured to receive the tweet message, and, in response to the tweet message, perceive the broadcast message on a first channel other than a second channel specified by its sequence of frequency jump.
    [0010]
    10. System according to claim 9, characterized by the fact that the first device (200) sends the chirp packet to the targeted devices of which the first device is aware.
    [0011]
    11. System, according to either of claims 9 or 10, characterized by the fact that: i) the first device (200) is configured to store and send a broadcast message in a time and in a first channel that is periodically programmed; and, ii) a second device (210) is configured to receive the time-diffusion message on the channel that is periodically programmed.
    [0012]
    12. System according to claim 11, characterized by the fact that the frequency hopping sequence of the first device (200) is equal to or different from the frequency hopping sequence of a second device (210).
    类似技术:
    公开号 | 公开日 | 专利标题
    BR112012006928B1|2020-11-10|method, device and system for distributing broadcast messages across multiple networks
    Musaloiu-E et al.2008|Koala: Ultra-low power data retrieval in wireless sensor networks
    JP2017521946A|2017-08-03|Traffic announcement and scheduling in neighbor aware network data links
    KR101891483B1|2018-08-24|Traffic advertisement and scheduling in a neighbor aware network data link
    ES2368385T3|2011-11-16|SIGNAL TRANSMISSION SCHEME FOR EFFECTIVE MANAGEMENT OF THE COMMON IMPROVED DEDICATED CHANNEL.
    JP2017522809A|2017-08-10|Traffic announcement and scheduling in neighbor aware network data links
    CN107852661B|2021-09-07|Network manager and mesh network system
    CN103119887B|2017-04-19|Device and method for scheduling data packet transmissions in wireless networks
    US20160073288A1|2016-03-10|Reducing contention in a peer-to-peer data link network
    JP2017521947A|2017-08-03|Traffic announcement and scheduling in neighbor aware network data links
    Cugola et al.2009|A context and content-based routing protocol for mobile sensor networks
    JP5902356B2|2016-04-13|Reuse of idle paging slots for frames in machine-to-machine | wireless wide area networks |
    CA2619382A1|2007-03-08|Media access control architecture
    US20140126548A1|2014-05-08|Dynamic paging channel selection in a machine-to-machine wireless wide area network
    US20110317692A1|2011-12-29|Acknowledgement of communications using shared messages
    US9008049B2|2015-04-14|Forward link frame generation in a machine-to-machine | wireless wide area network |
    US10785700B2|2020-09-22|Apparatus and method for transmitting beacon messages in a mesh network
    Alam et al.2013|SYREN: Synergistic link correlation-aware and network coding-based dissemination in wireless sensor networks
    US20140146795A1|2014-05-29|Flexible paging scheme in a machine-to-machine wireless wide area network
    US20130163425A1|2013-06-27|System and method for managing beacon traffic within a network system
    Roth et al.2011|MOBINET: Mobility management across different wireless sensor networks
    Chandanala et al.2010|Network coding in duty-cycled sensor networks
    Yu et al.2014|Cirf: Constructive interference-based reliable flooding in asynchronous duty-cycle wireless sensor networks
    US10743343B2|2020-08-11|Network node and methods in a mesh network
    US7310530B2|2007-12-18|Data transmission to a first node from a second node to another second node
    同族专利:
    公开号 | 公开日
    EP2483637B1|2014-07-23|
    US20130343430A1|2013-12-26|
    BR112012006928A2|2016-06-14|
    PH12014500401A1|2014-08-18|
    EP2483637A1|2012-08-08|
    AU2010300848B2|2015-04-02|
    US8711900B2|2014-04-29|
    NZ598859A|2014-02-28|
    CA2774677C|2017-06-13|
    CA2774677A1|2011-04-07|
    WO2011041254A1|2011-04-07|
    PH12014500401B1|2014-08-18|
    AU2010300848A1|2012-04-12|
    MX2012003506A|2012-05-08|
    US8548025B2|2013-10-01|
    US20110075704A1|2011-03-31|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    US7920897B2|2002-03-14|2011-04-05|Intel Corporation|Interference suppression in computer radio modems|
    US20050191958A1|2004-02-27|2005-09-01|Hoskins Rodney W.|Multi-level priority communications and broadcast scanning receiver|
    US7103693B2|2004-09-30|2006-09-05|International Business Machines Corporation|Method for applying interrupt coalescing to incoming messages based on message length|
    US7643852B2|2006-01-17|2010-01-05|Noll John R|Method to calibrate RF paths of an FHOP adaptive base station|
    US7427927B2|2006-02-16|2008-09-23|Elster Electricity, Llc|In-home display communicates with a fixed network meter reading system|
    US20090146839A1|2006-05-17|2009-06-11|Tanla Solutions Limited|Automated meter reading system and method thereof|
    US7965758B2|2006-09-15|2011-06-21|Itron, Inc.|Cell isolation through quasi-orthogonal sequences in a frequency hopping network|
    US8687563B2|2007-01-09|2014-04-01|Stmicroelectronics, Inc.|Simultaneous sensing and data transmission|
    AT447833T|2007-04-27|2009-11-15|Research In Motion Ltd|DEVICE AND METHOD FOR HANDLING BROADCASTING INFORMATION ON USER DEVICES OF A TELECOMMUNICATIONS SYSTEM|
    JP5076967B2|2008-02-27|2012-11-21|富士通株式会社|Information processing system, information processing system control method, and information processing system control program|
    US8279778B2|2009-06-24|2012-10-02|Elster Electricity, Llc|Simultaneous communications within controlled mesh network|
    US8548025B2|2009-09-30|2013-10-01|Landis+Gyr Innovations, Inc.|Methods and systems for distributing broadcast messages on various networks|US9819747B2|2008-11-24|2017-11-14|MeshDynamics|Chirp networks|
    US10785316B2|2008-11-24|2020-09-22|MeshDynamics|Evolutionary wireless networks|
    US8548025B2|2009-09-30|2013-10-01|Landis+Gyr Innovations, Inc.|Methods and systems for distributing broadcast messages on various networks|
    GB2490140B|2011-04-19|2018-01-31|Qualcomm Technologies Int Ltd|Chirp communications|
    US8879604B2|2011-07-06|2014-11-04|Cisco Technology, Inc.|Efficient rendezvous for distributed messages in frequency-hopping communication networks|
    US9020008B2|2011-07-12|2015-04-28|Cisco Technology, Inc.|Overlaying independent unicast frequency hopping schedules with a common broadcast schedule|
    US8908621B2|2011-07-22|2014-12-09|Cisco Technology, Inc.|Dynamic common broadcast schedule parameters for overlaying an independent unicast schedule|
    US9001676B2|2011-07-28|2015-04-07|Cisco Technology, Inc.|Collecting power outage notifications in a frequency hopping communication network|
    US9001698B2|2011-09-09|2015-04-07|Landis+Gyr Innovations, Inc.|Systems and methods for optimizing the distribution of point-to-point and broadcast messages in a layered mesh network|
    US8908626B2|2012-04-20|2014-12-09|Cisco Technology, Inc.|On-demand pair-wise frequency-hopping synchronization|
    US9236904B2|2012-11-05|2016-01-12|Cisco Technology, Inc.|Fast frequency-hopping schedule recovery|
    US9246845B2|2013-06-19|2016-01-26|Cisco Technology, Inc.|Overlaying receive schedules for energy-constrained devices in channel-hopping networks|
    US10652844B1|2014-01-07|2020-05-12|Marvell Asia Pte. Ltd.|Paging auto-acknowledgement|
    US9823996B2|2015-03-12|2017-11-21|Landis+Gyr Innovations, Inc.|Debugging code for controlling intelligent devices using log data from executed object code|
    US9798649B1|2016-05-04|2017-10-24|Landis+Gyr Innovations, Inc.|Debugging code controlling resource-constrained intelligent devices contemporaneously with executing object code|
    CN106100694B|2016-06-28|2018-05-15|广东电网有限责任公司东莞供电局|Electric power pylon group-net communication method and system|
    US10841808B2|2017-10-16|2020-11-17|Apple Inc.|Apparatus and medium for enabling multi-carrier operation|
    CN112566232A|2020-11-08|2021-03-26|临沂中科睿鹤智慧科技有限公司|Method and system for synchronizing data among multiple terminals of wireless Internet of things|
    法律状态:
    2016-12-27| B25D| Requested change of name of applicant approved|Owner name: LANDIS+GYR INNOVATIONS, INC. (US) |
    2019-01-08| B06F| Objections, documents and/or translations needed after an examination request according [chapter 6.6 patent gazette]|
    2019-07-16| B06T| Formal requirements before examination [chapter 6.20 patent gazette]|
    2019-11-26| B15K| Others concerning applications: alteration of classification|Free format text: AS CLASSIFICACOES ANTERIORES ERAM: G01D 4/00 , H04W 4/06 , H04B 1/713 Ipc: H04B 1/713 (1995.01), H04W 72/00 (2009.01), H04W 7 |
    2020-01-21| B06U| Preliminary requirement: requests with searches performed by other patent offices: procedure suspended [chapter 6.21 patent gazette]|
    2020-02-18| B06I| Publication of requirement cancelled [chapter 6.9 patent gazette]|Free format text: ANULADA A PUBLICACAO CODIGO 6.21 NA RPI NO 2559 DE 21/01/2020 POR TER SIDO INDEVIDA. |
    2020-06-09| B09A| Decision: intention to grant [chapter 9.1 patent gazette]|
    2020-11-10| B16A| Patent or certificate of addition of invention granted|Free format text: PRAZO DE VALIDADE: 10 (DEZ) ANOS CONTADOS A PARTIR DE 10/11/2020, OBSERVADAS AS CONDICOES LEGAIS. |
    优先权:
    申请号 | 申请日 | 专利标题
    US24711009P| true| 2009-09-30|2009-09-30|
    US61/247,110|2009-09-30|
    PCT/US2010/050355|WO2011041254A1|2009-09-30|2010-09-27|Methods and systems for distributing broadcast messages on various networks|
    [返回顶部]