LOCATION DETECTION IN A WIRELESS NETWORK

• US 20110110242A1
• Filed: 11/06/2009
• Published: 05/12/2011
• Est. Priority Date: 11/06/2009
• Status: Active Grant

• Current Assignee: Rosemount Incorporated (Emerson Electric Company)
• Original Assignee: Rosemount Incorporated (Emerson Electric Company)
• Inventors: Chen, Deji, Schleiss, Trevor Duncan, Rotvold, Eric, Karschnia, Robert, Nixon, Mark
• Granted Patent: US 8,811,199 B2
• Time in Patent Office: Days
• US Class Current: 370/252
• CPC Class Codes: H04W 56/009 Closed loop measurements
• CPC Class Codes: H04W 64/00 Locating users or terminals or network equipment for network management purposes, e.g. mobility management
• CPC Class Codes: H04W 84/18 Self-organising networks, e.g. ad-hoc networks or sensor networks
• CPC Class Codes: Y02D 30/70 in wireless communication networks

Abstract

A first node sends a first message to a second node. The second node sends a second message to the first node. A first elapsed time is measured from the beginning of the transmission of the first message to the beginning of receipt of the second message. A second elapsed time is measured from the beginning of the receipt of the first message to the beginning of the transmission of the second message. The second node sends a third message to the first node containing the second elapsed time. The distance between the first and second node is calculated based on these elapsed times and a calibration count multiplier contained in the second or third message. A node may be moved within a wireless mesh network. Positional information about the node and distances to its neighbors is determined and transmitted to the network manager where it is stored.

Claims

1. A method for locating a node within a wireless mesh network comprising:

measuring, by a first node, a calibration count multiplier;

measuring, by a second node, a second calibration count multiplier;

transmitting a first message by the first node;

receiving the first message by the second node;

transmitting a second message by the second node;

receiving the second message by the first node;

measuring a first elapsed time from a beginning of transmitting the first message to a beginning of receiving the second message;

measuring a second elapsed time from a beginning of receiving the first message to a beginning of transmitting the second message;

transmitting a third message by second node containing the second elapsed time;

receiving the third message by the first node; and

calculating a distance between the first and second nodes based upon the first and second elapsed times and the first and second calibration count multipliers;

wherein the second calibration count multiplier is contained in either the second or third message.

2. The method of claim 1 wherein measuring a first elapsed time from a beginning of transmitting the first message to a beginning of receiving the second message further comprises:

recording a first timestamp at the beginning of transmitting the first message;

recording a second timestamp at the beginning of receiving the second message; and

calculating the first elapsed time by subtracting the first timestamp from the second timestamp.

3. The method of claim 1 wherein measuring a second elapsed time from a beginning of receiving the first message to a beginning of transmitting the second message further comprises:

recording a first timestamp at the beginning of receiving the first message;

recording a second timestamp at the beginning of transmitting the second message; and

calculating the second elapsed time by subtracting the first timestamp from the second timestamp.

4. The method of claim 1 wherein measuring a first elapsed time from a beginning of transmitting the first message to a beginning of receiving the second message further comprises:

starting a counter at the beginning of transmitting the first message; and

reading the counter at the beginning of receiving the second message to determine the first elapsed time.

5. The method of claim 1 measuring a second elapsed time from a beginning of receiving the first message to a beginning of transmitting the second message further comprises:

starting a counter at the beginning of receiving the first message; and

reading the counter at the beginning of transmitting the second message to determine the second elapsed time.

6. The method of claim 1 wherein the first and second elapsed times have a resolution of at least 1 nanosecond.

7. The method of claim 1 wherein the first and second elapsed times have a resolution of approximately 10 nanoseconds.

8. The method of claim 1 wherein the first and second elapsed times have a resolution of approximately 20 nanoseconds.

9. The method of claim 1 further comprising:

determining a distance between the first node and a third node; and

calculating a position of the first node in two dimensions based upon the distance between the first and second nodes and the distance between the first and third nodes.

10. The method of claim 9 further comprising:

reporting the position of the first node to a network manager; and

maintaining, by the network manager, a map including the position of the first node.

11. The method of claim 10 further comprising:

displaying the map on a graphical interface.

12. The method of claim 10 further comprising:

maintaining a position of all known nodes within an area defined by the map;

detecting an object within the area; and

raising an alarm if the object is not a known node within the area.

13. The method of claim 1 further comprising:

determining a distance between the first node and a third node;

determining a distance between the first node and a fourth node; and

calculating a position of the first node in three dimensions based upon the distance between the first and second nodes, the distance between the first and third nodes, and the distance between the first and fourth nodes.

14. The method of claim 13 further comprising:

reporting the position of the first node to a network manager; and

maintaining, by the network manager, a map including the position of the first node.

15. The method of claim 14 further comprising:

displaying the map on a graphical interface.

16. The method of claim 15 further comprising:

maintaining a position of all known nodes within an area defined by the map;

detecting an object within the area; and

raising an alarm if the object is not a known node within the area.

17. A method for locating a node within a wireless mesh network comprising:

positioning a node in more than one location within the wireless mesh network;

determining, for each location, positional information about the node;

exchanging calibration count multipliers between the node and a plurality of nodes installed in the wireless network;

measuring a first plurality of distances from the plurality of nodes to the node at each location using a time of flight measurement and the calibration count multipliers;

transmitting the first plurality of distances and the positional information about the node for each location to a network manager; and

storing, by the network manager, the first plurality of distances and the positional information for each location.

18. The method of claim 17 wherein storing, by the network manager, the first plurality of distances and the positional information for each location further comprises filtering the first plurality of distances and storing only those associated with a fixed node.

19. The method of claim 17 wherein storing, by the network manager, the first plurality of distances and the positional information for each location further comprises comparing the first plurality of distances to a set of previously stored plurality of distances and storing only those within one standard deviation of the set of previously stored plurality of distances.

20. The method of claim 17 wherein transmitting the first plurality of distances and the positional information about the node for each location to a network manager further comprises filtering the first plurality of distances and transmitting only those associated with a fixed node.

21. The method of claim 17 wherein at least one of the plurality of nodes is a locator beacon.

22. The method of claim 17 wherein the node is a mobile node.

23. The method of claim 17 wherein measuring a first plurality of distances from a plurality of nodes installed in the wireless mesh network to the node at each location comprises using a time of flight measurement and a calibration count multiplier to calculate the first plurality of distances.

24. The method of claim 17 wherein determining, for each location, positional information about the node further comprises obtaining a GPS measurement of a position of the node.

25. The method of claim 24 wherein determining, for each location, positional information about the node further comprises using a GPS repeater installed near the wireless mesh network to increase a signal strength of the GPS measurement.

26. The method of claim 17 further comprising:

positioning the node within the wireless mesh network;

measuring a second plurality of distances from the plurality of nodes installed in the wireless mesh network to the node;

transmitting the second plurality of distances to the network manager;

determining a location of the node based on the second plurality of distances and the stored first plurality of distances and positional information.

27. The method of claim 17 further comprising:

positioning a second node within the wireless mesh network;

measuring a second plurality of distances from the plurality of nodes installed in the wireless mesh network to the second node;

transmitting the second plurality of distances to the network manager;

determining a location of the second node based on the second plurality of distances and the stored first plurality of distances and positional information.

28. The method of claim 27 wherein measuring a second plurality of distances from the plurality of nodes installed in the wireless mesh network to the second node further comprises using a time of flight measurement and a calibration count multiplier to calculate the second plurality of distances.

29. The method of claim 27 wherein determining a location of the second node based on the second plurality of distances and the stored first plurality of distances and positional information further comprises triangulating a region based upon the second plurality of distances and searching only the stored first plurality of distances and positional information located in the region.

30. The method of claim 27 wherein determining a location of the second node based on the second plurality of distances and the stored first plurality of distances and positional information further comprises searching the stored first plurality of distances and positional information using a least squares algorithm.

31. The method of claim 27 wherein determining a location of the second node based on the second plurality of distances and the stored first plurality of distances and positional information further comprises searching the stored first plurality of distances and positional information using a neural network algorithm.

32. The method of claim 27 further comprising:

displaying a graphical representation of the location of the second node.

33. The method of claim 27 further comprising:

maintaining a status of a position of all known nodes in the wireless mesh network;

detecting a position of an object within a region of coverage of the wireless mesh network; and

raising an alarm if the position of the object is not a known node in the wireless mesh network.