초록 ▼

A random multiple path tabular routing method for routing data packets within a wireless, packet-hopping network, e.g., an intelligent lighting control system, which includes the steps of programming a plurality of the individual nodes to each serve as a repeater node for at least one other individu

A random multiple path tabular routing method for routing data packets within a wireless, packet-hopping network, e.g., an intelligent lighting control system, which includes the steps of programming a plurality of the individual nodes to each serve as a repeater node for at least one other individual node, the repeater nodes forming multiple programmed communication paths between the central node and each of at least selected ones of the individual nodes, and randomly hopping the data packets along the programmed communication paths. The repeater nodes are preferably programmed on the basis of nodal connectivity information obtained during a network initialization process. The repeater nodes are preferably programmed by storing compact partial routing tables in a memory portion of each of these repeater nodes. This routing method is partially deterministic or tabular in that routing tables are used to preprogram the multiple communication paths, and partially random, in that the data packets are randomly hopped along these preprogrammed multiple paths, rather than being hopped along preprogrammed singular paths. Each of the individual nodes preferably includes a first address table and a second address table stored in its respective memory. The step of programming is preferably carried out by storing in the first address table of each of the individual nodes at least its own address, and storing in the second address table of each of the individual nodes the address of each node for which that node is selected to serve as a repeater node. The step of randomly hopping the data packets is preferably carried out by programming each of the nodes which receives a data packet to compare the address contained in the address byte of that data packet with the address(es) stored in its first address table, and if a match is detected, to respond to that data packet, and to compare the address contained in the address byte of that data packet with the address(es) stored in its second address table, and if a match is detected, to repeat that data packet. All data communications are preferably carried out in accordance with a CSMA protocol. The invention also relates to a network which is programmed to implement this routing method.

대표청구항 ▼

[ What is claimed is:] [1.] A method for routing data packets within a wireless network including a central node and individual nodes, comprising the steps of:programming a plurality of said individual nodes to each serve as a repeater node for at least one other one of said individual nodes, said i

[ What is claimed is:] [1.] A method for routing data packets within a wireless network including a central node and individual nodes, comprising the steps of:programming a plurality of said individual nodes to each serve as a repeater node for at least one other one of said individual nodes, said individual nodes programmed to serve as a one of said repeater nodes forming at least two programmed communication paths between said central node and each of at least selected ones of said individual nodes; andrandomly hopping data packets along said programmed communication paths.