DISTRIBUTED DATABASE

RELATED APPLICATIONS

[0001] The present application claims priority to U.S. Pat. App. Ser. No.

16/201 ,652, filed on Nov. 27, 2018 and entitled“Parking Infrastructure Powered by a Decentralized, Distributed Database,” the entire disclosure of which application is hereby incorporated herein by reference.

FIELD OF THE TECHNOLOGY

[0002] At least some embodiments disclosed herein relate to parking

infrastructure in general, and more particularly, but not limited to smart parking infrastructure powered by a decentralized, distributed database.

BACKGROUND

[0003] U.S. Pat. App. Pub. No. 2012/0236149, entitled“Parking Lot,” discloses a parking lot that has cameras to read the license plates of parked vehicles via optical character recognition (OCR) and radio beacons to read out the radio IDs carried on the vehicles. A central computer is configured to store parking space reservations in association with vehicle license numbers and radio IDs. The identification of an entering vehicle takes place via radio, while the localization and validation of the vehicle in the parking space is realized with OCR of license plates. When the parking space is equipped with electric vehicle charging stations, the central computer can unlock the charging station for charging a vehicle after successfully checking the vehicle license number signaled by the camera of the respective parking space, such that the improper use of charging stations is precluded.

[0004] U.S. Pat. App. Pub. No. 2008/0033769, entitled“Personalized Parking and Reservation System,” discloses a parking facility having a ticket dispenser and parking space sensors and aisle sensors to detect the movements of vehicles in the parking facility. The ticket dispenser permits entry of parking space preference information. Based on the personal preference of a parking patron, a computer is configured to identify a recommended parking space, and send the location of the recommended parking space to the ticket dispenser. The ticket dispenser prints a map and textual instructions after the parking authorization.

[0005] U.S. Pat. App. Pub. No. 2014/0195282, entitled“Computer-Implemented System and Method for Offering Customer Priority Parking Reservations,” discloses a system that has a vehicle occupancy sensor to sense occupancy of a parking space by a motor vehicle, a smart parking device to determine an identity of the driver of the motor vehicle, and parking availability indicators associated with the reserved parking spaces that are activated throughout the reservation period in a merchant priority parking mode.

[0006] U.S. Pat. App. Pub. No. 2014/0350855, entitled“Systems and Methods for Providing Navigational Assistance to Reserved Parking Locations,” discloses a system that when a vehicle is detected to be occupying a parking space different from a space reserved for the vehicle and the parking space is not available for the vehicle, presents a prompt requesting the vehicle to be moved to an alternative parking space via a parking application running in a user access device.

[0007] U.S. Pat. App. Pub. No. 2017/0255881 , entitled“Systems and Methods of Controlling Digital Signage for Directing Parking Traffic,” discloses a parking lot having at least one device to identify occupancy statuses of parking spaces and display devices controlled by a server to present navigational guidance based on parking reservations.

[0008] A blockchain is a growing list of records/blocks that are linked using cryptography. Each block can contain a cryptographic hash of the previous block, a timestamp, and data. The linked blocks can generally be represented as a Merle tree root hash. The blockchain can be hosted on a network of computers as a decentralized, distributed and public digital ledger.

BRIEF DESCRIPTION OF THE DRAWINGS

[0009] The embodiments are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.

[0010] FIG. 1 illustrates a parking infrastructure having a decentralized, distributed database to manage parking related activities according to one

embodiment. [0011] FIG. 2 illustrates a decentralized, distributed database to store an activity record related to parking according to one embodiment.

[0012] FIG. 3 shows a method to manage parking according to one embodiment.

[0013] FIG. 4 is a block diagram of an example computer system in which embodiments of the present disclosure can operate.

DETAILED DESCRIPTION

[0014] At least some aspects of the present disclosure are directed to a smart parking infrastructure powered by a decentralized, distributed database.

[0015] For example, the decentralized, distributed database can be implemented using a blockchain technique to allow public access by autonomous vehicles (and/or manually driven vehicles) during parking related activities, such as making parking reservation, driving to parking lots, entering parking lots, locating available/reserved parking spaces/spots, occupying parking spaces, vacating parking spaces, exiting parking lots, making payments for parking, etc.

[0016] FIG. 1 illustrates a parking infrastructure having a decentralized, distributed database to manage parking related activities according to one

embodiment.

[0017] The parking infrastructure illustrated in FIG. 1 includes a set of parking lots (111 , 113, 115, and 117). In general, a parking infrastructure can have more or less parking lots as illustrated in FIG. 1.

[0018] For example, the set of parking lots (111 - 117) can be different levels/floors of a parking structure/building.

[0019] For example, the set of parking lots (111 - 117) can be separate parking structures/buildings of a parking service provider.

[0020] For example, the set of parking lots (111 - 117) can be separate parking structures/buildings servicing a same area, a city, a company or shopping mall, a point of interest, a tourist destination, etc.

[0021] For example, the set of parking lots (111 - 117) can be provided by a coalition of different parking service providers located in a same geographical area, a city, a state, or a country.

[0022] A typical parking lot (111 ) can have an associated server (101 ). The server (101 ) can provide functions to manage the parking lot (111 ), such as controlling gates at entrances (e.g., 131 and 135), detecting occupancy status of parking spaces (e.g., 121 , 123, 125, ... ), detecting identities of vehicles entering the parking lot (121 ) and/or occupying the parking spaces (e.g., 125), processing payments and/or reservations, etc.

[0023] A communication network (143) connects the servers (e.g., 101 , 103, 105, and 107) of the parking lots (e.g., 111 - 117). Peer-to-peer connections among the servers (101 - 107) allows the servers to communicate with each other to implement a decentralized, distributed database (e.g., using a blockchain technique).

[0024] Optionally, a set of vehicles (e.g., 151 and 153) can join the peer-to-peer network of servers (111 - 117) to access the services of the servers (111 - 117) and/or to access the parking records stored in the decentralized, distributed database.

[0025] Examples of parking records include records of vehicles (e.g., 151 and 153) making reservations for parking in the lots (111 - 117), entering the parking lots (111 - 117), initiating payments for parking services upon entering the parking lots, occupying parking spaces (e.g., 121 - 125), leaving parking spaces (e.g., 121 - 125), exiting parking lots (111 - 117), finalizing payments for parking services upon exiting the parking lots (111 - 117), etc.

[0026] For example, a vehicle (e.g., 153) inside or near the parking lot (111 ) can establish a peer-to-peer connection with the server (101 ) of the parking lot (111 ), or another server (e.g., 103, 105, 107), through a wireless local area connection provided in the parking lot (111 ), a base station or access point (e.g., 141 ), and/or a communication network (143). A range limitation of the wireless connection can be used to identify the location of the vehicle (e.g., 153). The connection can be used to request permission for entering the parking lot (111 ), initiating parking payment, confirming parking in a parking space (e.g., 125), reporting leaving the parking lot (111 ), finalizing parking payment, etc.

[0027] For example, a vehicle (e.g., 151 ) outside of the parking lot (111 ) can establish a peer-to-peer connection with the server (101 ) of the parking lot (111 ), or another server (e.g., 103, 105, 107), a base station or access point (141 ) and/or a communication network (143). The connection can be used to make a reservation request.

[0028] In one embodiment, a vehicle (e.g., 153) has a parking application integrated in an autonomous driving system or an advanced driver-assistance system. The parking application can make a connection to the peer-to-peer network of servers (111 - 117) to access the records stored in the peer-to-peer network.

Thus, the autonomous vehicle (e.g., 153) can make a parking reservation, drive to a parking lot (111 ), locate a parking space (125), and/or pay the parking fee in an autonomous mode without human assistance.

[0029] In another embodiment, a mobile device runs a parking application that can make a connection to the peer-to-peer network of servers (111 - 117) to access the records stored in the peer-to-peer network. When the mobile device is connected to an infotainment system of a vehicle, the parking application can make a parking reservation, provide navigational guidance to the driver for driving to a parking lot (111 ) and/or locate a parking space (125), and/or pay the parking fee.

[0030] Optionally, the vehicles and/or mobile devices interested in the services of the parking lots (111 - 117) can also join the peer-to-peer network to host the parking related records in the decentralized, distributed database (e.g., implemented using a blockchain technique).

[0031] Optionally, selected types of parking records can be hosted in a peer-to- peer network of vehicles and mobile devices without hosting such records on the servers (101 - 107).

[0032] In one implementation, each of the servers (101 - 107) functions as a computing node on the peer-to-peer network to host a decentralized, distributed database (e.g., implemented using a blockchain technique). The decentralized, distributed database is configured to store redundant copies of activity records related to parking. For example, each respective server (101 - 107) can broadcast a parking activity record in the peer to peer network to cause one or more additional nodes in the peer to peer network to store the parking activity record in the decentralized, distributed database having a copy of the parking activity record maintained by each of the one or more additional nodes. The servers (101 - 107) can control the parking lots (111 - 117) based at least in part on network consensus on the activity records stored in the decentralized, distributed database. For example, each computing node in the network can independently determine the validity of a record based on copies of records stored in the computing node; when a majority of active nodes in the peer to peer network approves the validity of a parking activity record, the peer-to-peer network can reach network consensus that the parking activity record is valid; and the validated parking activity record can be used to control reservation, access control, vacancy management, navigational guidance, etc.

[0033] For example, each parking space (e.g., 121 ) can be represented by a digital token; and the peer-to-peer network can be used to manage the inventory, reservation and/or transfer of the digital tokens to/from parking applications representing users of parking spaces. Parking applications can be configured as part of advanced driver-assistance systems of vehicles, part of autonomous driving systems of vehicles, and/or as mobile applications running on mobile devices that are connected to infotainment systems of the vehicles. For example, a parking activity record identifying the reservation of a digital token by a parking application can be used to indicate the reservation of a parking space represented by the digital token; and a parking activity record identifying the transfer of a digital token from a server to a parking application can be used to indicate the occupation of a parking space represented by the digital token by a vehicle corresponding to the parking application.

[0034] Optionally, the computing devices on which some of the parking

applications are configured can dynamically join and leave the peer-to-peer network to participate in the hosting of the decentralized, distributed database. Such computing devices can include wireless mobile devices connected to infotainment systems of the vehicles, advanced driver-assistance systems of vehicles,

autonomous driving systems of vehicles. Each of such computing devices can join the peer-to-peer network to receive copies of parking activity records, become an active node of the peer-to-peer network, participate in network consensus

determination.

[0035] In some instances, the population of the computing devices of the users or potential users of the parking spaces can be sufficient to maintain the decentralized, distributed database; and the servers (101 - 107) can use the records (e.g., reservation and inventory) in the decentralized, distributed database without having to store copies of the records on the servers (101 - 107). For example, the peer-to- peer network of user computing devices can maintain records of digital tokens of parking spaces that have not yet been occupied, parking spaces that have not yet been reserved, decentralized, distributed database that have been reserved by users/vehicles, and decentralized, distributed database that have been occupied by users/vehicles. Thus, the servers (101 - 107) do not have to involve in the reservation and inventory management of the parking spaces. The servers (101 - 107) can use the records in the decentralized, distributed database and/or the network consensus to control aspects of the parking lots (111 - 117), such as granting gate access to a vehicle having a reservation validated by the network, providing navigational guidance to a parking space (121 ) reserved by the vehicle, and/or confirming/announcing the non-availability of a parking space (121 ), etc.

[0036] FIG. 2 illustrates a decentralized, distributed database to store an activity record related to parking according to one embodiment. For example, the decentralized, distributed database of FIG. 2 can be used in the implementation of the parking infrastructure illustrated in FIG. 1.

[0037] In FIG. 2, a peer to peer network (201 ) includes computing nodes (e.g., 211 , 213, ... ) that are connected via peer to peer communication connections.

[0038] For example, a node (e.g., 211 or 213) can be a server (e.g., 101 , 103,

105 or 107 in FIG. 1), or a vehicle (e.g., 151 or 153), or a mobile device of a driver or passenger of a vehicle (e.g., 151 or 153).

[0039] The decentralized, distributed database (201 ) of FIG. 2 is hosted on the peer to peer network (201 ) of nodes (e.g., 211 , 213, ... ).

[0040] For example, when a parking activity record (205) is created, a node having the record (205) can broadcast the record (205) in the peer to peer network (201 ); and the record (205) can propagate in the peer to peer network (201 ) such that redundant copies of the record (205) are stored in nodes (e.g., 211 or 213) that receive the record (205). Redundant copies of the record (205) can be stored in some or all of the nodes (e.g., 211 or 213) in the peer to peer network (201 ).

[0041] The peer to peer network (201 ) can validate a record (205) based on network consensus. For example, when the majority of nodes (e.g., 211 , 213) approves the validity of a record (205), the record (205) is accepted.

[0042] Optionally, a parking activity record (205) involving two computing devices (e.g., a server (101 ) and a vehicle (153)) can have digital signatures of the

computing devices for authenticity the nodes (e.g., 211 , 213) in the peer to peer network (201 ) can independently validate the authenticity of the digital signatures.

[0043] Optionally, a new parking activity record (205) can be linked in

cryptography to a prior parking activity record by including a hash of the prior parking activity record. Since a modification of the prior parking activity record can be detected from checking against the hash in the new parking activity record (205), the creation and distribution of the subsequent parking activity records and network consensus can be used to effectively prevent tampering of activity records stored in the decentralized, distributed database (203).

[0044] For example, a parking space (153) can be represented by a digital token; and the possession of the token can be limited by the decentralized, distributed database (203) to one parking application (207) at a time. When the token is transferred to a parking application (207) of a node (211 ) representing a server (101 ), the parking space (153) is freed and available for reservation and/or occupation. When the token is transferred to a parking application (207) of a node (211 ) representing a vehicle (153) (or a mobile device), the parking space (153) is occupied by the vehicle (153).

[0045] For example, when the digital token representing the parking space (153) is acquired by the server (101 ) according to the network consensus of the

decentralized, distributed database (203), the digital token may be reserved a parking application (207) of a vehicle (153) for acquisition. The reservation transaction can be performed in response to a destination to be set to the parking lot (111 ) in a navigation system of the vehicle (153), or in response to an explicit user request, or in response to the distance between the parking lot and the vehicle (153) being shorter than a threshold.

[0046] In some instances, the parking infrastructure and/or the parking application can allow multiple competing reservations for a parking space; and a set of predetermined rules can be implemented to select a reservation to be honored. For example, when the vehicle (153) having a reservation for the parking space (125) arrives at an entrance (e.g., 131 or 135) prior to the arrival of other vehicles having the reservation for the parking space (125), the reservation of the other vehicles can be invalidated and/or changed to reservations for other available parking spaces (e.g., 121 or 123).

[0047] For example, the arrival of the vehicle (153) at the entrance (e.g., 131 or 135) can be detected via a secure message exchange between the server (101 ) and the vehicle (153) over a wireless local area network.

[0048] For example, the arrival of the vehicle (153) at the entrance (e.g., 131 or 135) can be detected via a camera at the entrance scanning the license plate of the vehicle (153).

[0049] For example, the arrival of the vehicle (153) at the entrance (e.g., 131 or 135) can be detected via a position report from the parking application of the vehicle (153). The position of the vehicle (153) can be determined using signals (147) from satellites (145) of a satellite positioning system (e.g., a global positioning system (GPS)), and/or from base stations or access points (e.g., 141 ).

[0050] Based on the position of the vehicle (153) in the parking lot (111 ), the parking application (207) can provide turn-by-turn guidance to lead the vehicle (153) to the parking space (125).

[0051] Upon detection of the vehicle (153) occupying the parking space (125), a transaction record can be generated in the decentralized, distributed database (203) for the transfer of the digital token of the parking space (125) from the parking application (207) of the server (111 ) to the parking application (207) of the vehicle (153).

[0052] Upon detection of the vehicle (153) leaving the parking space (125), a transaction record can be generated in the decentralized, distributed database (203) for the transfer of the digital token of the parking space (125) back to the parking application (207) of the server (111 ) from the parking application (207) of the vehicle (153).

[0053] In general, various parking rules, reservation rules, parking charges can be implemented via the detection of the parking related activities and the records in the decentralized, distributed database (203). Thus, the techniques are not limited to particular examples illustrated above.

[0054] FIG. 3 shows a method to manage parking according to one embodiment. For example, the method of FIG. 3 can be implemented in the parking infrastructure of FIG. 1 using a decentralized, distributed database of FIG. 2.

[0055] At block 301 , a decentralized, distributed database (203), hosted on a peer to peer network (201 ), records reservations for parking spaces (e.g., 121 , 123, 125, ... ) in a parking lot (e.g., 111 ).

[0056] In one example, the peer to peer network (201 ) can be formed using a set of server computers (101 - 107) of parking lots. Such a peer to peer network (201 ) may exclude vehicles (e.g., 151 and 153) and/or mobile devices of users/drivers.

[0057] In another example, the peer to peer network (201 ) can be formed using a set of vehicles (e.g., 151 , 153) and/or mobile devices that are registered to use the parking services of the parking infrastructure illustrated in FIG. 1. Such a peer to peer network (201 ) may not include servers (101 - 107) as nodes to store redundant parking activity records. However, the servers (101 - 107) can provide other functions, such as detecting the presence of the vehicles (e.g., 151 , 153) in and/or near the parking lots (e.g., 111 ).

[0058] In yet another example, the peer to peer network (201 ) can be formed using a set of vehicles (e.g., 151 , 153) and/or mobile devices that are registered to use the parking services of a parking lot (e.g., 111 ). Different parking lots (101 - 107) can have separate peer to peer networks for recording parking activities related to their parking spaces.

[0059] In a further example, the peer to peer network (201 ) can be formed using a combination of vehicles (e.g., 151 , 153), registered mobile devices, and/or server computers (e.g., 101 - 107).

[0060] In some implementations, a vehicle (153), or a mobile device connected to the infotainment system of the vehicle (153), can dynamically join and leave the peer to peer network (201 ) based on the parking needs of the vehicle (153).

[0061] For example, the parking application (207) running in the vehicle (153), or a mobile device connected to the infotainment system of the vehicle (153), can join the peer to peer network (201 ) for the parking lot (111 ) when there is an interest in a parking space of the parking lot (111 ). Thus, a group of parking application (207) interested in the parking lot (111 ) can form the dynamic peer to peer network (201 ) to track and regulate the reservation and usage of the parking spaces in the parking lot (111 ), with or without the involvement of the server (101 ) of the parking lot (111 ).

[0062] In some instances, the server (101 ) signs an activity record using its private key such that the validity of the record can be validated independently the vehicles and mobile devices using the public key of the server (101 ); and a parking application involved in the record can publish the record in the peer to peer network (201 ) to allow regulation of parking activities among vehicles interested in the services of the parking lot (111 ). Optionally, the server (101 ) can also be part of the peer to peer network (201 ).

[0063] For example, a reservation can be made automatically by a parking application (207) in response to the destination of a navigational system of a vehicle (e.g., 151 or 153) being set to a parking lot (e.g., 111 ) or a point of interest near the parking lot (e.g., 111 ). The navigational system can be integrated within an autonomous vehicle, or a mobile device that is connected to the infotainment system of a vehicle. [0064] For example, each respective parking space (e.g., 125) in the parking lots (101 - 107) can be represented by a digital token. Parking activity records (e.g., 205) can be configured to identify the transfer of the digital token to or from parking applications, as indication of the use and release of the parking space (e.g., 125) by vehicles.

[0065] For example, the server (101 ) and/or the vehicle (153) can broadcast (e.g., the parking application (207)), a record of reservation in the peer to peer network (201 ) to store copies of a parking activity record (205) for the reservation in the nodes (e.g., 211 , 213, ... ) in the decentralized, distributed database (201 ). The parking application (207) can control parking activities based on the records stored in the decentralized, distributed database (203), by managing availability, reservation, approval, etc.

[0066] At block 303, a server (e.g., 101 ) of the parking lot (e.g., 111 ) detects a vehicle (e.g., 151 or 153) at an entrance (e.g., 131 or 135) of the parking lot (e.g., 1 1 1 ).

[0067] For example, when the vehicle (e.g., 151 or 153) at an entrance (e.g., 131 or 135) of the parking lot (e.g., 111 ), a parking application (207) for or in the vehicle (e.g., 151 or 153) can communicate with a server (e.g., 101 ) via a wireless local connection (e.g., using a wireless local area network, such as Wi-Fi, or a wireless personal area network, such as Bluetooth). The limited signal coverage area of the communication connection confirms that the physical presence of the vehicle or the mobile device running the parking application (207).

[0068] At block 305, the server (e.g., 101 ) determines whether the peer to peer network (201 ) recognizes a reservation for the vehicle (e.g., 151 or 153).

[0069] For example, each respective node (e.g., 111 ) in the peer to peer network (201 ) is configured to use its parking application (207) to determine whether the reservation is valid based on records stored on the respective node (e.g., 111 ).

When a majority of nodes (e.g., 211 , 213, ... ) in the peer to peer network (201 ) confirming validity of the reservation record, the reservation can be recognized.

[0070] For example, the vehicle (e.g., 153) is permitted to enter the parking lot (e.g., 111 ) in response to the reservation being recognized by the consensus of the peer to peer network (201 ) and not permitted to enter the parking lot (e.g., 111 ) when the reservation is not recognized by the consensus of the peer to peer network (201 ). [0071] At block 307, the server (e.g., 101 ) of the parking lot (e.g., 111 ) permits the vehicle (e.g., 151 or 153) to enter the parking lot (e.g., 111 ) based on recognition of the reservation for the vehicle (e.g., 151 or 153) by a majority of nodes (e.g., 211 , 213, ... ) in the peer to peer network (201 ).

[0072] At block 309, a parking application (207) can optionally guide the vehicle (e.g., 151 or 153) from the entrance to an available park space (e.g., 121 or 125) in the parking lot (e.g., 111 ).

[0073] At block 311 , the server (101 ) confirms occupation of the parking space (e.g., 121 or 125) by the vehicle (e.g., 151 or 153).

[0074] For example, a sensor can be configured to detect that the parking space (125) is being occupied by a vehicle (153).

[0075] For example, the parking application (207) can report, to the server (101 ) and/or the peer to peer network (201 ), the arrival of the vehicle (153) at the parking space (125), based on the result of the navigational guidance and/or the position of the vehicle (153) as determined by the parking application (207).

[0076] At block 313, the decentralized, distributed database (203) records occupation of the parking space (e.g., 121 or 125).

[0077] For example, the server computer (101 ) can generate or finalize an activity record (205) for the digital token representing the parking space (125), in response to a wireless communication with a parking application (207) of a vehicle (153), or a mobile device connected to the infotainment system of the vehicle (153). The limited range of the wireless communication indicates the location of the vehicle (153) in the parking lot (111 ). The server computer (101 ) and/or the application (207) can broadcast the activity record in the peer to peer network (201 ).

[0078] Since the activity record indicates that a vehicle (153) is parked in the parking space (125) represented by the digital token, via a transaction record of a transfer of the digital token from the server computer to the parking application, the availability information of the parking space (125) is updated in the decentralized, distributed database (203). The updated availability information can be used by other vehicles to plan travel, make reservation, and/or find alternative parking lots and/or parking spaces.

[0079] FIG. 4 is a block diagram of an example computer system in which embodiments of the present disclosure can operate.

[0080] FIG. 4 illustrates an example machine of a computer system (400) within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, can be executed. In some embodiments, the computer system (400) can correspond to a server computer system (e.g., 101 of FIG. 1); and in other embodiments, the computer system (400) can correspond to a vehicle (e.g., 153 of FIG. 1) or a mobile device connectable to an infotainment system of the vehicle. The computer system (400) can be coupled to, or utilized to perform the operations of a parking application (207) (e.g., to execute instructions to perform operations corresponding to the parking application (207) described with reference to FIGS. 1 - 3). In alternative embodiments, the machine can be connected (e.g., networked) to other machines in a LAN, an intranet, an extranet, and/or the Internet. The machine can operate in the capacity of a server or a client machine in client-server network environment, as a peer machine in a peer-to-peer (or distributed) network environment, or as a server or a client machine in a cloud computing infrastructure or environment.

[0081] The machine can be a personal computer (PC), a tablet PC, a set-top box (STB), a Personal Digital Assistant (PDA), a cellular telephone, a web appliance, a server, a network router, a switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine. Further, while a single machine is illustrated, the term“machine” shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the

methodologies discussed herein.

[0082] The example computer system (400) includes a processing device (402), a main memory (404) (e.g., read-only memory (ROM), flash memory, dynamic random access memory (DRAM) such as synchronous DRAM (SDRAM) or Rambus DRAM (RDRAM), static random access memory (SRAM), etc.), and a data storage system (418), which communicate with each other via a bus (430) (which can include multiple buses).

[0083] Processing device (402) represents one or more general-purpose processing devices such as a microprocessor, a central processing unit, or the like. More particularly, the processing device can be a complex instruction set computing (CISC) microprocessor, reduced instruction set computing (RISC) microprocessor, very long instruction word (VLIW) microprocessor, or a processor implementing other instruction sets, or processors implementing a combination of instruction sets. Processing device (402) can also be one or more special-purpose processing devices such as an application specific integrated circuit (ASIC), a field

programmable gate array (FPGA), a digital signal processor (DSP), network processor, or the like. The processing device (402) is configured to execute instructions (426) for performing the operations and steps discussed herein. The computer system (400) can further include a network interface device (408) to communicate over the network (420).

[0084] The data storage system (418) can include a machine-readable storage medium (424) (also known as a computer-readable medium) on which is stored one or more sets of instructions (426) or software embodying any one or more of the methodologies or functions described herein. The instructions (426) can also reside, completely or at least partially, within the main memory (404) and/or within the processing device (402) during execution thereof by the computer system (400), the main memory (404) and the processing device (402) also constituting machine- readable storage media.

[0085] In one embodiment, the instructions (426) include instructions to

implement functionality corresponding to a parking application (207) (e.g., the parking application (207) described with reference to FIGS. 1 - 3). While the machine-readable storage medium (424) is shown in an example embodiment to be a single medium, the term“machine-readable storage medium” should be taken to include a single medium or multiple media that store the one or more sets of instructions. The term“machine-readable storage medium” shall also be taken to include any medium that is capable of storing or encoding a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the present disclosure. The term“machine-readable storage medium” shall accordingly be taken to include, but not be limited to, solid-state memories, optical media, and magnetic media.

[0086] Some portions of the preceding detailed descriptions have been presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the ways used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.

[0087] It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. The present disclosure can refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system’s registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage systems.

[0088] The present disclosure also relates to an apparatus for performing the operations herein. This apparatus can be specially constructed for the intended purposes, or it can include a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program can be stored in a computer readable storage medium, such as, but not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, and magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, or any type of media suitable for storing electronic instructions, each coupled to a computer system bus.

[0089] The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems can be used with programs in accordance with the teachings herein, or it can prove convenient to construct a more specialized apparatus to perform the method. The structure for a variety of these systems will appear as set forth in the description below. In addition, the present disclosure is not described with reference to any particular programming language. It will be appreciated that a variety of

programming languages can be used to implement the teachings of the disclosure as described herein.

[0090] The present disclosure can be provided as a computer program product, or software, that can include a machine-readable medium having stored thereon instructions, which can be used to program a computer system (or other electronic devices) to perform a process according to the present disclosure. A machine- readable medium includes any mechanism for storing information in a form readable by a machine (e.g., a computer). In some embodiments, a machine-readable (e.g., computer-readable) medium includes a machine (e.g., a computer) readable storage medium such as a read only memory (“ROM”), random access memory (“RAM”), magnetic disk storage media, optical storage media, flash memory components, etc.

[0091] In this description, various functions and operations are described as being performed by or caused by computer instructions to simplify description.

However, those skilled in the art will recognize what is meant by such expressions is that the functions result from execution of the computer instructions by one or more controllers or processors, such as a microprocessor. Alternatively, or in

combination, the functions and operations can be implemented using special purpose circuitry, with or without software instructions, such as using Application- Specific Integrated Circuit (ASIC) or Field-Programmable Gate Array (FPGA).

Embodiments can be implemented using hardwired circuitry without software instructions, or in combination with software instructions. Thus, the techniques are limited neither to any specific combination of hardware circuitry and software, nor to any particular source for the instructions executed by the data processing system.

[0092] In the foregoing specification, embodiments of the disclosure have been described with reference to specific example embodiments thereof. It will be evident that various modifications can be made thereto without departing from the broader spirit and scope of embodiments of the disclosure as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.