APPARATUS FOR A BEACON-ENABLED WIRELESS NETWORK, TRANSMISSION TIME DETERMINATION METHOD, AND TANGIBLE MACHINE-READABLE MEDIUM THEREOF

• US 20090059886A1
• Filed: 12/19/2007
• Published: 03/05/2009
• Est. Priority Date: 08/31/2007
• Status: Active Grant

• Current Assignee: Institute For Information Industry
• Original Assignee: Institute For Information Industry
• Inventors: Fang, Hua-Wei, Teng, Chi-Wen, Yeh, Lun-Wu, Pan, Meng-Shiuan, Ko, Li-Chun, Tseng, Yu-Chee
• Granted Patent: US 8,149,803 B2
• Time in Patent Office: Days
• US Class Current: 370/345
• CPC Class Codes: H04W 74/002 Transmission of channel access control information
• CPC Class Codes: H04W 74/04 Scheduled access hybrid access H04W74/02
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

An apparatus for a beacon-enabled wireless network, a transmission time determination method, and a tangible machine-readable medium thereof are provided. The apparatus is located within the coverage area of the first equipment. The second equipment is located within the coverage area of the apparatus. The apparatus comprises a receive/transmission module and a decision module. The receive/transmission module is configured to receive the beacon of the first equipment. The decision module is configured to decide information of an upload time slot and a download time slot of the apparatus according to the beacon so that the receive/transmission module can perform data transmission with the first equipment by the upload time slot and perform data transmission with the second equipment by the download time slot. According to the aforementioned allocations, transmission collisions can be avoided and delay of transmission times is decreased.

Claims

1. An apparatus for use in a beacon-enabled wireless network, the apparatus being located within a coverage area of a first equipment, a second equipment being located within a coverage area of the apparatus, the apparatus comprising:

a receive/transmission module being configured to receive a beacon of the first equipment; and

a decision module being configured to decide an information of an upload time slot and an information of a download time slot of the apparatus according to the beacon, so that the receive/transmission module can perform data transmission with the first equipment in the upload time slot and perform data transmission with the second equipment by the download time slot.

2. The apparatus of claim 1, further comprising:

a storage module being configured to store the information of the upload time slot and the information of the download time slot.

3. The apparatus of claim 1, wherein the beacon comprises a time slot parameter for defining a plurality of time slots in a superframe of the beacon-enabled wireless network, and the upload time slot and the download time slot are two different ones of the time slots.

4. The apparatus of claim 3, wherein the time slots have a sequence order, the first equipment occupies one of the time slots as a parent time slot, and the decision module decides the upload time slot to be the time slot that is unoccupied and that is nearest to and ahead of the parent time slot according to the sequence order.

5. The apparatus of claim 4, wherein the information of the upload time slot is an ordering number of the upload time slot, and the decision module decides the ordering number of the upload time slot according to following equation:

min{(p−

m)mod k≠

u},

wherein p represents an ordering number of the parent time slot according to the sequence order, u represents an ordering number of each of the occupied time slots according to the sequence order, k represents a total number of the time slots in the superframe, mod represents the remainder of (p−

m) being divided by k, m represents the ordering number of the upload time slot according to the sequence order, and min{•

} represents finding an integer m that minimizes a value of the equation.

6. The apparatus of claim 3, wherein the time slots have a sequence order, the first equipment occupies one of the time slots as a parent time slot, and the decision module decides the download time slot to be the time slot that is unoccupied and that is nearest to and behind the parent time slot according to the sequence order.

7. The apparatus of claim 6, wherein the information of the download time slot is an ordering number of the download time slot, the decision module decides the ordering number of the download time slot according to following equation:

min{(n−

p)mod k≠

u},

wherein p represents an ordering number of the parent time slot according to the sequence order, u represents an ordering number of each of the occupied time slots according to the sequence order, k represents a total number of the time slots in the superframe, mod represents the remainder of (n−

p) being divided by k, n represents the ordering number of the download time slot according to the sequence order, and min{•

} represents finding an integer n that minimizes a value of the equation.

8. A transmission time determination method for use in an apparatus of a beacon-enabled wireless network, the apparatus being located within a coverage area of a first equipment, a second equipment being located within a coverage area of the apparatus, the transmission time determination method comprising the following steps of:

receiving a beacon of the first equipment;

deciding an information of an upload time slot of the apparatus according to the beacon, so that the apparatus can perform data transmission with the first equipment in the upload time slot; and

deciding an information of a download time slot of the apparatus according to the beacon, so that the apparatus can perform data transmission with the second equipment in the download time slot.

9. The transmission time determination method of claim 8, further comprising the following step of:

storing the information of the upload time slot; and

storing the information of the download time slot.

10. The transmission time determination method of claim 8, wherein the beacon comprises a time slot parameter for defining a plurality of time slots in a superframe of the beacon-enabled wireless network, and the upload time slot and the download time slot are two different ones of the time slots.

11. The transmission time determination method of claim 10, wherein the time slots have a sequence order, the first equipment occupies one of the time slots as a parent time slot, and the step of deciding the information of the upload time slot decides the upload time slot to be the time slot that is unoccupied and that is nearest to and ahead of the parent time slot according to the sequence order.

12. The transmission time determination method of claim 11, wherein the information of the upload time slot is an ordering number of the upload time slot, and the step of deciding the upload time slot decides the ordering number of the upload time slot according to following equation:

min{(p−

m)mod k≠

u},

wherein p represents an ordering number of the parent time slot according to the sequence order, u represents an ordering number of each of the occupied time slots according to the sequence order, k represents a total number of the time slots in the superframe, mod represents the remainder of (p−

m) being divided by k, m represents the ordering number of the upload time slot according to the sequence order, and min{•

} represents finding an integer m that minimizes a value of the equation.

13. The transmission time determination method of claim 10, wherein the time slots have a sequence order, the first equipment occupies one of the time slots as a parent time slot, and the step of deciding the information of the download time slot decides the download slot to be the time slots that is unoccupied and that is nearest to and behind the parent time slot according to the sequence order.

14. The transmission time determination method of claim 13, wherein the information of the download time slot is an ordering number of the download time slot, the step of deciding the information of the download time slot decides the ordering number of the download time slot according to following equation:

min{(n−

p)mod k≠

u}

wherein p represents an ordering number of the parent time slot according to the sequence order, u represents an ordering number of each of the occupied time slots according to the sequence order, k represents a total number of the time slots in the superframe, mod represents the remainder of (n−

p) being divided by k, n represents the ordering number of the download time slot according to the sequence order, and min{•

} represents finding an integer n that minimizes a value of the equation.

15. A tangible machine-readable medium storing a computer program to enable an apparatus of a beacon-enabled wireless network to execute a transmission time determination method, the apparatus being located within a coverage area of a first equipment, a second equipment being located within a coverage area of the apparatus, the transmission time determination method comprising the following steps of:

receiving a beacon of the first equipment;

deciding an information of an upload time slot of the apparatus according to the beacon, so that the apparatus can perform data transmission with the first equipment in the upload time slot; and

deciding an information of a download time slot of the apparatus according to the beacon, so that the apparatus can perform data transmission with the second equipment in the download time slot.

16. The tangible machine-readable medium of claim 15, wherein the transmission time determination method further comprises the following step of:

Storing the information of the upload time slot; and

storing the information of the download time slot.

17. The tangible machine-readable medium of claim 15, wherein the beacon comprises a time slot parameter for defining a plurality of time slots in a superframe of the beacon-enabled wireless network, and the upload time slot and the download time slot are two different ones of the time slots.

18. The tangible machine-readable medium of claim 17, wherein the time slots have a sequence order, the first equipment occupies one of the time slots as a parent time slot, and the step of deciding the information of the upload time slot decides the upload time slot to be the time slot that is unoccupied and that is nearest to and ahead of the upload time slot according to the sequence order.

19. The tangible machine-readable medium of claim 18, wherein the information of the upload time slot is an ordering number of the upload time slot, the step of deciding the information of the upload time slot decides the ordering number of the upload time slot according to following equation:

min{(p−

m)mod k≠

u},

wherein p represents an ordering number of the parent time slot according to the sequence order, u represents an ordering number of each of the occupied time slots according to the sequence order, k represents a number of the time slots, mod represents the remainder of (p−

m) being divided by k, m represents the ordering number of the upload time slot according to the sequence order, and min{•

} represents finding an integer m that minimizes a value of the equation.

20. The tangible machine-readable medium of claim 17, wherein the time slots have a sequence order, the first equipment occupies one of the time slots as a parent time slot, and the step of deciding the information of the download time slot decides the download time slot to be the time slot that is unoccupied and that is nearest to and behind the parent time slot according to the sequence order.

21. The tangible machine-readable medium of claim 20, wherein the information of the download time slot is an ordering number of the download time slot, the step of deciding the information of the download time slot decides the ordering number of the download time slot according to following equation:

min{(n−

p)mod k≠

u},

wherein p represents an ordering number of the parent time slot according to the sequence order, u represents an ordering number of each of the occupied time slots according to the sequence order, k represents a number of the time slots, mod represents the remainder of (n−

p) being divided by k, n represents the ordering number of the download time slot according to the sequence order, and min{•

} represents finding an integer n that minimizes a value of the equation.