This invention relates generally to navigation systems and, in particular, to apparatus and methods for reducing data transmission in wireless client-server environments.
The engineering and business requirements of navigation by wireless client-server (WCS) navigators, in which route searches and map generation are performed at a central location then transmitted to mobile units, differ somewhat from those of standard standalone navigators. One major difference is that for WCS navigators, data transmission costs are a large part of the ongoing cost of operating the navigation system. In order to economically provide WCS navigation, it is important to minimize the amount of data transmitted while still meeting customers' navigation needs.
This invention is directed to methods and apparatus for reducing data transmission in a wireless client-server navigation system. In the preferred method, a request for data representative of a map-related feature is received at a central server from a mobile unit. Data describing the feature is obtained in the form of line segments interconnecting points having coordinates such as a shapefile or other format. An operation is performed on the data describing the feature to generate data representative of the feature in a data-reduced format, and the data representative of the feature in the data-reduced format is forwarded to the mobile unit issuing the request.
The map-related feature may include a route; a road; a lake, stream, river, ocean or other body of water; other geographic feature; or text. The operation may be performed when the request is received from the mobile unit, or the operation may be performed in advance of the request from the mobile unit, such that the data representative of the feature in the data-reduced format is stored in a memory for later retrieval.
According to one embodiment, the operation responsible for producing the data-reduced format includes the steps of: receiving data describing a map; partitioning the map into a plurality of tiles; designating a reference point within each tile; representing the feature in the form of offsets from the reference points; and wherein the data-reduced format is based upon the reference points and offsets. The tiles may or may not be substantially equal in size, and the offsets may be represented with Cartesian, polar, or any other appropriate coordinates.
Alternatively, the operation may include the steps of approximating the feature with a curve, whereby the data-reduced format includes a description of the curve. The description of the curve may include the coordinates of points along the curve, or a mathematical function, including a Bezier or other spline, a polynomial or fractal curve. In this and in other embodiments a standard may be provided regarding the extent to which the operation will affect the approximation of the feature, such that the operation will only be applied if the standard is met. The standard may be based upon map scale, a user preference, or other factors.
In a further alternative embodiment, the operation includes the steps of removing one or more of the points having the coordinates, leaving a plurality of remaining points describing the feature, such that the reduced-data format is represented with line segments interconnecting the remaining points. In all embodiments, the operation may include, alone or in combination with other embodiments, the step of applying a data-compression algorithm to the data representative of the feature in the data-reduced format prior to forwarding the data to the mobile unit issuing the request. The data-compression algorithm includes the Lempel-Ziv algorithm or a variant or extension thereof, fractal compression or other methodologies.
A wireless client-server navigation system according to the invention includes a mobile unit and a central server. The mobile unit includes a wireless transmitter for transmitting a request for data representative of a map-related feature, a receiver for receiving the data representative of the map-related feature, and a display for displaying the feature on a map. The central server includes an input for receiving data describing map-related features in the form of line segments interconnecting points having coordinates, a receiver for receiving the request from the mobile unit, a processor for performing an operation on the data describing the map-related feature associated with the request by the mobile to generate data representative of the feature in a data-reduced format; and a transmitter for transmitting the data representative of the feature in the data-reduced format to the mobile unit. Other system-level aspects are disclosed and described in detail.
The various embodiments described herein are intended to be used with a wireless client-server (WCS) navigation system. Such a system provides guidance in the form of maps, routes, and/or instructions, and
In existing navigation systems, geographic data is often generated and stored using highly accurate but data-intensive means. For example, in the commonly used shapefile format depicted in
The tile method according to this invention uses a less data intensive method to preserve required accuracy while minimizing the amount of data transmitted. In the tile method, depicted in
As an example of how this could provide benefits in data transmission, suppose points in a map are stored in shapefile format, requiring 16 bytes to represent each point. The map is divided up into tiles measuring one mile east-west by one mile north-south. Further suppose that it has been determined that users of the navigator require no greater resolution than 25 feet; meaning that if a feature is within 25 feet of where their navigator says, then it's good enough for them. A reference point is selected within the tile, and all points within the tile are represented as an offset from the reference location. In a one square mile tile, all locations can be measured as an offset from a reference point to within 25 feet by a set of data including x and y coordinates in 8 bit integer format, requiring 2 bytes total for each point, since 5280 feet/mile divided by 2{circumflex over ( )}8 is 20.625 feet.
In this example, 16 additional bytes of data are required to represent the reference point of each tile, but for each point within the tile, 14 bytes are saved. Thus if there is on average more than one point per tile, an overall reduction in data transmission can be achieved with the specific approach of this example.
The tile method also has the advantage of dividing data to be transmitted into discrete, easily manipulated units of data.
Many standard representations of geographical information are limited to the use of straight lines. When a curve such as that shown in
According to this invention, instead of transmitting all of the points of straight lines representing a curve, the navigation system transmits information from which a curve can be constructed that approximates the lines provided in the geographical information.
In the first step of this method, a curve such as 602 shown in
The information representing the curve is then transmitted from the server to the client. The information may be a set of points along the curve, or it may be another arbitrary representation. The type of curve and information about how it is to be reconstructed may also be transmitted, or it may have been previously provided to the client. The client receives the information and from it constructs a graphical representation of the curve for use of the customer.
Many standard representations of geographical information are limited to the use of straight lines. When a curve must be approximated, a large number of straight lines 902 are used instead, as shown in
Many customers do not require the full accuracy provided by straight line approximations, particularly when maps are displayed that show large areas. For this reason it is useful to remove points of the representation if geographical data.
In this method:
This method may be applied when a user requests a map, or various approximate maps may be generated and later used upon user request.
In order to reduce the amount of data sent with a WCS navigator, a variety of data compression algorithms may be used. Common examples of such algorithms include the Lempel-Ziv algorithm, the DEFLATE algorithm, the Lempel-Ziv-Welch algorithm, and LZ-Renau algorithm, although this method is not intended to be limited to these particular algorithms. The data compression method is to use a data compression algorithm to reduce the amount of data transmitted in a WCS navigator.
Number | Name | Date | Kind |
---|---|---|---|
5566288 | Koerhsen | Oct 1996 | A |
5594855 | Von Ehr, II | Jan 1997 | A |
5774824 | Streit et al. | Jun 1998 | A |
6058350 | Ihara | May 2000 | A |
6311126 | Katayama et al. | Oct 2001 | B1 |
6597363 | Duluk et al. | Jul 2003 | B1 |
6674445 | Chithambaram et al. | Jan 2004 | B1 |
6703947 | Wallner | Mar 2004 | B1 |
6812925 | Krishnan et al. | Nov 2004 | B1 |
6954696 | Ihara et al. | Oct 2005 | B2 |
7088266 | Watanabe et al. | Aug 2006 | B2 |
7164987 | Watanabe et al. | Jan 2007 | B2 |
7248965 | Tanizaki et al. | Jul 2007 | B2 |
7340341 | Adachi | Mar 2008 | B2 |
7412362 | Hu et al. | Aug 2008 | B2 |
7493212 | Sumizawa et al. | Feb 2009 | B2 |
7542882 | Agrawala et al. | Jun 2009 | B2 |
7545382 | Montrym et al. | Jun 2009 | B1 |
7620496 | Rasmussen | Nov 2009 | B2 |
7839306 | Tanizaki et al. | Nov 2010 | B2 |
8350873 | Sakashita | Jan 2013 | B2 |
20020029224 | Carlsson | Mar 2002 | A1 |
20020097912 | Kimmel et al. | Jul 2002 | A1 |
20020113797 | Potter et al. | Aug 2002 | A1 |
20030063096 | Burke | Apr 2003 | A1 |
20030078720 | Adachi | Apr 2003 | A1 |
20030158653 | Sakai | Aug 2003 | A1 |
20030231190 | Jawerth et al. | Dec 2003 | A1 |
20030233403 | Bae | Dec 2003 | A1 |
20040032980 | Harman | Feb 2004 | A1 |
20040150639 | Park et al. | Aug 2004 | A1 |
20050046615 | Han | Mar 2005 | A1 |
20050085242 | Nishizawa | Apr 2005 | A1 |
20050090974 | Hirose | Apr 2005 | A1 |
20050131642 | Adachi | Jun 2005 | A1 |
20050187711 | Agrawala et al. | Aug 2005 | A1 |
20060106534 | Kawamata et al. | May 2006 | A1 |
20060184317 | Asahara et al. | Aug 2006 | A1 |
20060197760 | Yamada | Sep 2006 | A1 |
20060206623 | Gipps | Sep 2006 | A1 |
20060215923 | Beatty | Sep 2006 | A1 |
20070067126 | Adachi | Mar 2007 | A1 |
20070233817 | Johnson | Oct 2007 | A1 |
20070270692 | Barbu | Nov 2007 | A1 |
20080046175 | Tengler et al. | Feb 2008 | A1 |
20080059889 | Parker | Mar 2008 | A1 |
Entry |
---|
Author: Monika Sester, Claus Brenner Title: Continuous Generalization for Visualization on Small Mobile Devices (2004) In Proc. Conference on Spatial Data Handling, 2005, Part 8, 355-368, DOI: 10.1007/3-540-26772-7_27 Publisher: Springer Berlin Heidelberg. |
ESRI Shapefile Technical Description, Jul. 1998, 1998 Environmental Systems Research Institute, Inc, pp. 1-28 (Year: 1998). |
Number | Date | Country | |
---|---|---|---|
20080249704 A1 | Oct 2008 | US |