APPARATUS, METHOD, AND COMPUTER READABLE MEDIUM THEREOF FOR DIVIDING A BEACON INTERVAL

• US 20080123619A1
• Filed: 04/05/2007
• Published: 05/29/2008
• Est. Priority Date: 11/23/2006
• Status: Abandoned Application

• Current Assignee: Institute For Information Industry
• Original Assignee: Institute For Information Industry
• Inventors: Hung, Chih-Hung, Ko, Li-Chun, Fang, Hua-Wei, Chang, Chih Lung
• Application Number:
  US11/697,135
• Publication Number:
  US 20080123619A1
• Time in Patent Office: Days
• US Class Current: 370/345
• CPC Class Codes: H04W 48/08 Access restriction or access information delivery, e.g. discovery data delivery signalling during connection H04W76/00
• CPC Class Codes: H04W 74/006 in the downlink, i.e. towards the terminal

Abstract

An apparatus, a method, and computer readable medium thereof for dividing a beacon interval are provided. The beacon interval is divided into a plurality of sub-beacon intervals in various sizes and each of the sub-beacon intervals is further divided into a predetermined number of time slots. Each of the sub-beacon intervals is similar to the beacon interval, and the difference between them is their time lengths. Therefore, more time slots in various sizes are provided. Consequently, nodes covered by the beacon interval can choose suitable time slots to transmit data to reduce waste of bandwidth. In addition, more time slots that are sub-contention free periods are provided, so transmitting data via time slots that are sub-contention access periods can be prevented. It means that collisions and data transmission can be reduced as well.

Claims

1. An apparatus for dividing a beacon interval, comprising:

a decision module for deciding a first reference value and a second reference value, the first reference value corresponding to a longest length of a sub-beacon interval derived after the division, and the second reference value corresponding to a shortest length of the sub-beacon interval derived after the division;

a generation module for generating a plurality of sub-beacon lengths according to the first reference value and the second reference value; and

a division module for dividing a superframe duration of the beacon interval according to the sub-beacon lengths.

2. The apparatus of claim 1, wherein the generation module comprises:

a decreasing module for deriving a plurality of indexes by continuously decreasing by one from the first reference value minus one until the second reference value is reached;

wherein the generation module generates the sub-beacon lengths according to each of the indexes.

3. The apparatus of claim 1, wherein the division module comprises:

a definition module for defining a plurality of sub-beacon intervals in the beacon interval, a length of each of the sub-beacon intervals being determined based on one of the sub-beacon lengths; and

a placement module;

wherein the generation module further generates a beacon for each of the sub-beacon lengths, and the placement module places the beacon at the beginning of the corresponding sub-beacon interval.

4. The apparatus of claim 3, wherein the generation module comprises a calculation module for generating each of the sub-beacon lengths according to the following equation:

SSD=aBaseSuperframeDuration×

2^x

wherein SSD denotes one of the sub-beacon lengths, aBaseSuperframeDuration denotes a first predetermined value, and x denotes the corresponding index for the one of the sub-beacon lengths.

5. The apparatus of claim 4, wherein each of the sub-beacon intervals comprises a sub-Contention Access Period (CAP) and a sub-Contention Free Period (CFP), a summation of the sub-CAPs is not longer than a CAP of the beacon interval, and a summation of the sub-CFPs is not longer than a CFP of the beacon interval.

6. The apparatus of claim 1, wherein the division module divides the beacon interval in a sequence from long to short according to the sub-beacon lengths.

7. The apparatus of claim 1, further comprising:

a determination module for determining whether a summation of the lengths of the sub-beacon intervals is smaller than a length of the superframe duration; and

a setting module for setting a rest length of the superframe duration as an inactive period if the summation is smaller than the length of the superframe duration.

8. A method for dividing a beacon interval, comprising the steps of:

deciding a first reference value and a second reference value, the first reference value corresponding to a longest length of a sub-beacon interval derived after the division, and the second reference value corresponding to a shortest length of the sub-beacon interval derived after the division;

generating a plurality of sub-beacon lengths according to the first reference value and the second reference value; and

dividing a superframe duration of the beacon interval according to the sub-beacon lengths.

9. The method of claim 8, wherein the generating step comprises the steps of:

deriving a plurality of indexes by continuously decreasing by one from the first reference value minus one until the second reference value is reached; and

generating the sub-beacon lengths according to each of the indexes.

10. The method of claim 8, wherein the dividing step comprises the steps of:

generating a beacon for each of the sub-beacon lengths,

defining a plurality of sub-beacon intervals in the beacon interval, a length of each of the sub-beacon intervals being determined based on one of the sub-beacon lengths; and

placing the beacon at the beginning of the corresponding sub-beacon interval.

11. The method of claim 10, wherein the generating step comprises the step of:

calculating each of the sub-beacon lengths according to the following equation;

SSD=aBaseSuperframeDuration×

2^x

wherein SSD denotes one of the sub-beacon lengths, aBaseSuperframeDuration denotes a first predetermined value, and x denotes the corresponding index for the one of the sub-beacon lengths.

12. The method of claim 11, wherein each of the sub-beacon intervals comprises a CAP and a CFP, a summation of the sub-CAPs is not longer than a CAP of the beacon interval, and a summation of the sub-CFPs is not longer than a CFP of the beacon interval.

13. The method of claim 8, wherein the dividing step divides the beacon interval in a sequence from long to short according to the sub-beacon lengths.

14. The method of claim 8, further comprising the steps of:

determining whether a summation of the lengths of the sub-beacon intervals is smaller than a length of the superframe duration; and

setting a rest length of the superframe duration as an inactive period if the summation is smaller than the length of the superframe duration.

15. A computer readable medium, storing an application program to execute a method for dividing a beacon interval, the method comprising the steps of:

deciding a first reference value and a second reference value, the first reference value corresponding to a longest length of a sub-beacon interval derived after the division, and the second reference value corresponding to a shortest length of the sub-beacon interval derived after the division;

generating a plurality of sub-beacon lengths according to the first reference value and the second reference value; and

dividing a superframe duration of the beacon interval according to the sub-beacon lengths.

16. The computer readable medium of claim 15, wherein the generating step comprises the steps of:

deriving a plurality of indexes by continuously decreasing by one from the first reference value minus one until the second reference value is reached; and

generating the sub-beacon lengths according to each of the indexes.

17. The computer readable medium of claim 15, wherein the dividing step comprises the steps of:

generating a beacon for each of the sub-beacon lengths,

defining a plurality of sub-beacon intervals in the beacon interval, a length of each of the sub-beacon intervals being determined based on one of the sub-beacon lengths; and

placing the beacon at the beginning of the corresponding sub-beacon interval.

18. The computer readable medium of claim 17, wherein the generating step comprises the step of:

calculating each of the sub-beacon lengths according to the following equation;

SSD=aBaseSuperframeDuration×

2^x

wherein SSD denotes one of the sub-beacon lengths, aBaseSuperframeDuration denotes a first predetermined value, and x denotes the corresponding index for the one of the sub-beacon lengths.

19. The computer readable medium of claim 18, wherein each of the sub-beacon intervals comprises a CAP and a CFP, a summation of the sub-CAPs is not longer than a CAP of the beacon interval, and a summation of the sub-CFPs is not longer than a CFP of the beacon interval.

20. The computer readable medium of claim 15, wherein the dividing step divides the beacon interval in a sequence from long to short according to the sub-beacon lengths.

21. The computer readable medium of claim 15, the method further comprising the steps of:

determining whether a summation of the lengths of the sub-beacon intervals is smaller than a length of the superframe duration; and

setting a rest length of the superframe duration as an inactive period if the summation is smaller than the length of the superframe duration.