WIRELESS SENSOR NETWORK TRAFFIC NAVIGATION ANALYTICS

• US 20120283945A1
• Filed: 05/03/2011
• Published: 11/08/2012
• Est. Priority Date: 05/03/2011
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Patel, Devang D., Bird, Theodore M., Hsu, Nelson YH, Wong, Ro Pun
• Granted Patent: US 8,972,172 B2
• Time in Patent Office: Days
• US Class Current: 701/420
• CPC Class Codes: G01C 21/3492 employing speed data or traffic data, e.g. real-time or historical traffic control systems for road vehicles involving transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G08G 1/09 Arrangements for giving variable traffic instructions railroad crossing signals B61L; reflectors E01F, G08B; indicating arrangements for variable information by selection or combination of individual elements G09F9/00
• CPC Class Codes: G08G 1/0967 Systems involving transmission of highway information, e.g. weather, speed limits transmission of navigation instructions to the vehicle G08G1/0968
• CPC Class Codes: G08G 1/096791 where the origin of the information is another vehicle

Abstract

A mobile sensor receives a mobile sensor location and destination. The mobile sensor determines, from a repository of road segments, a plurality of routes having a first endpoint corresponding to the mobile sensor location, and a second endpoint corresponding to the destination. The mobile sensor receives transit data from a plurality of peer mobile sensors, wherein each transit data comprises a peer mobile sensor'"'"'s velocity and a peer mobile sensor'"'"'s location. The mobile sensor stores at least one transit data based on the peer mobile sensor'"'"'s velocity and peer mobile sensor'"'"'s location corresponding to at least one of the plurality of routes, thereby forming at least one stored transit data. The mobile sensor determines that a sampling period has expired. The mobile sensor reports a route corresponding to a stored transit route having best transit data or no transit data, wherein the route is among the plurality of routes.

Claims

1. A computer implemented method for selecting routes, the computer implemented method comprising:

receiving a mobile sensor location and a destination;

determining, from a repository of road segments, a plurality of routes having a first endpoint corresponding to the mobile sensor location, and a second endpoint corresponding to the destination, wherein each route is a distance-limited set of segments that connect at endpoints;

receiving transit data from a plurality of peer mobile sensors, wherein each transit data comprises a peer mobile sensor'"'"'s velocity and a peer mobile sensor'"'"'s location;

storing at least one transit data based on the peer mobile sensor'"'"'s velocity and peer mobile sensor'"'"'s location corresponding to at least one of the plurality of routes, thereby forming at least one stored transit data;

determining that a sampling period has expired; and

reporting at least a route corresponding to a stored transit route having best transit data or no transit data, wherein the route is among the plurality of routes.

2. The computer implemented method of claim 1, wherein reporting at least the route corresponding to the stored transit route further comprises:

responsive to a determination that the sampling period has expired, calculating a rating for each of the at least one stored transit data;

responsive to the determination that the sampling period has expired, calculating an aggregate of all ratings received during the sampling period for each of the plurality of routes, wherein the aggregate of all ratings is based on summing; and

reporting at least a route description corresponding to a highest average rating of all routes.

3. The computer implemented method of claim 2, wherein calculating further comprises:

looking up a segment corresponding to the at least one transit data;

looking up at least one route among the plurality of routes, wherein the at least one route includes the segment;

determining a route length for the at least one route; and

setting the rating based on the route length divided by the peer mobile sensor'"'"'s velocity.

4. The computer implemented method of claim 1, wherein reporting at least a route comprises:

responsive to a determination that the sampling period has expired, determining that no transit data is received during the sampling period for at least one of the plurality of routes; and

responsive to a determination that no transit data is received during the sampling period, reporting the at least one of the plurality of routes as a best route.

5. The computer implemented method of claim 1, wherein reporting at least a route corresponding to a stored transit route having best transit data or no transit data comprises reporting an estimated quickest route for the mobile sensor to traverse to reach the destination.

6. The computer implemented method of claim 1, wherein each route comprises at least two partial segments, wherein each partial segment is coextensive to a segment, wherein the partial segment has an end at a roadway threshold.

7. The computer implemented method of claim 1, wherein receiving transit data comprises:

receiving the transit data using an intermediary mobile sensor that is not a source mobile sensor, wherein transit data comprises data selected from the group consisting of black box information, lights, idle time, position change, and outside temperature, wherein the mobile sensor location is nearest to at least an endpoint of at least one partial segment and wherein the destination is nearest to at least an endpoint of at least one partial segment.

8. A computer program product for selecting routes, the computer program product comprising:

computer readable program code configured to receive a mobile sensor location and a destination;

computer readable program code configured to determine, from a repository of road segments, a plurality of routes having a first endpoint corresponding to the mobile sensor location, and a second endpoint corresponding to the destination, wherein each route is a distance-limited set of segments that connect at endpoints;

computer readable program code configured to receive transit data from a plurality of peer mobile sensors, wherein each transit data comprises a peer mobile sensor'"'"'s velocity and a peer mobile sensor'"'"'s location;

computer readable program code configured to store at least one transit data based on the peer mobile sensor'"'"'s velocity and peer mobile sensor'"'"'s location corresponding to at least one of the plurality of routes, thereby forming at least one stored transit data;

computer readable program code configured to determine that a sampling period has expired; and

computer readable program code configured to report at least a route corresponding to a stored transit route having best transit data or no transit data, wherein the route is among the plurality of routes.

9. The computer program product of claim 8, wherein computer readable program code configured to report at least the route corresponding to the stored transit route further comprises:

computer readable program code configured to calculate a rating for each of the at least one stored transit data, responsive to a determination that the sampling period has expired;

computer readable program code configured to calculate an aggregate of all ratings received during the sampling period for each of the plurality of routes, wherein the aggregate of all ratings is based on summing, responsive to the determination that the sampling period has expired; and

computer readable program code configured to report at least a route description corresponding to a highest average rating of all routes.

10. The computer program product of claim 9, wherein computer readable program code configured to calculate further comprises:

computer readable program code configured to look up a segment corresponding to the at least one transit data;

computer readable program code configured to look up at least one route among the plurality of routes, wherein the at least one route includes the segment;

computer readable program code configured to determine a route length for the at least one route; and

computer readable program code configured to set the rating based on the route length divided by the peer mobile sensor'"'"'s velocity.

11. The computer program product of claim 8, wherein computer readable program code configured to report at least a route comprises:

computer readable program code configured to determine that no transit data is received during the sampling period for at least one of the plurality of routes, responsive to a determination that the sampling period has expired; and

computer readable program code configured to report the at least one of the plurality of routes as a best route, responsive to a determination that no transit data is received during the sampling period.

12. The computer program product of claim 8, wherein computer readable program code configured to report at least a route corresponding to a stored transit route having best transit data or no transit data comprises reporting an estimated quickest route for the mobile sensor to traverse to reach the destination.

13. The computer program product of claim 8, wherein each route comprises at least two partial segments, wherein each partial segment is coextensive to a segment, wherein the partial segment has an end at a roadway threshold.

14. The computer program product of claim 8, wherein receiving transit data comprises:

computer readable program code configured to receive the transit data using an intermediary mobile sensor that is not a source mobile sensor, wherein transit data comprises data selected from the group consisting of black box information, lights, idle time, position change, and outside temperature, wherein the mobile sensor location is nearest to at least an endpoint of at least one partial segment and wherein the destination is nearest to at least an endpoint of at least one partial segment.

15. A data processing system for selecting routes, wherein processing system comprising:

one or more processors, one or more computer-readable memories and;

computer readable program code configured to receive a mobile sensor location and a destination;

computer readable program code configured to determine, from a repository of road segments, a plurality of routes having a first endpoint corresponding to the mobile sensor location, and a second endpoint corresponding to the destination, wherein each route is a distance-limited set of segments that connect at endpoints;

computer readable program code configured to receive transit data from a plurality of peer mobile sensors, wherein each transit data comprises a peer mobile sensor'"'"'s velocity and a peer mobile sensor'"'"'s location;

computer readable program code configured to store at least one transit data based on the peer mobile sensor'"'"'s velocity and peer mobile sensor'"'"'s location corresponding to at least one of the plurality of routes, thereby forming at least one stored transit data;

computer readable program code configured to determine that a sampling period has expired; and

computer readable program code configured to report at least a route corresponding to a stored transit route having best transit data or no transit data, wherein the route is among the plurality of routes.

16. The data processing system of claim 15, wherein reporting at least the route corresponding to the stored transit route further comprises:

computer readable program code configured to calculate a rating for each of the at least one stored transit data, responsive to a determination that the sampling period has expired;

computer readable program code configured to calculate an aggregate of all ratings received during the sampling period for each of the plurality of routes, wherein the aggregate of all ratings is based on summing, responsive to the determination that the sampling period has expired; and

computer readable program code configured to report at least a route description corresponding to a highest average rating of all routes.

17. The data processing system of claim 16, wherein calculating further comprises:

computer readable program code configured to look up a segment corresponding to the at least one transit data;

computer readable program code configured to look up at least one route among the plurality of routes, wherein the at least one route includes the segment;

computer readable program code configured to determine a route length for the at least one route; and

computer readable program code configured to set the rating based on the route length divided by the peer mobile sensor'"'"'s velocity.

18. The data processing system of claim 15, wherein reporting at least a route comprises:

computer readable program code configured to determine that no transit data is received during the sampling period for at least one of the plurality of routes, responsive to a determination that the sampling period has expired; and

computer readable program code configured to report the at least one of the plurality of routes as a best route, responsive to a determination that no transit data is received during the sampling period.

19. The data processing system of claim 15, wherein reporting at least a route corresponding to a stored transit route having best transit data or no transit data comprises reporting an estimated quickest route for the mobile sensor to traverse to reach the destination.

20. The data processing system of claim 15, wherein each route comprises at least two partial segments, wherein each partial segment is coextensive to a segment, wherein the partial segment has an end at a roadway threshold.