초록 ▼

An apparatus and a method for routing data in a radio data communication system having one or more host computers, one or more intermediate base stations, and one or more RF terminals organizes the intermediate base stations into an optimal spanning-tree network to control the routing of data to and

An apparatus and a method for routing data in a radio data communication system having one or more host computers, one or more intermediate base stations, and one or more RF terminals organizes the intermediate base stations into an optimal spanning-tree network to control the routing of data to and from the RF terminals and the host computer efficiently and dynamically. Communication between the host computer and the RF terminals is achieved by using the network of intermediate base stations to transmit the data.

대표청구항 ▼

What is claimed is: 1. A multi-hop data communication network having RF capability comprising: a plurality of terminal nodes; and a plurality of bridging nodes that operate to, at least, dynamically create and revise communication pathways between nodes in the network, each of the bridging nodes in

What is claimed is: 1. A multi-hop data communication network having RF capability comprising: a plurality of terminal nodes; and a plurality of bridging nodes that operate to, at least, dynamically create and revise communication pathways between nodes in the network, each of the bridging nodes independently storing and maintaining local information that specifies how communication traffic should flow through that bridging node, and the plurality of bridging nodes, together, providing a specification for the communication pathways; where each of the bridging nodes, using polling messages with a backward learning technique, operate to, at least, independently create and maintain locally stored information to specify how communication traffic should flow through that bridging node. 2. The multi-hop data communication network of claim 1, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on communication link conditions. 3. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to receive messages from the terminal nodes that are based, at least in part, on the communication link conditions. 4. The multi-hop data communication network of claim 3, wherein the messages from the terminal nodes comprise information that is based, at least in part, on the communication link conditions. 5. The multi-hop data communication network of claim 3, wherein the messages from the terminal nodes are addressed to bridging nodes that are determined based, at least in part, on the communication link conditions. 6. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on communication link interference conditions. 7. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on communication link RF interference conditions. 8. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on communication bandwidth. 9. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on communication link data rate. 10. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on communication path loading conditions. 11. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on node loading conditions. 12. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on RF communication link stability. 13. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on detection of unattached nodes. 14. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on signal strength. 15. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on physical communication link type. 16. The multi-hop data communication network of claim 2, wherein the plurality of bridging nodes operate to dynamically create and revise communication pathways between nodes in the network based, at least in part, on physical movement of at least one of the plurality of terminal nodes. 17. The multi-hop data communication network of claim 2, wherein at least one of the bridging nodes operates to monitor communication link conditions. 18. The multi-hop data communication network of claim 2, wherein at least one of the terminal nodes operates to monitor communication link conditions. 19. The multi-hop data communication network of claim 1, wherein the polling message comprises a HELLO message. 20. The multi-hop data communication network of claim 1, wherein the polling message comprises a beacon message. 21. The multi-hop data communication network of claim 1, wherein the bridging nodes operate to transmit polling messages at substantially constant periodic intervals. 22. The multi-hop data communication network of claim 21, wherein the substantially constant periodic intervals comprise a calculated random component. 23. In a multi-hop data communication network having RF capability and a plurality of RF terminal nodes, a bridging node that operates to at least: dynamically create and revise communication pathways between nodes in the network; independently store and maintain local information that specifies how communication traffic should flow through the bridging node; and using polling messages with a backward learning technique, independently create and maintain locally stored information to specify how communication traffic should flow through the bridging node. 24. The bridging node of claim 23, wherein the polling messages comprise information that is based, at least in part, on communication link conditions. 25. The bridging node of claim 23, wherein using polling messages with a backward learning technique comprises receiving response messages corresponding to the polling messages, wherein the response messages are based, at least in part, on communication link conditions. 26. The bridging node of claim 25, wherein the response messages comprise information that is based, at least in part, on communication link conditions. 27. The bridging node of claim 25, wherein the response messages are addressed to the bridging node based, at least in part, on communication link conditions. 28. The bridging node of claim 23, wherein using polling messages with a backward learning technique comprises: periodically, at substantially regular intervals, transmitting a polling message; receiving a response message to the polling message from a second node; and in response to the received response message, entering information of the second node in a routing table. 29. The bridging node of claim 28, wherein the bridging node further operates to, at least, communicate a message indicative of the response message to a third node. 30. The method of claim 28, wherein the response message comprises an attach request. 31. The method of claim 28, wherein the response message is based, at least in part, on communication link conditions. 32. The method of claim 31, wherein the response message comprises information that is based, at least in part, on communication link conditions. 33. The method of claim 31, wherein the response message is addressed to the bridging node based, at least in part, on communication link conditions.