Skip Ahead Routing in Wireless Ad Hoc Networks

• US 20120113896A1
• Filed: 09/20/2011
• Published: 05/10/2012
• Est. Priority Date: 11/10/2010
• Status: Abandoned Application

• Current Assignee: Telcordia Technologies Incorporated (Telefonaktiebolaget LM Ericsson)
• Original Assignee: Telcordia Technologies Incorporated (Telefonaktiebolaget LM Ericsson)
• Inventors: Karol, Mark
• Application Number:
  US13/237,513
• Publication Number:
  US 20120113896A1
• Time in Patent Office: Days
• US Class Current: 370/328
• CPC Class Codes: H04W 40/08 based on transmission power

Abstract

A wireless ad hoc network may be composed of several nodes that are coupled by communication links and configured dynamically. As the packet is transmitted from one node to the next node or hop in a predetermined route, a neighboring node, within the same transmission range, may hear the broadcasted transmission. If the neighboring node determines that a future hop on the route includes the neighboring node, the neighboring node may receive the packet at that time thereby skipping one or more hops along the route. The neighboring node may then forward the packet to the next node in the route.

Claims

1. A computer-implemented method, comprising:

providing a plurality of routes in a wireless ad hoc network, at least one route having an ordered sequence of hops, each hop is associated with a pair of nodes on the route;

receiving, at a neighboring node, a packet transmitted from a first node to a second node during transmission of the packet from the first node to the second node, the neighboring node being a node on the route after the second node; and

forwarding, by the neighboring node, the packet to a third node, the third node being a node on the route after the neighboring node.

2. The computer-implemented method of claim 1, further comprising:

receiving, at the neighboring node, the packet forwarded from the second node to the neighboring node; and

deleting the packet at the neighboring node.

3. The computer-implemented method of claim 1, wherein the packet is given a higher priority in transmission when forwarded to the third node.

4. The computer-implemented method of claim 1, further comprising:

transmitting, by the neighboring node, a notification to the second node that the neighboring node has already received the packet.

5. The computer-implemented method of claim 4, further comprising:

eliminating, by the second node, transmission of the packet to the neighboring node.

6. The computer-implemented method of claim 1, wherein the third node is the next node on the route after the neighboring node.

7. The computer-implemented method of claim 1, further comprising:

receiving, at the second node, a transmission forwarding the packet from the neighboring node to the third node; and

thwarting, at the second node, forwarding the packet to the neighboring node.

8. The computer-implemented method of claim 1, further comprising:

receiving, at the third node, the packet; and

forwarding the packet to the next node in the route.

9. A non-transitory computer-readable storage medium storing thereon processor-executable instructions, comprising:

a routing table containing a plurality of routes, each route having an ordered sequence of hops, each hop associated with a pair of nodes in a wireless ad hoc network; and

a skip-ahead routing module having processor-executable instructions that when executed enables a neighboring node to receive a packet during transmission of the packet from a first node to a second node which the neighboring node then forwards to a third node, the packet associated with a first route, the third node associated with a hop later in the first route than the neighboring node, the neighboring node associated with a hop later in the route than the second node and before the third node.

10. The non-transitory computer-readable storage medium of claim 9, wherein the third node is a next node in the first route after the neighboring node.

11. The non-transitory computer-readable storage medium of claim 9, wherein the skip-ahead routing module having further instructions that when executed enables the neighboring node to transmit the packet with a higher transmission priority than other transmissions.

12. The non-transitory computer-readable storage medium of claim 9, wherein the skip-ahead routing module having further instructions that when executed enables the neighboring node to notify the second node that the neighboring node received the packet.

13. The non-transitory computer-readable storage medium of claim 9, wherein the skip-ahead routing module having further instructions that when executed discards a received packet when having received the received packet, from another node.

14. The non-transitory computer-readable storage medium of claim 9, wherein the skip-ahead routing module having further instructions that when executed allows the second node to receive transmissions of the packet transmitted to the third node and to thwart forwarding the packet to the neighboring node.

15. The non-transitory computer-readable storage medium of claim 9, wherein the neighboring node is associated with a hop that is more than one hop away from the second node.

16. A network, comprising:

a plurality of nodes, each node coupled to a wireless communication link; and

a plurality of routes, each route having an ordered sequence of hops, each hop associated with a pair of nodes;

wherein a neighboring node is configured to receive a packet broadcast from a first node to a second node and to forward the packet to a third node, the packet having a route that includes the neighboring node as a node associated with a hop along the route after the second node and the third node as a node associated with a hop along the route after the neighboring node.

17. The network of claim 16, wherein the neighboring node is configured to notify the second node that the neighboring node has received the packet prior to the second node sending the packet to the neighboring node.

18. The network of claim 16, wherein the neighboring node is configured to not process the packet when transmitted by the second node.

19. The network of claim 16, wherein the neighboring node is a next hop on the route.

20. The network of claim 16, further comprising a fourth node, the fourth node configured to receive the packet broadcast from the neighboring node to the third node, the fourth node being a node associated with a hop along the route after the third node.