Bandwidth efficient system and method for ranging nodes in a wireless communication network

• US 7,382,804 B2
• Filed: 08/05/2005
• Issued: 06/03/2008
• Est. Priority Date: 08/05/2004
• Status: Active Grant

• Current Assignee: ARRIS Enterprises LLC (CommScope Holding Company, Inc.)
• Original Assignee: MeshNetworks, Inc. (Motorola Solutions, Inc.)
• Inventors: Belcea, John M., Alapuranen, Pertti O., Lorenzo-Luaces, Eduardo
• Primary Examiner(s): TRAN, TUAN A
• Application Number:
  US11/197,950
• Publication Number:
  US 20060029009A1
• Time in Patent Office: 1,033 Days
• Field of Search: 370/503, 370/508, 370/509, 370/519, 370/252, 370/350, 370/253, 370/236, 370/249, 4554561- 6, 455/445, 455/457, 455/500, 455/502, 455/507, 455/513, 455517-519
• US Class Current: 370/509
• CPC Class Codes: G01S 11/02 using radio waves G01S19/00 takes precedence
• CPC Class Codes: G01S 5/0289 of multiple transceivers, e.g. in ad hoc networks
• CPC Class Codes: H04B 17/27 for locating or positioning the transmitter
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• 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

Abstract

The present invention provides a bandwidth efficient system and method of measuring the range between nodes (102, 106, 107) in a wireless communications network (100) with one-way data transfer, where each node (102, 106, 107) periodically transmits a message that contains information regarding neighboring nodes (102, 106, 107) from which any prior messages have been received by the transmitting node (102, 106, 107). A node (102, 106, 107) receives the messages transmitted from neighboring nodes (102, 106, 107) in the network (100), and records the times of arrival of the received messages. The node (102, 106, 107) receiving those messages can thus determine the respective distances between itself and the neighboring nodes (102, 106, 107) based on the respective time of arrivals of the received messages and the respective information included in the respective messages.

Claims

1. A method for determining distances between nodes in a wireless communication network, comprising:

operating a plurality of nodes in the wireless communication network to periodically transmit respective messages, each of the nodes including a clock which is unsynchronized with the clocks of the other nodes, and each respective message transmitted by a respective node contains respective information pertaining to neighboring nodes of that respective node from which any previous messages have been received by that respective node; and

operating at least one of the nodes in the wireless communication network to receive the messages from its respective neighboring nodes, to record the respective times of arrival of the respective received messages, and to determine respective distances between itself and the respective neighboring nodes based on the respective times of arrival of the respective received messages and the respective information in the respective received messages.

2. The method as claimed in claim 1, wherein the step of operating at least one of the nodes comprises:

operating that node to identify respective differences between its clock frequency and respective information pertaining to frequencies of the clocks of the other nodes included in the respective received messages, and to adjust the respective times of arrival based on the respective differences;

operating that node to transmit information related to drift of its clock relative to all neighboring clocks in the respective messages; and

operating that node to determine the respective distances between itself and the respective neighboring nodes based on the adjusted respective times of arrival of the respective received messages and the respective information in the respective received messages.

3. The method as claimed in claim 2, wherein:

the information in a said message comprises information pertaining to respective times of arrival of the previous messages received by the node transmitting that said message.

4. The method as claimed in claim 1, wherein the step of operating at least one of the nodes comprises:

operating that node to determine respective time of flight values for the respective received messages to travel from their respective transmitting neighboring nodes to that node based on the respective times of arrival of the respective received messages and the respective information in the respective received messages; and

operating that node to determine the respective distances between itself and the respective neighboring nodes based on the respective time of flight values.

5. The method as claimed in claim 1, wherein:

the information in a said message comprises information pertaining to respective locations of the neighboring nodes that transmitted the previous messages received by the node transmitting that said message.

6. The method as claimed in claim 1, wherein:

the step of operating the node comprises operating the node to perform one-way ranging to determine the respective distances between itself and the respective neighboring nodes such that the node receives the respective messages from its respective neighboring nodes without first requesting the respective messages from its respective neighboring nodes.

7. The method as claimed in claim 1, wherein:

the wireless communication network comprises a multihopping wireless network, and the operating steps are performed on the nodes communicating in the multihopping wireless network.

8. The method as claimed in claim 1, wherein the step of operating the plurality of nodes comprises operating the plurality of nodes in the wireless communication network to periodically transmit respective messages when a terminal clock register is zero.

9. A wireless communication network, comprising:

a plurality of nodes, each comprising a clock which is unsynchronized with the clocks of the other nodes, and each being adapted to periodically transmit a respective message, each respective message transmitted by a respective node contains respective information pertaining to neighboring nodes of that respective node from which any previous messages have been received by that respective node; and

at least one of the nodes is adapted to receive the messages from its respective neighboring nodes, to record the respective times of arrival of the respective received messages, and to determine respective distances between itself and the respective neighboring nodes based on the respective times of arrival of the respective received messages and the respective information in the respective received messages.

10. The wireless communication network as claimed in claim 9, wherein:

said at least one node is further adapted to identify respective differences between its clock frequency and respective information pertaining to frequencies of the clocks of the other nodes included in the respective received messages, to adjust the respective times of arrival based on the respective differences, and to determine the respective distances between itself and the respective neighboring nodes based on the adjusted respective times of arrival of the respective received messages and the respective information in the respective received messages.

11. The wireless communication network as claimed in claim 9, wherein:

said at least one node is further adapted to determine respective time of flight values for the respective received messages to travel from their respective transmitting neighboring nodes to that node based on the respective times of arrival of the respective received messages and the respective information in the respective received messages, and to determine the respective distances between itself and the respective neighboring nodes based on the respective time of flight values.

12. The wireless communication network as claimed in claim 9, wherein:

the information in a said message comprises information pertaining to respective times of arrival of the previous messages received by the node transmitting that said message.

13. The wireless communication network as claimed in claim 9, wherein:

the information in a said message comprises information pertaining to respective locations of the neighboring nodes that transmitted the previous messages received by the node transmitting that said message.

14. The wireless communication network as claimed in claim 9, wherein:

said at least one node is further adapted to perform one-way ranging to determine the respective distances between itself and the respective neighboring nodes such that the node is adapted to receive the respective messages from its respective neighboring nodes without first requesting the respective messages from its respective neighboring nodes.

15. The wireless communication network as claimed in claim 9, wherein:

the wireless communication network comprises a multihopping wireless network, and the nodes are adapted to communicate in the multihopping wireless network.

16. A node, adapted to communicate in a wireless communication network, the node comprising:

a clock which is unsynchronized with clocks of other nodes in the wireless communication network;

a transceiver, adapted to periodically transmit a respective message, each respective message containing respective information pertaining to neighboring nodes of the node from which any previous messages have been received by the node, and further adapted to receive messages from its respective neighboring nodes; and

a controller, adapted to record the respective times of arrival of the respective received messages, and to determine respective distances between itself and the respective neighboring nodes based on the respective times of arrival of the respective received messages and the respective information in the respective received messages.

17. The node as claimed in claim 16, wherein:

the controller is further adapted to identify respective differences between a frequency of the clock of the node and respective information pertaining to frequencies of the clocks of the other nodes included in the respective received messages, to adjust the respective times of arrival based on the respective differences, and to determine the respective distances between the node and the respective neighboring nodes based on the adjusted respective times of arrival of the respective received messages and the respective information in the respective received messages.

18. The node as claimed in claim 16, wherein:

the controller is further adapted to determine respective time of flight values for the respective received messages to travel from their respective transmitting neighboring nodes to the node based on the respective times of arrival of the respective received messages and the respective information in the respective received messages, and to determine the respective distances between the node and the respective neighboring nodes based on the respective time of flight values.

19. The node as claimed in claim 16, wherein:

the information in a said message comprises information pertaining to respective times of arrival of the previous messages received by the node transmitting that said message.

20. The node as claimed in claim 16, wherein:

the information in a said message comprises information pertaining to respective locations of the neighboring nodes that transmitted the previous messages received by the node transmitting that said message.

21. The node as claimed in claim 16, wherein:

the controller is adapted to control the node to perform one-way ranging to determine the respective distances between the node and the respective neighboring nodes by controlling the transceiver to receive the respective messages from the respective neighboring nodes without first transmitting a request for the respective messages to the respective neighboring nodes.