U.S. patent application number 16/854846 was filed with the patent office on 2021-10-21 for vehicle to vehicle wireless energy transfer.
The applicant listed for this patent is TOYOTA MOTOR NORTH AMERICA, INC.. Invention is credited to Norman Lu.
Application Number | 20210323420 16/854846 |
Document ID | / |
Family ID | 1000004973705 |
Filed Date | 2021-10-21 |
United States Patent
Application |
20210323420 |
Kind Code |
A1 |
Lu; Norman |
October 21, 2021 |
VEHICLE TO VEHICLE WIRELESS ENERGY TRANSFER
Abstract
An example operation includes one or more of establishing a
first wireless connection between a first transport in motion and a
second transport in motion, receiving an energy transfer request
over the first wireless connection from the first transport to the
second transport, establishing a second wireless connection from an
energy interface on the second transport to an energy interface on
the first transport, and transferring an amount of energy via the
second wireless connection based on the request.
Inventors: |
Lu; Norman; (Fairview,
TX) |
|
Applicant: |
Name |
City |
State |
Country |
Type |
TOYOTA MOTOR NORTH AMERICA, INC. |
Plano |
TX |
US |
|
|
Family ID: |
1000004973705 |
Appl. No.: |
16/854846 |
Filed: |
April 21, 2020 |
Current U.S.
Class: |
1/1 |
Current CPC
Class: |
B60L 53/12 20190201;
H02J 7/00032 20200101; H04W 4/46 20180201; B60L 53/305
20190201 |
International
Class: |
B60L 53/12 20060101
B60L053/12; H04W 4/46 20060101 H04W004/46; B60L 53/30 20060101
B60L053/30; H02J 7/00 20060101 H02J007/00 |
Claims
1. A method, comprising: establishing a first wireless connection
between a first transport in motion and a second transport in
motion; receiving an energy transfer request over the first
wireless connection from the first transport to the second
transport; establishing a second wireless connection from an energy
interface on the second transport to an energy interface on the
first transport; and transferring an amount of energy via the
second wireless connection based on the request.
2. The method of claim 1, comprising indicating an optimal speed
and position of the first transport and an optimal speed and
position of the second transport to provide a maximum efficiency of
the transferring of the amount of energy between the energy
interfaces based on a current traffic scenario and an estimated
traffic scenario for a period of time needed to transfer the amount
of energy.
3. The method of claim 1, comprising instructing the first
transport and the second transport to maneuver to another route to
provide a maximum efficiency of the transferring of the amount of
energy between the energy interfaces based on a current traffic
scenario and an estimated traffic scenario for a period of time
needed to transfer the amount of energy.
4. The method of claim 1, comprising: instructing the first
transport to move away from the second transport while the second
transport is transferring the amount of energy in a less than
maximum efficiency; instructing the transport to move toward a
third transport in motion; establishing a third wireless connection
from an energy interface on the third transport to the energy
interface on the first transport; and transferring the amount of
energy via the third wireless connection in near maximum
efficiency.
5. The method of claim 1, comprising disconnecting the second
wireless connection from the energy interface on the second
transport when at least one of the transports is traveling at a
speed at or above a threshold and reconnecting the second wireless
connection when the transports are traveling below the threshold
speed.
6. The method of claim 1, wherein the transferred amount of energy
via the second wireless connection based on the request is
initially a test amount to ensure sufficient throughput, wherein
the amount of energy is further transferred as long as the
sufficiency of the throughput remains.
7. The method of claim 1, wherein at least one of the energy
interfaces on the first transport and the energy interface on the
second transport are configured to move to provide an efficient
transfer of the amount of energy.
8. A transport in motion, comprising a processor configured to:
establish a first wireless connection with a second transport in
motion; receive an energy transfer request over the first wireless
connection from the first transport to the second transport;
establish a second wireless connection from an energy interface on
the second transport to an energy interface on the first transport;
and transfer an amount of energy via the second wireless connection
based on the request.
9. The transport of claim 8, wherein the processor is configured to
indicate an optimal speed and position of the transport and an
optimal speed and position of the second transport to provide a
maximum efficiency of the transfer of the amount of energy between
the energy interfaces based on a current traffic scenario and an
estimated traffic scenario for a period of time needed to transfer
the amount of energy.
10. The transport of claim 8, wherein the processor is configured
to instruct the transport and the second transport to maneuver to
another route to provide a maximum efficiency of the transfer of
the amount of energy between the energy interfaces based on a
current traffic scenario and an estimated traffic scenario for a
period of time needed to transfer the amount of energy.
11. The transport of claim 8, wherein the processor is configured
to instruct the transport to: move away from the second transport
while the second transport transfers the amount of energy in a less
than maximum efficiency; instruct the transport to move toward a
third transport in motion; establish a third wireless connection
from an energy interface on the third transport to the energy
interface on the first transport; and transfer the amount of energy
via the third wireless connection in near maximum efficiency.
12. The transport of claim 8, wherein the processor is configured
to disconnect the second wireless connection from the energy
interface on the second transport when at least one of the
transports travels at a speed at or above a threshold and reconnect
the second wireless connection when the transports travel below the
threshold speed.
13. The transport of claim 8, wherein the transferred amount of
energy via the second wireless connection based on the request is
initially a test amount to ensure sufficient throughput, wherein
the amount of energy is further transferred as long as the
sufficiency of the throughput remains.
14. The transport of claim 8, wherein at least one of the energy
interface on the first transport and the energy interface on the
second transport to are configured to move to provide an efficient
transfer of the amount of energy.
15. A non-transitory computer readable medium comprising
instructions, that when read by a processor, cause the processor to
perform: establishing a first wireless connection between a first
transport in motion and a second transport in motion; receiving an
energy transfer request over the first wireless connection from the
first transport to the second transport; establishing a second
wireless connection from an energy interface on the second
transport to an energy interface on the first transport; and
transferring an amount of energy via the second wireless connection
based on the request.
16. The non-transitory computer readable medium of claim 15,
comprising indicating an optimal speed and position of the first
transport and an optimal speed and position of the second transport
to provide a maximum efficiency of the transferring of the amount
of energy between the energy interfaces based on a current traffic
scenario and an estimated traffic scenario for a period of time
needed to transfer the amount of energy.
17. The non-transitory computer readable medium of claim 15,
comprising instructing the first transport and the second transport
to maneuver to another route to provide a maximum efficiency of the
transferring of the amount of energy between the energy interfaces
based on a current traffic scenario and an estimated traffic
scenario for a period of time needed to transfer the amount of
energy.
18. The non-transitory computer readable medium of claim 15,
comprising: instructing the first transport to move away from the
second transport while the second transport is transferring the
amount of energy in a less than maximum efficiency; instructing the
transport to move toward a third transport in motion; establishing
a third wireless connection from an energy interface on the third
transport to the energy interface on the first transport; and
transferring the amount of energy via the third wireless connection
in near maximum efficiency.
19. The non-transitory computer readable medium of claim 15,
comprising disconnecting the second wireless connection from the
energy interface on the second transport when at least one of the
transports is traveling at a speed at or above a threshold and
reconnecting the second wireless connection when the transports are
traveling below the threshold speed.
20. The non-transitory computer readable medium of claim 15,
wherein at least one of the energy interfaces on the first
transport and the energy interface on the second transport are
configured to move to provide an efficient transfer of the amount
of energy.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS
[0001] This application is related to co-pending U.S.
non-provisional patent application entitled, "LOAD EFFECTS ON
TRANSPORT ENERGY," and co-pending U.S. non-provisional patent
application entitled, "TRANSPORT CHARGE OFFLOAD MANAGEMENT," all of
which were filed on Apr. 21, 2020 and are each incorporated herein
by reference in their entirety.
BACKGROUND
[0002] Vehicles or transports, such as cars, motorcycles, trucks,
planes, trains, etc., generally provide transportation needs to
occupants and/or goods in a variety of ways. Functions related to
transports may be identified and utilized by various computing
devices, such as a smartphone or a computer located on and or off
of the transport.
SUMMARY
[0003] One example embodiment provides a method that includes one
or more establishing a first wireless connection between a first
transport in motion and a second transport in motion, receiving an
energy transfer request over the first wireless connection from the
first transport to the second transport, establishing a second
wireless connection from an energy interface on the second
transport to an energy interface on the first transport, and
transferring an amount of energy via the second wireless connection
based on the request.
[0004] Another example embodiment provides a transport in motion
that includes a processor configured to perform one or more of
establish a first wireless connection with a second transport in
motion, receive an energy transfer request over the first wireless
connection from the first transport to the second transport,
establish a second wireless connection from an energy interface on
the second transport to an energy interface on the first transport,
and transfer an amount of energy via the second wireless connection
based on the request.
[0005] A further example embodiment provides a non-transitory
computer readable medium comprising instructions, that when read by
a processor, cause the processor to perform one or more of
establishing a first wireless connection between a first transport
in motion and a second transport in motion, receiving an energy
transfer request over the first wireless connection from the first
transport to the second transport, establishing a second wireless
connection from an energy interface on the second transport to an
energy interface on the first transport, and transferring an amount
of energy via the second wireless connection based on the
request.
BRIEF DESCRIPTION OF THE DRAWINGS
[0006] FIG. 1A illustrates an example a diagram of two transports
according to example embodiments.
[0007] FIG. 1B illustrates an example transport to transport flow
of energy, according to example embodiments.
[0008] FIG. 1C illustrates another transport according to example
embodiments.
[0009] FIG. 2A illustrates a transport network diagram, according
to example embodiments.
[0010] FIG. 2B illustrates another transport network diagram,
according to example embodiments.
[0011] FIG. 2C illustrates yet another transport network diagram,
according to example embodiments.
[0012] FIG. 3A illustrates a flow diagram, according to example
embodiments.
[0013] FIG. 4 illustrates a machine learning transport network
diagram, according to example embodiments.
[0014] FIG. 5A illustrates an example vehicle configuration for
managing database transactions associated with a vehicle, according
to example embodiments.
[0015] FIG. 5B illustrates another example vehicle configuration
for managing database transactions conducted among various
vehicles, according to example embodiments
[0016] FIG. 6A illustrates a blockchain architecture configuration,
according to example embodiments.
[0017] FIG. 6B illustrates another blockchain configuration,
according to example embodiments.
[0018] FIG. 6C illustrates a blockchain configuration for storing
blockchain transaction data, according to example embodiments.
[0019] FIG. 6D illustrates example data blocks, according to
example embodiments.
[0020] FIG. 7 illustrates an example system that supports one or
more of the example embodiments.
DETAILED DESCRIPTION
[0021] It will be readily understood that the instant components,
as generally described and illustrated in the figures herein, may
be arranged and designed in a wide variety of different
configurations. Thus, the following detailed description of the
embodiments of at least one of a method, apparatus, non-transitory
computer readable medium and system, as represented in the attached
figures, is not intended to limit the scope of the application as
claimed but is merely representative of selected embodiments.
[0022] The instant features, structures, or characteristics as
described throughout this specification may be combined in any
suitable manner in one or more embodiments. For example, the usage
of the phrases "example embodiments", "some embodiments", or other
similar language, throughout least this specification refers to the
fact that a particular feature, structure, or characteristic
described in connection with the embodiment may be included in at
one embodiment. Thus, appearances of the phrases "example
embodiments", "in some embodiments", "in other embodiments", or
other similar language, throughout this specification do not
necessarily all refer to the same group of embodiments, and the
described features, structures, or characteristics may be combined
in any suitable manner in one or more embodiments. In the diagrams,
any connection between elements can permit one-way and/or two-way
communication even if the depicted connection is a one-way or
two-way arrow. In the current solution, a transport may include one
or more of cars, trucks, walking area battery electric vehicle
(BEV), e-Palette, fuel cell bus, motorcycles, scooters, bicycles,
boats, recreational vehicles, planes, and any object that may be
used to transport people and or goods from one location to
another.
[0023] In addition, while the term "message" may have been used in
the description of embodiments, the application may be applied to
many types of network data, such as, a packet, frame, datagram,
etc. The term "message" also includes packet, frame, datagram, and
any equivalents thereof. Furthermore, while certain types of
messages and signaling may be depicted in exemplary embodiments
they are not limited to a certain type of message, and the
application is not limited to a certain type of signaling.
[0024] Example embodiments provide methods, systems, components,
non-transitory computer readable media, devices, and/or networks,
which provide at least one of: a transport (also referred to as a
vehicle herein) a data collection system, a data monitoring system,
a verification system, an authorization system and a vehicle data
distribution system. The vehicle status condition data, received in
the form of communication update messages, such as wireless data
network communications and/or wired communication messages, may be
received and processed to identify vehicle/transport status
conditions and provide feedback as to the condition changes of a
transport. In one example, a user profile may be applied to a
particular transport/vehicle to authorize a current vehicle event,
service stops at service stations, and to authorize subsequent
vehicle rental services.
[0025] Within the communication infrastructure, a decentralized
database is a distributed storage system, which includes multiple
nodes that communicate with each other. A blockchain is an example
of a decentralized database, which includes an append-only
immutable data structure (i.e. a distributed ledger) capable of
maintaining records between untrusted parties. The untrusted
parties are referred to herein as peers, nodes or peer nodes. Each
peer maintains a copy of the database records and no single peer
can modify the database records without a consensus being reached
among the distributed peers. For example, the peers may execute a
consensus protocol to validate blockchain storage entries, group
the storage entries into blocks, and build a hash chain via the
blocks. This process forms the ledger by ordering the storage
entries, as is necessary, for consistency. In a public or
permissionless blockchain, anyone can participate without a
specific identity. Public blockchains can involve cryptocurrencies
and use consensus based on various protocols such as proof of work
(PoW). On the other hand, a permissioned blockchain database
provides a system, which can secure interactions among a group of
entities, which share a common goal, but which do not or cannot
fully trust one another, such as businesses that exchange funds,
goods, information, and the like. The instant solution can function
in a permissioned and/or a permissionless blockchain setting.
[0026] Smart contracts are trusted distributed applications, which
leverage tamper-proof properties of the shared or distributed
ledger (i.e., which may be in the form of a blockchain) database
and an underlying agreement between member nodes, which is referred
to as an endorsement or endorsement policy. In general, blockchain
entries are "endorsed" before being committed to the blockchain
while entries, which are not endorsed are disregarded. A typical
endorsement policy allows smart contract executable code to specify
endorsers for an entry in the form of a set of peer nodes that are
necessary for endorsement. When a client sends the entry to the
peers specified in the endorsement policy, the entry is executed to
validate the entry. After validation, the entries enter an ordering
phase in which a consensus protocol is used to produce an ordered
sequence of endorsed entries grouped into blocks.
[0027] Nodes are the communication entities of the blockchain
system. A "node" may perform a logical function in the sense that
multiple nodes of different types can run on the same physical
server. Nodes are grouped in trust domains and are associated with
logical entities that control them in various ways. Nodes may
include different types, such as a client or submitting-client
node, which submits an entry-invocation to an endorser (e.g.,
peer), and broadcasts entry-proposals to an ordering service (e.g.,
ordering node). Another type of node is a peer node, which can
receive client submitted entries, commit the entries and maintain a
state and a copy of the ledger of blockchain entries. Peers can
also have the role of an endorser, although it is not a
requirement. An ordering-service-node or orderer is a node running
the communication service for all nodes, and which implements a
delivery guarantee, such as a broadcast to each of the peer nodes
in the system when committing entries and modifying a world state
of the blockchain, which is another name for the initial blockchain
entry, which normally includes control and setup information.
[0028] A ledger is a sequenced, tamper-resistant record of all
state transitions of a blockchain. State transitions may result
from smart contract executable code invocations (i.e., entries)
submitted by participating parties (e.g., client nodes, ordering
nodes, endorser nodes, peer nodes, etc.). An entry may result in a
set of asset key-value pairs being committed to the ledger as one
or more operands, such as creates, updates, deletes, and the like.
The ledger includes a blockchain (also referred to as a chain),
which is used to store an immutable, sequenced record in blocks.
The ledger also includes a state database, which maintains a
current state of the blockchain. There is typically one ledger per
channel. Each peer node maintains a copy of the ledger for each
channel of which they are a member.
[0029] A chain is an entry log structured as hash-linked blocks,
and each block contains a sequence of N entries where N is equal to
or greater than one. The block header includes a hash of the
block's entries, as well as a hash of the prior block's header. In
this way, all entries on the ledger may be sequenced and
cryptographically linked together. Accordingly, it is not possible
to tamper with the ledger data without breaking the hash links. A
hash of a most recently added blockchain block represents every
entry on the chain that has come before it, making it possible to
ensure that all peer nodes are in a consistent and trusted state.
The chain may be stored on a peer node file system (i.e., local,
attached storage, cloud, etc.), efficiently supporting the
append-only nature of the blockchain workload.
[0030] The current state of the immutable ledger represents the
latest values for all keys that are included in the chain entry
log. Because the current state represents the latest key values
known to a channel, it is sometimes referred to as a world state.
Smart contract executable code invocations execute entries against
the current state data of the ledger. To make these smart contract
executable code interactions efficient, the latest values of the
keys may be stored in a state database. The state database may be
simply an indexed view into the chain's entry log, it can therefore
be regenerated from the chain at any time. The state database may
automatically be recovered (or generated if needed) upon peer node
startup, and before entries are accepted.
[0031] A blockchain is different from a traditional database in
that the blockchain is not a central storage but rather a
decentralized, immutable, and secure storage, where nodes must
share in changes to records in the storage. Some properties that
are inherent in blockchain and which help implement the blockchain
include, but are not limited to, an immutable ledger, smart
contracts, security, privacy, decentralization, consensus,
endorsement, accessibility, and the like.
[0032] Example embodiments provide a way for providing a vehicle
service to a particular vehicle and/or requesting user associated
with a user profile that is applied to the vehicle. For example, a
user may be the owner of a vehicle or the operator of a vehicle
owned by another party. The vehicle may require service at certain
intervals and the service needs may require authorization prior to
permitting the services to be received. Also, service centers may
offer services to vehicles in a nearby area based on the vehicle's
current route plan and a relative level of service requirements
(e.g., immediate, severe, intermediate, minor, etc.). The vehicle
needs may be monitored via one or more sensors, which report sensed
data to a central controller computer device in the vehicle, which
in turn, is forwarded to a management server for review and
action.
[0033] A sensor may be located on one or more of the interior of
the transport, the exterior of the transport, on a fixed object
apart from the transport, and on another transport near to the
transport. The sensor may also be associated with the transport's
speed, the transport's braking, the transport's acceleration, fuel
levels, service needs, the gear-shifting of the transport, the
transport's steering, and the like. The notion of a sensor may also
be a device, such as a mobile device. Also, sensor information may
be used to identify whether the vehicle is operating safely and
whether the occupant user has engaged in any unexpected vehicle
conditions, such as during the vehicle access period. Vehicle
information collected before, during and/or after a vehicle's
operation may be identified and stored in a transaction on a
shared/distributed ledger, which may be generated and committed to
the immutable ledger as determined by a permission granting
consortium, and thus in a "decentralized" manner, such as via a
blockchain membership group.
[0034] Each interested party (i.e., company, agency, etc.) may want
to limit the exposure of private information, and therefore the
blockchain and its immutability can limit the exposure and manage
permissions for each particular user vehicle profile. A smart
contract may be used to provide compensation, quantify a user
profile score/rating/review, apply vehicle event permissions,
determine when service is needed, identify a collision and/or
degradation event, identify a safety concern event, identify
parties to the event and provide distribution to registered
entities seeking access to such vehicle event data. Also, the
results may be identified, and the necessary information can be
shared among the registered companies and/or individuals based on a
"consensus" approach associated with the blockchain. Such an
approach could not be implemented on a traditional centralized
database.
[0035] Autonomous driving systems can utilize software, an array of
sensors as well as machine learning functionality, lidar
projectors, radar, ultrasonic sensors, etc. to create a map of
terrain and road that a transport can use for navigation and other
purposes. In some embodiments, GPS, maps, cameras, sensors and the
like can also be used in autonomous vehicles in place of lidar.
[0036] The instant solution includes, in certain embodiments,
authorizing a vehicle for service via an automated and quick
authentication scheme. For example, driving up to a charging
station or fuel pump may be performed by a vehicle operator and the
authorization to receive charge or fuel may be performed without
any delays provided the authorization is received by the service
station. A vehicle may provide a communication signal that provides
an identification of a vehicle that has a currently active profile
linked to an account that is authorized to accept a service, which
can be later rectified by compensation. Additional measures may be
used to provide further authentication, such as another identifier
may be sent from the user's device wirelessly to the service center
to replace or supplement the first authorization effort between the
transport and the service center with an additional authorization
effort.
[0037] Data shared and received may be stored in a database, which
maintains data in one single database (e.g., database server) and
generally at one particular location. This location is often a
central computer, for example, a desktop central processing unit
(CPU), a server CPU, or a mainframe computer. Information stored on
a centralized database is typically accessible from multiple
different points. A centralized database is easy to manage,
maintain, and control, especially for purposes of security because
of its single location. Within a centralized database, data
redundancy is minimized as a single storing place of all data also
implies that a given set of data only has one primary record.
[0038] Electric transports use elements that connect to ports on
the transport to receive electric charge to their batteries. These
elements may include a home charging unit that a transport plugs
into, such as in a garage, or a charging station connected to the
electric grid. These charging stations may be at various locations
wherein a transport can obtain charge during a long trip.
Currently, it is not possible for an electric transport to easily
obtain charge from another electric transport. What is needed is a
solution that overcomes this problem.
[0039] The current solution allows for an electric transport to
wirelessly transfer energy to/from a target transport. The
transport contains one or more energy sources, a wireless transfer
control interface for interacting with a target transport, and an
energy interface configured to be engaged with an energy interface
of the target transport. The energy interface includes hardware
and/or software as depicted and described herein. The transports
maneuver such that the energy interfaces, which may be located
anywhere on the transport and the target transport, are in
proximity to each other and permit energy to be transferred. In one
embodiment, the transports may be in motion.
[0040] Referring to FIG. 1A, a diagram of two transports in one
example of the current solution 100 is depicted. The transports 102
and 104 are in proximity to each other. Elements 106 and 108
located on the transports, such as on a lower portion of each of
the doors are provided to allow a transfer of energy. In one
embodiment, a request for a transfer of energy is initiated by one
transport. A wireless connection is established between the two
transports 102 104 to determine if a requested amount of energy is
able to be transferred. The transferring of the amount of energy
between the energy interfaces 106 and 108 includes transferring a
portion of the amount of energy at any time. The transferring of
the amount of energy between the energy interfaces 106 and 108
includes transferring a portion of the amount of energy until the
energy transfer request is satisfied.
[0041] Referring to FIG. 1B, a diagram of a transport to transport
flow of energy 120 is depicted. Electric charge from one
transport's 132 battery 140 to another transport's 122 battery 130
uses at least one process of energy transfer. Wireless transfer of
power implementations include at least two different varieties:
inductive, which uses magnetic field coupling in between the
conducting coils, and capacitive, which uses electric field
coupling between conducting plates to transfer the energy.
[0042] In inductive transfer systems, low power transfer density is
an issue. Capacitive transfer systems reduce the need for
electromagnetic field shielding and can be operated at higher
frequencies, allowing them to potentially be smaller and less
expensive. Hence, capacitive transfer systems may be a potential
solution for transport to transport wireless power transfer.
However, a high frequency is necessary due to small capacitance
between the transport's conductive plates. One or more of these
varieties and/or other technologies which allow the wireless
transfer of energy 142 can be used with the instant solution.
[0043] In one embodiment, by controlling the input voltages of
individual inverters 138 and their relative phase-shift, energy can
be maintained at an even level and wirelessly transferred between
various energy interfaces 128 and 134 on transports 122 and 132, as
well as charging stations that contain the requisite equipment. The
high frequency inverter 138 is used to compensate for coupling
variations while operating at a fixed frequency. A loading of the
inverter 138 can occur to provide voltage-free compensation with
nearly no current switching. Voltage gain and compensation networks
126 and 136 provide voltage and/or current gain. When coupling
reactance changes from its nominal value, the inverter 138 provides
a required additional compensation. A high frequency rectifier 124
provides variable compensation at a fixed frequency while
maintaining high efficiency.
[0044] Referring to FIG. 1C, a diagram 160 of a transport with a
moving element to provide maximum transfer of power is depicted. A
system (depicted or described herein) and/or the transport 162
determine a most optimal position of the energy interface 166 to
maximize the energy transfer. The energy interface 166 is
positioned in element 164 (which includes one or more of the
devices described or depicted in FIG. 1B) and is movable via a
pivot or tilt on a mechanism (not shown) such that a maximum amount
of transfer will occur. In another embodiment, the energy interface
164 is movable via a track (not shown) along the transport 164 to
account for changes in the speed of the transport, such as when the
transport increases or decreases speed.
[0045] In one embodiment, a processor and/or hardware in the
element 164 and/or the transport measures a receipt of electric
charge and sends instructions to the energy interface 166 and/or
the element 164 to reposition if the received amount of electric
charge is insufficient. The system instructs one or more of the
transports 104 and 102 (or one of the transports instructs another
of the transports), to reposition their respective energy
interfaces 166, 128, 134 for an optimal flow of electric charge
based on a known capacity or efficiency rating. Further, the system
can recommend an adjustment of the speed and direction of the
transports 102 104 to send and receive the greatest amount of
energy. One transport may be able to move closer to the other
transport to provide a greater amount of energy transfer, as an
example.
[0046] In one embodiment, the energy interfaces described and
depicted herein may be located in one or more of the sides, the
rear, and the front of the transports 102, 104 and 162. In one
embodiment, the energy interfaces are located on top of the
transports such that a drone landing on, or in proximity to the top
of the transports is able to receive energy from and/or provide
energy to the transports. In one embodiment, the energy interfaces
are located on the undercarriage of the transports such that coils
or other devices in the energy interfaces in the undercarriage
receive energy from coils or other devices connected to power
sources in or along the road. In one embodiment, the system and/or
the transport via one or more processors or sensors, determines an
amount of energy that will be transferred to a transport from power
sources in or along a road based on a location, destination and
current battery charge of the transport and determines when and how
much additional charge from another transport must be wirelessly
provided to ensure a non-stop journey to the destination. In
another embodiment, a recommended route may not be the most
efficient route but may be the chosen route due to those roads
including power sources in or along the road or transports capable
of delivering wireless power.
[0047] In one embodiment, the energy being transferred between
energy interfaces is in watts, kilowatts, milliwatts, and the like.
Hardware and software on the transports 102, 104 and 162, such as
an application executing via a processor, instruct the energy
interface(s) to adjust positions, alter an angle to maximize the
receipt of energy, etc. Various positions of the energy interfaces
can be tested to determine an optimal position for energy transfer
and/or reception. The most efficient and/or the greatest amount of
energy transferred can be determined at a particular time and/or
over a period of time. For example, it may be advantageous for the
energy interface to receive a lower amount of energy for a longer
amount of time, than a greater amount of energy over a shorter
amount of time, as that transfer could provide for a greater
overall amount of energy being transferred. Further, based on data
accumulated by one or more of the processors or sensors, the
transfer of energy can be based on a safe mode in which traffic and
other road or environmental conditions are assessed to dictate
different speeds of transfer and/or a break in the transfer (for
example, the processors, sensors, etc. can determine the traffic
ahead and adjust or pause the transfer accordingly).
[0048] In one embodiment the energy interface and/or other
processors record the amount of energy being sent/received and the
amount of interference and/or misalignment of the energy interfaces
in the energy transfer. In one embodiment, the energy interfaces
106, 108, 128, 134, 166 are able to angle, move within the
transport, move out a distance from the transport (such as via a
movable arm), tilt, and the like. The instant solution can
continuously assess the best position for the transports to send
and/or receive the greatest, most efficient and/or safest amount of
energy.
[0049] In one embodiment, one or more of the elements/servers
depicted or described herein determine/receive from one or more
processors/sensors on a target transport, one or more of a
following: an amount of charge in the transport, a destination of
the transport, a route of the transport, an amount of additional
charge needed based on the destination including various conditions
(such as, road, transport, traffic, environmental,
driver/occupants, etc.). The elements/server can then
determine/receive information regarding transports traveling along
the route that are able to provide energy to the target transport
heading to its destination and further determine the availability
of those transports to position proximate the target transport, and
their amount of stored energy at the time and for a length of time
that they are able to be proximate to the target transport (based
on the conditions). This information can determine if the transport
can reach its destination without a need to stop and recharge.
[0050] In one embodiment, multiple transports may provide transfer
of energy to a target transport such as transport 122. For example,
a plurality of transports may provide charge to a target transport.
The plurality of transports may be ahead, behind and on either side
of the target transport to provide a transfer of energy. The system
monitors the amount of energy being transferred from the sending
transports and notifies a providing or sending transport to stop
the energy transfer when the amount of transferring energy falls
below a threshold, reaches an intended transfer amount, and/or if
another providing transport is more efficient at providing the
charger or is providing in a safer manner (based on the
conditions).
[0051] In one embodiment, communication between the system and a
display on the transport allows for a user of the transport to be
made aware of the energy transfer between the transport 122 and the
other sending transport(s) such as transport 132.
[0052] In another embodiment, the system may instruct the
transports 122 and 132 to maneuver to alternate routes to allow for
maximum energy transfer. This allows for a continued transfer of
energy when the current route may make the transfer difficult. The
system, communicating with a navigation application on the
transport or data off the transport such as data stored in one or
more elements depicted or described herein, determines alternate
paths where the transports will be able to continue to
transfer/receive energy when a current route becomes unavailable to
perform the action, such as due to traffic, road construction, and
the like. The system informs the driver in the scenario where there
is a non-autonomous transport, or redirects the navigation in the
scenario where an autonomous transport is present. In one
embodiment, a hand-shake is performed, via on-board processors and
sensors, where both transports (the providing and the receiving
transport) reach an agreement related to the alternate route.
[0053] When one or more transports are providing energy to a target
transport, the system and/or the providing or target transports,
may instruct a handoff from one providing transport to another
providing transport. There may be a period of time that both
providing transports are providing energy to the target transport.
The system monitors the amount of energy transferred and is aware
of an amount of energy requested and/or needed to reach a
destination without stopping for a charge. In a situation where a
wireless transfer of energy becomes difficult or impossible, the
system locates an optimal charging station for the transport to
receive a charge as well as an amount of time to spend at the
charging station until the wireless transfer of energy from another
providing transport becomes possible, safe and/or efficient.
[0054] In another embodiment not involving a wireless transfer of
energy, a server/computer can cause the processor to establish a
wireless connection from the first transport 132 to the second
transport 122, receive an energy transfer directive over the
wireless connection to the first transport 122, move an
articulating arm from the first transport such that a first energy
interface on the arm connects with a second energy interface on the
second transport; and transfer an amount of energy as specified in
the energy transfer directive.
[0055] In one embodiment, an optimal speed and position of the
first transport 102 and an optimal speed and position of the second
transport 104 is obtained to provide a maximum efficiency of the
energy transfer between the energy interfaces based on a current
traffic scenario and an estimated traffic scenario for a period of
time needed to transfer the amount of energy.
[0056] In one embodiment, the first transport 102 is instructed by
the system or via the current solution executing on a processor of
the transport to move further away from the second transport 104
when a transfer of energy is below a maximum efficiency. The first
transport 102 is then instructed to move toward a third transport
in motion where a third wireless connection is established from an
energy interface on the third transport to the energy interface on
the first transport 102. An amount of energy is transferred via the
third wireless connection. In one embodiment, the wireless
connection is disconnected from the energy interface on a second
transport 104 when at least one of the transports 102 104 is
traveling at a speed at or above a threshold and reconnecting the
wireless connection when the transports 102 104 are traveling below
the threshold speed. In one embodiment, a test is performed by the
second, receiving transport 104 such that the transferred amount of
energy via the wireless connection based on the request is
initially a test amount to ensure sufficient throughput, wherein
the amount of energy is further transferred as long as the
sufficiency of the throughput remains.
[0057] FIG. 2A illustrates a transport network diagram 200,
according to example embodiments. The network comprises elements
including a transport node 202 including a processor 204, as well
as a transport node 202' including a processor 204'. The transport
nodes 202, 202' communicate with one another via the processors
204, 204', as well as other elements (not shown) including
transceivers, transmitters, receivers, storage, sensors and other
elements capable of providing communication. The communication
between the transport nodes 202, 202' can occur directly, via a
private and/or a public network (not shown) or via other transport
nodes and elements comprising one or more of a processor, memory,
and software. Although depicted as single transport nodes and
processors, a plurality of transport nodes and processors may be
present. One or more of the applications, features, steps,
solutions, etc., described and/or depicted herein may be utilized
and/or provided by the instant elements.
[0058] FIG. 2B illustrates another transport network diagram 210,
according to example embodiments. The network comprises elements
including a transport node 202 including a processor 204, as well
as a transport node 202' including a processor 204'. The transport
nodes 202, 202' communicate with one another via the processors
204, 204', as well as other elements (not shown) including
transceivers, transmitters, receivers, storage, sensors and other
elements capable of providing communication. The communication
between the transport nodes 202, 202' can occur directly, via a
private and/or a public network (not shown) or via other transport
nodes and elements comprising one or more of a processor, memory,
and software. The processors 204, 204' can further communicate with
one or more elements 230 including sensor 212, wired device 214,
wireless device 216, database 218, mobile phone 220, transport node
222, computer 224, I/O device 226 and voice application 228. The
processors 204, 204' can further communicate with elements
comprising one or more of a processor, memory, and software.
[0059] Although depicted as single transport nodes, processors and
elements, a plurality of transport nodes, processors and elements
may be present. Information or communication can occur to and/or
from any of the processors 204, 204' and elements 230. For example,
the mobile phone 220 may provide information to the processor 204,
which may initiate the transport node 202 to take an action, may
further provide the information or additional information to the
processor 204', which may initiate the transport node 202' to take
an action, may further provide the information or additional
information to the mobile phone 220, the transport node 222, and/or
the computer 224. One or more of the applications, features, steps,
solutions, etc., described and/or depicted herein may be utilized
and/or provided by the instant elements.
[0060] FIG. 2C illustrates yet another transport network diagram
240, according to example embodiments. The network comprises
elements including a transport node 202 including a processor 204
and a non-transitory computer readable medium 242C. The processor
204 is communicably coupled to the computer readable medium 242C
and elements 230 (which were depicted in FIG. 2B).
[0061] The processor 204 performs one or more of establishing a
first wireless connection between a first transport in motion and a
second transport in motion 242, receiving an energy transfer
request over the first wireless connection from the first transport
to the second transport 244, establishing a second wireless
connection from an energy interface on the second transport to an
energy interface on the first transport 246, and transferring an
amount of energy via the second wireless connection based on the
request 248.
[0062] The processors and/or computer readable media may fully or
partially reside in the interior or exterior of the transport
nodes. The steps or features stored in the computer readable media
may be fully or partially performed by any of the processors and/or
elements in any order. Additionally, one or more steps or features
may be added, omitted, combined, performed at a later time,
etc.
[0063] FIG. 3A illustrates a flow diagram 300, according to example
embodiments. Referring to FIG. 3A, the flow comprises one or more
of establishing a first wireless connection between a first
transport in motion and a second transport in motion 302, receiving
an energy transfer request over the first wireless connection from
the first transport to the second transport 304, establishing a
second wireless connection from an energy interface on the second
transport to an energy interface on the first transport 306, and
transferring an amount of energy via the second wireless connection
based on the request 308.
[0064] FIG. 4 illustrates a machine learning transport network
diagram 400, according to example embodiments. The network 400
includes a transport node 402 that interfaces with a machine
learning subsystem 406. The transport node includes one or more
sensors 404.
[0065] The machine learning subsystem 406 contains a learning model
408, which is a mathematical artifact created by a machine learning
training system 410 that generates predictions by finding patterns
in one or more training data sets. In some embodiments, the machine
learning subsystem 406 resides in the transport node 402. In other
embodiments, the machine learning subsystem 406 resides outside of
the transport node 402.
[0066] The transport node 402 sends data from the one or more
sensors 404 to the machine learning subsystem 406. The machine
learning subsystem 406 provides the one or more sensor 404 data to
the learning model 408, which returns one or more predictions. The
machine learning subsystem 406 sends one or more instructions to
the transport node 402 based on the predictions from the learning
model 408.
[0067] In a further embodiment, the transport node 402 may send the
one or more sensor 404 data to the machine learning training system
410. In yet another embodiment, the machine learning subsystem 406
may sent the sensor 404 data to the machine learning subsystem 410.
One or more of the applications, features, steps, solutions, etc.,
described and/or depicted herein may utilize the machine learning
network 400 as described herein.
[0068] FIG. 5A illustrates an example vehicle configuration 500 for
managing database transactions associated with a vehicle, according
to example embodiments. Referring to FIG. 5A, as a particular
transport/vehicle 525 is engaged in transactions (e.g., vehicle
service, dealer transactions, delivery/pickup, transportation
services, etc.), the vehicle may receive assets 510 and/or
expel/transfer assets 512 according to a transaction(s). A
transport processor 526 resides in the vehicle 525 and
communication exists between the transport processor 526, a
database 530, a transport processor 526 and the transaction module
520. The transaction module 520 may record information, such as
assets, parties, credits, service descriptions, date, time,
location, results, notifications, unexpected events, etc. Those
transactions in the transaction module 520 may be replicated into a
database 530. The database 530 can be one of a SQL database, an
RDBMS, a relational database, a non-relational database, a
blockchain, a distributed ledger, and may be on board the
transport, may be off board the transport, may be accessible
directly and/or through a network, or be accessible to the
transport.
[0069] FIG. 5B illustrates an example vehicle configuration 550 for
managing database transactions conducted among various vehicles,
according to example embodiments. The vehicle 525 may engage with
another vehicle 508 to perform various actions such as to share,
transfer, acquire service calls, etc. when the vehicle has reached
a status where the services need to be shared with another vehicle.
For example, the vehicle 508 may be due for a battery charge and/or
may have an issue with a tire and may be in route to pick up a
package for delivery. A transport processor 528 resides in the
vehicle 508 and communication exists between the transport
processor 528, a database 554, a transport processor 528 and the
transaction module 552. The vehicle 508 may notify another vehicle
525, which is in its network and which operates on its blockchain
member service. A transport processor 526 resides in the vehicle
525 and communication exists between the transport processor 526, a
database 530, the transport processor 526 and a transaction module
520. The vehicle 525 may then receive the information via a
wireless communication request to perform the package pickup from
the vehicle 508 and/or from a server (not shown). The transactions
are logged in the transaction modules 552 and 520 of both vehicles.
The credits are transferred from vehicle 508 to vehicle 525 and the
record of the transferred service is logged in the database 530/554
assuming that the blockchains are different from one another, or,
are logged in the same blockchain used by all members. The database
554 can be one of a SQL database, an RDBMS, a relational database,
a non-relational database, a blockchain, a distributed ledger, and
may be on board the transport, may be off board the transport, may
be accessible directly and/or through a network.
[0070] FIG. 6A illustrates a blockchain architecture configuration
600, according to example embodiments. Referring to FIG. 6A, the
blockchain architecture 600 may include certain blockchain
elements, for example, a group of blockchain member nodes 602-606
as part of a blockchain group 610. In one example embodiment, a
permissioned blockchain is not accessible to all parties but only
to those members with permissioned access to the blockchain data.
The blockchain nodes participate in a number of activities, such as
blockchain entry addition and validation process (consensus). One
or more of the blockchain nodes may endorse entries based on an
endorsement policy and may provide an ordering service for all
blockchain nodes. A blockchain node may initiate a blockchain
action (such as an authentication) and seek to write to a
blockchain immutable ledger stored in the blockchain, a copy of
which may also be stored on the underpinning physical
infrastructure.
[0071] The blockchain transactions 620 are stored in memory of
computers as the transactions are received and approved by the
consensus model dictated by the members' nodes. Approved
transactions 626 are stored in current blocks of the blockchain and
committed to the blockchain via a committal procedure, which
includes performing a hash of the data contents of the transactions
in a current block and referencing a previous hash of a previous
block. Within the blockchain, one or more smart contracts 630 may
exist that define the terms of transaction agreements and actions
included in smart contract executable application code 632, such as
registered recipients, vehicle features, requirements, permissions,
sensor thresholds, etc. The code may be configured to identify
whether requesting entities are registered to receive vehicle
services, what service features they are entitled/required to
receive given their profile statuses and whether to monitor their
actions in subsequent events. For example, when a service event
occurs and a user is riding in the vehicle, the sensor data
monitoring may be triggered, and a certain parameter, such as a
vehicle charge level, may be identified as being above/below a
particular threshold for a particular period of time, then the
result may be a change to a current status, which requires an alert
to be sent to the managing party (i.e., vehicle owner, vehicle
operator, server, etc.) so the service can be identified and stored
for reference. The vehicle sensor data collected may be based on
types of sensor data used to collect information about vehicle's
status. The sensor data may also be the basis for the vehicle event
data 634, such as a location(s) to be traveled, an average speed, a
top speed, acceleration rates, whether there were any collisions,
was the expected route taken, what is the next destination, whether
safety measures are in place, whether the vehicle has enough
charge/fuel, etc. All such information may be the basis of smart
contract terms 630, which are then stored in a blockchain. For
example, sensor thresholds stored in the smart contract can be used
as the basis for whether a detected service is necessary and when
and where the service should be performed.
[0072] FIG. 6B illustrates a shared ledger configuration, according
to example embodiments. Referring to FIG. 6B, the blockchain logic
example 640 includes a blockchain application interface 642 as an
API or plug-in application that links to the computing device and
execution platform for a particular transaction. The blockchain
configuration 640 may include one or more applications, which are
linked to application programming interfaces (APIs) to access and
execute stored program/application code (e.g., smart contract
executable code, smart contracts, etc.), which can be created
according to a customized configuration sought by participants and
can maintain their own state, control their own assets, and receive
external information. This can be deployed as an entry and
installed, via appending to the distributed ledger, on all
blockchain nodes.
[0073] The smart contract application code 644 provides a basis for
the blockchain transactions by establishing application code, which
when executed causes the transaction terms and conditions to become
active. The smart contract 630, when executed, causes certain
approved transactions 626 to be generated, which are then forwarded
to the blockchain platform 652. The platform includes a
security/authorization 658, computing devices, which execute the
transaction management 656 and a storage portion 654 as a memory
that stores transactions and smart contracts in the blockchain.
[0074] The blockchain platform may include various layers of
blockchain data, services (e.g., cryptographic trust services,
virtual execution environment, etc.), and underpinning physical
computer infrastructure that may be used to receive and store new
entries and provide access to auditors, which are seeking to access
data entries. The blockchain may expose an interface that provides
access to the virtual execution environment necessary to process
the program code and engage the physical infrastructure.
Cryptographic trust services may be used to verify entries such as
asset exchange entries and keep information private.
[0075] The blockchain architecture configuration of FIGS. 6A and 6B
may process and execute program/application code via one or more
interfaces exposed, and services provided, by the blockchain
platform. As a non-limiting example, smart contracts may be created
to execute reminders, updates, and/or other notifications subject
to the changes, updates, etc. The smart contracts can themselves be
used to identify rules associated with authorization and access
requirements and usage of the ledger. For example, the information
may include a new entry, which may be processed by one or more
processing entities (e.g., processors, virtual machines, etc.)
included in the blockchain layer. The result may include a decision
to reject or approve the new entry based on the criteria defined in
the smart contract and/or a consensus of the peers. The physical
infrastructure may be utilized to retrieve any of the data or
information described herein.
[0076] Within smart contract executable code, a smart contract may
be created via a high-level application and programming language,
and then written to a block in the blockchain. The smart contract
may include executable code that is registered, stored, and/or
replicated with a blockchain (e.g., distributed network of
blockchain peers). An entry is an execution of the smart contract
code, which can be performed in response to conditions associated
with the smart contract being satisfied. The executing of the smart
contract may trigger a trusted modification(s) to a state of a
digital blockchain ledger. The modification(s) to the blockchain
ledger caused by the smart contract execution may be automatically
replicated throughout the distributed network of blockchain peers
through one or more consensus protocols.
[0077] The smart contract may write data to the blockchain in the
format of key-value pairs. Furthermore, the smart contract code can
read the values stored in a blockchain and use them in application
operations. The smart contract code can write the output of various
logic operations into the blockchain. The code may be used to
create a temporary data structure in a virtual machine or other
computing platform. Data written to the blockchain can be public
and/or can be encrypted and maintained as private. The temporary
data that is used/generated by the smart contract is held in memory
by the supplied execution environment, then deleted once the data
needed for the blockchain is identified.
[0078] A smart contract executable code may include the code
interpretation of a smart contract, with additional features. As
described herein, the smart contract executable code may be program
code deployed on a computing network, where it is executed and
validated by chain validators together during a consensus process.
The smart contract executable code receives a hash and retrieves
from the blockchain a hash associated with the data template
created by use of a previously stored feature extractor. If the
hashes of the hash identifier and the hash created from the stored
identifier template data match, then the smart contract executable
code sends an authorization key to the requested service. The smart
contract executable code may write to the blockchain data
associated with the cryptographic details.
[0079] FIG. 6C illustrates a blockchain configuration for storing
blockchain transaction data, according to example embodiments.
Referring to FIG. 6C, the example configuration 660 provides for
the vehicle 662, the user device 664 and a server 666 sharing
information with a distributed ledger (i.e., blockchain) 668. The
server may represent a service provider entity inquiring with a
vehicle service provider to share user profile rating information
in the event that a known and established user profile is
attempting to rent a vehicle with an established rated profile. The
server 666 may be receiving and processing data related to a
vehicle's service requirements. As the service events occur, such
as the vehicle sensor data indicates a need for fuel/charge, a
maintenance service, etc., a smart contract may be used to invoke
rules, thresholds, sensor information gathering, etc., which may be
used to invoke the vehicle service event. The blockchain
transaction data 670 is saved for each transaction, such as the
access event, the subsequent updates to a vehicle's service status,
event updates, etc. The transactions may include the parties, the
requirements (e.g., 18 years of age, service eligible candidate,
valid driver's license, etc.), compensation levels, the distance
traveled during the event, the registered recipients permitted to
access the event and host a vehicle service, rights/permissions,
sensor data retrieved during the vehicle event operation to log
details of the next service event and identify a vehicle's
condition status, and thresholds used to make determinations about
whether the service event was completed and whether the vehicle's
condition status has changed.
[0080] FIG. 6D illustrates blockchain blocks 680 that can be added
to a distributed ledger, according to example embodiments, and
contents of block structures 682A to 682n. Referring to FIG. 6D,
clients (not shown) may submit entries to blockchain nodes to enact
activity on the blockchain. As an example, clients may be
applications that act on behalf of a requester, such as a device,
person or entity to propose entries for the blockchain. The
plurality of blockchain peers (e.g., blockchain nodes) may maintain
a state of the blockchain network and a copy of the distributed
ledger. Different types of blockchain nodes/peers may be present in
the blockchain network including endorsing peers, which simulate
and endorse entries proposed by clients and committing peers which
verify endorsements, validate entries, and commit entries to the
distributed ledger. In this example, the blockchain nodes may
perform the role of endorser node, committer node, or both.
[0081] The instant system includes a blockchain that stores
immutable, sequenced records in blocks, and a state database
(current world state) maintaining a current state of the
blockchain. One distributed ledger may exist per channel and each
peer maintains its own copy of the distributed ledger for each
channel of which they are a member. The instant blockchain is an
entry log, structured as hash-linked blocks where each block
contains a sequence of N entries. Blocks may include various
components such as those shown in FIG. 6D. The linking of the
blocks may be generated by adding a hash of a prior block's header
within a block header of a current block. In this way, all entries
on the blockchain are sequenced and cryptographically linked
together preventing tampering with blockchain data without breaking
the hash links. Furthermore, because of the links, the latest block
in the blockchain represents every entry that has come before it.
The instant blockchain may be stored on a peer file system (local
or attached storage), which supports an append-only blockchain
workload.
[0082] The current state of the blockchain and the distributed
ledger may be stored in the state database. Here, the current state
data represents the latest values for all keys ever included in the
chain entry log of the blockchain. Smart contract executable code
invocations execute entries against the current state in the state
database. To make these smart contract executable code interactions
extremely efficient, the latest values of all keys are stored in
the state database. The state database may include an indexed view
into the entry log of the blockchain, it can therefore be
regenerated from the chain at any time. The state database may
automatically get recovered (or generated if needed) upon peer
startup, before entries are accepted.
[0083] Endorsing nodes receive entries from clients and endorse the
entry based on simulated results. Endorsing nodes hold smart
contracts, which simulate the entry proposals. When an endorsing
node endorses an entry, the endorsing nodes creates an entry
endorsement, which is a signed response from the endorsing node to
the client application indicating the endorsement of the simulated
entry. The method of endorsing an entry depends on an endorsement
policy that may be specified within smart contract executable code.
An example of an endorsement policy is "the majority of endorsing
peers must endorse the entry." Different channels may have
different endorsement policies. Endorsed entries are forward by the
client application to an ordering service.
[0084] The ordering service accepts endorsed entries, orders them
into a block, and delivers the blocks to the committing peers. For
example, the ordering service may initiate a new block when a
threshold of entries has been reached, a timer times out, or
another condition. In this example, blockchain node is a committing
peer that has received a data block 682A for storage on the
blockchain. The ordering service may be made up of a cluster of
orderers. The ordering service does not process entries, smart
contracts, or maintain the shared ledger. Rather, the ordering
service may accept the endorsed entries and specifies the order in
which those entries are committed to the distributed ledger. The
architecture of the blockchain network may be designed such that
the specific implementation of `ordering` (e.g., Solo, Kafka, BFT,
etc.) becomes a pluggable component.
[0085] Entries are written to the distributed ledger in a
consistent order. The order of entries is established to ensure
that the updates to the state database are valid when they are
committed to the network. Unlike a cryptocurrency blockchain system
(e.g., Bitcoin, etc.) where ordering occurs through the solving of
a cryptographic puzzle, or mining, in this example the parties of
the distributed ledger may choose the ordering mechanism that best
suits that network.
[0086] Referring to FIG. 6D, a block 682A (also referred to as a
data block) that is stored on the blockchain and/or the distributed
ledger may include multiple data segments such as a block header
684A to 684n, transaction specific data 686A to 686n, and block
metadata 688A to 688n. It should be appreciated that the various
depicted blocks and their contents, such as block 682A and its
contents are merely for purposes of an example and are not meant to
limit the scope of the example embodiments. In some cases, both the
block header 684A and the block metadata 688A may be smaller than
the transaction specific data 686A, which stores entry data;
however, this is not a requirement. The block 682A may store
transactional information of N entries (e.g., 100, 500, 1000, 2000,
3000, etc.) within the block data 690A to 690n. The block 682A may
also include a link to a previous block (e.g., on the blockchain)
within the block header 684A. In particular, the block header 684A
may include a hash of a previous block's header. The block header
684A may also include a unique block number, a hash of the block
data 690A of the current block 682A, and the like. The block number
of the block 682A may be unique and assigned in an
incremental/sequential order starting from zero. The first block in
the blockchain may be referred to as a genesis block, which
includes information about the blockchain, its members, the data
stored therein, etc.
[0087] The block data 690A may store entry information of each
entry that is recorded within the block. For example, the entry
data may include one or more of a type of the entry, a version, a
timestamp, a channel ID of the distributed ledger, an entry ID, an
epoch, a payload visibility, a smart contract executable code path
(deploy tx), a smart contract executable code name, a smart
contract executable code version, input (smart contract executable
code and functions), a client (creator) identify such as a public
key and certificate, a signature of the client, identities of
endorsers, endorser signatures, a proposal hash, smart contract
executable code events, response status, namespace, a read set
(list of key and version read by the entry, etc.), a write set
(list of key and value, etc.), a start key, an end key, a list of
keys, a Merkel tree query summary, and the like. The entry data may
be stored for each of the N entries.
[0088] In some embodiments, the block data 690A may also store
transaction specific data 686A, which adds additional information
to the hash-linked chain of blocks in the blockchain. Accordingly,
the data 686A can be stored in an immutable log of blocks on the
distributed ledger. Some of the benefits of storing such data 686A
are reflected in the various embodiments disclosed and depicted
herein. The block metadata 688A may store multiple fields of
metadata (e.g., as a byte array, etc.). Metadata fields may include
signature on block creation, a reference to a last configuration
block, an entry filter identifying valid and invalid entries within
the block, last offset persisted of an ordering service that
ordered the block, and the like. The signature, the last
configuration block, and the orderer metadata may be added by the
ordering service. Meanwhile, a committer of the block (such as a
blockchain node) may add validity/invalidity information based on
an endorsement policy, verification of read/write sets, and the
like. The entry filter may include a byte array of a size equal to
the number of entries in the block data 610A and a validation code
identifying whether an entry was valid/invalid.
[0089] The other blocks 682B to 682n in the blockchain also have
headers, files, and values. However, unlike the first block 682A,
each of the headers 684A to 684n in the other blocks includes the
hash value of an immediately preceding block. The hash value of the
immediately preceding block may be just the hash of the header of
the previous block or may be the hash value of the entire previous
block. By including the hash value of a preceding block in each of
the remaining blocks, a trace can be performed from the Nth block
back to the genesis block (and the associated original file) on a
block-by-block basis, as indicated by arrows 692, to establish an
auditable and immutable chain-of-custody.
[0090] The above embodiments may be implemented in hardware, in a
computer program executed by a processor, in firmware, or in a
combination of the above. A computer program may be embodied on a
computer readable medium, such as a storage medium. For example, a
computer program may reside in random access memory ("RAM"), flash
memory, read-only memory ("ROM"), erasable programmable read-only
memory ("EPROM"), electrically erasable programmable read-only
memory ("EEPROM"), registers, hard disk, a removable disk, a
compact disk read-only memory ("CD-ROM"), or any other form of
storage medium known in the art.
[0091] An exemplary storage medium may be coupled to the processor
such that the processor may read information from, and write
information to, the storage medium. In the alternative, the storage
medium may be integral to the processor. The processor and the
storage medium may reside in an application specific integrated
circuit ("ASIC"). In the alternative, the processor and the storage
medium may reside as discrete components. For example, FIG. 7
illustrates an example computer system architecture 700, which may
represent or be integrated in any of the above-described
components, etc.
[0092] FIG. 7 is not intended to suggest any limitation as to the
scope of use or functionality of embodiments of the application
described herein. Regardless, the computing node 700 is capable of
being implemented and/or performing any of the functionality set
forth hereinabove.
[0093] In computing node 700 there is a computer system/server 702,
which is operational with numerous other general purpose or special
purpose computing system environments or configurations. Examples
of well-known computing systems, environments, and/or
configurations that may be suitable for use with computer
system/server 702 include, but are not limited to, personal
computer systems, server computer systems, thin clients, thick
clients, hand-held or laptop devices, multiprocessor systems,
microprocessor-based systems, set top boxes, programmable consumer
electronics, network PCs, minicomputer systems, mainframe computer
systems, and distributed cloud computing environments that include
any of the above systems or devices, and the like.
[0094] Computer system/server 702 may be described in the general
context of computer system-executable instructions, such as program
modules, being executed by a computer system. Generally, program
modules may include routines, programs, objects, components, logic,
data structures, and so on that perform particular tasks or
implement particular abstract data types. Computer system/server
702 may be practiced in distributed cloud computing environments
where tasks are performed by remote processing devices that are
linked through a communications network. In a distributed cloud
computing environment, program modules may be located in both local
and remote computer system storage media including memory storage
devices.
[0095] As shown in FIG. 7, computer system/server 702 in cloud
computing node 700 is shown in the form of a general-purpose
computing device. The components of computer system/server 702 may
include, but are not limited to, one or more processors or
processing units 704, a system memory 706, and a bus that couples
various system components including system memory 706 to processor
704.
[0096] The bus represents one or more of any of several types of
bus structures, including a memory bus or memory controller, a
peripheral bus, an accelerated graphics port, and a processor or
local bus using any of a variety of bus architectures. By way of
example, and not limitation, such architectures include Industry
Standard Architecture (ISA) bus, Micro Channel Architecture (MCA)
bus, Enhanced ISA (EISA) bus, Video Electronics Standards
Association (VESA) local bus, and Peripheral Component
Interconnects (PCI) bus.
[0097] Computer system/server 702 typically includes a variety of
computer system readable media. Such media may be any available
media that is accessible by computer system/server 702, and it
includes both volatile and non-volatile media, removable and
non-removable media. System memory 706, in one embodiment,
implements the flow diagrams of the other figures. The system
memory 706 can include computer system readable media in the form
of volatile memory, such as random-access memory (RAM) 708 and/or
cache memory 710. Computer system/server 702 may further include
other removable/non-removable, volatile/non-volatile computer
system storage media. By way of example only, memory 706 can be
provided for reading from and writing to a non-removable,
non-volatile magnetic media (not shown and typically called a "hard
drive"). Although not shown, a magnetic disk drive for reading from
and writing to a removable, non-volatile magnetic disk (e.g., a
"floppy disk"), and an optical disk drive for reading from or
writing to a removable, non-volatile optical disk such as a CD-ROM,
DVD-ROM or other optical media can be provided. In such instances,
each can be connected to the bus by one or more data media
interfaces. As will be further depicted and described below, memory
706 may include at least one program product having a set (e.g., at
least one) of program modules that are configured to carry out the
functions of various embodiments of the application.
[0098] Program/utility, having a set (at least one) of program
modules, may be stored in memory 706 by way of example, and not
limitation, as well as an operating system, one or more application
programs, other program modules, and program data. Each of the
operating system, one or more application programs, other program
modules, and program data or some combination thereof, may include
an implementation of a networking environment. Program modules
generally carry out the functions and/or methodologies of various
embodiments of the application as described herein.
[0099] As will be appreciated by one skilled in the art, aspects of
the present application may be embodied as a system, method, or
computer program product. Accordingly, aspects of the present
application may take the form of an entirely hardware embodiment,
an entirely software embodiment (including firmware, resident
software, micro-code, etc.) or an embodiment combining software and
hardware aspects that may all generally be referred to herein as a
"circuit," "module" or "system." Furthermore, aspects of the
present application may take the form of a computer program product
embodied in one or more computer readable medium(s) having computer
readable program code embodied thereon.
[0100] Computer system/server 702 may also communicate with one or
more external devices via an I/O device 712 (such as an I/O
adapter), which may include a keyboard, a pointing device, a
display, a voice recognition module, etc., one or more devices that
enable a user to interact with computer system/server 702, and/or
any devices (e.g., network card, modem, etc.) that enable computer
system/server 702 to communicate with one or more other computing
devices. Such communication can occur via I/O interfaces of the
device 712. Still yet, computer system/server 702 can communicate
with one or more networks such as a local area network (LAN), a
general wide area network (WAN), and/or a public network (e.g., the
Internet) via a network adapter. As depicted, device 712
communicates with the other components of computer system/server
702 via a bus. It should be understood that although not shown,
other hardware and/or software components could be used in
conjunction with computer system/server 702. Examples, include, but
are not limited to: microcode, device drivers, redundant processing
units, external disk drive arrays, RAID systems, tape drives, and
data archival storage systems, etc.
[0101] Although an exemplary embodiment of at least one of a
system, method, and non-transitory computer readable medium has
been illustrated in the accompanied drawings and described in the
foregoing detailed description, it will be understood that the
application is not limited to the embodiments disclosed, but is
capable of numerous rearrangements, modifications, and
substitutions as set forth and defined by the following claims. For
example, the capabilities of the system of the various figures can
be performed by one or more of the modules or components described
herein or in a distributed architecture and may include a
transmitter, receiver or pair of both. For example, all or part of
the functionality performed by the individual modules, may be
performed by one or more of these modules. Further, the
functionality described herein may be performed at various times
and in relation to various events, internal or external to the
modules or components. Also, the information sent between various
modules can be sent between the modules via at least one of: a data
network, the Internet, a voice network, an Internet Protocol
network, a wireless device, a wired device and/or via plurality of
protocols. Also, the messages sent or received by any of the
modules may be sent or received directly and/or via one or more of
the other modules.
[0102] One skilled in the art will appreciate that a "system" could
be embodied as a personal computer, a server, a console, a personal
digital assistant (PDA), a cell phone, a tablet computing device, a
smartphone or any other suitable computing device, or combination
of devices. Presenting the above-described functions as being
performed by a "system" is not intended to limit the scope of the
present application in any way but is intended to provide one
example of many embodiments. Indeed, methods, systems and
apparatuses disclosed herein may be implemented in localized and
distributed forms consistent with computing technology.
[0103] It should be noted that some of the system features
described in this specification have been presented as modules, in
order to more particularly emphasize their implementation
independence. For example, a module may be implemented as a
hardware circuit comprising custom very large-scale integration
(VLSI) circuits or gate arrays, off-the-shelf semiconductors such
as logic chips, transistors, or other discrete components. A module
may also be implemented in programmable hardware devices such as
field programmable gate arrays, programmable array logic,
programmable logic devices, graphics processing units, or the
like.
[0104] A module may also be at least partially implemented in
software for execution by various types of processors. An
identified unit of executable code may, for instance, comprise one
or more physical or logical blocks of computer instructions that
may, for instance, be organized as an object, procedure, or
function. Nevertheless, the executables of an identified module
need not be physically located together but may comprise disparate
instructions stored in different locations that when joined
logically together, comprise the module and achieve the stated
purpose for the module. Further, modules may be stored on a
computer-readable medium, which may be, for instance, a hard disk
drive, flash device, random access memory (RAM), tape, or any other
such medium used to store data.
[0105] Indeed, a module of executable code could be a single
instruction, or many instructions, and may even be distributed over
several different code segments, among different programs, and
across several memory devices. Similarly, operational data may be
identified and illustrated herein within modules and may be
embodied in any suitable form and organized within any suitable
type of data structure. The operational data may be collected as a
single data set or may be distributed over different locations
including over different storage devices, and may exist, at least
partially, merely as electronic signals on a system or network.
[0106] It will be readily understood that the components of the
application, as generally described and illustrated in the figures
herein, may be arranged and designed in a wide variety of different
configurations. Thus, the detailed description of the embodiments
is not intended to limit the scope of the application as claimed
but is merely representative of selected embodiments of the
application.
[0107] One having ordinary skill in the art will readily understand
that the above may be practiced with steps in a different order,
and/or with hardware elements in configurations that are different
than those which are disclosed. Therefore, although the application
has been described based upon these preferred embodiments, it would
be apparent to those of skill in the art that certain
modifications, variations, and alternative constructions would be
apparent.
[0108] While preferred embodiments of the present application have
been described, it is to be understood that the embodiments
described are illustrative only and the scope of the application is
to be defined solely by the appended claims when considered with a
full range of equivalents and modifications (e.g., protocols,
hardware devices, software platforms etc.) thereto.
* * * * *