Determining node location using a master node association in a wireless node network

Patent metadata

Field	Value
Publication number	US-9854556-B2
Application number	US-201414489583-A
Country	US
Kind code	B2
Filing date	Sep 18, 2014
Priority date	Nov 29, 2013
Publication date	Dec 26, 2017
Grant date	Dec 26, 2017

Abstract

Improved methods and apparatus are described for determining node locations using one or more associations of nodes in a wireless node network. In general, a first node (such as a master node) may broadcast one or more first messages at a first anticipated range distance. The first node identifies which nodes associated with the first node received at least one of the first messages, such as by reports from associated nodes that receives such message(s). The first node then broadcasts one or more second messages at a smaller anticipated range distance (e.g., with a lower output power level), and determines a location of those associated nodes that did not receive any second messages but received at least one of the first messages. Such a location is between the first anticipated range distance from the first node and the second anticipated range distance from the first node.

First claim

What is claimed is:

1. A method for location determination using one or more associations of nodes in a wireless node network, the method comprising:
broadcasting one or more first messages by a first of the nodes at a first anticipated range distance;
identifying which of the nodes associated with the first node received at least one of the first messages;
broadcasting one or more second messages by the first node at a second anticipated range distance, which is incrementally smaller than the first anticipated range distance; and
determining a location of one or more of the identified associated nodes that did not receive any second messages but received at least one of the first messages, the location being between the first anticipated range distance from the first node and the second anticipated range distance from the first node.

2. The method of claim 1 further comprising the steps of:
broadcasting one or more third messages by the first node at a third anticipated range distance, which is incrementally smaller range than the second anticipated range distance; and
determining a location of one or more of the identified associated nodes that did not receive any of the third messages but received at least one of the second messages, the location being between the second anticipated range distance from the first node and the third anticipated range distance from the first node.

3. The method of claim 1 , wherein the first anticipated range distance is an optimal broadcasting range for the first of the nodes.

4. The method of claim 3 , wherein the first anticipated range distance is the optimal range for the first of the nodes adjusted based upon context data.

5. The method of claim 4 , wherein the first anticipated range distance and the second anticipated range distance are adjusted based upon one or more types of context data related to how an RF output signal from the first node may be impeded.

6. The method of claim 1 , wherein the identifying step further comprises reviewing association data as part of identifying which of the nodes associated with the first node received at least one of the first messages.

7. The method of claim 1 , wherein the identifying step further comprises identifying at least those of the nodes that are passively associated with the first node as part of identifying which of the nodes associated with the first node received at least one of the first messages.

8. The method of claim 1 , wherein the identifying step further comprises identifying at least those of the nodes that are actively associated with the first node as part of identifying which of the nodes associated with the first node received at least one of the first messages.

9. The method of claim 1 further comprising the step of refining the location of the one or more of the identified associated nodes that did not receive any of the second messages but received at least one of the first messages by updating a location of the first node.

10. The method of claim 9 , wherein the refining step further comprises:
determining a current mobile location of the first node; and
refining the location of the one or more of the identified associated nodes that did not receive any of the second messages but received at least one of the first messages based upon the current mobile location of the first node.

11. The method of claim 9 further comprising the step of transmitting the refined location to a server in the network.

12. The method of claim 1 , wherein at least one of the one or more of the identified associated nodes is part of a node-enabled package; and
wherein the step of determining the location of the at least one node further comprises determining the location of the at least one node while the at least one node is within the node-enabled package and while the node-enabled package is within a vehicle.

13. The method of claim 12 further comprising the steps of:
generating a location message regarding where the node-enabled package is located within the vehicle based upon the determined location of the at least one node; and
transmitting the location message to another network device in the wireless node network for display on a user interface of the another network device.

14. The method of claim 12 further comprising the steps of:
accessing shipping information related to the node-enabled package;
generating a relocation message regarding where the node-enabled package is to be relocated within the vehicle based upon the determined location of the at least one node and the accessed shipping information; and
transmitting the location message to another network device in the wireless node network for display on a user interface of the another network device.

15. The method of claim 14 , wherein the shipping information comprises weight information on the node-enabled package.

16. The method of claim 15 , wherein the location of the node-enabled package within the vehicle is according to a loading scheme.

17. The method of claim 16 , wherein the loading scheme is related to an anticipated delivery schedule.

18. The method of claim 12 , wherein the vehicle is one from a group consisting of a truck, a van, a trailer, an aircraft, and a marine vessel.

19. A non-transitory computer-readable medium containing instructions which when executed on a processor performs a method for location determination using one or more associations of nodes in a wireless node network, the method comprising:
broadcasting one or more first messages by a first of the nodes at a first anticipated range distance;
identifying which of the nodes associated with the first node received at least one of the first messages;
broadcasting one or more second messages by the first node at a second anticipated range distance, which is incrementally smaller than the first anticipated range distance; and
determining a location of one or more of the identified associated nodes that did not receive any second messages but received at least one of the first messages, the location being between the first anticipated range distance from the first node and the second anticipated range distance from the first node.

20. The non-transitory computer-readable medium of claim 19 , wherein the method further comprises the steps of:
broadcasting one or more third messages by the first node at a third anticipated range distance, which is incrementally smaller range than the second anticipated range distance; and
determining a location of one or more of the identified associated nodes that did not receive any of the third messages but received at least one of the second messages, the location being between the second anticipated range distance from the first node and the third anticipated range distance from the first node.

21. The non-transitory computer-readable medium of claim 19 , wherein the first anticipated range distance is an optimal broadcasting range for the first of the nodes.

22. The non-transitory computer-readable medium of claim 21 , wherein the first anticipated range distance is the optimal range for the first of the nodes adjusted based upon context data.

23. The non-transitory computer-readable medium of claim 22 , wherein the first anticipated range distance and the second anticipated range distance are adjusted based upon one or more types of context data related to how an RF output signal from the first node may be impeded.

24. The non-transitory compu

Assignees

• Fedex Corp Services Inc

Inventors

• Skaaksrud Ole-Petter
• Hollahan Terence
• Benton Steven

Classifications

• G01S2205/01

  specially adapted for specific applications · CPC title

• H04W12/06

  Authentication · CPC title

• H04W12/08

  Access security · CPC title

• G01S5/14

  Determining absolute distances from a plurality of spaced points of known location · CPC title

• G01S5/0289

  of multiple transceivers, e.g. in ad hoc networks · CPC title