Method for QoS delivery in contention-based multi hop network

• US 9,060,310 B2
• Filed: 11/08/2011
• Issued: 06/16/2015
• Est. Priority Date: 09/25/2008
• Status: Active Grant

• Current Assignee: AT&T Intellectual Property I LP (AT&T, Inc.)
• Original Assignee: AT&T Intellectual Property I LP (AT&T, Inc.)
• Inventors: Ji, Lusheng
• Primary Examiner(s): Phung, Luat
• Application Number:
  US13/291,318
• Publication Number:
  US 20120051253A1
• Time in Patent Office: 1,316 Days
• Field of Search: 370/465, 370/235, 370/238, 370/278, 370/311, 370/338, 370/389, 370/443, 370/455, 455/39, 455/41.2, 455/63.1, 709/227, 709/228
• US Class Current: 1/1
• CPC Class Codes: H04L 45/10 Routing in connection-oriented networks, e.g. X.25 or ATM
• CPC Class Codes: H04L 45/302 Route determination based on requested QoS
• CPC Class Codes: H04L 45/38 Flow based routing
• CPC Class Codes: H04W 28/0289 Congestion control load shedding arrangements in network planning H04W16/08; performing reselection for handling the traffic H04W36/22; wireless traffic scheduling H04W72/12
• CPC Class Codes: H04W 28/04 Error control
• CPC Class Codes: H04W 28/26 Resource reservation
• CPC Class Codes: H04W 40/28 for reactive routing
• CPC Class Codes: H04W 74/0808 using carrier sensing, e.g. carrier sense multiple access [CSMA]
• CPC Class Codes: H04W 76/10 Connection setup
• CPC Class Codes: H04W 8/04 Registration at HLR or HSS [Home Subscriber Server]

Abstract

An arrangement and a method that, for a given pair of nodes that wish to intercommunicate with a high QoS measure, converts a portion of the contention-based network into a contention-less subnetwork by sending a reservation message and a confirmation message between the given pair of nodes. All nodes that are on the paths used for communicating between the pair of nodes are protected from interference by causing all nodes that potentially can interfere to enter a non-transmitting state.

Claims

1. A method executed in a contention-based network for establishing a two-way communication path from a first node to a second node comprising the steps of:

said first node sending a reservation message destined to said second node, which message requests a reservation of said two-way communication path;

said second node receiving said reservation message through a forward path that comprises said first node, said second node, and one or more other nodes of said network, and responding with a reservation confirmation message that is destined to said first node, nodes of said forward path being path nodes;

said first node receiving said reservation confirmation message through a reverse path that comprises said first node, said second node, and one or more other nodes of said network, nodes of said reverse path being path nodes;

each of one or more first neighbor nodes, which are not one of the path nodes, receiving said reservation message from at least one of the nodes in the forward path and setting itself to a non-transmitting mode of operation for a duration of the reservation of the two-way communication path responsive to receiving said reservation message and not being one of the path nodes;

each one or more second neighbor nodes, which are not one of the path nodes, receiving the confirmation message from at least one of said nodes in the reverse path and setting itself to the non-transmitting mode of operation for the duration of the reservation of the two-way communication path responsive to receiving said confirmation message and not being one of the path nodes,

wherein the duration of the reservation is determined according to messages flowing through the path nodes without a hiatus of more than a preselected time interval; and

wherein the reservation message includes a negotiable field, specifying whether said first node is amenable to proposed changes in the reservation message.

2. The method of claim 1 where nodes of said network that are not path nodes and not first or second neighbor nodes operate pursuant to a contention-based protocol, whereas said path nodes operate pursuant to a protocol that is other than a contention protocol.

3. The method of claim 1 where said forward path is determined in accordance with a preselected protocol.

4. The method of claim 3 wherein said protocol computes, for a given node and a given destination node, a next node of a path leading from said given node toward said destination node.

5. The method of claim 3 wherein said protocol is one where a node of said network that receives a broadcasted reservation message re-broadcasts a modified version of said reservation message.

6. The method of claim 3 wherein said protocol is one where a node of said network that receives a plurality of broadcasted reservation messages selects one of the received messages and re-broadcasts a modified version of the selected reservation message.

7. The method of claim 3 where said reverse path is set to comprise the nodes that are included in said forward path.

8. The method of claim 1 where said forward path is determined in accordance with a first protocol and said reverse path is selected in accordance with a second protocol that may be the same as said first protocol or different from said first protocol.

9. The method of claim 8 where said forward path and said reverse path include the same nodes.

10. The method of claim 1 where said reservation message includes a field that conveys to said second node information about said forward path.

11. The method of claim 10 where said field contains a listing of nodes included in said forward path.

12. The method of claim 1 where messages flowing through said network, including said reservation message, said reservation confirmation message, and an information message are multi-field packets.

13. The method of claim 12 where said reservation message includes an originator field that contains identity of said first node, a responder field that contains identity of said second node, and a type field that identifies the message as a reservation message.

14. The method of claim 12 where said reservation message includes a path field, into which identities of nodes in said forward path are inserted.

15. The method of claim 12 where said reservation message includes one or more of the following fields:

type, specifying the message'"'"'s type;

sender address;

addressee identifier;

path list, containing and ordered listing of nodes in said forward path;

duration, specifying duration of the reservation requested by the reservation message;

passcode, containing encryption information;

reservation identifier;

idle time, specifying expected maximum idle time between information messages;

packet arrival interval, specifying arrival times of information messages;

step interval, specifying a frame structure for transmitting and receiving;

negotiable, specifying whether said first node is amenable to proposed changes in the reservation;

renewal window, specifying when a renewal message might arrive;

neighbor sleep allowed, specifying whether the neighbor nodes can go to sleep for duration of said reservation; and

new channel, specifying a channel for said path nodes.

16. The method of claim 1 further comprising sending a reservation termination message via said path nodes to terminate the two-way communication path.

17. The method of claim 1 further comprising the first node sending a reservation renewal message to renew the reservation for the two-way communication path during the duration of the reservation before the two-way communication path expires.

18. The method of claim 1 further comprising the first node sending an acknowledgement message following receipt of said reservation confirmation message.

19. The method as recited in claim 1 further comprising the first and second neighbor nodes staying awake to observe whether the preselected time interval of the hiatus has expired to thereby determine the duration of the reservation.

20. A method executed in a contention-based network for establishing a two-way communication path from a first node to a second node comprising the steps of:

said first node sending a reservation message destined to said second node, which message requests a reservation of said two-way communication path;

said second node receiving said reservation message through a forward path that comprises said first node, said second node, and one or more other nodes of said network, and responding with a reservation confirmation message that is destined to said first node, nodes of said forward path being path nodes;

said first node receiving said reservation confirmation message through a reverse path that comprises said first node, said second node, and one or more other nodes of said network, nodes of said reverse path being path nodes;

each node of said network that is not one of the path nodes but which receives said reservation message from at least one of said nodes in the forward path is a neighbor node, each neighbor node setting itself to a sleep mode according to a neighbor sleep allowed field in the reservation message, the neighbor sleep allowed field specifying whether each neighbor node can go to sleep for a duration of said reservation, the duration of the reservation being specified in a reservation duration field in the reservation message.

21. The method as recited in claim 20 wherein the reservation message includes a negotiable field, specifying whether said first node is amenable to proposed changes in the reservation message.