Legal claims defining the scope of protection. Each claim is shown in both the original legal language and a plain English translation.
1. A method, comprising: receiving a broadcast schedule and storing the broadcast schedule in a memory; determining, using a processor, if a neighbor unicast listening schedule is available for a neighboring device; when the neighbor unicast listening schedule is available, transmitting a data frame to the neighboring device pursuant to the neighbor unicast listening schedule; and when the neighbor unicast listening schedule is not available, transmitting the data frame to the neighboring device pursuant to the broadcast schedule.
A device determines how to send a data frame to a neighboring device. It first receives and stores a general broadcast schedule. Then, it checks if a specific unicast listening schedule is available for that neighbor. If a unicast schedule exists, the device transmits the data frame using that schedule. Otherwise, it sends the data frame using the general broadcast schedule.
2. The method of claim 1 , further comprising: when the neighbor unicast listening schedule is not available, determining if a neighbor unicast listening schedule is available for an alternate neighboring device; when the neighbor unicast listening schedule for the alternate neighbor device is available, transmitting the data frame to the alternate neighbor device; and when the neighbor unicast listening schedule for the alternate neighbor device is not available, transmitting the data frame to the neighboring device pursuant to the broadcast schedule.
Building upon the previous description, if a unicast listening schedule isn't available for the primary neighboring device, the device checks for a unicast schedule for an *alternate* neighboring device. If found, it transmits the data frame to that alternate neighbor using *its* unicast schedule. If no unicast schedule is available for the alternate neighbor either, the device transmits the data frame to the *original* neighboring device using the broadcast schedule.
3. The method of claim 1 , further comprising: determining if the transmission of the data frame pursuant to the neighbor unicast listening schedule was successful; and in response to determining that the transmission was not successful, in-validating the neighbor unicast listening schedule and transmitting the data frame to the neighboring device pursuant to the broadcast schedule.
Extending the first description, after transmitting a data frame to a neighbor using the unicast schedule, the device determines if the transmission was successful. If the transmission fails, the device invalidates (discards) the stored unicast listening schedule for that neighbor. Subsequently, it re-transmits the same data frame to the neighboring device using the broadcast schedule instead.
4. The method of claim 3 , wherein it is determined that the transmission of the data frame is not successful when an acknowledgement data frame is not received from the neighboring device after a predetermined number of transmission attempts.
Elaborating on the previous description, the device determines that a data frame transmission using the neighbor's unicast listening schedule has failed if it doesn't receive an acknowledgement data frame back from the neighboring device within a certain number of retransmission attempts. Only after these attempts are exhausted does the device consider the transmission unsuccessful and revert to using the broadcast schedule as described before.
5. The method of claim 1 , further comprising receiving an acknowledgement data frame from the neighboring device, wherein the acknowledgement data frame comprises the neighbor unicast listening schedule.
In addition to the initial description, the device also receives an acknowledgement data frame from the neighboring device after sending it a data frame. Critically, this acknowledgement data frame *includes* the neighbor's unicast listening schedule, which the transmitting device can use for future communications.
6. The method of claim 5 , wherein the neighbor unicast listening schedule is stored in the memory.
The system receives an acknowledgement that comprises the neighbor's unicast listening schedule (as defined in the previous description). This neighbor unicast listening schedule is then stored in the memory of the transmitting device. This allows the device to quickly access the listening schedule when communicating with this neighbor in the future.
7. The method of claim 6 , wherein a last recently used unicast listening schedule is removed from the memory.
The system stores the neighbor unicast listening schedule in memory (as described in the prior claim). The device actively manages its memory by removing the least recently used unicast listening schedule when space is needed for new schedules. This prevents memory overflow and ensures more frequently used schedules are retained.
8. The method of claim 1 , further comprising determining a local unicast listening schedule and receiving data transmissions from neighboring devices pursuant to the unicast listening schedule and the broadcast schedule.
The device not only transmits data according to broadcast and neighbor-specific unicast schedules, but it also *determines its own* local unicast listening schedule. The device then receives data transmissions from *other* neighboring devices based on both *its* unicast listening schedule and the broadcast schedule. This enables bidirectional communication.
9. An apparatus, comprising: a network interface adapted to communicate over a network; a processor configured to communicate with the network interface; and a memory configured to communicate with the processor, the memory having instructions stored thereon that, in response to execution by the processor, cause the processor to perform operations comprising; receiving a broadcast schedule and storing the broadcast schedule in the memory; determining if a neighbor unicast listening schedule is available for a neighboring device; when the neighbor unicast listening schedule is available, transmitting a data frame to the neighboring device pursuant to the neighbor unicast listening schedule; when when the neighbor unicast listening schedule is not available, transmitting the data frame to the neighboring device pursuant to the broadcast schedule.
An apparatus (device) contains a network interface for communication, a processor, and memory. The memory stores instructions that, when executed by the processor, cause the device to: receive and store a general broadcast schedule; check if a specific unicast listening schedule is available for a neighboring device; transmit a data frame using the unicast schedule if available; otherwise, transmit the data frame using the broadcast schedule.
10. The apparatus of claim 9 , further comprising: when the neighbor unicast listening schedule is not available, determining if a neighbor unicast listening schedule is available for an alternate neighboring device; when the neighbor unicast listening schedule for the alternate neighbor device is available, transmitting the data frame to the alternate neighbor device; and when the neighbor unicast listening schedule for the alternate neighbor device is not available, transmitting the data frame to the neighboring device pursuant to the broadcast schedule.
This apparatus builds upon the previous description. If a unicast listening schedule isn't available for the primary neighboring device, the apparatus checks for a unicast schedule for an *alternate* neighboring device. If found, it transmits the data frame to that alternate neighbor using *its* unicast schedule. If no unicast schedule is available for the alternate neighbor either, the apparatus transmits the data frame to the *original* neighboring device using the broadcast schedule.
11. The apparatus of claim 9 , further comprising: determining if the transmission of the data frame pursuant to the neighbor unicast listening schedule was successful; and in response to determining that the transmission was not successful, in-validating the neighbor unicast listening schedule and transmitting the data frame to the neighboring device pursuant to the broadcast schedule.
The apparatus described earlier, after transmitting a data frame to a neighbor using the unicast schedule, determines if the transmission was successful. If the transmission fails, the apparatus invalidates (discards) the stored unicast listening schedule for that neighbor. Subsequently, it re-transmits the same data frame to the neighboring device using the broadcast schedule instead.
12. The apparatus of claim 11 , wherein it is determined that the transmission of the data frame is not successful when an acknowledgement data frame is not received from the neighboring device after a predetermined number of transmission attempts.
The apparatus determines that a data frame transmission using the neighbor's unicast listening schedule has failed (as described in the previous claim) if it doesn't receive an acknowledgement data frame back from the neighboring device within a certain number of retransmission attempts. Only after these attempts are exhausted does the device consider the transmission unsuccessful and revert to using the broadcast schedule.
13. The apparatus of claim 9 , further comprising receiving an acknowledgement data frame from the neighboring device, wherein the acknowledgement data frame comprises the neighbor unicast listening schedule.
This apparatus (as described before) also receives an acknowledgement data frame from the neighboring device after sending it a data frame. Critically, this acknowledgement data frame *includes* the neighbor's unicast listening schedule, which the apparatus can use for future communications.
14. The apparatus of claim 13 , wherein the neighbor unicast listening schedule is stored in the memory.
The apparatus receives an acknowledgement that comprises the neighbor's unicast listening schedule (as defined in the previous description). This neighbor unicast listening schedule is then stored in the memory of the apparatus. This allows the apparatus to quickly access the listening schedule when communicating with this neighbor in the future.
15. The apparatus of claim 14 , wherein a last recently used unicast listening schedule is removed from the memory.
The apparatus stores the neighbor unicast listening schedule in memory (as described in the prior claim). The apparatus actively manages its memory by removing the least recently used unicast listening schedule when space is needed for new schedules. This prevents memory overflow and ensures more frequently used schedules are retained.
16. The apparatus of claim 9 , further comprising determining a local unicast listening schedule and receiving data transmissions from neighboring devices pursuant to the unicast listening schedule and the broadcast schedule.
The apparatus not only transmits data according to broadcast and neighbor-specific unicast schedules, but it also *determines its own* local unicast listening schedule. The apparatus then receives data transmissions from *other* neighboring devices based on both *its* unicast listening schedule and the broadcast schedule. This enables bidirectional communication.
17. A tangible non-transitory computer-readable storage medium having computer-executable instructions stored thereon that, when executed by a processor, cause the processor to perform operations comprising: determining a local unicast listening schedule and storing the local unicast listening schedule in a memory; receiving a broadcast schedule and storing the broadcast schedule in the memory; receiving a first data frame pursuant to the broadcast schedule and, in response to receipt of the first data frame, transmitting a first acknowledgement message, the acknowledgement message including the local unicast listening schedule; determining if a neighbor unicast listening schedule is available for a neighboring device; when the neighbor unicast listening schedule is available, transmitting a second data frame to the neighboring device pursuant to the neighbor unicast listening schedule; and when the neighbor unicast listening schedule is not available, transmitting the second data frame to the neighboring device pursuant to the broadcast schedule.
A computer-readable medium stores instructions that, when executed, cause a processor to: determine and store a local unicast listening schedule; receive a data frame via the broadcast schedule and send an acknowledgement including its local unicast schedule; check for a neighbor unicast listening schedule; send a data frame to a neighbor using its unicast schedule if available; otherwise, transmit the data frame using the broadcast schedule.
18. The computer-readable medium of claim 17 , further comprising receiving a second acknowledgement data frame from the neighboring device, wherein the second acknowledgement data frame comprises the neighbor unicast listening schedule.
The computer-readable medium, described previously, further dictates that the device receives a second acknowledgement data frame from the neighboring device after sending a data frame. Crucially, this second acknowledgement data frame *includes* the neighbor's unicast listening schedule, which the device can then use for future communications.
19. The computer-readable medium of claim 17 , further comprising: determining if the transmission of the second data frame pursuant to the neighbor unicast listening schedule was successful; and in response to determining that the transmission was not successful, in-validating the neighbor unicast listening schedule and transmitting the second data frame to the neighboring device pursuant to the broadcast schedule.
The computer-readable medium, extending the earlier description, causes the processor to determine if the transmission of the second data frame using the neighbor unicast schedule was successful. If the transmission fails, the stored neighbor unicast schedule is invalidated, and the same data frame is retransmitted to the neighbor using the broadcast schedule.
20. The computer-readable medium of claim 19 , wherein it is determined that the transmission of the data frame is not successful when an acknowledgement data frame is not received from the neighboring device after a predetermined number of transmission attempts.
According to the computer-readable medium, the device determines that a data frame transmission (as defined in the previous description) using the neighbor's unicast listening schedule has failed if it doesn't receive an acknowledgement data frame back from the neighboring device within a defined number of retransmission attempts. Only after these attempts are exhausted is the transmission considered unsuccessful and the broadcast schedule used.
Unknown
December 9, 2014
Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.