Network channel access protocol—slot scheduling

• US 7,356,043 B2
• Filed: 08/17/2006
• Issued: 04/08/2008
• Est. Priority Date: 04/18/2001
• Status: Expired due to Term

• Current Assignee: Trilliant Networks Incorporated
• Original Assignee: SkyPilot Networks Incorporated (Trilliant Networks Incorporated)
• Inventors: Bradley, Kirk Alton, Rich, Mark J., Hammel, Thomas
• Primary Examiner(s): PHAM, BRENDA H
• Application Number:
  US11/505,753
• Publication Number:
  US 20060280201A1
• Time in Patent Office: 600 Days
• Field of Search: 370/458, 370/459, 370/498, 370/522, 370/537, 370/528, 370/465, 370/466, 370/907, 370/232, 370/235, 370/252, 370/329, 370/341, 370/376, 370/395.21, 370/395.41, 370/230, 370/253.3
• US Class Current: 370/458
• CPC Class Codes: H04L 47/11 Identifying congestion
• CPC Class Codes: H04L 47/12 Avoiding congestion; Recovering from congestion
• CPC Class Codes: H04W 16/02 Resource partitioning among network components, e.g. reuse partitioning
• CPC Class Codes: H04W 16/06 Hybrid resource partitioning, e.g. channel borrowing
• CPC Class Codes: H04W 16/12 Fixed resource partitioning
• CPC Class Codes: H04W 16/14 Spectrum sharing arrangements between different networks
• CPC Class Codes: H04W 16/24 Cell structures
• CPC Class Codes: H04W 28/10 Flow control between communication endpoints
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• 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 72/0446 Resources in time domain, e.g. slots or frames
• CPC Class Codes: H04W 72/52 based on load
• CPC Class Codes: H04W 72/54 based on quality criteria
• CPC Class Codes: H04W 72/541 using the level of interference
• CPC Class Codes: H04W 72/542 using measured or perceived quality
• CPC Class Codes: H04W 72/56 based on priority criteria
• CPC Class Codes: H04W 72/569 of the traffic information
• CPC Class Codes: H04W 74/00 Wireless channel access
• CPC Class Codes: H04W 74/04 Scheduled access hybrid access H04W74/02
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

Network channel access protocol is disclosed. More particularly, a distributed, locally determined, channel access protocol that adapts to load, avoids interference and controls access by a group of nodes to a set of shared channels is disclosed. Shared channel space is divided into a number of communication slots that are repeated at a predetermined interval. Permission to use a slot to communicate between any two nodes is dynamically adjusted by the channel access protocol, which locally: (i) estimates load to neighboring nodes; (ii) allocates or deallocates slot usage to adapt to load and avoid interference; and (iii) asserts and advertises slot usage within an interference area about itself.

Claims

1. A method for slot allocation acknowledgement by a node, comprising:

providing slot allocation information;

determining if the slot allocation information has been superseded;

if the slot allocation information has not been superseded, determining whether the slot allocation information pertains to the node;

if the slot allocation information pertains to the node, determining a mode associated with the slot allocation information;

if the mode condition is transmit or receive, checking for conflicts and interference with the slot allocation information;

if the slot allocation information is not conflicted and not precluded by interference,

scheduling use of a communication slot identified by the slot allocation information;

determining whether the mode condition of the slot allocation information involves activity within an interference area of the node; and

if the activity is within the interference area, advertising the slot allocation information to neighboring nodes of the node.

2. The method of claim 1 further comprising if the mode condition is none, unscheduling usage identified by the slot allocation information.

3. The method of claim 1 wherein the advertising is only by point-to-point communication.

4. The method of claim 1 wherein the advertising is only by point-to-multipoint communication.

5. The method of claim 1 wherein the advertising is only by broadcast communication.

6. The method of claim 1 wherein the advertising is by one or more of point-to-point communication, point-to-multipoint communication and broadcast communication.

7. The method of claim 1 further comprising if the slot allocation information is not conflicted and not precluded by interference and if the mode condition is a receive mode, acknowledging a sender of usage identified by the slot allocation information.

8. The method of claim 7 wherein the acknowledging is only by point-to-point communication.

9. The method of claim 7 wherein the acknowledging is only by point-to-multipoint communication.

10. The method of claim 7 wherein the acknowledging is only by broadcast communication.

11. The method of claim 7 wherein the acknowledging is by one or more of point-to-point communication, point-to-multipoint communication and broadcast communication.

12. The method of claim 1 further comprising:

if the slot allocation information is conflicted or precluded by interference,

canceling a slot allocation identified by the slot allocation information; and

advertising the neighboring nodes of the node of the canceling of the slot allocation.

13. The method of claim 12 wherein the advertising is only by point-to-point communication.

14. The method of claim 12 wherein the advertising is only by point-to-multipoint communication.

15. The method of claim 12 wherein the advertising is only by broadcast communication.

16. The method of claim 12 wherein the advertising is by one or more of point-to-point communication, point-to-multipoint communication and broadcast communication.

17. A computer-readable medium containing a program which, when executed by a processor in response to receiving slot allocation information, causes execution of a method comprising:

determining if the slot allocation information has been superseded;

if the slot allocation information has not been superseded, determining whether the slot allocation information pertains to the node;

if the slot allocation information pertains to the node, determining a mode associated with the slot allocation information;

if the mode condition is transmit or receive, checking for conflicts and interference with the slot allocation information;

if the slot allocation information is not conflicted and not precluded by interference,

scheduling use of a communication slot identified by the slot allocation information;

determining whether the mode condition of the slot allocation information involves activity within an interference area of the node; and

if the activity is within the interference area, advertising the slot allocation information to neighboring nodes of the node.