An Energy-Efficient Transaction Model for the Blockchain-enabled Internet of Vehicles (IoV)

11/30/2018 ∙ by Vishal Sharma, et al. ∙ 0

The blockchain is a safe, reliable and innovative mechanism for managing numerous vehicles seeking connectivity. However, following the principles of the blockchain, the number of transactions required to update ledgers pose serious issues for vehicles as these may consume the maximum available energy. To resolve this, an efficient model is presented in this letter which is capable of handling the energy demands of the blockchain-enabled Internet of Vehicles (IoV) by optimally controlling the number of transactions through distributed clustering. Numerical results suggest that the proposed approach is 40.16 number of transactions required to share the entire blockchain-data compared with the traditional blockchain.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

I Introduction

Blockchain enables shared access to information which is broadcasted across a network based on the trust of its participants [1]. Industries aiming at services for the Internet of Vehicles (IoV) consider blockchain as a leading technology for handling managerial as well as transmission aspects of vehicles [2]. Research groups in Mobility Open Blockchain Initiative (MOBI) have highlighted the potential use of this technology for IoV [3]. Challenges like broadcast collision-avoidance, resource scheduling [4], and privacy-preserving [5] in IoV can be resolved through an efficient implementation of vehicular-blockchain. Blockchain enables IoV to be protected against different types of cyber threats as well as allows secure distribution of vehicular services. In spite of playing a pivotal role, there are certain issues related to the prominent use of this blockchain technology, which includes excessive energy consumption for ledger-updates, peer-to-peer and peer-to-multi-peer smart contracts, and excessive transactions [6]. Resolving these can help to extend the utility as well as the applicability of blockchain to IoV.

In the networks where communications are bounded by blockchain technology, the number of transactions on each node is considerably high and these transactions cause a huge impact on the consumption of energy resources. Moreover, the mechanisms in blockchain use public key operations, which may cause considerable overheads even if light-weight cryptography algorithms are used for onboard security. However, the primary cause of concern is the multiple exchanges of transaction-messages between the vehicles and the core, which is a problem and it is desired to find a solution to reduce these number of transactions.

Fig. 1: An exemplary illustration of IoV with energy conserving points.

Ii System Model and Problem Statement

The solution presented in this letter uses distributed clustering mechanism based on stochastic volatility model of security derivatives for reducing the burden of transactions on each device in IoV by finding the optimal slots for updating the blockchain ledgers. In general, the presented optimal transaction model is driven by the selection of appropriate Cluster-Heads (CHs) as a part of distributed clustering. The success of the approach depends on the reduction in the overall cost of operation, which is expressed in terms of energy-efficiency and the number of iterations performed to identify the final transaction in the formulated blockchain.

To further clarify, the problem at hand can be observed from Fig. 1 in which each entity plays the role of a miner where consensus is performed through broadcasting. Let denote the set of vehicles each operating a set of applications that require blockchain procedures to accomplish their operations, such that the total energy consumed by th vehicle for number of blockchains is expressed as:

(1)

where is the energy consumed for security operations such as light-weight elliptic curve cryptography for checking correctness of nodes, and are the energy requirements of transmission procedures and blockchain-update (Ledgers) operations, respectively. In the proposed model,

(2)

and

(3)

where is the number of intermediate hops, is the number of records updated in a transaction, is the per record energy consumption, is the per request energy consumption, is the number of requests and is the types of messages like send, receive and acknowledgement. The network conditions for optimality are based on governing equations which are derived through a stochastic volatility model as it helps to predict the variation in energy consumption of the network. It also allows to accurately calculate the network sustaining rate if no additional batteries/resources are provided to IoV, such that the network differential variation, by using Heston Model [7], is given as:

(4)

where is the initial values for energy consumption, is the number of blockchain requests per unit time, is the ratio of the excessive energy to the total initial energy of the vehicle,

is the standard deviation of energy required w.r.t. energy utilized, and

denotes the rate of change of requests per unit time. Based on the given model, the location of a vehicle can be marked as , and the maximum distance to connect can be written as , which shows the range between entities involved in the update and sharing of ledgers. To sustain at a given energy rate, the network can be modeled into a transfer function , which is given as:

(5)

where

is the probability denoting the presence of a receiver,

denotes the probability function that a vehicle is in the range, is the set of clusters, is the operational time, and

(6)

where is the vehicle movement function within and is the probability of existence of vehicles with the given movement function (). Now, based on the above conditions, the network problem deals with attaining maximum transfers at a low consumption of energy, i.e.,

(7)

s.t.

Iii Distributed clustering for Blockchain-enabled IoV

Usually, clustering involves a centralized entity, which is against the principles of the blockchain. However, with a distributed phenomenon over the selection of CHs, the principles of blockchain remain intact and the network can be managed efficiently. Distributed clustering helps to lower the number of updates for ledgers as well as reduces the number of blockchain-links () generated for each ledger operation. Moreover, the slot-wise transactions offer better control over the operations of the entire network. However, it is required that the network entities must be aware of the optimal points as well as know the slots, which may result in redundant transmissions. In such a way, the energy of the network can be conserved considerably. In general, the major factors in the proposed approach are about the selection of CHs, decision to transmit (when and how), the number of permissible blockchain queries, and location-based ledger-offloading. Satisfaction of all these issues through stochastic volatility helps to sustain the network for longer durations.

Fig. 2: An exemplary illustration of the proposed mechanism of distributed clustering for the blockchain-enabled IoV.

The mechanism of distributed clustering can be followed from Fig. 2, according to which, every chain is labeled sequentially to identify the nodes involved in updates. The regular operations and authentication procedures are the same as defined in the original blockchain. However, in the proposed model, local and global chains are used for conserving energy, in which the ones with critical energy values (marked in red) are removed from the global operations and an appropriate CH is selected to handle their operations. For this, the local and global authentication processes are used, which involves hash-based authentication of CHs with the core components and hash-based authentication of general vehicles with CH. The CHs are temporary and their choices are made on-demand and as per the state of the network. This mechanism not only reduces the burden of excessive sharing but also lowers the complexity involved in performing fork operations for individual entries. Following Lemmas help to understand the operational details of the proposed methodology.
Lemma-1 In the given model, the sustaining rate of the network is governed by and , and the capacity of the network decreases if increases to a large extent. In such a case, if the rate of change in the number of requests approaches zero, the lifetime becomes only a function of initial value of energy and per-unit-energy consumption of the blockchain application.
Proof: A blockchain network should limit to share the operations for maintaining network secrecy. However, the success of the proposed approach depends on the knowledge of the operations. According to which, the network governing equations can be calculated based on two frequencies, and , of vehicle slots for operations defined in (1). Considering that the vehicles operate in a Gaussian mode, the two frequencies for network and blockchain operations can be given as and

, respectively. Gaussian distribution suites these formations as the average mean for network is high. Similar distribution can be used for f(p) in (

5). Here, and are the standard deviations for general operations per unit time and blockchain operations per unit time, respectively. Now, using and , with , and , the energy decaying in the network for each vehicle can be observed by solving the integral (), which gives

as an output. In actual practice,

is unknown, however, its value can be estimated by assuming that all the operations in the network are synchronized, such that

and . The deviation is varied to maintain a difference in regular and blockchain operations. Now, in such a case, and becomes , based on which, the energy decaying is calculated as

The values for these help to form an estimated overview of energy requirements/consumptions of each vehicle, and allow tracking of differential variations for energy demands in (4). Such provisioning facilitates the selection of CHs with a high availability of energy. In addition, the extent up to which the network can survive at a given depletion rate is observable through these results.
Lemma-2 The number of transactions needed to shift the entire load depends on the number of local as well as global updates performed in the IoV. The local updates can be accumulated and transferred once a slot for global exchange is initiated. Based on these, the actual number of required transactions () is given by

and assuming that all vehicles follow similar pattern where is their radio range, is the average range of the network required to maintain a connection, is the deviation of from .
Proof: In the given network, the number of transactions are driven by , number of parallel links , and the connectivity function of the network . Here, is driven by and , such that, the number of transitions to be performed for the blockchain can be written as , which on following the Gaussian distribution for vehicles can be written as . Now, solving in parts, it can be written as

By solving the remaining part, the observed value becomes , which is the desired output at and .
Optimal Solution: The solution to the energy-efficient transition considering the distributed clustering mechanism can be attained by performing optimal offloading and selecting new CHs whenever the energy demand of the network increases. If is the observation, which controls the changing of CH to optimize the transactions for conserving energy, the solutions can be attained through following formulations:

  • Based on Optimal Stopping Theory (OST) [8], change CH if

    (12)

    where stopping points are observable from Mayer, Lagrange and Supremum (MLS-OST) [8]

    for each CH at negligible Heston variance 

    [7], such that

    (13)

    Using Lemma-1 and Lemma-2, (13) deduces to

  • If OST does not hold, Lemma-2 is used for changing CH, i.e. and if , select CH that satisfies this condition provided that . If no CH is available, divide load based on , or divide the load based on for the given conditions in (II).

  • If both the above metrics fail to decide or create ambiguity, is modeled for pre-energy decaying, i.e. change CH, if

    where is the previous time slot/iteration for which the observational values are available.

The proposed optimal solution is convergent and guarantees uniqueness at and . However, the uniqueness is subject to and . As discussed earlier, for practical cases, is unknown, because of which the solution converges w.r.t. only. For extreme large values (), the optimal observation is affected and there can be more than one solution for (III)-(III), because of which the identification of CH becomes ambiguous and (III) is used as a solution. However, such a case is most unlikely to occur in practical scenarios. All the procedures defined in the system model can be accumulated, as shown in Algorithm 1, which suggests when to change the CH and time slot in which pre-offloading should be performed to avoid delays and conserve the energy. The operational complexity of the algorithm depends on and . The distributed and parallel operations can further help to conserve the energy associated with the onboard processing on each vehicle.

1:Input: Set network metrics and set idealistic values for
2:Set: Initial CHs and mark slots, ,
3:repeat
4:Compute energy ratings for each vehicle and find
5:Change CH if
6:until: , (7) and (II) hold
7:Output: Offloading at for and new CH
Algorithm 1 CH Selection and offloading
Fig. 3: Number of Transactions vs. operational time.
Fig. 4: Energy conservation factor (Lemma-1) vs. requests per unit time.

Iv Performance Evaluations

The proposed scheme was numerically evaluated for its efficacy compared with the traditional blockchain solution, which relies on the broadcasting of ledgers through Matlab™. The evaluations were carried with settings , in each cluster, , , requests per blockchain per second, , , , , J, and J is the approx. average, which can be fixed based on the curve algorithm or any dedicated security scheme [9] [10]. Excessive energy is taken twice as the total energy, i.e., , s, [11], m, s,

i.e. maximum presence of vehicles. In addition, standard normal distribution was considered for normal and blockchain operations with zero mean and unit deviation. The proposed scheme helps to conserve energy by following a non-standard formation of clusters against the original policies of blockchain while keeping its principles intact. The performance was recorded for the number of transactions required to offload the entire blockchain (Fig. 

3) and total energy conserved in variation with the number of requests (Fig. 4). The results in Fig. 3 show that the proposed scheme overpowers the traditional blockchain by reducing the transaction load up to 82.06% even at higher values for . These results govern the optimal solutions for selecting CH whenever the network’s energy consumption goes beyond the set limits. Moreover, the proposed scheme shows an average energy conservation of 40.16% compared with traditional blockchain at varying requests. Although the conserved energy decreases with an increase in the number of requests, the increase is lower than the standard operations and the conservation follows the values 33.32%, 40.02%, 42.85%, 44.45% for different values of , and , as shown in Fig. 4. At present, the security of the network depends on the success of transactions and updates shared between the vehicles. The intermittent evaluations of the principles of the blockchain-security are beyond the scope of this article and will be discussed in future reports.

V Conclusion

This letter aims at reducing the number of transactions required to update ledgers on the Internet of Vehicles. The purpose of the proposed approach is to reduce the burden of the network from numerous blockchain-transfer operations while conserving a maximum amount of available energy. To satisfy this goal, a distributed clustering model is designed which helps to conserve energy by 40.16% (average) and reduces the number of ledger-transactions by 82.06% compared with the traditional blockchain-based Internet of Vehicles (IoV).

References

  • [1] J. Gu, B. Sun, X. Du, J. Wang, Y. Zhuang, and Z. Wang, “Consortium blockchain-based malware detection in mobile devices,” IEEE Access, vol. 6, pp. 12118–12128, 2018.
  • [2] H. Liu, Y. Zhang, and T. Yang, “Blockchain-enabled security in electric vehicles cloud and edge computing,” IEEE Network, vol. 32, no. 3, pp. 78–83, 2018.
  • [3] E. Uhlemann, “Time for autonomous vehicles to connect [connected vehicles],” IEEE Vehicular Technology Magazine, vol. 13, no. 3, pp. 10–13, 2018.
  • [4] C.-Y. Wei, A. C.-S. Huang, C.-Y. Chen, and J.-Y. Chen, “Qos-aware hybrid scheduling for geographical zone-based resource allocation in cellular vehicle-to-vehicle communications,” IEEE Communications Letters, vol. 22, no. 3, pp. 610–613, 2018.
  • [5] J. Lim, H. Yu, K. Kim, M. Kim, and S.-B. Lee, “Preserving location privacy of connected vehicles with highly accurate location updates,” IEEE Communications Letters, vol. 21, no. 3, pp. 540–543, 2017.
  • [6] X. Liu, W. Wang, D. Niyato, N. Zhao, and P. Wang, “Evolutionary game for mining pool selection in blockchain networks,” IEEE Wireless Communications Letters, pp. 1–1, 2018.
  • [7] E. Benhamou, E. Gobet, and M. Miri, “Time dependent heston model,” SIAM Journal on Financial Mathematics, vol. 1, no. 1, pp. 289–325, 2010.
  • [8] G. Peskir and A. Shiryaev, Stochastic processes: A brief review, pp. 53–121. Basel: Birkhäuser Basel, 2006.
  • [9] A. Liu and P. Ning, “Tinyecc: A configurable library for elliptic curve cryptography in wireless sensor networks,” in International conference on Information processing in sensor networks, pp. 245–256, IEEE, 2008.
  • [10] N. R. Potlapally, S. Ravi, A. Raghunathan, and N. K. Jha, “Analyzing the energy consumption of security protocols,” in International symposium on Low power electronics and design, pp. 30–35, ACM, 2003.
  • [11] U. Ozguner, T. Acarman, and K. A. Redmill, Autonomous ground vehicles. Artech House, 2011.