Method for Routing Ad-Hoc Signals

• US 20100238935A1
• Filed: 06/03/2010
• Published: 09/23/2010
• Est. Priority Date: 02/25/2002
• Status: Abandoned Application

• Current Assignee: Intel Corporation
• Original Assignee: Olsonet Communications Corporation
• Inventors: Sendrowicz, Gerry
• Application Number:
  US12/792,989
• Publication Number:
  US 20100238935A1
• Time in Patent Office: Days
• US Class Current: 370/392
• CPC Class Codes: H04W 40/02 Communication route or path selection, e.g. power-based or shortest path routing
• CPC Class Codes: H04W 40/248 Connectivity information update
• CPC Class Codes: H04W 40/28 for reactive routing
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

An ad-hoc network is a typically a dynamic collection of nodes capable of communicating therebetween without the aid of pre-established infrastructure. Ad-hoc networks differ from traditional networks in that the topology of interconnections between nodes is inherently dynamic and not fixed. Generally, the routing protocols belong to two groups: proactive and reactive. Proactive protocols attempt to maintain correct and up-to-date routing information at every node. Reactive protocols, in turn, collect necessary routing information only if a pair of nodes are to establish a communication. In accordance with embodiments of the invention a reactive ad-hoc network protocol is disclosed that uses controlled flooding to broadcast packets of information within the ad-hoc network. Furthermore, the ad-hoc network protocol does not maintain up-to-date routing information at every node in an ad-hoc network and does not utilize specific control messages to assure that packets within the ad-hoc network follow optimal paths.

Claims

1. A method of adjusting packet loading within a plurality of nodes forming a reactive ad-hoc network comprising:

(a) receiving at a node a packet of data from a source node intended for a destination node other than the receiving node, the packet of data comprising message data and header data;

(b) calculating a discard counter in dependence upon the header data,

(c) retrieving from a memory associated with the node an initial discard counter, the initial discard counter associated with receipt of a previous packet of data transmitted from the source node to the destination node and being the calculated discard counter for that previous packet of data;

(d) calculating a probability in dependence upon the discard counter and the initial discard counter; and

(e) determining whether to forward or discard the received packet of data in dependence upon the calculated probability.

2. A method according to claim 1 wherein;

at least one of step (d) and step (e) is performed only if a deterministic discard decision established in dependence upon at least the calculated discard counter determines to forward the packet of data.

3. A method according to claim 1 wherein;

the header data comprises data relating to mobility of packets of data within the reactive ad-hoc network as determined by an application in execution upon a processor associated with the source node.

4. A method according to claim 3 wherein;

the application establishes the data relating to mobility of packets of data in dependence upon at least one of a measure of physical node mobility, a measure of topology change, and a measure of packets loss within the reactive ad-hoc network.

5. A method according to claim 1 wherein;

the initial discard counter is recalculated upon receipt of a packet of data at the node transmitted between the source node and destination node via a communication path that indicates the previous path was sub-optimal.

6. A method according to claim 1 wherein;

the header data comprises data relating to the source node and the destination node for the packet of data, data relating to a number of hops already completed for the packet of data, data relating to mobility of packets of data within the reactive ad-hoc network transmitted from the source node to the destination node and the destination node to the source node, data relating to a number of hops between the source node and the destination node for a previous packet of data, and a unique identifier for the packet of data; and

the discard counter is determined in dependence upon at least the direction of the packet relative to the source node and destination node, a packet mobility factor in the direction of the packet, the number of hops from the source node to the second other node, the number of hops from the destination node to the second other node and the number of hops between the source node and destination node for a previous packet of data;

7. A method according to claim 6 wherein;

the initial discard counter is recalculated upon receipt of a packet of data at the node transmitted between the source node and destination node via a communication path that indicates the previous path has a number of hops between the source node and destination node that is lower than the number of hops between the source node and destination node for a previous packet of data.

8. A method of adjusting packet loading within a plurality of nodes forming a reactive ad-hoc network comprising:

(a) receiving at a node a packet of data from a source node intended for a destination node other than the receiving node, the packet of data comprising message data and header data, the header data comprising data relating to the source node and the destination node for the packet of data, data relating to a number of hops already completed for the packet of data, data relating to mobility of packets of data within the reactive ad-hoc network transmitted from the source node to the destination node and the destination node to the source node, data relating to a number of hops between the source node and the destination node for a previous packet of data, and a unique identifier for the packet of data;

(b) calculating a discard counter, the discard counter determined in dependence upon at least the direction of the packet relative to the source node and destination node, a packet mobility factor in the direction of the packet, the number of hops from the source node to the second other node, the number of hops from the destination node to the second other node and the number of hops between the source node and destination node for a previous packet of data;

(c) retrieving from a memory associated with the node an initial discard counter, the initial discard counter associated with receipt of a previous packet of data transmitted from the source node to the destination node and being the calculated discard counter for that previous packet of data;

(d) calculating a probability in dependence upon the discard counter and the initial discard counter; and

(e) determining whether to forward or discard the received packet of data in dependence upon the calculated probability.

9. A method according to claim 8 wherein;

at least one of step (d) and step (e) is performed only if a deterministic discard decision established in dependence upon at least the calculated discard counter determines to forward the packet of data.

10. A method according to claim 8 wherein;

the header data comprises data relating to mobility of packets of data within the reactive ad-hoc network as determined by an application in execution upon a processor associated with the source node.

11. A method according to claim 10 wherein;

the application establishes the data relating to mobility of packets of data in dependence upon at least one of a measure of physical node mobility, a measure of topology change, and a measure of packets loss within the reactive ad-hoc network.

12. A method according to claim 8 wherein;

the initial discard counter is recalculated upon receipt of a packet of data at the node transmitted between the source node and destination node via a communication path that indicates the previous path was sub-optimal.

13. A node forming part of a reactive ad-hoc network comprising:

(a) a processor;

(b) a memory in communication with the processor;

(c) a transceiver in communication with the processor for receiving signals and for transmitting signals, the signals transmitted and received via a wireless communication medium; and

(d) an application in execution upon the processor executing an ad-hoc communications protocol to communicate with at least one other node to form an ad-hoc network, the application;

(i) receiving from the transceiver a packet of data intended for a destination node other than the receiving node comprising message data and header data, the header data comprising data relating to a source node and a destination node for the packet of data, data relating to a number of hops already completed for the packet of data, data relating to mobility of packets of data within the reactive ad-hoc network transmitted from the source node to the destination node and the destination node to the source node, data relating to a number of hops between the source node and the destination node for a previous packet of data, and a unique identifier for the packet of data;

(ii) calculating a discard counter, the discard counter determined in dependence upon at least the direction of the packet relative to the source node and destination node, a packet mobility factor in the direction of the packet, the number of hops from the source node to the second other node, the number of hops from the destination node to the second other node and the number of hops between the source node and destination node for a previous packet of data;

(iii) retrieving from a memory associated with the node an initial discard counter, the initial discard counter associated with receipt of a previous packet of data transmitted from the source node to the destination node and being the calculated discard counter for that previous packet of data;

(iv) calculating a probability in dependence upon the discard counter and the initial discard counter; and

(v) determining whether to forward or discard the received packet of data in dependence upon the calculated probability.

14. A method according to claim 13 wherein;

at least one of calculating a probability and the determination is performed only if a deterministic discard decision established in dependence upon at least the calculated discard counter determines to forward the packet of data.

15. A method according to claim 13 wherein;

the header data comprises data relating to mobility of packets of data within the reactive ad-hoc network as determined by an application in execution upon a processor associated with the source node.

16. A method according to claim 13 wherein;

the application establishes the data relating to mobility of packets of data in dependence upon at least one of a measure of physical node mobility, a measure of topology change, and a measure of packets loss within the reactive ad-hoc network.

17. A method according to claim 13 wherein;

the initial discard counter is recalculated upon receipt of a packet of data at the node transmitted between the source node and destination node via a communication path that indicates the previous path was sub-optimal.

18. A node forming part of a reactive ad-hoc network comprising:

(a) a processor;

(b) a memory in communication with the processor;

(c) a transceiver in communication with the processor for receiving signals and for transmitting signals, the signals transmitted and received via a wireless communication medium; and

(d) an application in execution upon the processor executing an ad-hoc communications protocol to communicate with at least one other node to form an ad-hoc network, the application;

(i) receiving at a node a packet of data from a source node intended for a destination node other than the receiving node, the packet of data comprising message data and header data;

(ii) calculating a discard counter in dependence upon the header data,

(iii) retrieving from a memory associated with the node an initial discard counter, the initial discard counter associated with receipt of a previous packet of data transmitted from the source node to the destination node and being the calculated discard counter for that previous packet of data;

(iv) calculating a probability in dependence upon the discard counter and the initial discard counter; and

(v) determining whether to forward or discard the received packet of data in dependence upon the calculated probability.

19. A method according to claim 18 wherein;

at least one of step (d) and step (e) is performed only if a deterministic discard decision established in dependence upon at least the calculated discard counter determines to forward the packet of data.

20. A method according to claim 18 wherein;

the header data comprises data relating to mobility of packets of data within the reactive ad-hoc network as determined by an application in execution upon a processor associated with the source node.

21. A method according to claim 18 wherein;

the application establishes the data relating to mobility of packets of data in dependence upon at least one of a measure of physical node mobility, a measure of topology change, and a measure of packets loss within the reactive ad-hoc network.

22. A method according to claim 18 wherein;

the initial discard counter is recalculated upon receipt of a packet of data at the node transmitted between the source node and destination node via a communication path that indicates the previous path was sub-optimal.

23. A method according to claim 18 wherein;

the header data comprises data relating to the source node and the destination node for the packet of data, data relating to a number of hops already completed for the packet of data, data relating to mobility of packets of data within the reactive ad-hoc network transmitted from the source node to the destination node and the destination node to the source node, data relating to a number of hops between the source node and the destination node for a previous packet of data, and a unique identifier for the packet of data; and

the discard counter is determined in dependence upon at least the direction of the packet relative to the source node and destination node, a packet mobility factor in the direction of the packet, the number of hops from the source node to the second other node, the number of hops from the destination node to the second other node and the number of hops between the source node and destination node for a previous packet of data;

24. A method according to claim 23 wherein;

the initial discard counter is recalculated upon receipt of a packet of data at the node transmitted between the source node and destination node via a communication path that indicates the previous path has a number of hops between the source node and destination node that is lower than the number of hops between the source node and destination node for a previous packet of data.