Multicasting in a network using neighbor information
First Claim
Patent Images
1. A method to multicast in a network comprising:
- determining using a processor a least amount of relay nodes to multicast a message from a source node to all other nodes in the network by using a neighbor matrix of the source node stored in the data link layer of the source node and used in Node Activation Multiple Access (NAMA) scheduling by;
designating a one-hop neighbor of the source node 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;
indicating in a field of the neighbor matrix associated with the exclusive one-hop neighbor that the exclusive one-hop neighbor 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 exclusive one-hop neighbor of the source node that the two-hop neighbor is covered; and
notifying one-hop neighbors of the source node that are selected as relay nodes of their selection as relay nodes.
1 Assignment
0 Petitions
Accused Products
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.
44 Citations
12 Claims
-
1. A method to multicast in a network comprising:
determining using a processor a least amount of relay nodes to multicast a message from a source node to all other nodes in the network by using a neighbor matrix of the source node stored in the data link layer of the source node and used in Node Activation Multiple Access (NAMA) scheduling by; designating a one-hop neighbor of the source node 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; indicating in a field of the neighbor matrix associated with the exclusive one-hop neighbor that the exclusive one-hop neighbor 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 exclusive one-hop neighbor of the source node that the two-hop neighbor is covered; and notifying one-hop neighbors of the source node that are selected as relay nodes of their selection as relay nodes. - View Dependent Claims (2, 3, 4, 5, 6, 7)
-
8. An article comprising:
a non-transitory 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 to multicast a message from a source node to all other nodes in the network by using a neighbor matrix of the source node stored in the data link layer of the source node and 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; 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; andnotifying one-hop neighbors of the source node that are selected as relay nodes of their selection as relay nodes. - View Dependent Claims (9)
-
10. An apparatus to multicast in a network, comprising:
-
circuitry to determine a least amount of relay nodes to multicast a a message from a source node to all other nodes in the network by using a neighbor matrix of the source node stored in the data link layer of the source node and 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; 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; andnotifying one-hop neighbors of the source node that are selected as relay nodes of their selection as relay nodes. - View Dependent Claims (11, 12)
-
Specification