METHOD FOR SELECTING RELAY IN WIRELESS BROADCAST AD HOC NETWORKS

• US 20100208739A1
• Filed: 06/13/2007
• Published: 08/19/2010
• Est. Priority Date: 06/15/2006
• Status: Abandoned Application

• Current Assignee: Rafael - Armament Development Authority Ltd.
• Original Assignee: Rafael - Armament Development Authority Ltd.
• Inventors: Ofri, Orit
• Application Number:
  US12/304,774
• Publication Number:
  US 20100208739A1
• Time in Patent Office: Days
• US Class Current: 370/400
• CPC Class Codes: H04L 45/124 using a combination of metrics
• CPC Class Codes: H04W 40/20 based on geographic position or location
• CPC Class Codes: H04W 40/24 Connectivity information management, e.g. connectivity discovery or connectivity update

Abstract

The method of the invention is implemented in ad hoc communications network employing at least two-hop routing and wherein each node in the network employs an omnidirectional send/receive capability. Each node keeps a near neighbour database (NND) updated by receiving of messages. Each Othernode in the network, the message of which was received by Mynode in a time period T, is a candidate for becoming a relay for transmitting Mynode'"'"'s messages. The probability of an Othernode to become a relay for Mynode is higher for a larger amount of candidates Othernode has in its NND. The probability for the Othernode to become a relay is higher the larger its distance from Mynode.

Claims

1. An ad hoc communications network employing multi-hop routing, wherein each node employs an omnidirectional send/receive capability and keeps a near neighbour database (NND) updated by receiving of messages, wherein each Othernode the message of which was received by Mynode in a time period T, is a candidate for becoming a relay for transmitting Mynode'"'"'s messages, and wherein the probability of an Othernode to become a relay for Mynode is higher for a larger amount of candidates said Othernode has in its NND, and the probability for said Othernode to become a relay is higher the larger its distance from Mynode.

2. An ad hoc communications network as in claim 1, wherein said NND is updated using at least maintenance messages sent periodically by each node.

3. An ad hoc communications network as in claim 1 wherein the bandwidth available is limited.