System and method for routing a data packet in a wireless network, computing system in a system for routing a data packet in a wireless network, and method for routing a data packet in a computing system

• US 20090279481A1
• Filed: 07/09/2007
• Published: 11/12/2009
• Est. Priority Date: 07/10/2006
• Status: Abandoned Application

• Current Assignee: Miraveo, Inc.
• Original Assignee: Miraveo, Inc.
• Inventors: Fusté Vilella, David, Morillo Pozo, Julián David, García Vidal, Jorge
• Application Number:
  US12/373,219
• Publication Number:
  US 20090279481A1
• Time in Patent Office: Days
• US Class Current: 370/328
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/22 Alternate routing
• CPC Class Codes: H04L 45/28 using route fault recovery
• CPC Class Codes: H04W 40/28 for reactive routing
• CPC Class Codes: H04W 40/38 adapting due to varying relative distances between nodes
• CPC Class Codes: H04W 88/04 adapted for relaying to or from another terminal or user

Abstract

An embodiment of the present invention provides a method and system for detecting the inability of the designated intermediate node (A₁; A₂) to forward, via itself, the data packet from the previous node to the designated intermediate node, to the node after the designated intermediate node according to the forwarding path; and a method and system for obtaining a set of cooperating nodes of the designated intermediate node (A₁; A₂), from among all the nodes of the network (N₀, . . . , N₁₅), to forward, via itself, the data packet from the previous node to the designated intermediate node to the node after the designated intermediate node according to the forwarding path, in case that the designated intermediate node is unable to do so.

A system which allows using the resources of the nodes next to the nodes of the forwarding path for increasing their communication capacity and processing is achieved.

Claims

1. A system for forwarding at least one data packet in a wireless communication network, from an origin node (S) to a destination node (D), through at least one node (A1, A2) of the network which acts as a designated intermediate node, generating a data packet forwarding path (S, A1, A2, D), the system comprising means for detecting the incapacity of the designated intermediate node (A1;

A2) to forward through itself the data packet from the previous node to the next node, as established by the data packet forwarding path; and

means for determining, among a set of nodes (N0, . . . , N15), a group of cooperating nodes (L1, L2) of the designated intermediate node, for forwarding, through itself, the data packet from the previous node to the next node as established in the data packet forwarding path, in case that the incapacity of the designated intermediate node is detected.

2. A system according to claim 1 further comprising means for obtaining a plurality of nodes (B1;

B2) of potential cooperating nodes for the designated intermediate node.

3. A system according to claim 2, the means for obtaining the plurality (B1;

B2) of potential cooperating nodes of the designated intermediate node (A1;

A2) comprising means for obtaining the plurality of nodes which are within coverage range of the designated intermediate node, and means for selecting, among this plurality of nodes, the plurality of potential cooperating nodes of the designated intermediate node, in such a way that this plurality of potential cooperating nodes have optimal conditions for acting as cooperating nodes of the designated intermediate node.

4. A system according to claim 2, the means for determining the group (L₁;

L₂) of cooperating nodes of the designated intermediate node (A1;

A2) comprising means for obtaining, from the plurality (B₁;

B₂) of potential cooperating nodes, the subset of nodes which are within coverage range of the previous node of the designated intermediate node as established by the data packet forwarding path, when said node previous to the designated intermediate node has transmitted the data packet; and

means for selecting, among this set of nodes, the group of cooperator nodes of the designated intermediate node.

5. A system according to claim 2, the means for determining the group (L₁;

L₂) of cooperating nodes of the designated intermediate node (A1;

A2) comprising means for obtaining, from the plurality (B₁;

B₂) of potential cooperating nodes, the subset of nodes which are within coverage range of the previous node to the designated intermediate node as established by the data packet forwarding path, when the previous node to the designated intermediate node has sent the data packet, means for obtaining, from said subset of nodes, a second subset of nodes, in such a way that the node after the designated intermediate node, as established by the data packet forwarding path, is within coverage of said second subset of nodes, and means for selecting, among this second subset of nodes, the group of cooperating nodes of the designated intermediate node.

6. A system according to claim 2, wherein the transmission of the data packet made by the previous node to the designated intermediate node is performed, at the same time, to both the designated intermediate node (A1;

A2) and to the set (B1;

B2) of potential cooperating nodes of the designated intermediate node.

7. A system according to claim 2, wherein the means for obtaining the set (B1;

B2) of potential cooperating nodes of the designated intermediate nodes (A1;

A2), operate at predetermined time periods.

8. A system according to claim 2, the means for obtaining the set (B1;

B2) of potential cooperating nodes of the designated intermediate nodes (A1;

A2) comprising means for detecting the inability of the designated intermediate node.

9. A system according to claim 2, wherein at least one of the nodes of the set (B1;

B2) of potential cooperating nodes of the designated intermediate node (A1;

A2) comprises means for communicating the incapacity of the designated intermediate node to the previous node of the designated intermediate node, as established in the forwarding path of the data packet.

10. A system according to claim 1, wherein at least one of the nodes in the routing path (S, A1;

A2, D) comprises routing information.

11. A system according to claim 2, wherein the data packet transmitted to the designated intermediate node (A1;

A2) and to its set (B1;

B2) of potential cooperating nodes comprises a flag or indicator which informs the nodes of the set of potential cooperating nodes that they must cooperate in the forwarding of said data packet.

12. A system according to claim 2, wherein the designated intermediate node (A1;

A2) comprises means for distributing to its set of potential cooperating nodes (B1;

B2), the required routing information.

13. A system according to claim 2 further comprising means for detecting the incorrect operation of a node of the set (B1;

B2) of potential cooperating nodes.

14. A system according to claim 2, wherein the set (B1;

B2) of potential cooperating nodes comprises an identifier of the set (B1;

B2).

15. A system according to claim 14, wherein the routing information of at least one of the nodes of the data packet path (S, A1;

A2, D)comprises the identifier of its set (B1;

B2) of potential cooperating nodes.

16. A system according to claim 2, further comprising a mechanism which allows a cooperating node belonging to the set (B1;

B2) of potential cooperating nodes, to know that it does not receive correctly anymore the messages of the designated intermediate node of this set (B1;

B2) of potential cooperating nodes.

22. A computing system in a system according to claim 1, wherein the computing system is adequate for operating as a cooperating node of the designated intermediate node (A1;

A2), comprising means for detecting the incapacity of the designated intermediate node for forwarding through it the data packet from the previous node to this designated intermediate node to the next node, as established by the data packet forwarding path, and means for receiving the data packet from the previous node to the designated intermediate node and transmitting it to the next node, as established by the data packet forwarding path, in case that the incapacity of the designated intermediate node is detected.

23. A system according to claim 22, the means for transmitting the data packet to the next node of the designated intermediate node, comprising means for introducing in the data packet an indicator which informs to the set (B1;

B2) of potential cooperator nodes of the designated intermediate node (A1;

A2) that must cooperate on the forwarding of the data packet).

24. A method for forwarding at least one data packet in a computing system according to claim 22, comprising the steps of:

D) Receiving the data packet from the previous node of the designated intermediate node as established by the data packet forwarding path;

A) Detecting the incapacity of the designated intermediate node (A1;

A2) to forward through itself the data packet from the previous node of the designated intermediate node to the next node of the designated intermediate node as established by the data packet forwarding path;

E) In case of a positive detection in step (A), transmitting the data packet to the next node of the designated intermediate node.

25. A computer program comprising instructions which are executed in a computing system for performing the method according to claim 24.

26. A computer program according to claim 25 wherein the computer program is stored in a storage media.

27. A computer program according to claim 25, wherein the computer program is carried by a carrier wave.

17. A method for forwarding at least one data packet in a wireless network, from an origin node (S) to a destination node (D), through at least one network node (A1;

A2) which acts as a designated intermediate node, building a data packet forwarding path (S, B1;

B2, D), the method comprising;

A) Detecting the incapacity of the designated intermediate node to forward through itself the data packet from the previous node of the designated intermediate node to the next node of the designated intermediate node as established by the data packet forwarding path;

B) In case of a positive detection in step (A), determining a group (L1;

L2) of cooperating nodes of the designated intermediate node, among a plurality of network nodes, to forward through it the data packet from the previous node of the designated intermediate node, to the next node, as established by the data packet forwarding path.

18. A method according to claim 17, comprising a step (C) of obtaining a set (B1, B2) of potential cooperating nodes of the designated intermediate node.

19. A method according to claim 18, wherein step (C) of obtaining a set (B1, B2) of potential cooperating nodes of the designated intermediate node, comprises the steps of:

C.1) Obtaining the set of nodes which are within coverage range of the designated intermediated node;

C.2) Selecting, among said set of nodes, the set (B1, B2) of potential cooperating nodes of the designated intermediate node, in such a way that this set of potential cooperating nodes fulfill optimal conditions for acting as cooperating nodes of the designated intermediate node.

20. A method according to claim 18, wherein step (B) of determination of the group (L1;

L2) of cooperating nodes of the designated intermediate node (A1;

A2), comprises the steps of;

B.1) Obtaining, among the set (B1, B2) of potential cooperating nodes, the subset of nodes which are within coverage range with the previous node to the designated intermediate node as established by the data packet forwarding path, when the previous node of the designated intermediate node has transmitted the data packet;

B.2) Selecting, among this subset of nodes, the group of cooperating nodes of the designated intermediate node.

21. A method according to claim 18, wherein step (B) of determination of the group of cooperating nodes of the designated intermediate node (A1;

A2) comprises the steps of;

B.3) Obtaining, from the set (B1, B2) of potential cooperating nodes, the subset of nodes which are within coverage range with the previous node to the designated intermediate node (A1;

A2) as established by the data packet forwarding path, when the previous node of the designated intermediate node has transmitted the data packet;

B.4) Obtaining, from this subset of nodes, a second subset of nodes, in such a way that the next node to the designated intermediate node (A;

A2) as established in the data packet routing path, is within coverage range of the nodes of the second subset of cooperating nodes of the designated intermediate node;

B.5) Selecting, among this second subset of nodes, the group of cooperating nodes of the designated intermediate node.