System and method for trans-medium address resolution on an ad-hoc network with at least one highly disconnected medium having multiple access points to other media

Information

  • Patent Grant
  • 6771666
  • Patent Number
    6,771,666
  • Date Filed
    Wednesday, September 25, 2002
    22 years ago
  • Date Issued
    Tuesday, August 3, 2004
    20 years ago
Abstract
A system and method for providing a mechanism for trans-medium address resolution on a network with at least one highly disconnected medium having multiple access points to other media. The system and method provides a “unique” media access control (MAC) address in address resolution protocol (ARP) for mobile nodes in an ad-hoc network, correctly identifying the optimum intelligent access point (IAP) for node communication where the optimum IAP changes more rapidly than traditional address updating may be able to accommodate. Medium layer routing protocols recognize medium frames addressed with this unique MAC address should be routed to the currently associated IAP, whichever IAP that might be at the moment the frame is sent.
Description




BACKGROUND OF THE INVENTION




1. Field of the Invention




The present invention relates to a system and method for data routing in an ad-hoc network where optimum mobile node-to-IAP links are constantly changing. More particularly, the present invention relates to a system and method for modifying an address resolution protocol (ARP) mechanism to assign a unique media access control (MAC) address for mobile node's IAP, such that frames addressed with this unique MAC address are routed by medium-layer routing protocols to the node's associated IAP at the time the frame is sent.




2. Description of the Related Art




In recent years, a type of mobile communications network known as an “ad-hoc” network has been developed to address the needs of multiple mobile device communication beyond traditional infrastructure coverage. In this type of network, each user terminal (hereinafter “mobile node”) is capable of operating as a base station or router for other mobile nodes within the network, thus eliminating the need for a fixed infrastructure of base stations. Accordingly, data packets being sent from a source mobile node to a destination mobile node are typically routed through a number of intermediate mobile nodes before reaching the destination mobile node. Details of an ad-hoc network are set forth in U.S. Pat. No. 5,943,322 to Mayor, the entire content of which is incorporated herein by reference.




More sophisticated ad-hoc networks are also being developed which, in addition to enabling mobile nodes to communicate with each other as in conventional ad-hoc networks, further enable the mobile nodes to access a fixed network and thus, communicate with other types of user terminals, such as those on the public switched telephone network (PSTN) and on other networks, such as the Internet. Details of these types of ad-hoc networks are described in U.S. patent application Ser. No. 09/897,790 entitled “Ad Hoc Peer-to-Peer Mobile Radio Access System Interfaced to the PSTN and Cellular Networks”, filed on Jun. 29, 2001, in U.S. patent application Ser. No. 09/815,157 entitled “Time Division Protocol for an Ad-Hoc, Peer-to-Peer Radio Network Having Coordinating Channel Access to Shared Parallel Data Channels with Separate Reservation Channel”, filed on Mar. 22, 2001, and in U.S. patent application Ser. No. 09/815,164 entitled “Prioritized-Routing for an Ad-Hoc, Peer-to-Peer, Mobile Radio Access System”, filed on Mar. 22, 2001, the entire content of each being incorporated herein by reference.




Generally, all of the nodes in a wireless ad-hoc peer-to-peer network provide certain similar core services and functionality, although they can each provide different functions relating to their specific purpose and application (e.g. if they are an access point, wireless router, and so on). Therefore peer-to-peer networks distinguish themselves from infrastructure networks where one or more nodes offer a superset of the functionality of the rest of the network. Infrastructure nodes in these networks typically can handle Dynamic Host Configuration Protocol (DHCP), Address Resolution Protocol (ARP), as well as other services that depend on broadcast traffic. DHCP is defined by IETF RFC 2131 and 2132, which are incorporated herein by reference, and is used by a client node to automatically obtain network settings from a central server. These network settings include the client's IP address, the address of Domain Name Servers (DNS), the IP address of default gateways, and many other network settings. Address resolution protocol is defined by STD 0037 and RFC 0826, which are incorporated herein by reference, and is used by a network node to map IP addresses to MAC addresses so IP traffic can be delivered to specific hardware.




These infrastructure nodes are normally discovered by broadcast traffic advertisements from their client nodes in a network, however peer-to-peer networks typically do not contain specialized infrastructure nodes. The IEEE 802.11 standard offers a peer-to-peer mode in addition to an infrastructure mode. Details of the 802.11 standards are set forth in ISO/IEC 8802-11, ANSI/IEEE 802.11 “Information Technology-Telecommunications and Information Exchange Between Systems-Local and Metropolitan Area Network Specific Requirements”, Part 11: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications, the entire contents of which being incorporated herein by reference. Also, a description of the 802.11 standard is found in a book by Bob O'Hara and Al Petrick entitled


IEEE


802.11


Handbook: A Designer's Companion


, IEEE, 1999, the entire contents of which being incorporated herein by reference.




These packet-switched networks can operate across many different kinds of physical hardware by using network-layer routers, such as Internet protocol (IP) routers, with multiple hardware interfaces at junctions where the different hardware mediums must communicate. In the case of fully connected multiple-access hardware mediums, such as CSMA-CD LAN's, where all nodes can directly communicate to all other nodes via hardware broadcasts, media converters can also be inserted into the network to operate below the network layer and pass hardware frames between two different mediums, such as with a 10base2-to-10baseT media converter. In this manner, a media converter can allow a single network-layer routing domain to span multiple hardware media.




However, in an ad-hoc networking system, all routing is done below the network layer since frames in the unified network layer sub-net may be intended for nodes within either the media, wired or wireless network. Therefore, routing methods must be adapted to cross any media junctures below the network layer. However, a media converter would not fit the need because the wireless medium is highly disconnected. That is, nodes in the wireless network may not hear frames from other nodes that are geographically or electrically distant, or occupy different data channels at the time of transmission. In certain ad-hoc networks, intelligent access points (IAP's) are connected to bridge the wired and wireless media, as network efficiency dictates that there be many diverse access points to the wired network. Details of these requirements are described in U.S. patent application Ser. No. 09/897,790, 09/815,157 and 09/815,164, referenced above.




Because the wireless network is not fully connected, the IAP's act as proxies rather than as media converters. Whereas a LAN media converter would hear all frames from all nodes on one medium and directly replicate them on the opposing medium, frames that must cross from the wireless medium to the wired medium in an ad-hoc network are medium-addressed directly to an access point below the network layer to ensure delivery, since the source of the frame may not be within direct transmission range of an access point. In such cases, broadcast services and address resolution protocol (ARP) are handled through special tunneling mechanisms, such as address resolution protocol. Unicast frames that must cross the media carry unicast addressing, particular to the given medium, that specifies a particular IAP.




As noted, address resolution within the ad-hoc network is difficult due to the replacement of traditional LAN components with a wireless network. Whereas in a LAN, ARP may broadcast a request packet for unknown addresses with little impact, in a wireless network such broadcasts could flood the radio network. As disclosed in U.S. Provisional Patent Application Serial No. 60/357,645 to Whitehill et al. referenced above, modifications to the use of ARP satisfies the broadcast concerns of address resolution issues within ad-hoc networks, however the mobility of nodes in the network results in a need for yet further modifications.




Node mobility poses additional problems for traditional ARP uses, as address resolutions made by ARP are generally cached. Cached address resolutions work well for wired-to-wired or wireless-to-wireless unicast communications, as it reduces the need to resolve every network packet individually. Network addresses are resolved to medium addresses once, then cached for future network packets. In a typical implementation, this cache may have an expiration timeout on the order of 20-120 minutes. Upon timeout, a given network address will be re-resolved to ensure reliable resolution for situations where network addresses of given nodes change periodically, such as the case with a DHCP-managed network. When a wireless node resolves network addresses of devices on the wired medium, a medium address is determined that correlates to the node's associated IAP and which is presumed to be the “best” media bridge for the node to use. The best IAP may be selected based on bandwidth, spectral efficiency, or other reasons specific to the network. To provide this functionality, the ARP mechanism is implemented in such a way as to offer the medium address of a node's associated IAP when resolving network addresses of wired nodes. However, given node mobility, the best IAP may not be static for a given mobile node. In such a network, IAP associations may be formed and broken at a higher rate than the ARP expiration timeout would correct for. While the wireless network might allow routing to less-appropriate IAP's, the network would not operate very efficiently. Furthermore, security issues might not allow a non-associated IAP to proxy for a given wireless node.




Accordingly, a need exists for a system and method for modifying the ARP mechanism to assign a medium address for a mobile node's associated IAP in which the optimum IAP is targeted.




SUMMARY OF THE INVENTION




An object of the present invention is to provide a mechanism for trans-medium address resolution on a network with at least one highly disconnected medium having multiple access points to other media.




Another object of the present invention is to provide a system and method for modifying the ARP mechanism to assign a medium address for a mobile node's associated IAP which directs medium-layer routing protocols to route medium frames so addressed to the node's associated IAP at the time the frame is sent.




These and other objects are substantially achieved by providing a system and method for identifying optimum IAP addresses which are subject to change at rates greater than traditional address updating may provide for. Once identified, the system and method provides a “unique” media access control (MAC) address in address resolution protocol (ARP) when wireless nodes are communicating with nodes on a core LAN. Medium layer routing protocols recognize that medium frames addressed with this unique address should be routed to the node's currently associated IAP, whichever IAP that might be at the moment the frame is sent.











BRIEF DESCRIPTION OF THE DRAWINGS




These and other objects, advantages and novel features of the invention will be more readily appreciated from the following detailed description when read in conjunction with the accompanying drawings, in which:





FIG. 1

is a block diagram of an example of an ad-hoc wireless communications network including a plurality of nodes;





FIG. 2

is a block diagram of an example of a wireless node as shown in

FIG. 1

; and





FIG. 3

is a block diagram illustrating an example of communication exchanges between a mobile node and an intelligent access point in the network shown in

FIG. 1

when performing an address resolution in accordance with an embodiment of the present invention.











DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS





FIG. 1

is a block diagram illustrating an example of an ad-hoc packet-switched wireless communications network


100


employing an embodiment of the present invention. Specifically, the network


100


includes a plurality of mobile wireless subscriber devices


102


-


1


through


102


-n (referred to generally as mobile nodes


102


), and a fixed network


104


having a plurality of access points


106


-


1


,


106


-


2


, . . . ,


106


-n, for providing the mobile nodes


102


with access to the fixed network


104


. The fixed network


104


can include a core local access network (LAN) and a plurality of servers and gateway routers, to provide the mobile nodes


102


with access to other networks, such as the public switched telephone network (PSTN), the Internet or another wireless ad-hoc network. The network


100


also includes one or more fixed routers


108


-


1


through


108


-n (referred to generally as fixed routers


108


) for routing data packets between nodes


102


, access points


106


, and other routers


108


.




In

FIG. 1

, mobile nodes


102


are capable of communicating directly with each other, or via one or more other nodes operating as routers for data packets being sent between nodes, as described in U.S. Pat. No. 5,943,322 to Mayor and in U.S. patent application Ser. Nos. 09/897,790 and 09/815,157, referenced above. As shown in

FIG. 2

, each mobile node of

FIG. 1

includes a host


116


which may consist of any number of devices, such as a notebook computer terminal, mobile telephone unit, mobile data unit, or any other suitable device. Each node


102


further includes a transceiver


118


, including a transmitter and a receiver, which collectively can be referred to as a modem. The transceiver is coupled to an antennae


110


, capable transmitting and receiving signals, such as packetized data signals including voice, data or multimedia, under the control of a controller


112


. Each controller


112


includes the appropriate hardware and software to perform Internet Protocol (IP) and Address Resolution Protocol (ARP), the purposes of which can be readily appreciated by one skilled in the art. The appropriate hardware and software to perform transmission control protocol (TCP) and user datagram protocol (UDP) may also be included.




Each mobile node further includes a memory


114


, including a read only memory (ROM) for storing information pertaining to the operation of the node, and a random access memory (RAM) for storing information such as routing table information and the like, in accordance with data packets transmitted, received and routed by the transceiver


118


. Further details of these types of ad-hoc networks are described in U.S. patent application Ser. No. 09/897,790 and in U.S. patent application Ser. No. 09/815,157, referenced above.




Each host


116


also includes the appropriate hardware and software to perform Internet Protocol (IP) and Address Resolution Protocol (ARP), the purposes of which can be readily appreciated by one skilled in the art. The host


116


can optionally include the appropriate hardware and software to perform transmission control protocol (TCP) and user datagram protocol (UDP). Furthermore, each host


116


includes a driver to provide an interface between the host and the transceiver


118


.




In addition to including a modem, the transceiver


118


includes the appropriate hardware and software to provide IP, ARP, admission control (AC), traffic control (TC), ad-hoc routing (AHR), logic link control (LLC) and media access control (MAC). The transceiver


118


further includes the appropriate hardware and software for IAP association (IA), UDP, simple network management protocol (SNMP), data link (DL) protocol and dynamic host configuration protocol (DHCP) relaying.




A more detailed description of the mobile node host and transceiver during communication with an associated IAP is shown in FIG.


3


. In

FIG. 3

, the admission control (AC) module of the mobile node transceiver acts on packets flowing between the IP stack module of the host


116


, and the IP stack module and traffic control (TC) module of the mobile node transceiver


118


. The IP stack of the transceiver


118


will communicate directly with the AC module and the TC module passes formatted messages (i.e., those messages having Ad-Hoc Routing (AHR) headers) to the Logical Link Control module (LLC). The AC module also provides a number of services to these interfacing modules, including determination and labeling of Quality of Service (QoS) requirements for IP packets, throttling of higher-layer protocols, support of the Mobility Manager (not shown), and generation of appropriate responses to client service requests such as DHCP, ARP, and other broadcast messages. The AC module will rely on local broadcasts, ad hoc routing updates, and unicast requests for information destined to the associated IAP


106


to provide these services transparently to the IP stacks.




Further details of the operations and protocols described above are set forth in a U.S. Patent Application of Eric A. Whitehill entitled “Embedded Routing Algorithms Under the Internet Protocol Routing Layer in a Software Architecture Protocol Stack”, Ser. No. 10/157,979, filed on May 31, 2002, the entire contents of which is incorporated herein by reference.




As further shown in

FIG. 3

, each IAP


106


includes an IAP host


122


and an IAP transceiver


120


. The IAP host


122


includes the appropriate hardware and software to perform TCP, UDP, IP and ARP. Also, IAP host


122


includes the appropriate hardware and software to provide DHCP relaying, IA, a proxy ARP agent, and an NDIS driver. Furthermore, the IAP host


122


includes a driver to provide an interface between the IAP host


122


and the transceiver


120


in the IAP


106


.




In addition to including a modem which can be similar to that in transceiver


118


, the transceiver


120


includes the appropriate hardware and software to perform IP, ARP, AC, TC, AHR, LLC and MAC in a manner similar to that described above for the host


116


and transceiver


118


. The transceiver


120


further includes the appropriate hardware and software for providing IA, UDP, SNMP, DL protocol and DHCP. Further details of the operations and protocols of IAP host and transceiver are discussed below and are set forth in U.S. patent application Ser. No. 10/157,979, referenced above.




In the following discussion, “frame” and “packet” are used interchangeably. A frame typically refers to a piece of link data at layer


2


, the MAC layer. A packet typically refers to a piece of routable data at layer


3


, as with IP. As known to those skilled in the art, during communication, frames are transmitted and packets are routed. Therefore as the routing layer discussed below is between layer


2


and layer


3


, either term may be correctly used.




When an incoming packet destined for a host machine on a particular LAN arrives at a gateway on the LAN which is, for example part of the fixed network


104


shown in

FIG. 1

, the gateway requests that the ARP program find a physical host or MAC address that matches the IP address. The ARP program looks in the ARP cache at the gateway and, if it finds the MAC address, provides the MAC address so that the packet can be converted and formatted as appropriate and sent to the node. If no entry is found for the IP address in the ARP cache, the ARP program broadcasts a request packet in a special format to all the nodes on the LAN to see if any node recognizes that IP address as being associated with its MAC address. A node that recognizes the IP address as its own returns an affirmative reply to the ARP program. A node configured to respond to requests for IP addresses other than its own, for which it is said to proxy, returns an affirmative reply if it recognizes the IP address as one for which it is so configured. In response, the ARP program updates the ARP cache for future reference, and then sends the packet to the node having the MAC address associated with the IP address for which the packet is intended.




Cached address resolutions work well for wired-to-wired or wireless-to-wireless unicast communications, as it reduces the need to resolve every network packet individually. Network addresses are resolved to medium addresses once, then cached for future network packets. In a typical implementation, this cache may have an expiration timeout on the order of 20-120 minutes. Upon timeout, a given network address will be re-resolved to ensure reliable resolution for situations where network addresses of given nodes change periodically, such as the case with a DHCP-managed network.




As shown in

FIG. 3

, when a wireless mobile node


102


resolves network addresses of other devices on the wired medium, a medium address is determined that correlates to the node's associated IAP


106


, which is presumed to be the best media bridge for the node to use. The best IAP


106


may be selected based on bandwidth, spectral efficiency, or other reasons specific to the network. However, given node mobility, the best IAP may not be static for a given mobile node. IAP associations may be formed and broken at a higher rate than the ARP expiration timeout would correct for. The MAC address for the IAP in the ARP cache therefore, may no longer reflect the best IAP, and depending upon ARP expiration timeout rates, the network could allow routing to less-appropriate IAP's.




The embodiment of the present invention shown in

FIG. 3

modifies the address resolution protocol (ARP) to determine IP addresses which are subject to the dynamic link between mobile node and associated IAP. Once determined, the ARP resolves the wired network addresses of these IAP nodes to a particular well-known medium address, that is not used by any real node. The “unique” medium address associated with these IAP nodes may be referred to as a special type of “Cookie”, which is easily identified by medium layer routing protocols. A medium frame addressed with this unique medium address is detected by the medium-layer routing protocols and routed to the node's currently associated IAP, at the moment the frame is sent. In doing so, the cached IAP MAC address is always current, regardless of changing links between mobile nodes and associated IAPs. The unique medium address assigned indicates an optimum IAP is subject to change, and medium-layer routing protocols should direct detection and route the frame to the currently associated IAP.




The modified ARP of

FIG. 3

allows the network-layer ARP protocol to cache and use an entry that is always valid for a given network IAP MAC address so long as the network address does not, by way of DHCP or otherwise, migrate to the wireless medium, at least not more often than the ARP expiration timeout. The security issues mentioned which preclude a node from sending packets through a non-associated IAP, require one additional mechanism in the embodiment of the present invention. Since ad-hoc routed nodes may route through other nodes to reach an IAP, and intermediate routing nodes may be associated to different IAP's, the well-known address is not sufficient for actual frame addressing in the ad-hoc routing medium. An intermediate node would choose to route this type of addressed frame to its own associated IAP instead of the associated IAP of the frame's source. To prevent this, the medium layer routing protocols replace any such well-known address sent from the network layer with the actual medium address of the associated IAP, just as the frames are sent. This ensures proper delivery, even if intermediate nodes are associated to different IAP's.




Although only a few exemplary embodiments of the present invention have been described in detail above, those skilled in the art will readily appreciate that many modifications are possible in the exemplary embodiments without materially departing from the novel teachings and advantages of this invention. Accordingly, all such modifications are intended to be included within the scope of this invention as defined in the following claims.



Claims
  • 1. A method for controlling a plurality of nodes in an ad-hoc communications network to perform address resolution protocol (ARP) on a frame by frame basis, each of said plurality of nodes being adapted to transmit and receive data packets to and from other nodes in said ad-hoc network, said method comprisingcontrolling a first node of said plurality of nodes in generate an address resolution protocol (ARP) request for a first media access control (MAC) address corresponding to an optimum intelligent access point (TAP) for sending a medium frame; controlling a second node to receive and identify said request, and provide a second MAC address, adapted to instruct said first node that said requested first MAC address is a dynamic link address; and controlling said first node to receive said second MAC address and in response, mute said medium frame to a current IAP.
  • 2. A method as claimed in claim 1, wherein said ARP controls said flit node to generate said ARP request.
  • 3. A method as claimed in claim 1, wherein said ARP controls said second node to identify an LAP MAC address corresponding to said dynamic link address, and to designate said second MAC address as the current address for said current LAP.
  • 4. A method as claimed in claim 1, wherein said dynamic link address comprises IAP MAC addresses for said current LAP and associated mobile nodes which are subject to movement relative to one another.
  • 5. A method as claimed in claim 1, wherein said ARP controls said second node to provide said second MAC address upon request for a MAC address corresponding to a dynamic link address.
  • 6. A method as claimed in claim 1, wherein said current LAP comprises the IAP associated with said first node at the time said medium frame is sent.
  • 7. A method as claimed in claim 1, wherein said ARP controls said first node to select said current IAP at the time said medium frame is sent.
  • 8. A method as claimed in claim 1, wherein said current IAP is selected by said first node based upon quantitative factors including bandwidth and spectral efficiency.
  • 9. A method as claimed in claim 1, wherein said second MAC address is included in network-layer ARP protocol.
  • 10. A method as claimed in claim 1, further comprising updating said second MAC address may be updated upon ARP expiration timeout.
  • 11. An apparatus adapted to perform address resolution protocol (ARP) on a flume by frame basis, and being further adapted to transmit and receive data packets to and from other nodes in an ad-hoc network, comprising:a first node, adapted to generate an address resolution protocol (ARP) request fir a first media access control (MAC) address corresponding to an optimum intelligent access point (LAP) for sending a medium frame; a second node, adapted to receive and identify said request, and to provide a second MAC address adapted to instruct said first node that said requested first MAC address is a dynamic link address; and said first node being further adapted to receive said second MAC address and in response, to route said medium frame to a current IAP.
  • 12. An apparatus as claimed in claim 11, wherein said ARP is adapted to control said first node to generate said ARP request.
  • 13. An apparatus as claimed in claim 11, wherein said ARP is adapted to control said second node to identify an IAP MAC address corresponding to said dynamic link address, and to designate said second MAC address as the current address for said current IAP.
  • 14. An apparatus as claimed in claim 11, wherein said dynamic link address comprises IAP MAC addresses for said current IAP and associated mobile nodes which are subject to movement relative to one another.
  • 15. An apparatus as claimed in claim 11, wherein said ARP is adapted to control said second node to provide said second MAC address upon request for a MAC address corresponding to a dynamic link address.
  • 16. An apparatus as claimed in claim 11, wherein said current IAP comprises the IAP associated with said first node at the time said medium frame is sent.
  • 17. An apparatus as claimed in claim 11, wherein said ARP is adapted to control said first node to select said current IAP at the time said medium frame is sent.
  • 18. An apparatus as claimed in claim 11, wherein said current IAP is selected by said first node based upon quantitative factors including bandwidth and spectral efficiency.
  • 19. An apparatus as claimed in claim 11, wherein said second MAC address is included in network-layer ARP protocol.
  • 20. An apparatus as claimed in claim 11, wherein said second node is further adapted to update said second MAC address.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims benefit under 35 U.S.C. § 119(e) from U.S. Provisional Application Serial No. 60/364,023, filed Mar. 15, 2002, the entire contents of which being incorporated herein by reference. Related subject matter is disclosed in a U.S. Provisional Patent Application of Whitehill et al., entitled “A System and Method for Providing A Congestion Optimized Address Resolution Protocol for Wireless Ad-Hoc Networks”, Ser. No. 60/357,645, filed Feb. 20, 2002, and U.S. Patent Application of Barker et al., entitled “A System and Method for Providing A Congestion Optimized Address Resolution Protocol for Wireless Ad-Hoc Networks”, Ser. No. 09/983,176, filed on Oct. 23, 2001, the entire contents of both being incorporated herein by reference.

US Referenced Citations (103)
Number Name Date Kind
4494192 Lew et al. Jan 1985 A
4617656 Kobayashi et al. Oct 1986 A
4736371 Tejima et al. Apr 1988 A
4742357 Rackley May 1988 A
4747130 Ho May 1988 A
4910521 Mellon Mar 1990 A
5034961 Adams Jul 1991 A
5068916 Harrison et al. Nov 1991 A
5231634 Giles et al. Jul 1993 A
5233604 Ahmadi et al. Aug 1993 A
5241542 Natarajan et al. Aug 1993 A
5317566 Joshi May 1994 A
5392450 Nossen Feb 1995 A
5412654 Perkins May 1995 A
5424747 Chazelas Jun 1995 A
5502722 Fulghum Mar 1996 A
5517491 Nanni et al. May 1996 A
5555425 Zeller et al. Sep 1996 A
5555540 Radke Sep 1996 A
5572528 Shuen Nov 1996 A
5615212 Ruszczyk et al. Mar 1997 A
5618045 Kagan et al. Apr 1997 A
5621732 Osawa Apr 1997 A
5623495 Eng et al. Apr 1997 A
5627976 McFarland et al. May 1997 A
5631897 Pacheco et al. May 1997 A
5644576 Bauchot et al. Jul 1997 A
5652751 Sharony Jul 1997 A
5680392 Semaan Oct 1997 A
5684794 Lopez et al. Nov 1997 A
5687194 Paneth et al. Nov 1997 A
5696903 Mahany Dec 1997 A
5701294 Ward et al. Dec 1997 A
5706428 Boer et al. Jan 1998 A
5717689 Ayanoglu Feb 1998 A
5745483 Nakagawa et al. Apr 1998 A
5774876 Woolley et al. Jun 1998 A
5781540 Malcolm et al. Jul 1998 A
5787080 Hulyalkar et al. Jul 1998 A
5794154 Bar-On et al. Aug 1998 A
5796732 Mazzola et al. Aug 1998 A
5796741 Saito et al. Aug 1998 A
5805593 Busche Sep 1998 A
5805842 Nagaraj et al. Sep 1998 A
5805977 Hill et al. Sep 1998 A
5809518 Lee Sep 1998 A
5822309 Ayanoglu et al. Oct 1998 A
5844905 McKay et al. Dec 1998 A
5845097 Kang et al. Dec 1998 A
5857084 Klein Jan 1999 A
5870350 Bertin et al. Feb 1999 A
5877724 Davis Mar 1999 A
5881095 Cadd Mar 1999 A
5881372 Kruys Mar 1999 A
5886992 Raatikainen et al. Mar 1999 A
5896561 Schrader et al. Apr 1999 A
5903559 Acharya et al. May 1999 A
5909651 Chander et al. Jun 1999 A
5936953 Simmons Aug 1999 A
5943322 Mayor et al. Aug 1999 A
5987011 Toh Nov 1999 A
5987033 Boer et al. Nov 1999 A
5991279 Haugli et al. Nov 1999 A
6028853 Haartsen Feb 2000 A
6029217 Arimilli et al. Feb 2000 A
6034542 Ridgeway Mar 2000 A
6044062 Brownrigg et al. Mar 2000 A
6047330 Stracke, Jr. Apr 2000 A
6052594 Chuang et al. Apr 2000 A
6052752 Kwon Apr 2000 A
6064626 Stevens May 2000 A
6067291 Kamerman et al. May 2000 A
6073005 Raith et al. Jun 2000 A
6078566 Kikinis Jun 2000 A
6104712 Robert et al. Aug 2000 A
6108738 Chambers et al. Aug 2000 A
6115580 Chuprun et al. Sep 2000 A
6122690 Nannetti et al. Sep 2000 A
6130881 Stiller et al. Oct 2000 A
6130892 Short et al. Oct 2000 A
6132306 Trompower Oct 2000 A
6147975 Bowman-Amuah Nov 2000 A
6163699 Naor et al. Dec 2000 A
6178337 Spartz et al. Jan 2001 B1
6192053 Angelico et al. Feb 2001 B1
6192230 Van Bokhorst et al. Feb 2001 B1
6208870 Lorello et al. Mar 2001 B1
6223240 Odenwald et al. Apr 2001 B1
6240294 Hamilton et al. May 2001 B1
6246875 Seazholtz et al. Jun 2001 B1
6249516 Brownrigg et al. Jun 2001 B1
6275707 Reed et al. Aug 2001 B1
6285892 Hulyalkar Sep 2001 B1
6304556 Haas Oct 2001 B1
6307843 Okanoue Oct 2001 B1
6327300 Souissi et al. Dec 2001 B1
6349091 Li Feb 2002 B1
6349210 Li Feb 2002 B1
6363065 Thornton et al. Mar 2002 B1
20010005368 Rune Jun 2001 A1
20010024443 Alriksson et al. Sep 2001 A1
20010053699 McCrady et al. Dec 2001 A1
20020044549 Johansson et al. Apr 2002 A1
Foreign Referenced Citations (17)
Number Date Country
2132180 Mar 1996 CA
0513841 Nov 1992 EP
0924890 Jun 1999 EP
2683326 Jul 1993 FR
WO 9608884 Mar 1996 WO
WO 9724005 Jul 1997 WO
WO 9839936 Sep 1998 WO
0627827 Mar 1999 WO
WO 9912302 Mar 1999 WO
WO 0034932 Jun 2000 WO
WO 01101154 Feb 2001 WO
WO 0133770 May 2001 WO
WO 0135567 May 2001 WO
WO 0137481 May 2001 WO
WO 0137482 May 2001 WO
WO 0137483 May 2001 WO
WO 0235253 May 2002 WO
Non-Patent Literature Citations (18)
Entry
Wong et al., “Soft Handoffs in CDMA Mobile Systems”, Dec. 1997, IEEE Personal Communications.
Wong et al., “A Pattern Recognition System for Handoff Algorithms”, Jul. 2000, IEEE Journal on Selected Areas in Communications, vol. 18, No. 7.
Andras G. Valko, “Cellular IP: A New Approach to Internet Host Mobility”, Jan. 1999, ACM Computer Communication Review.
Richard North, Dale Bryan and Dennis Baker, “Wireless Networked Radios: Comparison of Military, Commercial, and R&D Protocols”, Feb. 28-Mar. 3, 1999, 2nd Annual UCSD Conference on Wireless Communications, San Diego CA.
Benjamin B. Peterson, Chris Kmiecik, Richard Hartnett, Patrick M. Thompson, Jose Mendoza and Hung Nguyen, “Spread Spectrum Indoor Geolocation”, Aug. 1998, Navigation: Journal of the Institute of Navigation, vol. 45, No. 2, summer 1998.
Josh Broch, David A. Maltz, David B. Johnson, Yih-Chun Hu and Jorjeta Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols”, Oct. 25-30, 1998, Proceedings of the 4th Annual ACM/IEEE International Conference on Mobile Computing and Networking.
C. David Young, “USAP: A Unifying Dynamic Distributed Multichannel TDMA Slot Assignment Protocol”.
Chip Elliott and Bob Heile, “Self-Organizing, Self-Healing Wireless Networks”, 2000 IEEE.
J.J. Garcia-Luna-Aceves and Asimakis Tzamaloukas, “Reversing the Collision-Avoidance Handshake in Wireless Networks”.
J.J. Garcia-Luna-Aceves and Marcelo Spohn, “Transmission-Efficient Routing in Wireless Networks Using Link-State Information”.
J.J. Garcia-Luna-Aceves and Ewerton L. Madruga, “The Core-Assisted Mesh Protocol”, Aug. 1999, IEEE Journal on Selected Areas in Communications, vol. 17, No. 8.
Ad Kamerman and Gido Aben, “Net Throughput with IEEE 802.11 Wireless LANs”.
J.R. McChesney and R.J. Saulitis, “Optimization of an Adaptive Link Control Protocol for Multimedia Packet Radio Networks”.
Ram Ramanathan and Regina Rosales-Hain, “Topology Control of Multihop Wireless Networks using Transmit Power Adjustment”.
Ram Ramanathan and Martha E. Steenstrup, “Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support”.
Martha E. Steenstrup, “Dynamic Multipoint Virtual Circuits for Multimedia Traffic in Multihop Mobile Wireless Networks”.
Zhenyu Tang and J.J. Garcia-Luna-Aceves, “Collision-Avoidance Transmission Scheduling for Ad-Hoc Networks”.
George Vardakas and Wendell Kishaba, “QoS Networking With Adaptive Link Control and Tactical Multi-Channel Software Radios”.
Provisional Applications (1)
Number Date Country
60/364023 Mar 2002 US