Determining Node Location Using a Lower Level Node Association in a Wireless Node Network

• US 20150154546A1
• Filed: 09/18/2014
• Published: 06/04/2015
• Est. Priority Date: 11/29/2013
• Status: Active Grant

• Current Assignee: Fedex Corporate Services Incorporated (FedEx Corporation)
• Original Assignee: Fedex Corporate Services Incorporated (FedEx Corporation)
• Inventors: Skaaksrud, Ole-Petter, Hollahan, Terence, Benton, Steven
• Granted Patent: US 9,930,635 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: B60W 60/00256 Delivery operations
• CPC Class Codes: B65B 25/02 Packaging agricultural or horticultural products
• CPC Class Codes: B65D 25/02 Internal fittings of containers made by folding or erecting blanks made of paper B65D5/44
• CPC Class Codes: B65D 25/102 Straps, bands, strings or other elongate elements
• CPC Class Codes: G01C 21/3407 specially adapted for specific applications
• CPC Class Codes: G01C 21/3453 Special cost functions, i.e. other than distance or default speed limit of road segments
• CPC Class Codes: G01C 21/362 received from an external device or application, e.g. PDA, mobile phone or calendar application
• CPC Class Codes: G01S 2205/01 specially adapted for specific applications
• CPC Class Codes: G01S 5/0289 of multiple transceivers, e.g. in ad hoc networks
• CPC Class Codes: G01S 5/14 Determining absolute distances from a plurality of spaced points of known location
• CPC Class Codes: G05D 1/0022 characterised by the communication link data switching networks in general H04L12/00
• CPC Class Codes: G05D 1/0088 characterized by the autonomous decision making process, e.g. artificial intelligence, predefined behaviours using knowledge based models G06N5/00
• CPC Class Codes: G05D 1/021 specially adapted to land vehicles
• CPC Class Codes: G06K 19/0712 the arrangement being capable of triggering distinct operating modes or functions dependent on the strength of an energy or interrogation field in the proximity of the record carrier active means for hindering electromagnetic reading or writing G06K19/07336
• CPC Class Codes: G06K 7/10366 the interrogation device being adapted for miscellaneous applications
• CPC Class Codes: G06Q 10/083 Shipping
• CPC Class Codes: G06Q 10/0832 Special goods or special handling procedures, e.g. handling of hazardous or fragile goods
• CPC Class Codes: G06Q 10/0833 Tracking
• CPC Class Codes: G06Q 10/0835 Relationships between shipper or supplier and carriers
• CPC Class Codes: G06Q 10/08355 Routing methods
• CPC Class Codes: G06Q 10/0836 : Recipient pick-ups
• CPC Class Codes: G06Q 10/0838 : Historical data
• CPC Class Codes: G06Q 10/087 : Inventory or stock management, e.g. order filling, procurement or balancing against orders
• CPC Class Codes: G06Q 20/14 : specially adapted for billing systems
• CPC Class Codes: G06Q 20/22 : Payment schemes or models
• CPC Class Codes: G06Q 20/308 : using the Internet of Things
• CPC Class Codes: G06Q 20/321 : using wearable devices
• CPC Class Codes: G06Q 20/325 : using wireless networks
• CPC Class Codes: G06Q 20/40 : Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
• CPC Class Codes: G06Q 30/0267 : Wireless devices
• CPC Class Codes: G06Q 30/0269 : based on user profile or attribute
• CPC Class Codes: G08B 21/0261 : System arrangements wherein the object is to detect trespassing over a fixed physical boundary, e.g. the end of a garden
• CPC Class Codes: G08B 21/0269 : System arrangements wherein the object is to detect the exact location of child or item using a navigation satellite system, e.g. GPS
• CPC Class Codes: G16H 10/60 : for patient-specific data, e.g. for electronic patient records
• CPC Class Codes: G16H 10/65 : stored on portable record carriers, e.g. on smartcards, RFID tags or CD
• CPC Class Codes: G16H 40/63 : for local operation
• CPC Class Codes: G16H 40/67 : for remote operation
• CPC Class Codes: G16H 80/00 : ICT specially adapted for facilitating communication between medical practitioners or patients, e.g. for collaborative diagnosis, therapy or health monitoring
• CPC Class Codes: H04B 1/3822 : specially adapted for use in vehicles H04B1/3827 takes precedence
• CPC Class Codes: H04H 20/61 : for local area broadcast, e.g. instore broadcast
• CPC Class Codes: H04H 20/71 : Wireless systems
• CPC Class Codes: H04L 41/026 : using e-messaging for transporting management information, e.g. email, instant messaging or chat
• CPC Class Codes: H04L 41/0813 : characterised by the conditions triggering a change of settings
• CPC Class Codes: H04L 41/0823 : characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability for optimising operational conditions of wireless networks H04W24/02
• CPC Class Codes: H04L 43/10 : Active monitoring, e.g. heartbeat, ping or trace-route
• CPC Class Codes: H04L 45/22 : Alternate routing
• CPC Class Codes: H04L 65/403 : Arrangements for multi-party communication, e.g. for conferences data switching systems for conference H04L12/18; arrangements for connecting several subscribers to a common circuit, i.e. affording conference facilities H04M3/56; television conferencing systems H04N7/15
• CPC Class Codes: H04L 67/01 : Protocols
• CPC Class Codes: H04L 67/10 : in which an application is distributed across nodes in the network software deployment G06F8/60; multiprogramming arrangements G06F9/46
• CPC Class Codes: H04L 67/12 : specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
• CPC Class Codes: H04L 67/303 : Terminal profiles
• CPC Class Codes: H04L 67/52 : specially adapted for the location of the user terminal
• CPC Class Codes: H04W 12/06 : Authentication
• CPC Class Codes: H04W 12/08 : Access security
• CPC Class Codes: H04W 24/10 : Scheduling measurement reports ; Arrangements for measurement reports
• CPC Class Codes: H04W 4/02 : Services making use of location information
• CPC Class Codes: H04W 4/023 : using mutual or relative location information between multiple location based services [LBS] targets or of distance thresholds
• CPC Class Codes: H04W 4/025 : using location based information parameters
• CPC Class Codes: H04W 4/029 : Location-based management or tracking services
• CPC Class Codes: H04W 4/38 : for collecting sensor information
• CPC Class Codes: H04W 4/60 : Subscription-based services using application servers or record carriers, e.g. SIM application toolkits
• CPC Class Codes: H04W 4/80 : Services using short range communication, e.g. near-field communication [NFC], radio-frequency identification [RFID] or low energy communication
• CPC Class Codes: H04W 52/0212 : managed by the network, e.g. network or access point is master and terminal is slave
• CPC Class Codes: H04W 52/04 : TPC
• 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 64/003 : locating network equipment
• CPC Class Codes: H04W 64/006 : with additional information processing, e.g. for direction or speed determination
• CPC Class Codes: H04W 76/10 : Connection setup
• CPC Class Codes: H04W 8/18 : Processing of user or subscriber data, e.g. subscribed services, user preferences or user profiles; Transfer of user or subscriber data
• CPC Class Codes: H04W 8/24 : Transfer of terminal data
• CPC Class Codes: Y02D 30/70 : in wireless communication networks

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.

Claims

1. A method for location determination using one or more associations of nodes in a wireless node network, the method comprising:

instructing a first of the nodes to broadcast one or more first messages at a first power level, the first power level being related to a first anticipated range distance;

identifying which of the nodes associated with the first node have known locations;

determining which of the identified associated nodes received at least one of the first messages;

instructing the first node to broadcast one or more second messages at a second power level, the second power level being related to a second anticipated range distance and incrementally smaller than the first power level;

determining which of the identified associated nodes received at least one of the second messages; and

determining a location of the first node to be at or between the first anticipated range distance and the second anticipated range distance from each of the identified associated nodes that did not receive at least one of the second messages but received at least one of the first messages.

2. The method of claim 1, wherein the step of instructing the first node to broadcast the one or more second messages within a time interval after instructing the first node to broadcast the one or more first messages.

3. The method of claim 2, wherein the time interval is dynamically set based upon context data related to the first node.

4. The method of claim 3, wherein the time interval is reduced from a prior value when the context data related to the first node indicates the first node is moving.

5. The method of claim 3, wherein the time value of the interval is increased from a prior value when the context data related to the first node indicates the first node is substantially stationary.

6. The method of claim 1 further comprising the steps of:

instructing the first node to broadcast one or more third messages at a third power level, the third power level being related to a third anticipated range distance and incrementally smaller range than the second anticipated range distance; and

determining the location of the first node to be at or between the second anticipated range distance and the third anticipated range distance from each of the identified associated nodes that did not receive any of the third messages but received at least one of the second messages.

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

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

9. The method of claim 8, 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 broadcast from the first node may be impeded.

10. The method of claim 1, wherein the identifying step further comprises:

reviewing association data that indicates which of the nodes are associated with the first node;

determining which of the nodes are associated with the first node based upon the reviewed association data; and

identifying which of the nodes determined to be associated with the first node have known locations.

11. The method of claim 10, wherein the step of determining step which of the nodes are associated with the first node further comprises determining which of the nodes are passively associated with the first node based upon the reviewed association data.

12. The method of claim 10, wherein the step of determining step which of the nodes are associated with the first node further comprises determining which of the nodes are actively associated with the first node based upon the reviewed association data.

13. The method of claim 1 further comprising the step of refining the location of the first node with an updated location of 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.

14. The method of claim 1, wherein the first node is not self-aware of the location of the first node.

15. The method of claim 1, wherein the first node was previously self-aware of the location of the first node but is no longer self-aware of the location of the first node prior to broadcasting the one or more first messages.

16. The method of claim 15, wherein the first node is no longer self-aware of the location of the first node prior to broadcasting the first message because of a change in the environment surrounding the first node.

17. The method of claim 16, wherein the change in the environment further comprises when the first node has moved inside a structure that blocks location signals from being received by the first node.

18. The method of claim 1, wherein the first node is part of a node-enabled package;

and

wherein the step of determining the location of the first node further comprises determining the location of the first node while the first node is within the node-enabled package and while the node-enabled package is within a vehicle.

19. The method of claim 18 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 first 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.

20. The method of claim 18 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 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.

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

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

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

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

25. 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:

instructing a first of the nodes to broadcast one or more first messages at a first power level, the first power level being related to a first anticipated range distance;

identifying which of the nodes associated with the first node have known locations;

determining which of the identified associated nodes received at least one of the first messages;

instructing the first node to broadcast one or more second messages at a second power level, the second power level being related to a second anticipated range distance and incrementally smaller than the first power level;

determining which of the identified associated nodes received at least one of the second messages; and

determining a location of the first node to be at or between the first anticipated range distance and the second anticipated range distance from each of the identified associated nodes that did not receive at least one of the second messages but received at least one of the first messages.

26. The non-transitory computer-readable medium of claim 25, wherein the step of instructing the first node to broadcast the one or more second messages within a time interval after instructing the first node to broadcast the one or more first messages.

27. The non-transitory computer-readable medium of claim 26, wherein the time interval is dynamically set based upon context data related to the first node.

28. The non-transitory computer-readable medium of claim 27, wherein the time interval is reduced from a prior value when the context data related to the first node indicates the first node is moving.

29. The non-transitory computer-readable medium of claim 27, wherein the time value of the interval is increased from a prior value when the context data related to the first node indicates the first node is substantially stationary.

30. The non-transitory computer-readable medium of claim 25, wherein the method further comprises the steps of:

instructing the first node to broadcast one or more third messages at a third power level, the third power level being related to a third anticipated range distance and incrementally smaller range than the second anticipated range distance; and

determining the location of the first node to be at or between the second anticipated range distance and the third anticipated range distance from each of the identified associated nodes that did not receive any of the third messages but received at least one of the second messages.

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

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

33. The non-transitory computer-readable medium of claim 32, 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 broadcast from the first node may be impeded.

34. The non-transitory computer-readable medium of claim 25, wherein the identifying step further comprises:

reviewing association data that indicates which of the nodes are associated with the first node;

determining which of the nodes are associated with the first node based upon the reviewed association data; and

identifying which of the nodes determined to be associated with the first node have known locations.

35. The non-transitory computer-readable medium of claim 34, wherein the step of determining step which of the nodes are associated with the first node further comprises determining which of the nodes are passively associated with the first node based upon the reviewed association data.

36. The non-transitory computer-readable medium of claim 34, wherein the step of determining step which of the nodes are associated with the first node further comprises determining which of the nodes are actively associated with the first node based upon the reviewed association data.

37. The non-transitory computer-readable medium of claim 25, wherein the method further comprises the step of refining the location of the first node with an updated location of 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.

38. The non-transitory computer-readable medium of claim 25, wherein the first node is not self-aware of the location of the first node.

39. The non-transitory computer-readable medium of claim 25, wherein the first node was previously self-aware of the location of the first node but is no longer self-aware of the location of the first node prior to broadcasting the one or more first messages.

40. The non-transitory computer-readable medium of claim 39, wherein the first node is no longer self-aware of the location of the first node prior to broadcasting the first message because of a change in the environment surrounding the first node.

41. The non-transitory computer-readable medium of claim 40, wherein the change in the environment further comprises when the first node has moved inside a structure that blocks location signals from being received by the first node.

42. The non-transitory computer-readable medium of claim 25, wherein the first node is part of a node-enabled package;

and

wherein the step of determining the location of the first node further comprises determining the location of the first node while the first node is within the node-enabled package and while the node-enabled package is within a vehicle.

43. The non-transitory computer-readable medium of claim 42, wherein the method further comprises 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 first 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.

44. The non-transitory computer-readable medium of claim 42, wherein the method further comprises 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 first 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.

45. The non-transitory computer-readable medium of claim 44, wherein the shipping information comprises weight information on the node-enabled package.

46. The non-transitory computer-readable medium of claim 45, wherein the location of the node-enabled package within the vehicle is according to a loading scheme.

47. The non-transitory computer-readable medium of claim 46, wherein the loading scheme is related to an anticipated delivery schedule.

48. The non-transitory computer-readable medium of claim 42, wherein the vehicle is one from a group consisting of a truck, a van, a trailer, an aircraft, and a marine vessel.

49. A node apparatus in a wireless node network that uses location determination by association, comprising:

a node processing unit;

a node volatile memory coupled to the processing unit;

a node memory storage coupled to the node processing unit, the node memory storage maintaining at least a program code section, association data, and location data; and

a first communication interface coupled to the processing unit and that provides access to a first communication path operatively coupling the node with a plurality of other nodes in the network; and

wherein the node processing unit, when executing at least the program code section resident in the node volatile memory, is operative to

communicate an instruction via the first communication interface to a first of the nodes to cause the first node to broadcast one or more first messages at a first power level, the first power level being related to a first anticipated range distance;

identify which of the nodes associated with the first node have known locations;

determine which of the identified associated nodes received at least one of the first messages;

communicate another instruction via the first communication interface to the first node to cause the first node to broadcast one or more second messages at a second power level, the second power level being related to a second anticipated range distance and incrementally smaller than the first power level;

determine which of the identified associated nodes received at least one of the second messages; and

determine a location of the first node to be at or between the first anticipated range distance and the second anticipated range distance from each of the identified associated nodes that did not receive at least one of the second messages but received at least one of the first messages.

50. The node apparatus of claim 49, wherein the node processing unit is further operative to communicate the another instruction via the first communication interface to the first node to broadcast the one or more second messages within a time interval after instructing the first node to broadcast the one or more first messages.

51. The node apparatus of claim 50, wherein the time interval is dynamically set based upon context data related to the first node.

52. The node apparatus of claim 51, wherein the time interval is reduced from a prior value when the context data related to the first node indicates the first node is moving.

54. The node apparatus of claim 49, wherein the node processor is further operative to:

communicate a third instruction via the first communication interface to the first node to cause the first node to broadcast one or more third messages at a third power level, the third power level being related to a third anticipated range distance and incrementally smaller range than the second anticipated range distance; and

determine the location of the first node to be at or between the second anticipated range distance and the third anticipated range distance from each of the identified associated nodes that did not receive any of the third messages but received at least one of the second messages.

55. The node apparatus of claim 49, wherein the first anticipated range distance is an optimal range for the first of the nodes.

56. The node apparatus of claim 55, wherein the first anticipated range distance is the optimal range for the first of the nodes adjusted based upon context data.

57. The node apparatus of claim 56, 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 broadcast from the first node may be impeded.

58. The node apparatus of claim 49, wherein node processing unit is further operative to identify which of the nodes associated with the first node have known locations by being operative to:

access the association data on the node memory storage, the association data indicating which of the nodes are associated with the first node;

determine which of the nodes are associated with the first node based upon the accessed association data; and

identify which of the nodes determined to be associated with the first node have known locations.

59. The node apparatus of claim 58, wherein node processing unit is further operative to determine which of the nodes are associated with the first node by being operative to determine which of the nodes are passively associated with the first node based upon the accessed association data.

60. The node apparatus of claim 58, wherein node processing unit is further operative to determine which of the nodes are associated with the first node by being operative to determine which of the nodes are actively associated with the first node based upon the accessed association data.

61. The node apparatus of claim 49, wherein the node processing unit is further operative to refine the location of the first node with an updated location of 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.

62. The node apparatus of claim 49, wherein the first node is not self-aware of the location of the first node.

63. The node apparatus of claim 49, wherein the first node was previously self-aware of the location of the first node but is no longer self-aware of the location of the first node prior to broadcasting the one or more first messages.

64. The node apparatus of claim 63, wherein the first node is no longer self-aware of the location of the first node prior to broadcasting the first message because of a change in the environment surrounding the first node.

65. The node apparatus of claim 64, wherein the change in the environment further comprises when the first node has moved inside a structure that blocks location signals from being received by the first node.

66. The node apparatus of claim 49, wherein the node processing unit is further operative to store the determined location in the node memory storage as part of the location data.

67. The node apparatus of claim 49, wherein the first node is part of a node-enabled package;

and

wherein the node processing unit is further operative to determine the location of the first node by being further operative to determine the location of the first node while the first node is within the node-enabled package and while the node-enabled package is within a vehicle.

68. The node apparatus of claim 67, wherein the node processing unit is further operative to:

generate a location message regarding where the node-enabled package is located within the vehicle based upon the determined location of the first node; and

cause the first communication interface to transmit the location message to another network device in the wireless node network for display on a user interface of the another network device.

69. The node apparatus of claim 67, wherein the node processing unit is further operative to:

access shipping information related to the node-enabled package, the shipping information being maintained on the node memory storage;

generate a relocation message regarding where the node-enabled package is to be relocated within the vehicle based upon the determined location of the first node and the accessed shipping information; and

cause the first communication interface to transmit the location message to another network device in the wireless node network for display on a user interface of the another network device.

70. The node apparatus of claim 69, wherein the shipping information comprises weight information on the node-enabled package.

71. The node apparatus of claim 70, wherein the location of the node-enabled package within the vehicle is according to a loading scheme.

72. The node apparatus of claim 71, wherein the loading scheme is related to an anticipated delivery schedule.

73. The node apparatus of claim 67, wherein the vehicle is one from a group consisting of a truck, a van, a trailer, an aircraft, and a marine vessel.

53. The node apparatus of 51, wherein the time value of the interval is increased from a prior value when the context data related to the first node indicates the first node is substantially stationary.

74. A server apparatus in a wireless node network that uses location determination by association, comprising:

a server processing unit;

a server volatile memory coupled to the server processing unit;

a server memory storage coupled to the server processing unit, the server memory storage maintaining at least a program code section, association data, and location data; and

a communication interface coupled to the server processing unit, the communication interface providing access to a first communication path operatively coupling the server apparatus with at least a first node in the network; and

wherein the server processing unit, when executing at least the program code section resident in the server volatile memory, is operative to

communicate with the first node via the communication interface to cause a second node in the network to broadcast one or more first messages at a first power level at the request of the first node, the first power level being related to a first anticipated range distance;

identify which of the remaining nodes in the network associated with the second node have known locations;

determine which of the identified associated nodes received at least one of the first messages;

communicate with the first node via the communication interface to cause the second node to broadcast one or more second messages at a second power level at the request of the first node, the second power level being related to a second anticipated range distance and incrementally smaller than the first power level;

determine which of the identified associated nodes received at least one of the second messages; and

determine a location of the second node to be at or between the first anticipated range distance and the second anticipated range distance from each of the identified associated nodes that did not receive any of the second messages but received at least one of the first messages.

75. The server apparatus of claim 74, wherein the server processing unit is further operative to communicate with the first node via the communication interface to cause the second node to broadcast the one or more second messages within a time interval after communicating with the first node to cause the second node to broadcast the one or more first messages.

76. The server apparatus of claim 75, wherein the time interval is dynamically set based upon context data related to the second node.

77. The server apparatus of claim 74, wherein the first anticipated range distance is an optimal range for the second node.

78. The server apparatus of claim 77, wherein the first anticipated range distance is the optimal range for the second node adjusted based upon context data.

79. The server apparatus of claim 74, wherein the server processing unit is further operative to store the determined location in the server memory storage as part of the location data.

80. The node apparatus of claim 74, wherein the second node is part of a node-enabled package;

and

wherein the server processing unit is further operative to determine the location of the second node by being operative to determine the location of the second node while the second node is within the node-enabled package and while the node-enabled package is within a vehicle.