MULTICASTING IN A NETWORK USING NEIGHBOR INFORMATION

• US 20100040079A1
• Filed: 07/24/2009
• Published: 02/18/2010
• Est. Priority Date: 08/15/2008
• Status: Active Grant

• Current Assignee: Raytheon Company (Rtx Corporation)
• Original Assignee: Raytheon Company (Rtx Corporation)
• Inventors: Johnnie, Darryn A., Park, Sung I.
• Granted Patent: US 8,175,101 B2
• Time in Patent Office: Days
• US Class Current: 370/432
• CPC Class Codes: H04L 12/1877 Measures taken prior to transmission
• CPC Class Codes: H04L 12/1881 with schedule organisation, e.g. priority, sequence management
• CPC Class Codes: H04L 12/189 in combination with wireless systems selective distribution or broadcast in wireless communication networks H04W4/06
• CPC Class Codes: H04L 45/16 Multipoint routing
• CPC Class Codes: H04L 45/32 Flooding denial of service attacks H04L63/1458
• CPC Class Codes: H04W 40/22 using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
• CPC Class Codes: H04W 40/246 Connectivity information discovery

Abstract

In one aspect, a method to multicast in a network includes determining using a processor a least amount of relay nodes for use in multicasting a message to nodes in the network by using a neighbor matrix of a source node used in Node Activation Multiple Access (NAMA) scheduling. The method may include designating a one-hop neighbor that exclusively accesses the two-hop neighbor of the source node as a relay node. The method may also include designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node.

Claims

1. A method to multicast in a network comprising:

determining using a processor a least amount of relay nodes for use in multicasting a message to nodes in the network by using a neighbor matrix of a source node used in Node Activation Multiple Access (NAMA) scheduling.

2. The method of claim 1 further comprising determining an exclusive one-hop neighbor of the source node.

3. The method of claim 2, further comprising indicating in a field of the neighbor matrix associated with the exclusive one-hop neighbor that the exclusive one-hop neighbor is covered.

4. The method of claim 2, further comprising determining a two-hop neighbor of the source node that is accessed exclusively by the exclusive one-hop neighbor of the source node.

5. The method of claim 4, further comprising designating the exclusive one-hop neighbor of the source node as a relay node.

6. The method of claim 4, further comprising indicating in a field of the neighbor matrix associated with the two-hop neighbor of the source node that is accessed exclusively by the exclusive one-hop neighbor of the source node that the two-hop neighbor is covered.

7. The method of claim 4, further comprising designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node.

8. The method of claim 7 wherein designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node comprises designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node that do not have a field in the neighbor matrix of the source node indicating that the two-hop neighbors are already covered.

9. The method of claim 1, further comprising storing the neighbor matrix in a data link layer.

10. The method of claim 1, further comprising notifying one-hop neighbors of the source node that are selected as relay nodes of their selection as relay nodes.

11. The method of claim 1, further comprising:

at a second node being a one-hop neighbor of the source node, determining a least amount of relay nodes for use in multicasting a message nodes in the network by using a neighbor matrix of the second node by;

designating a one-hop neighbor that exclusively accesses a two-hop neighbor of the second node as a relay node;

designating a one-hop neighbor of the second node with accessibility to a maximum number of two-hop neighbors of the second node as a relay node; and

notifying one-hop neighbors of the second node that are selected as relay nodes of their selection as relay nodes.

12. The method of claim 1, further comprising connecting the nodes in the network by links wherein at least one of the links is a wireless link.

13. The method of claim 1, further comprising providing each node with a neighbor matrix which is maintained by each node for NAMA scheduling.

14. The method of claim 13 wherein providing each node with a neighbor matrix comprises providing each node with a neighbor matrix which identifies one-hop neighbors and two-hop neighbors.

15. The method of claim 14 wherein providing each node with a neighbor matrix comprises providing each node with a neighbor matrix in a table format that indicates a neighbor relationship between two nodes by having a nonzero value in an entry of the table corresponding to a row and a column associated with the two nodes.

16. An article comprising a machine-readable medium that stores executable instructions to multicast in a network, the instructions causing a machine to determine a least amount of relay nodes for use in multicasting a message to nodes in the network by using a neighbor matrix of a source node used in Node Activation Multiple Access (NAMA) scheduling by:

designating a one-hop neighbor that exclusively accesses a two-hop neighbor of the source node as a relay node;

designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node; and

notifying one-hop neighbors of the source node that are selected as relay nodes of their selection as relay nodes.

17. The article of claim 16, further comprising instructions causing a machine to:

indicating in a field of the neighbor matrix associated with the one-hop neighbor that exclusively accesses a two-hop neighbor of the source node that the one-hop neighbor that exclusively accesses a two-hop neighbor of the source node is covered.

indicating in a field of the neighbor matrix associated with the two-hop neighbor of the source node that is accessed exclusively by the one-hop neighbor of the source node that the two-hop neighbor is covered.

18. The article of claim 16, further comprising at a second node being a one-hop neighbor of the source node instructions causing a machine to:

designate a one-hop neighbor that exclusively accesses a two-hop neighbor of the second node as a relay node;

designate a one-hop neighbor of the second node with accessibility to a maximum number of two-hop neighbors of the second node as a relay node; and

notify one-hop neighbors of the second node that are selected as relay nodes of their selection as relay nodes.

19. An apparatus to multicast in a network, comprising:

circuitry to determine a least amount of relay nodes for use in multicasting a message to nodes in the network by using a neighbor matrix of a source node used in Node Activation Multiple Access (NAMA) scheduling by;

designating a one-hop neighbor that exclusively accesses a two-hop neighbor of the source node as a relay node;

designating a one-hop neighbor of the source node with accessibility to a maximum number of two-hop neighbors of the source node as a relay node; and

notifying one-hop neighbors of the source node that are selected as relay nodes of their selection as relay nodes.

20. The apparatus of claim 19 wherein the circuitry comprises at least one of a processor, a memory, programmable logic and logic gates.

21. The apparatus of claim 19, further comprising circuitry to:

indicate in a field of the neighbor matrix associated with the one-hop neighbor that exclusively accesses a two-hop neighbor of the source node that the one-hop neighbor that exclusively accesses a two-hop neighbor of the source node is covered.

indicate in a field of the neighbor matrix associated with the two-hop neighbor of the source node that is accessed exclusively by the one-hop neighbor of the source node that the two-hop neighbor is covered.

22. The apparatus of claim 19, further comprising at a second node being a one-hop neighbor of the source node circuitry to:

designate a one-hop neighbor that exclusively accesses a two-hop neighbor of the second node as a relay node;

designate a one-hop neighbor of the second node with accessibility to a maximum number of two-hop neighbors of the second node as a relay node; and

notify one-hop neighbors of the second node that are selected as relay nodes of their selection as relay nodes.