Contention groups for hidden nodes

• US 9,148,385 B2
• Filed: 06/13/2013
• Issued: 09/29/2015
• Est. Priority Date: 06/04/2007
• Status: Expired due to Fees

• Current Assignee: Qualcomm Atheros Incorporated (Qualcomm, Inc.)
• Original Assignee: Qualcomm, Inc.
• Inventors: Yonge, Lawrence Winston III, Katar, Srinivas, Krishnam, Manjunath Anandarama
• Primary Examiner(s): Sheikh, Ayaz
• Assistant Examiner(s): CHAU, PETER P
• Application Number:
  US13/917,394
• Publication Number:
  US 20130272315A1
• Time in Patent Office: 838 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: H04B 2203/5445 Local network
• CPC Class Codes: H04L 12/2801 Broadband local area networks
• CPC Class Codes: H04L 12/2856 Access arrangements, e.g. Internet access asynchronous transfer mode networks H04L12/5601; broadband local area networks H04L12/2801; optical access or distribution networks H04Q11/0067; access to open networks H04L12/5691; digital subscriber line end-user equipment and bit-level processing of data on a PSTN-based network H04M11/00; home network gateways H04L12/2834; wireless access networks H04W
• CPC Class Codes: H04L 12/413 with random access, e.g. carrier-sense multiple-access with collision detection [CSMA-CD]
• CPC Class Codes: H04L 12/44 Star or tree networks
• CPC Class Codes: H04L 45/12 Shortest path evaluation
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/122 by minimising distances, e.g. by selecting a route with minimum of number of hops
• CPC Class Codes: H04L 45/123 Evaluation of link metrics techniques for monitoring network metrics H04L43/08
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 47/787 Bandwidth trade among domains

Abstract

Communicating among stations in a network includes, from each of multiple stations in the network, transmitting information indicating which other stations from which that station is able to reliably receive transmissions. A schedule for communicating among the stations is determined based on the information from the stations and transmitting the schedule over the network. The schedule includes a plurality of time slots during which respective contention groups of stations are assigned to communicate using a contention-based protocol.

Claims

1. A method performed by a first station for communicating in a network, the method comprising:

identifying, at the first station, beacon levels of stations in the network, the beacon levels indicative of a hierarchy of the stations in the network;

assigning, at the first station, the stations to contention groups based, at least in part, on the beacon levels, wherein at least one contention group of the contention groups includes stations of two different consecutive beacon levels; and

determining, at the first station, a communications schedule for the contention groups, wherein neighboring contention groups of the contention groups are scheduled at non-overlapping time slots of the communications schedule.

2. The method of claim 1, wherein identifying the beacon levels comprises:

collecting information regarding from which other stations a particular station of the stations is capable of reliably receiving transmissions.

3. The method of claim 1, wherein determining the communications schedule comprises determining a time slot group having one or more of contention groups that do not interfere with each other, wherein the one or more contention groups in the time slot group are assigned to a same time slot of the communications schedule.

4. The method of claim 1, wherein each station in a first contention group is capable of reliably receiving transmissions from all other stations in the first contention group.

5. The method of claim 1, wherein each station in a first contention group is assigned to communicate in a first time slot and each station in a second contention group is assigned to communicate in a second time slot.

6. The method of claim 5, wherein each station in a third contention group is assigned to communicate in the first time slot, wherein each station in the first contention group is not able to reliably receive transmissions from stations in the third contention group.

7. The method of claim 1, wherein stations in a first contention group contend with each other to communicate over the network using a contention-based protocol.

8. The method of claim 7, wherein when there are no hidden nodes included in the first contention group, the contention-based protocol does not include Request to Send/Clear To Send (RTS/CTS) transmissions among the stations in the first contention group.

9. The method of claim 7, wherein when the first contention group includes at least one hidden node, the contention-based protocol includes Request to Send/Clear To Send (RTS/CTS) transmissions among the stations in the first contention group.

10. The method of claim 1, further comprising:

providing, to stations in different contention groups, at least one group-specific parameter associated with a contention-based protocol.

11. The method of claim 10, wherein the at least one group-specific parameter includes at least one member of a group consisting of a contention window size, a defer counter, and a random backoff parameter.

12. The method of claim 10, wherein the at least one group-specific parameter is selected based, at least in part, on a number of stations in each contention group.

13. The method of claim 10, wherein providing the at least one group-specific parameter comprises:

providing, to stations in a first contention group, a first parameter; and

providing, to stations in a second contention group, a second parameter, different from the first parameter.

14. The method of claim 1, wherein each respective station has a beacon level that is one level higher than a lowest beacon level of other stations from which the respective station is capable of reliably receiving transmissions.

15. A station for communicating in a network, the station comprising:

a processor; and

memory for storing instructions therein which, when executed by the processor, cause the station to;

identify beacon levels of stations in the network, the beacon levels indicative of a hierarchy of the stations in the network;

assign the stations to contention groups based, at least in part, on the beacon levels, wherein at least one contention group of the contention groups includes stations of two different consecutive beacon levels; and

determine a communications schedule for the contention groups, wherein neighboring contention groups of the contention groups are scheduled at non-overlapping time slots of the communications schedule.

16. The station of claim 15, further comprising:

a receiver configured to collect information indicating from which other stations a particular station is capable of reliably receiving transmissions; and

a transmitter configured to send transmissions in accordance with the communications schedule for a first contention group.

17. The station of claim 16, wherein the transmitter is configured to transmit scheduling information associated with the communications schedule to at least one other station.

18. The station of claim 16, wherein the transmitter is configured to transmit beacon transmissions via the network.

19. The station of claim 16, wherein the transmitter is configured to transmit, to at least one other station, information regarding from which other stations the station is capable of reliably receiving transmissions.

20. The station of claim 15, wherein the instructions, when executed by the processor, cause the station to:

provide, to stations in different contention groups, at least one group-specific parameter associated with a contention-based protocol.

21. The station of claim 20, wherein the at least one group-specific parameter includes at least one member of a group consisting of a contention window size, a defer counter, and a random backoff parameter.

22. The station of claim 20, wherein the at least one group-specific parameter is selected based, at least in part, on a number of stations in each contention group.

23. A non-transitory computer readable medium storing computer program code, the computer program code comprising instructions which, when executed by a processor of a station, cause the station to:

identify beacon levels of stations in a network, the beacon levels indicative of a hierarchy of the stations in the network;

assign the stations to contention groups of the contention groups based, at least in part, on the beacon levels, wherein at least one contention group includes stations of two different consecutive beacon levels; and

determine a communications schedule for the contention groups, wherein neighboring contention groups of the content are scheduled at non-overlapping time slots of the communications schedule.

24. The non-transitory computer readable medium of claim 23, wherein the computer program code comprises instructions which, when executed by the processor of the station, cause the station to collect information indicating from which other stations a particular station is capable of reliably receiving transmissions.

25. The non-transitory computer readable medium of claim 23, wherein the instructions that cause the station to determine the communications schedule comprise instructions which, when executed by the processor, cause the station to determine a time slot group having one or more contention groups that do not interfere with each other, wherein the one or more contention groups in the time slot group are assigned to a same time slot of the communications schedule.

26. The non-transitory computer readable medium of claim 23, wherein the computer program code comprises instructions which when executed by the processor of the station cause the station to transmit scheduling information associated with the communications schedule to at least one other station.

27. The non-transitory computer readable medium of claim 23, wherein the computer program code comprises instructions which when executed by the processor of the station cause the station to:

provide, to stations in different contention groups, at least one group-specific parameter associated with a contention-based protocol.

28. The non-transitory computer readable medium of claim 27, wherein the at least one group-specific parameter includes at least one member of a group consisting of a contention window size, a defer counter, and a random backoff parameter.

29. The non-transitory computer readable medium of claim 27, wherein the at least one group-specific parameter is selected based, at least in part, on a number of stations in each contention group.

30. A method performed by a first station for communication in a network, the method comprising:

identify, at the first station in the network, beacon levels of other stations in the network, the beacon levels indicative of a hierarchy of the other stations in the network;

assigning the first station and the other stations of the network to contention groups based, at least in part, on the beacon levels, wherein at least one contention group of the contention groups includes stations of two different consecutive beacon levels;

determining, at the first station, a schedule for each contention group of the contention groups to communicate using the network, wherein the schedule includes a plurality of time slots;

wherein the contention groups and the schedule are coordinated so that stations assigned to a first contention group are scheduled in a first time slot, and stations assigned to a second contention group are scheduled in a second time slot;

wherein the contention groups and the schedule are coordinated so that stations assigned to the first contention group are not capable of reliably receiving transmissions from stations in a third contention group, and wherein the first contention group and the third contention group are scheduled in the first time slot; and

transmitting the schedule over the network to the other stations.