Method and apparatus for routing messages in a network of nodes with minimal resources
First Claim
1. A method for routing data packets in a network that includes a plurality of nodes, including the steps of:
- assigning a logical address to each of the nodes; and
,instructing each of the nodes, upon receipt of a data packet, to compare its respective logical address with a message address contained in the received data packet, and to discard, process, or transmit the received data packet solely on the basis of this comparison, and without using a routing table.
2 Assignments
0 Petitions
Accused Products
Abstract
A system that includes a multihop broadcast network of nodes that have a minimum of hardware resources, such as memory and processing power. The network is configured by gathering information concerning which nodes can communicate with each other using flooding with hop counts and parent routing protocols. A partitioned spanning tree is created and node addresses are assigned so that the address of a child node includes as its most significant bits the address of its parent. This allows the address of the node to be used to determine if the node is to process or resend the packet so that the node can make complete packet routing decisions using only its own address.
230 Citations
20 Claims
-
1. A method for routing data packets in a network that includes a plurality of nodes, including the steps of:
-
assigning a logical address to each of the nodes; and
,instructing each of the nodes, upon receipt of a data packet, to compare its respective logical address with a message address contained in the received data packet, and to discard, process, or transmit the received data packet solely on the basis of this comparison, and without using a routing table. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A network, including:
-
a plurality of nodes, including a network control node and a plurality of other nodes; wherein the network control node is programmed to assign a logical address to each of the other nodes; and
,wherein each of the other nodes is programmed to compare its respective logical address with a message address contained in a received data packet, and to discard, process, or transmit the received data packet solely on the basis of this comparison, and without using a routing table. - View Dependent Claims (17, 18, 19, 20)
-
Specification