Communication network providing wireless and hard-wired dynamic routing

Information

  • Patent Grant
  • 7907577
  • Patent Number
    7,907,577
  • Date Filed
    Monday, May 13, 2002
    22 years ago
  • Date Issued
    Tuesday, March 15, 2011
    13 years ago
Abstract
A data communication network for providing dynamic routing through both wireless and wired subnetworks to support wireless communication devices and wired remote stations is disclosed. In the wireless network, the wireless communication devices can be mobile RF terminals, while the wired remote stations might be personal computers attached to a wired subnet, such as an ethernet coaxial cable. The wireless network architecture utilizes a spanning tree configuration which provides for transparent bridging between wired subnets and the wireless subnets. The spanning tree configuration provides dynamic routing to and from wireless communication devices and remote stations attached to standard IEEE 802 LANs.
Description
INCORPORATION BY REFERENCE

Applicant hereby incorporates by reference the following patent applications in their entirety:


1) U.S. application Ser. No. 08/238,090, filed May 4, 1994, by Robert C. Meier;


2) U.S. application Ser. No. 08/177,738, filed Jan. 4, 1994, by Robert C. Meier;


3) U.S. application Ser. No. 08/147,766, filed Nov. 4, 1993, by Robert C. Meier;


4) U.S. application Ser. No. 08/073,142, filed Jun. 4, 1993, by Robert C. Meier;


5) U.S. application Ser. No. 08/058,905, filed May 6, 1993, by Robert C. Meier;


6) U.S. application Ser. No. 07/769,425, filed Oct. 1, 1991, by Meier et al.; and


7) PCT application Ser. No. PCT/US92/08610, filed Oct. 1, 1992, by Meier et al.


BACKGROUND OF THE INVENTION

The present invention relates to a wireless and wired communication network used to maintain communication pathways among wireless communication devices and remote stations. As is well known, wired local area networks (“LANs”), such as ethernet utilizing coaxial or twisted pair cabling (“wiring”), provide communication among remote stations, such as personal computers, which are commonly wired to a wired LAN. Hereinafter, a wired LAN is referred to as a “wired subnet”. To maintain communication beyond the wired range of ethernet, for example, bridging devices are employed to route information between one wired section of ethernet to another wired section. The bridging devices forward communication from one side of the bridging device onto the other, and vice versa. Smarter bridging devices are also known which keep track of the location of the remote stations so that forwarding only occurs when necessary.


As is also well known, in typical wireless communication networks, wireless communication generally occurs directly between two or more wireless terminals. To overcome transmission range limitations, such wireless networks have included wireless relaying transceivers to relay received communication, extending the range at which communication can be maintained. However, depending on the mode of wireless communication, many wireless relaying transceivers may be needed to adequately serve the network requirements.


In earlier wireless communication systems, the wireless relaying transceivers were also used to manage communication among a variety of wireless communication devices. Such relaying transceivers have been called base stations. The base station were typically connected directly to a host computer through multi-dropped connections to an ethernet communication line. To communicate between a wireless communication device and a host computer, in such a system, the wireless communication device sends data to a base station, and the base station passes the data along a hard-wired (“wired”) link to the host computer.


In order to cover a larger area with a wireless communication system and to take advantage of the de-regulation of the spread-spectrum radio frequencies, later-developed wireless communication systems are organized into layers of base stations. As in earlier wireless communications systems, a typical system includes multiple base stations which communicate directly with wireless terminals and the host computer.


In such wireless networks, difficulties often arise in maintaining the integrity of wireless communications. The wireless communication network must be able to handle both wireless and wired connectivity, efficient routing of data information, wireless communication device mobility, and interference from many different sources.


Customarily, wired local area networks support wireless communication devices that occupy fixed locations. Message traffic to and from such devices are routed via paths that do not change with time. Absence of a communication link to a device reflects a fault condition, i.e., a breakdown in some network component.


Thus, one object of the present invention is to route data through a wired and wireless communication network efficiently, dynamically, and without looping.


Another object of the present invention is to make the routing of data transparent to wireless terminals and remote stations located on IEEE 802.3 type subnets.


It is a further object of the present invention for the network to be capable of handling wireless communication device mobility and lost network nodes with minimal impact on the entire data communication system.


It is a still further object of the invention to allow wireless mobile computing devices, a type of wireless communication device, to move freely within wireless networks consisting of many relay nodes while transparently maintaining network connectivity with a plurality of wired subnets.


SUMMARY OF THE INVENTION

The present invention solves many of the foregoing problems using a communication network comprising two wired subnets, a wired access point connected to each of the subnets, and a plurality of intermediate wireless access points. The plurality of intermediate wireless access points provide a wireless pathway between the wired access points connected to the two subnets. Together, the two wired access points and the plurality of intermediate wireless access points form a spanning tree which interconnects the two subnets.


In another embodiment of the invention, the network may also comprise a plurality of terminal nodes which utilize the wired access points and the plurality of intermediate wireless access points to communicate on the network.


In a further embodiment of the invention, the network may also comprise a remote station attached to each of the two wired subnets. The wired access points and the plurality of intermediate wireless access points maintain communication connectivity between the two remote stations. In addition, the network may further comprise a wireless communication device which utilizes the two wired access points and the plurality of intermediate wireless access points to communicate with the two remote stations.


In a still further embodiment, the network may also comprise a third subnet and a third wired access point connected thereto. The third wired access point participates in the spanning tree, and, along with the other two wired access points and the plurality of intermediate wireless access points, communicatively interconnects the three wired subnets. The network may also comprise a plurality of wireless communication devices which utilize the three wired access points and the plurality of intermediate wireless access points to communicate with the three subnets.


The full details of the subject invention will become apparent from the following detailed description taken in conjunction with the drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates the overall open wireless local area network (OWL) architecture according to the present invention.



FIG. 2 shows an exemplary expanded configuration of FIG. 1, providing additional detail of the OWL radio network.



FIG. 3 illustrates the MAC protocol stacks used in an exemplary configuration of the present invention to provide for communication between two terminal nodes via a relay node.



FIG. 4 illustrates an OWL bridge protocol stack used by each wireless domain access point (WDAP), an OWL bridge, to bridge the OWL radio network with an 802 type wired subnet, in an embodiment according to the present invention.



FIG. 5 is a data flow diagram illustrating how data flows through the bridge protocol stack of FIG. 4.



FIG. 6 illustrates an exemplary configuration of the OWL architecture according to one embodiment of the present invention.



FIG. 7 illustrates an alternate embodiment of the present invention wherein a WDAPs participates in more than one OWL radio network.



FIG. 8 is a diagram illustrating yet another variation of the OWL architecture according to another embodiment of the present invention wherein two OWL radio networks are used.





DETAILED DESCRIPTION OF THE INVENTION


FIG. 1 illustrates the overall open wireless local area network (OWL) architecture according to the present invention. Specifically, per IEEE (Institute of Electrical and Electronic Engineers) 802.3 Wired Local Area Network (LAN) Specifications, two subnets, a wired subnet 101 and a remote, wired subnet 107 are illustrated. The subnets 101 and 107 are wired LAN's built in accordance with the IEEE 802 specifications. According to the present invention, a third subnet, a wireless subnet 105, transparently interconnects the wired subnets 101 and 107. The wireless subnet 105 is referred to herein as an OWL radio network. Moreover, for reference herein, the wireless subnet 105 and the remote, wired subnet 107, together are referred to as an OWL subnet 103. Although, the wired subnet 101 is not part of the OWL subnet 103, it constitutes a distribution LAN for the OWL subnet 103.


Depending on the specific implementation, an OWL radio network can function (i) as a stand-alone LAN to support wireless communication between wireless communication devices, (ii) as a wireless subnet to a wired LAN to provide wireless access to and between wireless communication devices, (iii) as a wireless subnet to a wired LAN to provide access to remote wired subnets, or (iv) as a wireless subnet to a wired LAN to provide access between the wired LAN, remote wired subnets and wireless communication devices. For example, as illustrated, the wireless subnet 105 provides for communication between the wired subnet 101, the remove subnet 107, and wireless communication devices (not shown in FIG. 1) within the wireless subnet 105.



FIG. 2 shows an exemplary expanded configuration of FIG. 1, providing additional detail of the OWL radio network, the wireless subnet 105. The wireless subnet 105 provides access to the wired subnet 101, the remote wired subnet 107, and wireless communication devices, such as mobile radio-equipped computers (MRCs) 116 and 118. Other types of wireless communication devices include, but are not limited to, radio-equipped printers or other peripherals, stationary radio-equipped computers, pagers, etc. In addition, although radio frequency wireless communication is a preferred embodiment, other forms of wireless communication, such as infrared transmissions, might also be used.


The OWL radio network, such as the wireless subnet 105, provides for wireless transparent bridging via several types of wireless domain access points. In particular, each OWL subnet has a single primary wireless domain access point (WDAPp), such as the WDAPp 113. The WDAPp provides a single control point for the OWL subnet 103. The WDAPp 113 has direct access to the distribution LAN, i.e., the wired subnet 101. The WDAPp 113 forwards information, packaged in frames per IEEE 802 specification (hereinafter “802 frames”), between the wired subnet 101 and the wireless subnet 103.


In addition to a WDAPp, the OWL radio network may also be configured with one or more distributed wireless domain access points. As does the WDAPp, a distributed wireless domain access point (WDAPd) provides direct access to the wired subnet 101. However, each WDAPd in the network exists within the domain of its control point, the WDAPp. For example, as illustrated, within the domain of the WDAPp 113, a WDAPd 112 and a WDAPd 114 can be found. The WDAPd 112 and the WDAPd 114 forwards 802 frames between the wired subnet 101 and the OWL subnet 103.


As previously stated, an OWL subnet may also include wired subnets other than, and remotely located from, the distribution LAN, i.e., the wired subnet 101. For example, the wired subnet 107 represents one such remote wired subnets. Although only one is illustrated, many such remote wired subnets may exist in an OWL subnet 103.


Associated with each remote wired subnets, a secondary wireless domain access point (WDAPs) can be found. Each WDAPs serves as a bridge between a remote wired subnet and the OWL radio network. For example, a WDAPs 117 serves as a bridge between the remote wired subnet 107 and the wireless subnet 105. Thus, the WDAPs 117 forwards 802 frames between the remote wired subnet 107 and the wireless subnet 105.


As illustrated, a remote station 119 directly participates in the remote wired subnet 107 in conformance with IEEE 802 specifications. A remote station 111 similarly participates in the wired subnet 101. Each of the remote stations and wireless communication devices constitute “network nodes” in the OWL architecture. Moreover, any network node can freely communicate with any other network node. For example, the remote station 111 can freely intercommunicate with the remote station 119, MRC 116 and MRC 118. Similarly, the MRC 116 can communicate with the MRC 118 and the remote stations 111 and 119.


Wireless media access points are also used in the OWL radio network where needed. A wireless media access point (WMAP), such as a WMAP 115, is a radio equipped base station which extends the wireless coverage area of a OWL radio network, such as the wireless radio network 103, to support larger wireless coverage areas than might be desirable without the use of one or more WMAP's. A typical OWL radio network has multiple WMAP's with overlapping coverage areas. Thus, MRC's can roam between coverage areas and maintain network connectivity.



FIGS. 3–5 illustrates OWL protocol stacks according to the present invention which are contained in the MAC sub layer of a standard ISO protocol stack. In particular, an OWL MAC provides MAC sub layer services to the LLC sublayer of the ISO data link layer. The OWL MAC is subdivided into MAC-D, MAC-R, MAC-Q and MAC-S sublayers. The MAC-D sublayer is analogous to the data link layer in the ISO protocol stack. The MAC-D layer provides data link services to the MAC-R layer. It is responsible for channel access control and the reliable transmission of the MAC-R sublayer is analogous to the network layer in the ISO protocol stack. The MAC-R layer provides routing services to the MAC-Q layer. It is responsible for correctly routing information through the OWL subnet, which may include multiple hops and circular physical paths. Such information is formatted into MAC-R protocol data units (PDUs) for routing. The MAC-Q sublayer adds reliability to the radio network by retransmitting lost PDUs. The MAC-Q layer is responsible for discarding out-of-sequence and duplicate PDUs. The MAC-Q sublayer can be implemented as an entity in the MAC-R sublayer. The MAC-Q entities exist at entry points to the radio network. The MAC-S sublayer is responsible for providing services for security, compression, etc. The MAC-S entities exist at entry points to the OWL radio network.


As referred to herein, logical OWL nodes are MAC-R addressable entities in the OWL radio network. The logical OWL nodes functional entities which can be contained within the various network devices. A logical OWL node can be either a terminal node or a relay node. The terminal nodes are end points in the network. The MRC's 116 and 117 contain terminal nodes, i.e., an MRC contains the logical functionality of a terminal node. Relay nodes forward PDUs at the MAC-R sublayer. The WMAP 115, for example, contains a relay node.



FIG. 3 illustrates the MAC protocol stacks used in an exemplary configuration to provide for communication between two terminal nodes via a relay node. Each terminal node in the network contains a terminal protocol stack which defines the terminal node as a network end-point. Each relay node in the network also contains a protocol stack, the “relay protocol stack”, which defines the relay node as a PDU forwarding entity.


For example, as illustrated, two terminal nodes may communicate with each other via a relay node. The arrows shown represent the flow of data from a first terminal node (using a terminal protocol stack 151) to a second terminal node (using a terminal protocol stack 153) via a relay node (using a relay protocol stack 155). The upper layers of the relay protocol stack 155 are used to process PDUs addressed to the relay node.



FIG. 4 illustrates another type of protocol stack used in the network. An OWL bridge protocol stack 201 is illustrated which is used by each wireless domain access point (WDAP), an OWL bridge, to bridge a wireless subnet to an 802 type wired subnet. Each bridge protocol stack, such as bridge protocol stack 201, contains a relay protocol stack. In addition, the 802.3 MAC-D sublayer is used to send OWL PDUs over an 802.3 link that is part of the OWL radio network. The MAC-Q and MAC-S sublayers serve as proxy MAC-Q and MAC-S entities for stations, such as the remote stations 111 and 119 (FIG. 2), on the 802.3 subnet. For convenience, the MAC-Q and MAC-S sublayers also service PDUs for the local WDAP 802 address.



FIG. 5 illustrates how data flows through the bridge protocol stack of FIG. 4. A dashed line 259 represents the path a PDU takes as it travels from a station 251 on an 802.3 LAN to a terminal 255 in the OWL radio network. A WDAP, using the bridge protocol stack 201, bridges the PDU from the 802.3 subnet to the radio subnet. A solid line 257 represents the path a PDU takes as it travels from a terminal 253 to the terminal 255 wherein both terminals are in the radio network. In this example, because the path is contained in the radio network, the PDU does not have to be bridged.


In general, PDUs are bridged across subnet boundaries, and PDUs are routed within the radio network. A bridging entity in a WDAP uses a forwarding database to determine if a PDU should be bridged from one subnet to another subnet. A forwarding database contains a list of 802 addresses associated with each subnet to which the WDAP is attached. A MAC-R entity uses a routing table to determine how a PDU should be routed within an OWL subnet.


Further detail regarding this embodiment can be found in the attached Appendices A and B. Appendix A provides further detail regarding the OWL network architecture, while Appendix B describes the network frame formats used in communication exchanges.



FIG. 6 illustrates an exemplary configuration of the OWL architecture according to the present invention. Therein, a wired subnet 265 and remote wired subnets 287 and 289, are configured in accordance with IEEE 802 standards. A WDAPp 267, utilizing the bridging protocol stack shown in FIG. 4, acts as a spanning tree root node, providing access between an OWL radio network 261 and the wired subnet 265. Note that a WDAPd 263 is also illustrated which uses a bridging protocol stack. The WDAPd 263 could instead be used as the root of the spanning tree (becoming the network WDAPp) should the WDAPp break down. In addition, two exemplary remote stations, a host computer 285 and a personal computer 264, are connected to the wired subnet 265.


A WDAPs 271 constitutes an access point to and from the remote wired subnet 287. Similarly, a WDAPs 273 constitutes an access point to and from the remote wired subnet 289. Both WDAPs's utilize the bridge protocol stack of FIG. 3. Moreover, each remote wired subnet 287 and 289 illustrate the participation of a remote station, a personal computer 286 and 288, respectively. Also, wireless communication devices, such as an MRC 283 and an MRC 284, can move through the OWL radio network 261 while maintaining network connectivity. Any wireless communication device can communicate with any other wireless communication device or with any remote station. Similarly, any remote station can communicate with any other remote station or with any wireless communication device.


A plurality of intermediate wireless access points, i.e., the WMAP's 269, 275, 277 and 279, along with the wired access points, i.e., the WDAP's 267, 263, 271 and 273, providing for communication among any of the remote stations and wireless communication devices. Because WDAP's are wired to corresponding wired subnets, they are referred to herein as a “wired access points” even though WDAP's also participate wirelessly within the OWL radio network. Specifically, the plurality of intermediate wireless access points and the wired access points, together, form a spanning tree which provides for routing through the OWL radio network.


Specifically, nodes in an OWL radio network are organized into a network spanning tree. A WDAPp serves as a root of the spanning tree, while PDU's are routed along branches of the spanning tree. Routing toward the root is referred to herein as “downstream” routing. Routing away from the root is referred to as “upstream” routing. Referring to FIG. 6, the WDAPp 267 constitutes the root of the spanning tree formed within the OWL radio network 261. Communication flowing upstream, away from the WDAPp 267, might include a plurality of relay points along the way to reach a destination. For example, to reach the personal computer 286, data from the personal computer 264 first travels along the wired subnet 265 to the root of the spanning tree, i.e., to the WDAPp 267. The WDAPp 267, using a spanning tree routing table, identifies that the WMAP 269 is the next relay point upstream to the personal computer 286. Therefore, the WDAPp 267 forwards the data upstream to the WMAP 269. Upon receipt, the WMAP 269 similarly identifies the WMAP 275 and forwards the data upstream. In turn, the WMAP 275 forwards the data to the WDAPs 271. Finally, the WDAPs 271 relays the data along the remote wired subnet to the personal computer 286.


A spanning tree, which provides the data pathways throughout the OWL radio network, is stored and maintained by each participant in the OWL radio network. Each network node stores and modifies information which specifies how local communication traffic should flow. Optimal spanning trees assure efficient, adaptive (dynamic) routing of information without looping.


Nodes in the OWL radio network are generally categorized as being attached or unattached to the network spanning tree. Upon initialization of an OWL radio network, only the root node is attached. A single WDAP can be designated to contain the root node, or multiple root candidates can negotiate to determine which node assumes the root status. Once the root is designated, the WDAP containing the root node, i.e., the WDAPp, begins periodically broadcasting messages offering attachment. These messages are referred to as “HELLO response PDU's”. Unattached nodes, i.e., other WDAP's or WMAP's, receiving the Hello response PDU's may attach to the OWL radio network via the WDAPp. With the exception of terminal nodes, each network node that becomes attached also begins periodically transmitting Hello response PDU's. The nodes receiving Hello response PDU's from newly attached nodes may attach to the network via the newly attached nodes. This process continues until all of the network nodes are attached. Moreover, to attach to the network, an “Attach request PDU” must be sent and relayed downstream toward the root node. In response, the root sends an “Attach response PDU” back through the network to confirm the attachment. Upon receiving the Attach request PDU, each network node places an entry in a spanning tree routing table indicating the identity of both the requesting node and the node which last transmitted (relayed) the request. In this manner, routing tables can be constructed and maintained. As described in the Appendix A, other types of PDU's, i.e., Registration or Data request PDU's, are also be used to create and modify routing tables.


Using the spanning tree routing table, any network node can determine whether any other network node exists upstream or not. In particular, if an entry exists, the destination node must have previously sent a PDU (possibly the Attach request PDU) through that relay node in a downstream pathway to root node. Thus; if the entry exists, the relay node routes the PDU upstream per routing table instruction toward the destination node. However, if no entry for the destination node exists, the relay node can not determine the location of the destination node. Therefore, the relay node sends the PDU downstream toward the root node. If any node along the downstream pathway identifies the destination node in its routing table, that node relays the PDU upstream toward the destination. More detail regarding this entire procedure can be found in Appendix A, for example at pages 17–22.



FIG. 7 illustrates an alternate embodiment of the present invention wherein a WDAPs 291 participates in more than one OWL radio network. Specifically, the WDAPs 291 participates in OWL radio networks 293 and 295. For example, a personal computer 299 initiates communication to another remote station, a PC 301, by transmitting a message upon a wired subnet 297. Upon receiving the message, the WDAPs 291 checks its routing table and, because no entry is found, routes the message downstream through both the OWL radio networks 293 and 295. When the upstream routing in the OWL network 295 reaches a WDAPp 303, an entry for the personal computer 301 is still not found. Therefore, the WDAPp 303 unicasts the message onto a wired subnet 305. Because the PC 101 does not reside on the subnet 305, the message reaches a dead-end and is ignored. However, when the message reaches a WDAPp 307, and the WDAPp 307 does not find an entry for the personal computer 301, it unicasts the message onto a wireless subnet 309 for receipt by the personal computer 301.



FIG. 8 is a diagram illustrating yet another variation of the present invention wherein two OWL radio networks are used. Specifically, a WDAPp 425 provides access for communication between a wired subnet 401 and a remote wired subnet 403. Utilizing a spanning tree configuration, the plurality of intermediate wireless access points, such as WMAP 431, 433 and 435, provide a communication pathway between a WDAPs 441 and the WDAPp 425. Together, the WMAP's, the WDAPp 425 and the WDAPs 441 provide for communication among a plurality of wireless communication devices, such as MRC's 445 and 447, and the remote stations on the subnets 401 and 403, such as a host computer 407 and personal computers 409, 411 and 413.


Similarly, communication interconnectivity is provided via a second OWL radio network 423. The second network 423 provides for communication flow between the wired subnet 401 and a remote wired subnet 405 via a WDAPp 453, WDAPs 457 and a WMAP 455. Again full communication among a wireless communication device 449, a personal computer 451, the host computer 407 and the personal computer 409 is provided for.


Additionally, communication among remote stations on the remote subnets 403 and 405 and wireless communication devices in either network 421 or 423 is provided. For example, the host computer 407 may communicate to the personal computer 413 via the OWL radio network 421. To do so, the host computer 407 first transmits a message destined for the personal computer 413 onto the wired subnet 401. In response, the WDAPp 425 receives the message, identifies a routing table entry for the personal computer 413, and, in one exemplary spanning tree configuration, routes the message up-stream toward the personal computer 413 via a wireless transmission to the WMAP 431. When the WMAP 431 receives the message from the down-stream WDAPp 425, the WMAP 431 checks with its routing table. Upon finding a routing table entry for the personal computer 413, the WMAP 431 identifies the WMAP 433 as the next relay point in the pathway to the personal computer 413. Thus, via wireless transmission, the WMAP 433 relays the message to the WMAP 433. Upon receiving the message, the WMAP 433 similarly identifies a routing table entry for the personal computer 413, and routes the message to the WMAP 435. In turn, the WMAP 435 routes the message to the WDAPs 441. The WDAPs 441 finally sends the message to the personal computer 413 via the wired subnet 403. Together, the WDAPp 425, WMAP's 431435 and WDAPs 441 thus provide a communication pathway between the host computer 407 and the personal computer 413.


As noted previously, each WMAP and each WDAP maintains a spanning tree routing table, i.e., a forwarding database, which specifies how local communication traffic should flow therethrough. Upon receipt of a message, the WMAP or WDAP first identifies the destination of the message. The message destination is then compared with the spanning tree routing table. If an entry in the routing table exists for the message destination, corresponding information regarding the next relay point in the pathway to the message destination is retrieved from the routing table. Such information includes the handle of the next relay point and the communication channel required, for example.


As another example, the personal computer 411 may communicate with the personal computer 451 by utilizing both of the OWL radio networks 421 and 423. Specifically, the personal computer 411 transmits a message to the personal computer 451 on the wired subnet 403. In response, the WDAPs 441 receives the message, recognizes that the personal computer 451 is not within its spanning tree routing table, and routes the message downstream to the WMAP 435. The WMAP 435 receives the message from the WDAPs 441, recognizes that the personal computer 451 is not within its routing table, and thus routes the message to its downstream ancestor, i.e., the WMAP 433. Similarly, upon receiving the message, and, because no entry exists in its routing table, the WMAP 433 forwards the message downstream to its spanning tree ancestor, the WMAP 431. Again, finding no routing table entry for the personal computer 451, the WMAP 431 routes the message to the spanning tree root node, i.e., the WDAPp 425. In turn, finding no routing table entry for the personal computer 451, the WDAPp 425, depending on predetermined program control, may: 1) do nothing, aborting the communication attempt; 2) unicast the message on all ports except the one from which the message was received, i.e., floods the ports with the message; 3) unicast the message on selected ports; or 4) consult a routing control field in the message itself to determine which of the above three options to choose.


Assuming program control permits, the WDAPp 425 unicasts the message intended for the personal computer 451 onto the wired subnet 401. Upon receiving the unicast message, the WDAPp 453 locates the personal computer 451 in its routing table, and routes the message upstream to the WMAP 455. The WMAP 455 similarly identifies a personal computer 451 entry, and routes to the next upstream node, i.e., to a WDAPs 457. Finally, the WDAPs 457, identifying a personal computer 451 routing table entry, sends the message via the remote wired subnet 405 to the personal computer 451.


The illustrated communication network similarly supports communication among wireless communication devices, such as MRC's 445, 447 and 449, and remote stations, such as the host computer 407 and the personal computers 409, 411, 413 and 451.


As previously articulated, further detail regarding the present invention can be found with reference to the Appendices A and B. Moreover, additional detail may also be found in the patent applications cited above under the heading “Incorporation By Reference”. Such applications are incorporated herein by reference in their entirety.


As is evident from the description that is provided above, the implementation of the present invention can vary greatly depending upon the desired goal of the user. However, the scope of the present invention is intended to cover all variations and substitutions which are and which may become apparent from the illustrative embodiment of the present invention that is provided above, and the scope of the invention should be extended to the claimed invention and its equivalents.

Claims
  • 1. A communication network comprising: a first wired subnet and a second wired subnet;a first wired access point connected to the first wired subnet;a second wired access point connected to the second wired subnet;a plurality of intermediate wireless routers that provide a wireless communication pathway between the first wired access point and the second wired access point, the plurality of intermediate wireless routers being organized to form one or more wireless communication pathways; anda plurality of roaming mobile wireless communication devices operatively coupled to the plurality of intermediate wireless routers,wherein the roaming mobile wireless communication devices wirelessly communicate with each other over the one or more wireless communication pathways, wherein at least one of the plurality of intermediate wireless routers periodically broadcasts wirelessly a message, and wherein any of the plurality of intermediate wireless routers and the plurality of roaming mobile wireless communication devices can communicate with any other of the plurality of intermediate wireless routers and the plurality of roaming mobile wireless communication devices.
  • 2. The communication network according to claim 1, further comprising: a third wired subnet;a third wired access point connected to the third wired subnet, the third wired access point participating in a spanning tree, the third wired subnet being communicatively interconnected with the first wired subnet and the second wired subnet via the first wired access point, the second wired access point, the third wired access point and the plurality of intermediate wireless routers.
  • 3. The communication network according to claim 1, wherein the intermediate wireless routers are configured to form a spanning tree.
  • 4. The communication network according to claim 1, wherein each of the intermediate wireless routers comprises a protocol stack that is configured to provide a wireless communication pathway between the first wired access point and the second wired access point and that is configured to form a spanning tree that communicatively interconnects the first wired subnet and the second wired subnet.
  • 5. The communication network according to claim 1, wherein each of the intermediate wireless routers comprises a protocol stack that is configured to form a spanning tree with one or more of the other intermediate wireless routers.
  • 6. The communication network according to claim 1, wherein the plurality of roaming mobile wireless communication devices comprises a first mobile device and a second mobile device, and wherein the first mobile device wirelessly communicates with the second mobile device via a wireless communication pathway through at least two of the plurality of intermediate wireless routers.
  • 7. The communication network according to claim 1, wherein each of the plurality of intermediate wireless routers periodically broadcasts wirelessly a respective message.
  • 8. The communication network according to claim 1, wherein at least one of the roaming mobile wireless communication devices wirelessly responds to at least one of the periodically broadcasted messages.
  • 9. The communication network according to claim 1, wherein each of the plurality of intermediate wireless routers comprises a storage device in which resides a respective routing table.
  • 10. The communication network according to claim 9, wherein entries in the respective routing tables are updated.
  • 11. The communication network according to claim 1, wherein the plurality of intermediate wireless routers and the plurality of roaming mobile wireless communication devices are part of a wireless local area network.
  • 12. The communication network according to claim 1, wherein the plurality of intermediate wireless routers dynamically form one or more wireless communication pathways.
  • 13. The communication network according to claim 1, wherein the first and second wired access points and the plurality of intermediate wireless routers form a dynamic spanning tree.
  • 14. The communication network according to claim 1, wherein the plurality of intermediate wireless routers form one or more self-healing wireless communication pathways.
  • 15. The communication network according to claim 1, wherein the plurality of intermediate wireless routers provide adaptive routing of information.
  • 16. The communication network according to claim 1, wherein the plurality of roaming mobile wireless communication devices comprises two roaming mobile wireless communication devices, wherein the plurality of intermediate wireless routers comprises a particular intermediate wireless router, wherein the two roaming mobile wireless communication devices are operatively coupled to the particular intermediate wireless router, and wherein the two roaming mobile wireless communication devices communicate with each other without the particular intermediate wireless router forwarding the communication to a parent node of the particular intermediate wireless router.
  • 17. The communication network according to claim 1, wherein one of the plurality of intermediate wireless routers initiates the formation of a wireless local area network.
  • 18. The communication network according to claim 1, wherein the communication network employs spread spectrum communications.
  • 19. The communication network according to claim 1, wherein the plurality of intermediate wireless routers form one or more self-healing wireless communication pathways, and wherein the roaming mobile wireless communication devices that wirelessly communicate with each other over the one or more self-healing wireless communication pathways are unaware of re-routing due to a failure in at least one of the intermediate wireless routers.
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application is a CONTINUATION of U.S. application Ser. No. 09/072,791, filed May 5, 1998, issued U.S. Pat. No. 6,407,991, which is a CONTINUATION of U.S. application Ser. No. 08/780,124, filed Dec. 26, 1996, issued U.S. Pat. No. 5,748,619, which is a CONTINUATION of U.S. application Ser. No. 08/318,154, filed Oct. 4, 1994, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 08/238,090, filed May 4, 1994, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 08/177,738, filed Jan. 4, 1994, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 08/147,766, filed Nov. 4, 1993, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 08/073,142, filed Jun. 4, 1993, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 08/058,905, filed May 6, 1993, abandoned. The present application is a CONTINUATION-IN-PART of U.S. application Ser. No. 09/531,880, filed Mar. 21, 2000, issued U.S. Pat. No. 6,400,702, which is a CONTINUATION of U.S. application Ser. No. 09/089,950, filed Jun. 3, 1998, issued U.S. Pat. No. 6,084,867, which is a CONTINUATION of U.S. application Ser. No. 08/494,909, filed Jun. 26, 1995, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 08/059,447, May 7, 1993, issued U.S. Pat. No. 5,428,636, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 08/056,827, filed May 3, 1993, issued U.S. Pat. No. 5,295,154, which is a CONTINUATION of U.S. application Ser. No. 07/769,425, filed Oct. 1, 1991, abandoned. The present application is a CONTINUATION-IN-PART of U.S. application Ser. No. 09/960,265, filed Sep. 21, 2001, issued U.S. Pat. No. 6,714,559, which is a CONTINUATION of U.S. application Ser. No. 09/849,776, filed May 4, 2001, abandoned, which is a CONTINUATION of U.S. application Ser. No. 09/482,197, filed Jan. 12, 2000, abandoned, which is a CONTINUATION of U.S. application Ser. No. 08/941,496, filed Sep. 30, 1997, abandoned, which is a CONTINUATION of U.S. application Ser. No. 08/270,533, filed Jul. 5, 1994, issued U.S. Pat. No. 5,673,031, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 07/802,348, filed Dec. 4, 1991, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 07/790,946, filed Nov. 12, 1991, abandoned. The present application is a CONTINUATION-IN-PART of U.S. application Ser. No. 10/123,873, filed Apr. 16, 2002, issued U.S. Pat. No. 6,895,450, which is a CONTINUATION of U.S. application Ser. No. 09/060,287, filed Apr. 14, 1998, issued U.S. Pat. No. 6,374,311, which is a CONTINUATION of U.S. application Ser. No. 08/395,555, filed Feb. 28, 1995, issued U.S. Pat. No. 5,740,366, which is a CONTINUATION of U.S. application Ser. No. 08/255,848, filed Jun. 8, 1994, issued U.S. Pat. No. 5,394,436, which is a CONTINUATION of U.S. application Ser. No. 07/970,411, filed Nov. 2, 1992, abandoned, which is a CONTINUATION-IN-PART of U.S. application Ser. No. 07/968,990, filed Oct. 30, 1992, abandoned, which is a CONTINUATION-IN-PART of PCT International Application No. PCT/US92/08610, filed Oct. 1, 1992. Said U.S. application Ser. No. 07/968,990, filed Oct. 30, 1992, abandoned, is also a CONTINUATION-IN-PART of U.S. application Ser. No. 07/769,425, filed Oct. 1, 1991, abandoned.

US Referenced Citations (152)
Number Name Date Kind
3781815 Boudreau et al. Dec 1973 A
4063220 Metcalfe Dec 1977 A
4164628 Ward et al. Aug 1979 A
4247908 Lockhart, Jr. et al. Jan 1981 A
4251865 Moore et al. Feb 1981 A
4332027 Malcolm et al. May 1982 A
4352955 Kai et al. Oct 1982 A
4369443 Giallanza et al. Jan 1983 A
4420682 Huber Dec 1983 A
4449248 Leslie et al. May 1984 A
4477809 Bose Oct 1984 A
4630314 Smith Dec 1986 A
4644532 George et al. Feb 1987 A
4661902 Hochsprung Apr 1987 A
4663706 Allen et al. May 1987 A
4670899 Brody et al. Jun 1987 A
4679244 Kawasaki et al. Jul 1987 A
4689786 Sidhu et al. Aug 1987 A
4706081 Hart et al. Nov 1987 A
4707829 Pendse Nov 1987 A
4725992 McNatt et al. Feb 1988 A
4736461 Kawasaki et al. Apr 1988 A
4747126 Hood et al. May 1988 A
4748658 Gopal et al. May 1988 A
4789983 Acampora et al. Dec 1988 A
4794649 Fujiwara Dec 1988 A
4804954 Macnak et al. Feb 1989 A
4811337 Hart Mar 1989 A
4835372 Gombrich et al. May 1989 A
4864559 Perlman Sep 1989 A
4881271 Yamauchi et al. Nov 1989 A
4884266 Pflaumer Nov 1989 A
4885780 Gopal et al. Dec 1989 A
4910794 Mahany Mar 1990 A
4916441 Gombrich Apr 1990 A
4916726 Morley, Jr. et al. Apr 1990 A
4924462 Sojka May 1990 A
4926064 Tapang May 1990 A
4940974 Sojka Jul 1990 A
4942552 Merrill et al. Jul 1990 A
4945532 Hald Jul 1990 A
4956783 Teranishi et al. Sep 1990 A
4964121 Moore Oct 1990 A
4975904 Mann et al. Dec 1990 A
4977611 Maru Dec 1990 A
4987571 Haymond Jan 1991 A
4995099 Davis Feb 1991 A
5008882 Peterson et al. Apr 1991 A
5018133 Tsukakoshi et al. May 1991 A
5018137 Backes et al. May 1991 A
5025486 Klughart Jun 1991 A
5027427 Shimizu Jun 1991 A
5029183 Tymes Jul 1991 A
5031098 Miller et al. Jul 1991 A
5031231 Miyazaki Jul 1991 A
5042083 Ichikawa Aug 1991 A
5055659 Hendrick Oct 1991 A
5055660 Bertagna et al. Oct 1991 A
5056085 Vu Oct 1991 A
5058200 Huang et al. Oct 1991 A
5065003 Wakatsuki et al. Nov 1991 A
5070536 Mahany et al. Dec 1991 A
5081402 Koleda Jan 1992 A
5087099 Stolarczyk Feb 1992 A
5089813 DeLuca et al. Feb 1992 A
5099509 Morganstein et al. Mar 1992 A
5103461 Tymes Apr 1992 A
5117422 Hauptschein et al. May 1992 A
5119502 Kallin et al. Jun 1992 A
5121408 Cai et al. Jun 1992 A
5123029 Bantz et al. Jun 1992 A
5128932 Li Jul 1992 A
5128938 Borras Jul 1992 A
5134347 Koleda Jul 1992 A
5142531 Kirby Aug 1992 A
5142550 Tymes Aug 1992 A
5150360 Perlman et al. Sep 1992 A
5150361 Wieczorek et al. Sep 1992 A
5152006 Klaus Sep 1992 A
5157687 Tymes Oct 1992 A
5159592 Perkins Oct 1992 A
5163080 Amoroso et al. Nov 1992 A
5164942 Kamerman Nov 1992 A
5168498 Adams et al. Dec 1992 A
5170394 Biber et al. Dec 1992 A
5175537 Jaffe Dec 1992 A
5175870 Mabey et al. Dec 1992 A
5179555 Videlock et al. Jan 1993 A
5181200 Harrison Jan 1993 A
5214647 Komatsu May 1993 A
5230084 Nguyen Jul 1993 A
5239466 Morgan et al. Aug 1993 A
5241542 Natarajan et al. Aug 1993 A
5241691 Owen Aug 1993 A
5255268 Cato et al. Oct 1993 A
5260990 MeLampy et al. Nov 1993 A
5265270 Stengel et al. Nov 1993 A
5274666 Dowdell et al. Dec 1993 A
5276680 Messenger Jan 1994 A
5278831 Mabey et al. Jan 1994 A
5280480 Pitt et al. Jan 1994 A
5280650 Sobti Jan 1994 A
5283568 Asai et al. Feb 1994 A
5289378 Miller et al. Feb 1994 A
5291479 Vaziri et al. Mar 1994 A
5291511 Maher et al. Mar 1994 A
5293639 Wilson et al. Mar 1994 A
5295154 Meier et al. Mar 1994 A
5296849 Ide Mar 1994 A
5297144 Gilbert et al. Mar 1994 A
5317691 Traeger May 1994 A
5323384 Norwood et al. Jun 1994 A
5331634 Fischer Jul 1994 A
5339316 Diepstraten Aug 1994 A
5359320 Jaffe et al. Oct 1994 A
5361397 Wright Nov 1994 A
5373506 Tayloe et al. Dec 1994 A
5375254 Owen Dec 1994 A
5377192 Goodings et al. Dec 1994 A
5383187 Vardakas et al. Jan 1995 A
5390206 Rein et al. Feb 1995 A
5392023 D'Avello et al. Feb 1995 A
5394436 Meier et al. Feb 1995 A
5412654 Perkins May 1995 A
5425051 Mahany Jun 1995 A
5440560 Rypinski Aug 1995 A
5461627 Rypinski Oct 1995 A
5465081 Todd Nov 1995 A
5471469 Flammer, III et al. Nov 1995 A
5485147 Jaffe Jan 1996 A
5490139 Baker et al. Feb 1996 A
5504746 Meier Apr 1996 A
5528539 Ong et al. Jun 1996 A
5572528 Shuen Nov 1996 A
5584048 Wieczorek Dec 1996 A
5594731 Reissner Jan 1997 A
5625825 Rostoker Apr 1997 A
5673031 Meier Sep 1997 A
5687175 Rochester, Jr. et al. Nov 1997 A
5708680 Gollnick et al. Jan 1998 A
5726984 Kubler et al. Mar 1998 A
5748619 Meier May 1998 A
5828695 Webb Oct 1998 A
5844893 Gollnick et al. Dec 1998 A
5848064 Cowan Dec 1998 A
5898679 Brederveld et al. Apr 1999 A
5940771 Gollnick et al. Aug 1999 A
6084867 Meier Jul 2000 A
6400702 Meier Jun 2002 B1
7085289 Cromer et al. Aug 2006 B2
7158850 Cheng et al. Jan 2007 B2
7558528 King Jul 2009 B2
Foreign Referenced Citations (22)
Number Date Country
54-935 Jun 1993 EP
0 281 334 Sep 1998 EP
0 281 334 Sep 1998 EP
53-10206 Jan 1978 JP
58159036 Sep 1983 JP
61100041 May 1986 JP
61251251 Nov 1986 JP
1117533 May 1989 JP
1119146 May 1989 JP
1152837 May 1989 JP
1143536 Jun 1989 JP
1305637 Dec 1989 JP
2-60252 Feb 1990 JP
2051922 Feb 1990 JP
3268534 Nov 1991 JP
4123628 Apr 1992 JP
4199934 Jul 1992 JP
4259140 Sep 1992 JP
5253132 Oct 1993 JP
WO 9202084 Feb 1992 WO
WO 9307691 Apr 1993 WO
WO 96-10304 Apr 1996 WO
Related Publications (1)
Number Date Country
20030112767 A1 Jun 2003 US
Continuations (15)
Number Date Country
Parent 09072791 May 1998 US
Child 10144250 US
Parent 08780124 Dec 1996 US
Child 09072791 US
Parent 08318154 Oct 1994 US
Child 08780124 US
Parent 09089950 Jun 1998 US
Child 09531880 US
Parent 08494909 Jun 1995 US
Child 09089950 US
Parent 07769425 Oct 1991 US
Child 08056827 US
Parent 10144250 US
Child 08056827 US
Parent 09849776 May 2001 US
Child 09960265 US
Parent 09482197 Jan 2000 US
Child 09849776 US
Parent 08941496 Sep 1997 US
Child 09482197 US
Parent 08270533 Jul 1994 US
Child 08941496 US
Parent 09060287 Apr 1998 US
Child 10123873 US
Parent 08395555 Feb 1995 US
Child 09060287 US
Parent 08255848 Jun 1994 US
Child 08395555 US
Parent 07970411 Nov 1992 US
Child 08255848 US
Continuation in Parts (17)
Number Date Country
Parent 08238090 May 1994 US
Child 08318154 US
Parent 08177738 Jan 1994 US
Child 08238090 US
Parent 08147766 Nov 1993 US
Child 08177738 US
Parent 08073142 Jun 1993 US
Child 08147766 US
Parent 08058905 May 1993 US
Child 08073142 US
Parent 10144250 US
Child 08073142 US
Parent 09531880 Mar 2000 US
Child 10144250 US
Parent 08059447 May 1993 US
Child 08494909 US
Parent 08056827 May 1993 US
Child 08059447 US
Parent 09960265 Sep 2001 US
Child 10144250 US
Parent 07802348 Dec 1991 US
Child 08270533 US
Parent 07790946 Nov 1991 US
Child 07802348 US
Parent 10144250 US
Child 07802348 US
Parent 10123873 Apr 2002 US
Child 10144250 US
Parent 07968990 Oct 1992 US
Child 07970411 US
Parent PCT/US92/08610 Oct 1992 US
Child 07968990 US
Parent 07769425 Oct 1991 US
Child PCT/US92/08610 US