Structured adaptive frequency hopping

• US 20020122462A1
• Filed: 11/02/2001
• Published: 09/05/2002
• Est. Priority Date: 01/16/2001
• Status: Active Grant

• Current Assignee: Texas Instruments, Inc.
• Original Assignee: Texas Instruments, Inc.
• Inventors: Batra, Anuj, Anim-Appiah, Kofi Dankwa, Ho, Jin-Meng
• Granted Patent: US 7,236,511 B2
• Time in Patent Office: Days
• US Class Current: 375/132
• CPC Class Codes: H04B 1/715 Interference-related aspects
• CPC Class Codes: H04B 2001/7154 with means for preventing interference
• CPC Class Codes: H04J 13/00 Code division multiplex systems for frequency hopping H04B1/713
• CPC Class Codes: H04L 1/0001 Systems modifying transmission characteristics according to link quality, e.g. power backoff adaptive data allocation for multicarrier modulation H04L5/0044; controlling transmission power for radio systems H04W52/04
• CPC Class Codes: H04W 24/00 Supervisory, monitoring or testing arrangements
• CPC Class Codes: H04W 72/542 using measured or perceived quality

Abstract

The invention generally provides a method of intelligent frequency hopping such as in Bluetooth and Home RF networks. The method (100) includes the acts of sampling a plurality of channels in a frequency band and identifying each channel as a good channels or a bad channel (110), determining the size of a good window and the size of a bad window (120), and assigning a plurality of good channels to a good window (130) and a plurality of bad channels to a bad window (140). Accordingly, the method increases the reliability and throughput of wireless networks.

Claims

1. In a frequency band, a method of intelligent frequency hopping, comprising:

sampling a plurality of channels in the frequency band;

identifying each channel in the plurality of channels as a good channel or a bad channel as a function of a predetermined factor; and

assigning the good channels to a good window and the bad channels to a bad window.

2. The method of claim 1 wherein sampling the plurality of channels samples all channels available to a network.

3. The method of claim 1 wherein the good channel is defined as a channel having at least a predetermined Quality Level of Service.

4. The method of claim 1 wherein the bad channel is defined as a channel having less than a predetermined Quality Level of Service.

5. The method of claim 1 wherein each window has at least four slots to which the channels may be assigned.

6. The method of claim 1 wherein each window has an even number of slots to which the channels may be assigned.

7. The method of claim 1 further comprising determining a ratio of the good channels in the band to the bad channels in the band.

8. The method of claim 7 further comprising assigning a first size to the good window, and a second size to the bad window, such that the ratio of the size of the good window to the size of the bad window is the same as the ratio of the good channels in the band to the bad channels in the band (the ratio).

9. The method of claim 7 further comprising assigning a first size to the good window, and a second size to the bad window, such that the ratio of one plus the size of the good window to the size of the bad window is the same as the ratio of the good channels in the band to the bad channels in the band (the ratio).

10. The method of claim 7 further comprising the act of assigning a first size to a good window, and a second size to a bad window, such that the ratio of the size of the good window to one plus the size of the bad window is the same as the ratio of the good channels in the band to the bad channels in the band (the ratio).

11. The method of claim 1 further comprising sampling at least one channel in an original hopping sequence.

12. The method of claim 11 further comprising generating the good window by assigning the good channels to the good window.

13. The method of claim 11 further comprising generating the bad window by assigning the bad channels to the bad window.

14. The method of claim 12 further comprising detecting the good channel, and assigning the good channel to the good window, when a good window is being generated.

15. The method of claim 13 further comprising the act of detecting the bad channel, and assigning the bad channel to a bad window, when a bad window is being generated.

16. The method of claim 12 further comprising the act of detecting the bad channel, and ignoring the bad channel, when the good window is being generated.

17. The method of claim 13 further comprising the act of detecting the good channel, and ignoring the good channel, when the bad window is being generated.

18. The method of claim 1 wherein all of the channels in the good window are used before any channels in the bad window are used.

19. A method of intelligent frequency hopping, comprising:

sampling channels of a frequency band;

identifying each channel in the frequency band as a good channel or a bad channel;

determining a ratio of the good channels to the bad channels (the ratio);

assigning a first size to a good window, and a second size to a bad window, such that the ratio of the size of the good window to the size of the bad window is the same as the ratio; and

assigning a plurality of the good channels to the good window and a plurality of the bad channels to the bad window.

20. A method of intelligent frequency hopping, comprising:

sampling channels of a frequency band;

identifying each channel in the frequency band as a good channel or a bad channel;

determining a ratio of the good channels to the bad channels (the ratio);

assigning a first size to a good window, and a second size to a bad window, such that the ratio of the size of the good window to the size of the bad window is the same as the ratio;

assigning a plurality of the good channels to the good window and a plurality of the bad channels to the bad window; and

using all of the channels in the good window before using any channels in the bad window.