Quality of service based media access control for mobile ad hoc networks

• US 7,095,732 B1
• Filed: 04/12/2002
• Issued: 08/22/2006
• Est. Priority Date: 04/12/2002
• Status: Active Grant

• Current Assignee: Raytheon BBN Technologies Corp. (Rtx Corporation)
• Original Assignee: BBN Technologies (Rtx Corporation)
• Inventors: Watson, William Dugald Jr.
• Primary Examiner(s): PHAM, BRENDA H
• Application Number:
  US10/122,438
• Time in Patent Office: 1,593 Days
• Field of Search: 370/229, 370/235, 370/346, 370/312, 370/349, 370/400, 370/389, 370/376, 370/395.21, 370/395.4, 370/395.42, 370/449, 370/458
• US Class Current: 370/346
• CPC Class Codes: H04L 47/15 in relation to multipoint traffic arrangements for broadcast or multicast in data networks H04L12/18
• CPC Class Codes: H04L 47/2408 for supporting different services, e.g. a differentiated services [DiffServ] type of service
• CPC Class Codes: H04L 47/70 Admission control; Resource allocation
• CPC Class Codes: H04L 47/72 using reservation actions during connection setup
• CPC Class Codes: H04L 47/782 Hierarchical allocation of resources, e.g. involving a hierarchy of local and centralised entities
• CPC Class Codes: H04L 47/805 QOS or priority aware
• CPC Class Codes: H04L 47/824 Applicable to portable or mobile terminals
• CPC Class Codes: H04W 74/06 using polling

Abstract

A manager node (105) controls access to a shared network communication medium by a number of nodes. A first node (101) transmits a request to the manager node (105). The request includes information indicating that the first node (101) requires a QoS link to a second node. The manager node (105) determines whether the QoS link from the first node (101) to the second node can be supported and sends an accept message to the first node (101) when the QoS link can be supported. Prioritized media access control may also be used in a distributed network without using a manager node to control access to a shared communication medium. A node with high priority data may reduce the duration of its contention window so that it will have a better chance of gaining control of the shared communication medium than a node with low priority data.

Claims

1. A method, comprising:

generating a request at a first node, the request including information indicating that the first node requires a QoS link to a second node;

transmitting the request from the first node;

receiving the request at a third node, the third node representing a manager node;

determining, by the third node, whether the QoS link from the first node to the second node can be supported; and

sending an accept message from the third node to the first node when the QoS link can be supported;

generating, by the third node, a polling cycle;

reserving a time slot in the polling cycle for the first node when the QoS link from the first node to the second node can be supported; and

broadcasting polling signals based on the polling cycle, at least one of the polling signals identifying the first node, and

wherein the first node transmits data during an interval after receiving the polling signal identifying the first node.

2. The method of claim 1, further comprising:

reserving a time slot in a polling cycle for the first node when the QoS link can be supported.

3. The method of claim 2, further comprising:

broadcasting a polling signal identifying the first node; and

transmitting data, by the first node, during an interval after the polling signal is broadcast.

4. The method of claim 3, further comprising:

withholding transmission by at least one other node during the interval after the polling signal is broadcast.

5. The method of claim 1, further comprising:

sending a deny message to the first node when the QoS link cannot be supported.

6. The method of claim 1, wherein the determining includes:

forwarding the request to at least one other node, the other node being the second node or a next hop in a path to the second node, and

determining, by the at least one other node, whether the QoS link can be supported.

7. The method of claim 1, wherein a path from the first node to the second node includes a number of nodes, and wherein the determining includes:

forwarding the request to each of the nodes in the path and to the second node,

determining, by each of the nodes in the path, whether the QoS link can be supported,

determining, by the second node, whether the QoS link can be supported, and

generating, by the third node, an accept message when each of the nodes in the path and the second node can support the QoS link.

8. The method of claim 1, further comprising:

repeating the broadcasting over a period of time.

9. The method of claim 1, further comprising:

modifying the polling cycle in response to QoS release messages and requests for additional QoS links.

10. A first node, comprising:

a receiver configured to receive a request from a second node, the request including information indicating that the second node requires a QoS link to a third node;

a processing device configured to;

determine whether the QoS link from the second node to the third node can be supported,

generate a polling cycle, and

reserve a time slot for the second node in the polling cycle when the QoS link can be supported; and

a transmitter configured to transmit an accept message to the second node when the QoS link can be supported;

wherein when determining whether the QoS link from the second node to the third node can be supported, the processing device is configured to;

generate a deny message when the QoS link cannot be supported by each node in a path from the second node to the third node, and

the transmitter is configured to transmit the deny message to the second node.

11. The first node of claim 10, wherein the processing device is further configured to:

broadcast a polling signal via the transmitter, the polling signal identifying the second node at the time slot reserved for the second node, and wherein

the receiver is configured to receive data from the second node in an interval immediately following the broadcast of the polling signal.

12. The first node of claim 11, wherein the processing device is further configured to:

forward the data, via the transmitter, to the third node or to a next hop in a path to the third node.

13. The first node of claim 10, wherein the processing device is further configured to:

generate a deny message when the QoS link cannot be supported by each node in a path from the second node to the third node, and

the transmitter is configured to transmit the deny message to the second node.

14. The first node of claim 10, wherein the polling cycle identifies a number of nodes based on requests for QoS links and determinations that the requests for QoS links can be supported, and wherein the processing device is further configured to:

reserve a time slot in the polling cycle for each of the nodes that requests a QoS link that can be supported.

15. The first node of claim 14, wherein the transmitter is further configured to:

broadcast polling signals, each of the polling signals identifying a particular node based on the polling cycle.

16. A computer-readable medium having stored thereon a plurality of sequences of instructions which, when executed by a processor, cause said processor to:

receive a request from a first node, the request including information indicating that the first node requires a QoS link to a second node;

determine whether the QoS link from the first node to the second node can be supported;

generate a polling cycle;

reserve a time slot for the first node in the polling cycle when the QoS link can be supported; and

transmit an accept message to the first node when the QoS link can be supported;

wherein when determining whether the QoS link from the first node to the second node can be supported, the instructions cause the processor to;

identify at least one other node based on the request, the other node being the second node or a next hop in a path to the second node,

forward the request to the other node, and

receive a response from the other node indicating whether the QoS link can be supported;

wherein the polling cycle identifies a number of nodes based on requests for QoS links and determinations that the requests for QoS links can be supported, and wherein the instruction further cause the processor to;

reserve a time slot in the polling cycle for each node that requests a QoS link that can be supported; and

broadcast polling signals, each polling signal identifying a particular node based on the polling cycle.

17. The computer-readable medium of claim 16, including instructions for causing said processor to:

broadcast a polling signal identifying the first node at the time slot reserved for the first node; and

receive data from the first node in an interval immediately following the broadcast of the polling signal.

18. The computer-readable medium of claim 17, including instructions for causing said processor to:

forward the data to the second node or to a next hop in a path to the second node.

19. The computer-readable medium of claim 16, including instructions for causing said processor to:

generate a deny message when the QoS link cannot be supported by each node in a path from the first node to the second node; and

transmit the deny message to the first node.

20. A first node, comprising:

processing logic configured to generate a request, the request indicating that the first node requires a QoS link to a second node;

a transmitter configured to transmit the request to a third node, the third node representing a manager node for a number of nodes including the first node; and

a receiver configured to receive at least one of an accept message and a deny message from the third node, the accept message indicating that the QoS link can be supported and the deny message indicating that the QoS link cannot be supported;

wherein the receiver is further configured to;

receive a polling signal from the third node, the polling signal identifying the first node, and wherein the transmitter is further configured to transmit data in response to the polling signal;

a memory configured to store network configuration information, and

wherein the processing logic is further configured to;

access the memory to determine whether the second node is one hop away from the first node.

21. The first node of claim 20, wherein the transmitter is further configured to:

transmit the data directly to the second node when the second node is one hop away.

22. The first node of claim 20, wherein the transmitter is further configured to:

transmit the data to the third node when the second node is not one hop away.

23. The first node of claim 20, wherein the receiver is further configured to:

receive a polling signal from the third node, the polling signal identifying a node other than the first node, and

wherein the transmitter is further configured to withhold transmission of data for an interval of time following the receipt of the polling signal identifying a node other than the first node.

24. A computer-readable medium having stored thereon a plurality of sequences of instructions, said instructions which, when executed by a processor, cause said processor to:

generate a request indicating that a first node requires a QoS link to a second node, the first node being associated with the processor;

transmit the request to a third node, the third node representing a manager node for a number of nodes including the first node; and

receive at least one of an accept message and a deny message from the third node, the accept message indicating that the QoS link can be supported and the deny message indicating that the QoS message cannot be supported;

receive a polling signal from the third node;

determine that the polling signal identifies the first node; and

transmit data in response to the polling signal.

25. The computer-readable medium of claim 24, including instructions for causing the processor to:

determine whether the second node is one hop away from the first node; and

when transmitting data in response to the polling signal, the instructions cause the processor to;

transmit the data directly to the second node when the second node is one hop away, and

transmit the data to the third node when the second node is not one hop away.

26. The computer-readable medium of claim 24, including instructions for causing the processor to:

receive a polling signal from the third node;

determine that the polling signal identifies a node other than the first node; and

withhold transmission of data for an interval of time following the receipt of the polling signal identifying a node other than the first node.

27. A system for controlling access to a communication channel in a wireless network, comprising:

means for receiving requests from a plurality of nodes, each of the requests including information identifying a QoS link;

means for determining whether the QoS link identified in each of the respective requests can be supported;

means for generating a polling cycle identifying QoS links that can be supported;

means for broadcast polling signals based on the polling cycle; and

means for receiving data from a node identified in a polling signal in an interval immediately following the polling signal.

28. A method for accessing a shared communication medium comprising:

broadcasting a message from a first node to a plurality of nodes via the shared communication medium, the message identifying a link that the first node wishes to establish with a second node and including a priority associated with the link;

receiving the message at each of the plurality of nodes; and

adjusting, by the first node, a contention window interval based on the priority included in the message;

adjusting, by the second node, a contention window interval based on the priority included in the message;

adjusting the contention window interval to decrease the duration of the contention window interval when the priority associated with the link is high.

29. The method of claim 28, wherein the contention window interval defines an interval of time in which the first and second nodes cannot contend for the shared communication medium after expiration of a predetermined interval.

30. The method of claim 28, further comprising:

generating, by the first node, a release message;

broadcasting the release message; and

adjusting, by the first and second nodes, their respective contention window intervals back to a predetermined interval.

31. The method of claim 28, further comprising:

adjusting, by at least one node other than the first and second nodes, a contention window interval based on the priority included in the message.

32. The method of claim 31, wherein the adjusting by the at least one other node includes:

increasing the contention window interval when the priority included in the message is high.

33. A first node, comprising:

a processing device configured to;

generate a request that indicates that the first node wishes to establish a link over a shared communication medium with a second node, the request including a priority associated with the link, and

adjust a contention window interval based on the priority included in the request; and

a transmitter configured to broadcast the request to a number of nodes including the second node;

wherein the contention window interval defines an interval of time during which the first node cannot contend for the shared communication medium after expiration of a predetermined interval and when adjusting the contention window interval, the processing device is configured to;

increase the duration of the contention window interval when the priority associated with the link is low.

34. The first node of claim 33, wherein when adjusting the contention window interval, the processing device is configured to:

decrease the duration of the contention window interval when the priority associated with the link is high.

35. The first node of claim 33, wherein the processing device is further configured to:

generate a release message, the release message indicating that the link is no longer needed,

broadcast the release message via the transmitter, and

adjust the contention window interval back to a predetermined interval.

36. The first node of claim 33, wherein the link comprises a QoS link.

37. A computer-readable medium having stored thereon a plurality of sequences of instructions, said instructions which, when executed by a processor, cause said processor to:

generate a request, the request indicating that a first node wishes to establish a link over a shared communication medium with a second node, the processor being associated with the first node and the request including a priority associated with the link;

adjust a contention window interval based on the priority included in the request; and

broadcast the request to a number of nodes including the second node;

wherein when adjusting the contention window interval, the instructions cause the processor to;

decrease the duration of the contention window interval when the priority associated with the link is high.

38. The computer-readable medium of claim 37, wherein the contention window interval defines an interval of time during which the processor cannot contend for the shared communication medium after expiration of a predetermined interval and when adjusting the contention window interval, the instructions cause the processor to:

increase the duration of the contention window interval when the priority associated with the link is low.

39. The computer-readable medium of claim 37, including instructions for causing the processor to:

generate a release message when the link from the first node to the second node is no longer needed;

broadcast the release message; and

adjust the contention window interval back to a predetermined interval.

40. The computer-readable medium of claim 37, wherein the link comprises a QoS link.

41. A first node, comprising:

a receiver configured to receive a broadcast message from a second node; and

a processing device configured to;

determine that the broadcast message indicates that the second node wishes to establish a link over a shared communication medium,

identify a priority associated with the link, and

adjust a contention window interval based on the priority;

wherein the receiver is further configured to receive a release message indicating that the link is no longer needed, and

the processing device is further configured to adjust the contention window interval to a predetermined interval in response to the release message.

42. The first node of claim 41, wherein when adjusting the contention window interval, the processing device is configured to:

increase the duration of the contention window interval when the priority associated with the link is high.

43. The first node of claim 41, wherein the contention window interval defines an interval of time during which the first node cannot contend for the shared communication medium after expiration of a predetermined interval and when adjusting the contention window interval, the processing device is configured to:

decrease the duration of the contention window interval when the priority associated with the link is low.

44. The first node of claim 41, wherein the link comprises a QoS link.

45. A computer-readable medium having stored thereon a plurality of sequences of instructions, said instructions which, when executed by a processor, cause said processor to:

receive a broadcast message from a first node;

determine that the broadcast message indicates that the first node wishes to establish a link with a second node over a shared communication medium, wherein the first and second nodes are not associated with the processor;

identify a priority associated with the link; and

adjust a contention window interval based on the priority;

wherein the contention window interval defines an interval of time during which the processor cannot contend for the shared communication medium after expiration of a predetermined interval and when adjusting the contention window interval, the instructions cause the processor to;

decrease the duration of the contention window interval when the priority associated with the link is low.

46. The computer-readable medium of claim 45, wherein when adjusting the contention window interval, the instructions cause the processor to:

increase the duration of the contention window interval when the priority associated with the link is high.

47. The computer-readable medium of claim 45, wherein the instructions further cause the processor to:

receive a release message indicating that the link is no longer needed; and

adjust the contention window interval to a predetermined interval in response to the release message.

48. The computer-readable medium of claim 45, wherein the link comprises a QoS link.

49. A method for accessing a shared communication medium by a number of nodes, a first group of nodes being neighbors with a manager node and a second group of nodes being neighbors with each other, the method comprising:

generating a request at a first node in the first group of nodes, the request including information indicating that the first node requires a link to a second node;

transmitting the request from the first node to the manager node;

determining, by the manager node, whether the link from the first node to the second node can be supported;

sending an accept message from the manager node to the first node when the link can be supported;

broadcasting a message from a third node in the second group of nodes, the message identifying a link that the third node wishes to establish with another node in the second group of nodes and including a priority associated with the link;

receiving the message at each of the nodes in the second group of nodes; and

adjusting, by the third node, a contention window interval based on the priority included in the message.