ON-DEMAND PAIR-WISE FREQUENCY-HOPPING SYNCHRONIZATION

• US 20130279540A1
• Filed: 08/03/2012
• Published: 10/24/2013
• Est. Priority Date: 04/20/2012
• Status: Active Grant

• Current Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Original Assignee: Cisco Technology, Inc. (Cisco Systems, Inc.)
• Inventors: Hui, Jonathan W., Hong, Wei, Vasseur, Jean-Philippe
• Granted Patent: US 8,908,626 B2
• Time in Patent Office: Days
• US Class Current: 375/133
• CPC Class Codes: H04L 1/1607 Details of the supervisory signal
• CPC Class Codes: H04L 2001/0093 Point-to-multipoint
• CPC Class Codes: H04W 72/12 Wireless traffic scheduling
• CPC Class Codes: H04W 72/1263 Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
• CPC Class Codes: H04W 72/20 Control channels or signalling for resource management
• CPC Class Codes: H04W 72/23 in the downlink direction of a wireless link, i.e. towards a terminal
• CPC Class Codes: H04W 72/30 Resource management for broadcast services
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

In one embodiment, a device receives and stores a broadcast schedule, and may determine whether a neighbor unicast listening schedule is available for a neighboring device. If so, the device may transmit a data frame to the neighboring device pursuant to the neighbor unicast listening schedule. If a neighbor unicast listening schedule is not available, the device may transmit the data frame to the neighboring device pursuant to a broadcast schedule. Once the data frame is received by the neighboring device, pursuant to the neighbor unicast listening schedule or the broadcast schedule, an acknowledgement may be received from the neighboring device, which may include an updated neighbor unicast listening schedule for that neighboring device.

Claims

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.

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.

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.

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.

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.

6. The method of claim 5, wherein the neighbor unicast listening schedule is stored in the memory.

7. The method of claim 6, wherein a last recently used unicast listening schedule is removed from the memory.

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.

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.

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.

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.

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.

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.

14. The apparatus of claim 13, wherein the neighbor unicast listening schedule is stored in the memory.

15. The apparatus of claim 14, wherein a last recently used unicast listening schedule is removed from the memory.

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.

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.

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.

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.

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.