US 7,042,867 B2Grant
System and method for determining physical location of a node in a wireless network during an authentication check of the node
Issue Date:2006-05-09
•30 Claims
•8 Drawing Sheets
Abstract
A system and method for providing security to a wireless network by using a mobile node's location as a parameter for deciding if access is to be given to the node. The system and method employ access points, wireless routers and mobile nodes, each including at least one transceiver adapted to transmit and receive communication signals to and from other wireless routers, mobile nodes and other mobile access points. Each access point is connected to a network management system which allows enhanced network monitoring and control. Each network node includes technology which may determine an absolute node location containing latitude, longitude and altitude of a node, or a relative node location containing the distance and angle between nodes, or a combination of both absolute and relative location data.
Metadata
Assignee
- MeshNetworks, Inc.
Inventors
- Eric A. Whitehill
- Eric D. White
Application Information
Application Number:US 10/270,003
Filing Date:2002-10-15
Priority Date:2002-07-29
Art Unit:2661
Classifications
IPC:
H04Q7/24
Patent Drawings (8 sheets)
Description
[0001] This application claims benefit under 35 U.S.C. §119(e) from U.S. provisional patent application Ser. No. 60/398,834 entitled “A System And Method For Determining Physical Location Of A Node In A Wireless Network During An Authentication Check Of The Node”, filed Jul. 29, 2002, the entire contents of which is incorporated herein by reference.
Background of the Invention
[0002] 1. Field of the Invention
[0003] The present invention relates to a system and method for providing security for a wireless network, such as an ad-hoc wireless communications network, based on the position information relating to mobile nodes. More particularly, the present invention relates to a system and method for trusted infrastructure devices to compute the location of a mobile node in a wireless communications network, such as an ad-hoc terrestrial wireless communications network, during the authentication process.
[0004] 2. Description of the Related Art
[0005] Wireless communications networks, such as mobile wireless telephone networks, have become increasingly prevalent over the past decade. These wireless communications networks are commonly referred to as “cellular networks” because the network infrastructure is arranged to divide the service area into a plurality of regions called “cells”.
[0006] Specifically, a terrestrial cellular network includes a plurality of interconnected base stations that are distributed geographically at designated locations throughout the service area. Each base station includes one or more transceivers that are capable of transmitting and receiving electromagnetic signals, such as radio frequency (RF) communications signals, to and from user nodes, such as wireless telephones, located within the base station coverage area. The communications signals include, for example, voice data that has been modulated according to a desired modulation technique and transmitted as data packets. As can be appreciated by one skilled in the art, the transceiver and user nodes transmit and receive such data packets in multiplexed format, such as time-division multiple access (TDMA) format, code-division multiple access (CDMA) format, or frequency-division multiple access (FDMA) format, which enables a single transceiver at the base station to communicate simultaneously with several user nodes in it's coverage area.
[0007] In recent years, a type of mobile communications network known as an “ad-hoc” network has been developed for use by the military. In this type of network, each user node is capable of operating as a base station or router for the other user nodes, thus eliminating the need for a fixed infrastructure of base stations. 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.
[0008] More sophisticated ad-hoc networks are also being developed which, in addition to enabling user nodes to communicate with each other as in a conventional ad-hoc network, further enable the user nodes to access a fixed network and thus communicate with other user nodes, 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, and 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, the entire content of each being incorporated herein by reference.
[0009] In either conventional wireless communications networks, or in ad-hoc wireless communications networks, it may be necessary or desirable to know or determine the geographic location of user nodes. Different types of location determining services and techniques for wireless communications networks are described in a publication by Nokia which can be found on the Nokia website at “www.nokia.com/press/background/pdf/mlbs.pdf”, the entire content of which being incorporated herein by reference. In particular, the Nokia document states that location identification services are currently provided in wireless communications networks based on three major technologies. One of these technologies uses cell identification combined with Round Trip Time (RTT), Timing Advance (TA) and Measured Signal level (RX level), Time Difference of Arrival (TDOA) and Angle Of Arrival (AOA) techniques, the details of which can be appreciated by one skilled in the art. A second technology uses cellular signal timing based methods for code division multiple access (CDMA) and wideband code division multiple access (WCDMA). The third technology described in the Nokia document employs Global Positioning System (GPS) techniques.
[0010] Another list of methods and techniques currently used in the wireless communications industry for providing location services can be found at “www.911dispatch.com/911_file/location tech.html”, the entire content of which being incorporated herein by reference. Although the GPS technique is the last technique mentioned in this list, it is generally viewed as being more accurate than all of the other methods. Further details and descriptions of GPS based methods are set forth in a publication by J. J. Spilker Jr. entitled “Satellite Constellation and Geometric Dilution of Precision”, in a publication by P. Axelrad et al. entitled “GPS Navigation Algorithms”, in a publication by Bradford W. Parkinson entitled “GPS Error Analysis”, and in a publication by N. Ashby et al. Entitled “Introduction to Relativistic Effects on the Global Positioning System”, each found in “GPS—Theory and Applications”, American Institute of Astronautics, 1996, the entire content of each being incorporated herein by reference.
[0011] Despite the fact that the GPS technique has been in use for a considerable period of time and most of the world's navigation relies on this technique, the GPS technique is very susceptible to errors in measurement. Therefore, the GPS technique is capable of providing location determination results with very high accuracy only after performing a relatively large number of measurements to remove such errors. A description of the shortcomings of GPS is set forth in a document by IMA entitled “Mathematical Challenges in Global Positioning Systems (GPS)” which can be found at “www.ima.umn.edu/gps”, the entire content of this document being incorporated herein by reference. Certain other tests also demonstrate that the GPS technique is unsuitable for terrestrial-based networks.
[0012] In addition, other methods and techniques which do not use GPS satellites for determining mobile station locations in a wireless communications network typically require that the signal from the mobile station be received by at least two cell sites that can measure and process the delay between signal arrivals, identify the direction of the signal based on “path signature”, and determine the distance between mobile station and the cell towers. In all of these methods, information processing is executed in a designated central processing unit (CPU) which is typically located at a cell tower next to the base station (BTS). Also, most of these methods were designed to comply with E911 requirements without requiring that excessive modifications be made to existing wireless communications systems. Examples of other location determining techniques are set forth in a document by CERN European Organization for Nuclear Research, which can be found at “rkb.home.cern.ch/rkb/ANI16pp/node98.html#SECTION00098000000000000000”, in a document by Wendy J Woodbury Straight entitled “Exploring a New Reference System”, which can be found at “menstorsoftwareince.com/profile/newref.html”, and in a document entitled “An Introduction to SnapTrac Server-Aided GPS Technology”, which can be found at “www.snaptrack.com/pdf/ion.pdf”, the entire content of each being incorporated herein by reference. Additional details may also be found in U.S. patent application Ser. No. 09/988,001 entitled “A System and Method for Computing the Location of a Mobile Terminal in a Wireless Communications Network”, filed on Nov. 16, 2001, which describes a system and method for determining location with the use of technologies such as GPS, the entire content being incorporated herein by reference.
[0013] Accordingly, a need exists for a system and method for determining the location of a mobile user node in a wireless communications network by trusted infrastructure devices to determine if the device is physically within a predetermined “safe zone”, and provide access to the network based on this location determination.
Summary of the Invention
[0014] An object of the present invention is to provide a system and method for determining if a mobile node is physically located within a predetermined area of coverage. This may be accomplished with either absolute latitude/longitude location, or by a relative location to a known piece of infrastructure.
[0015] Another object of the present invention is to provide a system and method for providing network access to a mobile node based on determined location.
[0016] These and other objects are substantially achieved by providing a system and method for obtaining the location of a node in a wireless communications network and using the location information when determining if the node should be allowed access to the network. The wireless communications network can be an ad-hoc wireless communications network with each node and reference node being adapted to operate in the ad-hoc wireless communications network. The system and method further performs the operation of estimating a respective distance from the node to each of the reference nodes based on the respective signals received at the node, calculating a respective simulated pattern, such as a sphere or circle about each of the respective reference nodes based on the respective distance from the node to each respective reference node and the respective locations of the respective reference nodes, estimating a location at which each of the simulated patterns intersect each other, and identifying the estimated location as representing the location of the node. When estimating the respective distances from the node to the reference nodes, the system and method can also perform error minimizing techniques.
[0017] The system and method of the present invention determines if a mobile node is physically located in a secure area by the authentication server or it's agent. The location determination agent, at the request of the authentication server, initiates multiple (optimally 4, but at least one) range measurements taken from trusted infrastructure devices (wireless routers or access points) whose physical location is known. These measurements along with the infrastructure device locations are fed into the position algorithm that calculates the mobile node's location. If the result of the algorithm (i.e mobile node's location) is within the physical perimeter defined by the network administrator, then the authentication server receives a confirmation that the mobile node is within the building or area and can proceed with the authentication confirmation.
[0018] This algorithm is essentially identical to the location calculation algorithm that a mobile node may perform in other applications. However, in an embodiment of the present invention, all measurements are under the physical control of assets owned by the network administrator. Also, the position algorithm used is under the control of the trusted authentication server, and avoids relying on the mobile node to provide a valid answer.
Brief Description of the Drawings
[0019] 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:
[0020] FIG. 1 is a block diagram of an example of an ad-hoc packet switched wireless communications network including a plurality of nodes employing an embodiment of the present invention;
[0021] FIG. 2 is a block diagram illustrating an example of a node employed in the network shown in FIG. 1 ;
[0022] FIG. 3 is a diagram illustrating an example of the maximum and secure ranges of an infrastructure device in accordance with an embodiment of the present invention;
[0023] FIG. 4 is a diagram illustrating an example of a network layout with multiple infrastructure devices which have a radio ranges which extend beyond the desired secure area in accordance with an embodiment of the present invention;
[0024] FIG. 5 is a diagram illustrating an example of the secure ranges for each wireless router in FIG. 4 in accordance with an embodiment of the present invention;
[0025] FIG. 6 is a diagram illustrating an example location of several mobile nodes which are within radio range of the wireless network in FIG. 4 in accordance with an embodiment of the present invention; and
[0026] FIG. 7 is a ladder diagram illustrating an example of the flow of messages between devices during the authorization process in accordance with an embodiment of the present invention.
Detailed Description of the Preferred Embodiments
[0027] Wireless nodes wishing to obtain access to an enterprise LAN are typically required to authenticate themselves via the IP standard. Although this verifies that the user has the required challenge information, it does not prevent a computer that has been compromised from accessing the network. Due to the wireless interface, a user doesn't have to be inside the building in order to obtain access. Thus, a compromised computer with a wireless interface could be outside a business' secured environment, such as sitting in a parking lot, and obtain full access to the network services within a business building. Unlike a wired network, the wireless user doesn't need to pass the physical security checks such as a guard desk to obtain building access prior to plugging into the LAN.
[0028] In an embodiment of the present invention, or any other wireless technology which could be extended to add a location measurement (e.g. 802.11), the authentication server can request the wireless routers or access points to take time of flight measurements and report either the time of flight or the calculated distance. The authentication server can then determine if the location of the wireless user is within a defined space, such as a building outline, and the authentication server may reject users that are outside the perimeter.
[0029] FIG. 1 is a block diagram illustrating an example of a wireless communications network 100 employing mobile access nodes, or terminals, according to an embodiment of the present invention. As shown in FIG. 1 , network 100 includes a plurality of devices, including access points (101-1 to 101-2), wireless routers (102-1 to 102-n) and mobile nodes (103-1 to 103-n) on the wireless side of the network, and a Network Operations Center 104 on the wired part of the network. Further details of the network 100 and its operation will now be described. For purposes of this discussion, the terms “user terminal” and “mobile node” will be used interchangeably.
[0030] As shown in FIG. 2 , each access point 101, wireless routers 102 and mobile node 103 includes at least one transceiver 106 and at least one controller 107. Each transceiver 106 is coupled to an antenna 109 and can transmit and receive data packets over any frequency band, for example, over the 2nd Institutional Scientific Medical (ISM) band.
[0031] The frequency and modulation scheme used by the transceiver 106 however, do not impact the implementation of the mobile access points 101, wireless routers 102, or nodes 103. Each node 101, 102 and 103 further includes a memory 108, such as a random access memory (RAM), that is capable of storing, among other things, routing information pertaining to itself and other nodes in the network 100. Certain nodes, in particular, mobile nodes 103-1 through 103-n, can be coupled to a host device 110, such as a personal computer (PC), personal data assistant (PDA), or any other suitable device for use by a user.
[0032] Each access point 101 and wireless router 102 maintains knowledge of their geographic location. This information may be manually entered, or the devices may include positioning functionality, such as global positioning system (GPS) functionality, differential navigation functionality, or other positioning functionality such as various triangulation techniques as can be appreciated by one skilled in the art, or as described in U.S. patent application Ser. No. 09/988,001 referenced above, and in a U.S. patent application of Eric A. Whitehill, Ser. No. 09/973,799, for “A System And Method For Efficiently Performing Two-Way Ranging To Determine The Location Of A Wireless Node In A Communications Network”, filed on Oct. 11, 2001, the entire contents of which being incorporated herein by reference.
[0033] Referring to FIG. 1 , each node 101, 102 and 103 can be in communication with the Network Operations Center 104, either directly or via other nodes. The Network Communication Center typically consists of equipment used to configure and manage the wireless network, however, for the purposes of this description, only the Authentication, Authorization and Accounting (AAA) server 105 is shown.
[0034] Coverage graph 112 of FIG. 3 shows an example of a network 100 deployment where a single access point 101 is used to provide wireless coverage to an area, such as an office, bounded by an office perimeter 114. In this example, the range of the transceiver 106 of the access point 101, shown bounded by 116, is greater than the perimeter 114 of the office. This could potentially allow an unauthorized user, located beyond the perimeter 114 but within the bounded area 116, to access the network 100. As part of the configuration of the network 100, however, the maximum radius of the transceiver range of access point 101 which guarantees that the user is physically in the secure space is determined. This range, shown bounded by 118, is subsequently used during the authorization process to determine if a node requesting access is within a network access restrict boundary.
[0035] Coverage graph 120 of FIG. 4 shows an example of a larger network 100 configuration consisting of a single access point 101 and four wireless routers 102-1, 102-2, 102-3 and 102-4. In this example, the range of the transceiver 106 of each wireless router, shown bounded by 116-1, 116-2, 116-3 and 116-4 respectively, is greater than the perimeter 114 of the office, which could potentially allow an unauthorized user to access the network as described in FIG. 3 . Therefore, as in FIG. 3 , a maximum radius of each transceiver range which guarantees that the user is physically in the secure space is determined and subsequently used during the authorization process as shown in FIG. 5 . As described in greater detail below, in each of FIGS. 3 , 4 and 5, nodes requesting access to the network are first located by the fixed devices 101 and 102 within the network. Location of the requesting node is determined by measuring a distance at which the requesting node is located from a fixed device, including both wireless routers 102 and access point 101. If the requesting node is located within the secure space 118, access for the node is allowable on the basis of position.
[0036] Due to the placement of the devices in FIGS. 4 and 5 however, simply utilizing the distance of a mobile node to a wireless router may be insufficient for determining if the node is in the secure zone of any one wireless router, shown bounded by 118-1, 118-2, 118-3 and 118-4 respectively. As shown in coverage graph 124 of FIG. 6 , mobile nodes 103-2 and 103-3 are both beyond the secure space of each fixed device, however, node 103-2 is located within the perimeter 114 and should be allowed access to the network on the basis of position. As described in greater detail below, the distance between each mobile node 103-1, 103-2 and 103-3 and multiple infrastructure devices must be determined to decide if the “absolute location” of a mobile node is within the perimeter 114, as shown in the coverage graph 124 of FIG. 6 .
[0037] The ladder diagram 126 of FIG. 7 shows an example of the process flow that occurs for one embodiment of the present invention. Using the coverage graph 124 of FIG. 6 as an example, the process flow of FIG. 7 may be used to accurately locate mobile nodes requesting access and restrict network access based upon improper node location. Referring to FIGS. 6 and 7 , the restricted access process of the embodiment of the present invention begins when a mobile node, such as node 103-2, powers up and the transceiver 106 of the node chooses a path to an access point 101, such as via the wireless router 102-1. The mobile node 103-2 sends a request to join the wireless network 100 and the wireless router 102-1 passes the message to the access point 101, which in turn passes the message to the Authentication, Authorization and Accounting (AAA) server 105.
[0038] As part of the authentication process, the AAA server 105 sends a message to the access point 101 requesting the range information of the mobile node 103-2, such as the location of the wireless router 102-1, and the distance between wireless router and the mobile device 103-2. The access point 101 receives the message from the AAA server and sends a request to the wireless router 102-1 to determine the distance between the mobile device 103-2 and the wireless router 102-1. The wireless router 102-1 executes a series of measurements, such as time of flight measurements, and determines the requested distance information, which is then sent to the AAA server 105 via the access point 101. The AAA server then calculates a position for the mobile node 103-2 and determines if the mobile node is within a secure zone 118-1, that is, within a zone in which network access by mobile nodes is allowed.
[0039] If the mobile node 103-2 is not found within the secure zone 118-1 by measurements provided by the wireless router 102-1, the AAA server 105 sends a request for an “absolute position” determination to the access point 101. The access point then requests neighboring wireless routers, such as 102-2, 102-3 and 102-4, to determine the distance between mobile node 103-2 and each wireless router 102-2, 102-3 and/or 102-4 respectively. In addition, the access point 101 may also determine the distance between the mobile node 103-2 and the access point 101. Each wireless router executes a series of measurements, such as time of flight measurements, and determines the requested distance information, which is then sent to the access point 101.
[0040] Upon receiving the additional distance information, the access point 101 calculates the absolute position of the mobile node 103-2 and sends the result to the AAA server 105. The AAA server 105 evaluates the absolute position of the mobile node 103-2 and determines if the mobile node is within the perimeter 114, and if so, sends a response to the original request for access from the wireless router 102-1 to allow the mobile node 103-2 to join the network on the basis of location.
[0041] There can be variations to the process flow in FIG. 7 . For example, in another embodiment of the present invention, the AAA server 105 may request an absolute location without previously requesting the range information. The AAA server 105 may perform the calculations to determine if the mobile node 103 is in the secure zone, or it may send the information to an agent and subsequently use the agent's response. In each embodiment, the AAA server requests and receives location information and uses the location information received as part of the decision to provide service to the node.
[0042] In embodiments of the invention described above, security is maintained as the mobile nodes 103 cannot “spoof” the time of flight measurement used, since any attempt at processing the message would only delay the signal's return and effectively cause a greater distance to be calculated. Likewise, the mobile nodes 103 cannot provide an erroneous location since it they never queried for a self-determined location. All location determinations are done by infrastructure devices under control of the network.
[0043] 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.
Claims
What is claimed is:
1. A method for restricting network access between nodes in an ad-hoc communications network, said nodes being adapted to transmit and receive signals to and from other nodes in said ad-hoc network, the method comprising:
controlling a first node in said ad-hoc communications network to receive a request for network access from a second node and in response, controlling at least one node in said network to calculate a location of said second node;
controlling said first node to allow said second node to have access to said network if said location of said second node is within a network access restriction boundary;
controlling said first node to communicate said request for network access to a third node; and
controlling said third node to communicate to said first node a request for said location calculation of said second node and in response, controlling said first node to calculate said location of said second node and communicate said location to said third node.
2. A method as claimed in claim 1, further comprising:
calculating said locution of said second node based on at least one of a time of flight calculation, a known location of said first node and a known location of said at least one node.
3. A method as claimed in claim 2, further comprising:
calculating said known location of said first node and said at least one node based on at least one of manual position entry, global positioning, differential navigation and triangulation.
4. A method as claimed in claim 1, wherein said at least one node includes said first node.
5. A method as claimed in claim 1, wherein said third node is coupled to a network operations center.
6. A method as claimed in claim 1, wherein said third node includes an authentication, authorization and accounting server.
7. A method as claimed in claim 1, further comprising:
controlling said third node to control said first node to allow said second node to have access to said network if said location of said second node is within said network access restriction boundary.
8. A method as claimed in claim 1, wherein:
said network access restriction boundary is independent of a transmission range of said first node.
9. A method as claimed in claim 1, wherein:
said ad-hoc communications network is a wireless peer-to-peer ad-hoc communications network, said second node is a mobile node, and said location is an absolute location of said second node.
10. A method for restricting network access between nodes in an ad-hoc communications network, said nodes being adapted to transmit and receive signals to and from other nodes in said ad-hoc network, the method comprising:
controlling a first node in said ad-hoc communications network to receive a request for network access from a second node and in response, controlling at least one node in said network to calculate a location of said second node;
controlling said first node to allow said second node to have access to said network if said location of said second node is within a network access restriction boundary;
controlling said first node to communicate said request for network access to a third node;
controlling said third node to communicate a request for an absolute location of said second node to said first node of said ad-hoc communications network and in response, controlling said first node to calculate said absolute location and communicate said absolute location to said third node; and
controlling said third node to control said first node to allow said second node to have access to said network if said absolute location of said second node is within said network access restriction boundary.
11. A method as claimed in claim 10, further comprising:
controlling said first node to calculate said absolute location of said second node based on said known location of at least one node of said network and a calculated location of said second node relative to said at least one node.
12. A system, adapted to restrict network access between nodes in an ad-hoc communications network, said nodes being adapted to transmit and receive signals to and from other nodes in said ad-hoc network, the system comprising:
a first node in said ad-hoc communications network, adapted to receive a request for network access from a second node and in response, to calculate a location of said second node;
said first node being further adapted to allow said second node to have access to said network if said location of said second node is within a network access restriction boundary;
said first node is further adapted to communicate said request for network access to a third node; and
said third node is adapted to communicate to said first node a request for said location calculation and in response, said first node is further adapted to calculate said location of said second node and communicate said location to said third node.
13. A system as claimed in claim 12, wherein:
said first node is further adapted to calculate said location of said second node based on at least one of a time of flight calculation, a known location of said first node and a known location of at least one node.
14. A system as claimed in claim 13, wherein:
said first node is further adapted to calculate said known location of said first node and said at least one node based on at least one of manual position entry, global positioning, differential navigation and triangulation.
15. A system as claimed in claim 12, wherein said at least one node includes said first node.
16. A system as claimed in claim 12, wherein said third node is coupled to a network operations center.
17. A system as claimed in claim 12, wherein said third node includes an authentication, authorization and accounting server.
18. A system as claimed in claim 12, wherein:
said third node is further adapted to control said first node to allow said second node to have access to said network if said location of said second node is within said network access restriction boundary.
19. A system as claimed in claim 12, wherein:
said network access restriction boundary is independent of a transmission range of said first node.
20. A system as claimed in claim 12, wherein:
said ad-hoc communications network is a wireless peer-to-peer ad-hoc communications network, said second node is a mobile node, and said location is an absolute location of said second node.
21. A system, adapted to restrict network access between nodes in an ad-hoc communications network, said nodes being adapted to transmit and receive signals to and from other nodes in said ad-hoc network, the system comprising:
a first node in said ad-hoc communications network, adapted to receive a request for network access from a second node and in response, to calculate a location of said second node;
said first node being further adapted to allow said second node to have access to said network if said location of said second node is within a network access restriction boundary;
said first node is further adapted to communicate said request for network access to a third node;
said third node is further adapted to communicate a request for an absolute location of said second node to said first node of said ad-hoc communications network and in response, said first node is further adapted to calculate said absolute location and communicate said absolute location to said third node; and
said third node is further adapted to control said first node to allow said second node to have access to said ad-hoc communications network if said absolute location of said second node is within said network access restriction boundary.
22. A system as claimed in claim 21, wherein:
said first node is further adapted to calculate said absolute location of said second node based on said known location of at least one node of said network and a calculated location of said second node relative to said at least one node.
23. A computer-readable medium of instructions, adapted to restrict network access between nodes in an ad-hoc communications network, said nodes being adapted to transmit and receive signals to and from other nodes in said ad-hoc network, comprising:
a first set of instructions, adapted to control a first node in said ad-hoc communications network to receive a request for network access from a second node and in response, to calculate a location of said second node, and said first set of instructions being further adapted to control said first node to communicate said request for network access to a third node;
a second set of instructions, adapted to control said first node to allow said second node to have access to said network if said location of said second node is within a network access restriction boundary; and
a third set of instructions, adapted to control said third node to communicate to said first node a request for said location calculation and in response, said first set of instructions is further adapted to control said first node to calculate said location of said second node and communicate said location to said third node.
24. A computer-readable medium of instructions claimed in claim 23, wherein:
said first set of instructions is further adapted to control said first node to calculate said location of said second node based on at least one of a time of flight calculation, a known location of said first node and a known location of at least one node.
25. A computer-readable medium of instructions as claimed in claim 24, wherein:
said first set of instructions is further adapted to control said first node to calculate said known location of said first node and said at least one node based on at least one of manual position entry, global positioning, differential navigation and triangulation.
26. A computer-readable medium of instructions as claimed in claim 23, wherein:
said second set of instructions is further adapted to control first node to allow said second node to have access to said network if said location of said second node is within said network access restriction boundary.
27. A computer-readable medium of instructions as claimed in claim 23, wherein:
said third set of instructions is further adapted to control said third node to communicate a request for an absolute location of said second node to said first node of said ad-hoc communications network and in response, said first set of instructions is further adapted to control said first node to calculate said absolute location and communicate said absolute location to said third node; and
said second set of instructions is further adapted to control first node to allow said second node to have access to said network if said absolute location of said second node is within said network access restriction boundary.
28. A computer-readable medium of instructions as claimed in claim 27, wherein:
said first set of instructions is further adapted to control said first node to calculate said absolute location of said second node based on said known location of at least one node of said network and a calculated location of said second node relative to said at least one node.
29. A computer-readable medium of instructions as claimed in claim 23, wherein:
said network access restriction boundary is independent of a transmission range of said first node.
30. A computer-readable medium of instructions as claimed in claim 23, wherein:
said ad-hoc communications network is a wireless peer-to-peer ad-hoc communications network, said second node is a mobile node, and said location is absolute location of said second node.
Patent Citations (145)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4494192(A) | 1985-01-01 | Lew et al. | Applicant |
| US4617656(A) | 1986-10-01 | Kobayashi et al. | Applicant |
| US4736371(A) | 1988-04-01 | Tejima et al. | Applicant |
| US4742357(A) | 1988-05-01 | Rackley | Applicant |
| US4747130(A) | 1988-05-01 | Ho | Applicant |
| US4910521(A) | 1990-03-01 | Mellon | Applicant |
| US5034961(A) | 1991-07-01 | Adams | Applicant |
| US5068916(A) | 1991-11-01 | Harrison et al. | Applicant |
| US5231634(A) | 1993-07-01 | Giles et al. | Applicant |
| US5233604(A) | 1993-08-01 | Ahmadi et al. | Applicant |
| US5241542(A) | 1993-08-01 | Natarajan et al. | Applicant |
| US5317566(A) | 1994-05-01 | Joshi | Applicant |
| US5392450(A) | 1995-02-01 | Nossen | Applicant |
| US5412654(A) | 1995-05-01 | Perkins | Applicant |
| US5424747(A) | 1995-06-01 | Chazelas | Applicant |
| US5502446(A) | 1996-03-01 | Denninger | Examiner |
| US5502722(A) | 1996-03-01 | Fulghum | Applicant |
| US5517491(A) | 1996-05-01 | Nanni et al. | Applicant |
| US5555425(A) | 1996-09-01 | Zeller et al. | Applicant |
| US5555540(A) | 1996-09-01 | Radke | Applicant |
| US5572528(A) | 1996-11-01 | Shuen | Examiner |
| US5615212(A) | 1997-03-01 | Ruszczyk et al. | Applicant |
| US5618045(A) | 1997-04-01 | Kagan et al. | Applicant |
| US5621732(A) | 1997-04-01 | Osawa | Applicant |
| US5623495(A) | 1997-04-01 | Eng et al. | Applicant |
| US5627976(A) | 1997-05-01 | McFarland et al. | Applicant |
| US5631897(A) | 1997-05-01 | Pacheco et al. | Applicant |
| US5644576(A) | 1997-07-01 | Bauchot et al. | Applicant |
| US5652751(A) | 1997-07-01 | Sharony | Applicant |
| US5680392(A) | 1997-10-01 | Semaan | Applicant |
| US5684794(A) | 1997-11-01 | Lopez et al. | Applicant |
| US5687194(A) | 1997-11-01 | Paneth et al. | Applicant |
| US5696903(A) | 1997-12-01 | Mahany | Applicant |
| US5701294(A) | 1997-12-01 | Ward et al. | Applicant |
| US5706428(A) | 1998-01-01 | Boer et al. | Applicant |
| US5717689(A) | 1998-02-01 | Ayanoglu | Applicant |
| US5745483(A) | 1998-04-01 | Nakagawa et al. | Applicant |
| US5774876(A) | 1998-06-01 | Wooley et al. | Applicant |
| US5781540(A) | 1998-07-01 | Malcolm et al. | Applicant |
| US5787080(A) | 1998-07-01 | Hulyalkar et al. | Applicant |
| US5794154(A) | 1998-08-01 | Bar-On et al. | Applicant |
| US5796732(A) | 1998-08-01 | Mazzola et al. | Applicant |
| US5796741(A) | 1998-08-01 | Saito et al. | Applicant |
| US5805593(A) | 1998-09-01 | Busche | Applicant |
| US5805842(A) | 1998-09-01 | Nagaraj et al. | Applicant |
| US5805977(A) | 1998-09-01 | Hill et al. | Applicant |
| US5809518(A) | 1998-09-01 | Lee | Applicant |
| US5822309(A) | 1998-10-01 | Ayanoglu et al. | Applicant |
| US5835857(A) | 1998-11-01 | Otten | Examiner |
| US5844905(A) | 1998-12-01 | McKay et al. | Applicant |
| US5845097(A) | 1998-12-01 | Kang et al. | Applicant |
| US5857084(A) | 1999-01-01 | Klein | Applicant |
| US5870350(A) | 1999-02-01 | Bertin et al. | Applicant |
| US5877724(A) | 1999-03-01 | Davis | Applicant |
| US5881095(A) | 1999-03-01 | Cadd | Applicant |
| US5881372(A) | 1999-03-01 | Kruys | Applicant |
| US5886992(A) | 1999-03-01 | Raatikainen et al. | Applicant |
| US5896561(A) | 1999-04-01 | Schrader et al. | Applicant |
| US5903559(A) | 1999-05-01 | Acharya et al. | Applicant |
| US5909651(A) | 1999-06-01 | Chander et al. | Applicant |
| US5936953(A) | 1999-08-01 | Simmons | Applicant |
| US5943322(A) | 1999-08-01 | Mayor et al. | Applicant |
| US5987011(A) | 1999-11-01 | Toh | Applicant |
| US5987033(A) | 1999-11-01 | Boer et al. | Applicant |
| US5991279(A) | 1999-11-01 | Haugli et al. | Applicant |
| US6028853(A) | 2000-02-01 | Haartsen | Applicant |
| US6029217(A) | 2000-02-01 | Arimilli et al. | Applicant |
| US6034542(A) | 2000-03-01 | Ridgeway | Applicant |
| US6034950(A) | 2000-03-01 | Sauer et al. | Examiner |
| US6044062(A) | 2000-03-01 | Brownrigg et al. | Applicant |
| US6047330(A) | 2000-04-01 | Stracke, Jr. | Applicant |
| US6052594(A) | 2000-04-01 | Chuang et al. | Applicant |
| US6052752(A) | 2000-04-01 | Kwon | Applicant |
| US6064626(A) | 2000-05-01 | Stevens | Applicant |
| US6067291(A) | 2000-05-01 | Kamerman et al. | Applicant |
| US6067297(A) | 2000-05-01 | Beach | Applicant |
| US6078566(A) | 2000-06-01 | Kikinis | Applicant |
| US6088337(A) | 2000-07-01 | Eastmond et al. | Examiner |
| US6104712(A) | 2000-08-01 | Robert et al. | Applicant |
| US6108738(A) | 2000-08-01 | Chambers et al. | Applicant |
| US6115580(A) | 2000-09-01 | Chuprun et al. | Applicant |
| US6122690(A) | 2000-09-01 | Nannetti et al. | Applicant |
| US6130881(A) | 2000-10-01 | Stiller et al. | Applicant |
| US6132306(A) | 2000-10-01 | Trompower | Applicant |
| US6163699(A) | 2000-12-01 | Naor et al. | Applicant |
| US6178337(B1) | 2001-01-01 | Spartz et al. | Applicant |
| US6192053(B1) | 2001-02-01 | Angelico et al. | Applicant |
| US6192230(B1) | 2001-02-01 | Van Bokhorst et al. | Applicant |
| US6208870(B1) | 2001-03-01 | Lorello et al. | Applicant |
| US6222463(B1) | 2001-04-01 | Rai | Applicant |
| US6223240(B1) | 2001-04-01 | Odenwald et al. | Applicant |
| US6240294(B1) | 2001-05-01 | Hamilton et al. | Applicant |
| US6246875(B1) | 2001-06-01 | Seazholtz et al. | Applicant |
| US6249516(B1) | 2001-06-01 | Brownrigg et al. | Applicant |
| US6275707(B1) | 2001-08-01 | Reed et al. | Applicant |
| US6285892(B1) | 2001-09-01 | Hulyalkar | Applicant |
| US6304556(B1) | 2001-10-01 | Haas | Applicant |
| US6327300(B1) | 2001-12-01 | Souissi et al. | Applicant |
| US6349091(B1) | 2002-02-01 | Li | Applicant |
| US6349210(B1) | 2002-02-01 | Li | Applicant |
| US6359872(B1) | 2002-03-01 | Mahany et al. | Applicant |
| US6377636(B1) | 2002-04-01 | Paulraj et al. | Examiner |
| US6404756(B1) | 2002-06-01 | Whitehill et al. | Examiner |
| US6456599(B1) | 2002-09-01 | Elliott | Examiner |
| US6505049(B1) | 2003-01-01 | Dorenbosch | Examiner |
| US6519464(B1) | 2003-02-01 | Santhoff et al. | Examiner |
| US6539232(B1) | 2003-03-01 | Hendrey et al. | Examiner |
| US6574266(B1) | 2003-06-01 | Haartsen | Examiner |
| US6618690(B1) | 2003-09-01 | Syrjarinne | Examiner |
| US6625135(B1) | 2003-09-01 | Johnson et al. | Examiner |
| US6697649(B1) | 2004-02-01 | Bennett et al. | Examiner |
| US6728545(B1) | 2004-04-01 | Belcea | Examiner |
| US6744740(B1) | 2004-06-01 | Chen | Examiner |
| US6826385(B1) | 2004-11-01 | Kujala | Examiner |
| US2001/0053699(A1) | 2001-12-01 | McCrady et al. | Applicant |
| US2002/0131386(A1) | 2002-09-01 | Gwon | Examiner |
| US2003/0012168(A1) | 2003-01-01 | Elson et al. | Examiner |
| US2003/0035437(A1) | 2003-02-01 | Garahi et al. | Examiner |
| US2003/0053424(A1) | 2003-03-01 | Krishnamurthy et al. | Examiner |
| US2003/0073406(A1) | 2003-04-01 | Benjamin et al. | Examiner |
| US2003/0091010(A1) | 2003-05-01 | Garahi et al. | Examiner |
| US2003/0118015(A1) | 2003-06-01 | Gunnarsson et al. | Examiner |
| US2003/0156558(A1) | 2003-08-01 | Cromer et al. | Examiner |
| US2003/0177219(A1) | 2003-09-01 | Taib et al. | Examiner |
| US2003/0232620(A1) | 2003-12-01 | Runkle et al. | Examiner |
| US2003/0233580(A1) | 2003-12-01 | Keeler et al. | Examiner |
| US2003/0235175(A1) | 2003-12-01 | Naghian et al. | Examiner |
| US2004/0203380(A1) | 2004-10-01 | Hamdi et al. | Examiner |
| CA2132180 | 1996-03-01 | Applicant | |
| EP513841(A2) | 1992-11-01 | Applicant | |
| EP627827(A2) | 1994-12-01 | Applicant | |
| EP924890(A2) | 1999-06-01 | Applicant | |
| FR2683326 | 1993-07-01 | Applicant | |
| WO9608884 | 1996-03-01 | Applicant | |
| WO9724005 | 1997-07-01 | Applicant | |
| WO9839936 | 1998-09-01 | Applicant | |
| WO9912302 | 1999-03-01 | Applicant | |
| WO34932 | 2000-06-01 | Applicant | |
| WO110154 | 2001-02-01 | Applicant | |
| WO133770 | 2001-05-01 | Applicant | |
| WO135567 | 2001-05-01 | Applicant | |
| WO137481 | 2001-05-01 | Applicant | |
| WO137482 | 2001-05-01 | Applicant | |
| WO137483 | 2001-05-01 | Applicant | |
| WO235253 | 2002-05-01 | Applicant |
Non-Patent Literature (17)
- Wong et al., “Soft Handoffs in CDMA Mobile Systems”, Dec. 1997, IEEE Personal Communications.Applicant
- Wong et al., “A Pattern Recognition System for Handoff Algorithms”, Jul. 2000, IEEE Journal on Selected Areas in Communications, vol. 18, No. 7.Applicant
- Andras G. Valko, “Cellular IP: A New Approach to Internet Host Mobility”, Jan. 1999, ACM Computer Communication Review.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- C. David Young, “USAP: A Unifying Dynamic Distributed Multichannel TDMA Slot Assignment Protocol”.Applicant
- Chip Elliott and Bob Heile, “Self-Organizing, Sef-Healing Wireless Networks”, 2000 IEEE.Applicant
- J.J. Garcia-Luna-Aceves and Asimakis Tzamaloukas, “Reversing the Collision-Avoidance Handshake in Wireless Networks”.Applicant
- J.J. Garcia-Luna-Aceves and Marcelo Spohn, “Transmission-Efficient Routing in Wireless Networks Using Link-State Information”.Applicant
- 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.Applicant
- Ad Kamerman and Guido Aben, “Net Throughput with IEEE 802.11 Wireless LANs”.Applicant
- J.R. McChesney and R.J. Saulitis, “Optimization of an Adaptive Link Control Protocol for Multimedia Packet Radio Networks”.Applicant
- Ram Ramanathan and Regina Rosales-Hain, “Topology Control of Multihop Wireless Networks using Transmit Power Adjustment”.Applicant
- Ram Ramanathan and Martha E. Steenstrup, “Hierarchically-Organized, Multihop Mobile Wireless Networks for Quality-of-Service Support”.Applicant
- Zhenyu Tang and J.J. Garcia-Luna-Aceves, “Collision-Avoidance Transmission Scheduling for Ad-Hoc Networks”.Applicant
- George Vardakas and Wendell Kishaba, “QoS Networking With Adaptive Link Control and Tactical Multi-Channel Software Radios”.Applicant