On the spread of charitable behavior in a social network: a model based on game theory

1.   Introduction

As rapid development of internet of things (IoTs), a large number of devices in the IoTs and the volume of data generated make it further messy and huge. Further, there are high security risks while establishing an ecosystem containing all devices of the IoTs ^[1]. The blockchain is a decentralized ledger based on the consensus mechanism, cryptography and distributed storage in the intelligent transportation system. A perfect protocol and architecture design are essential to build a blockchain secure and reliable storage and trading network. In the field of IoT, blockchain can be used to provide security and privacy for user data in the network ^[2]. In the field of big data, blockchain can be used to improve data security and data quality ^[3]. In the field of healthcare domain Agbo et al. ^[4] made blockchain technology in healthcare: A systematic review. In the field of agri-food domain, Mirabelli ^[5] proposed a blockchain-based solution for agri-food supply chains. In the field of energy domain, Andoni et al. ^[6] proposed Blockchain technology in the energy sector: A systematic review of challenges and opportunities. In the field of Construction industry domain, Plevris et al. ^[7] proposed. Blockchain in civil engineering, architecture and construction industry: State of the art, evolution, challenges and opportunities. Bakogiannis et al. ^[8] proposed leveraging blockchain technology to break the cloud computing market monopoly in the field of cloud computing. In order to obtain data security, blockchain is also used in the field of fog computing and edge computing ^[9]. Khan et al. ^[10] pointed out that the scalability problem in the public blockchain hinders the provision of the best solution for enterprises and industries. Key management, encryption algorithm and smart contract are the core features of blockchain security ^[11]. Blockchain applications pay more attention to the core blockchain technologies and jointly provide a solid security cornerstone for blockchain applications from multiple dimensions such as security, data security, management security and application security ^[12], Bhat et al. ^[13] designed the agricultural food supply chain management system based on blockchain and IoT. Huh et al. ^[14] studied the blockchain consensus algorithm for feasible management of new and renewable energy. Astarita et al. ^[15] reviewed the application of blockchain in transportation system.

Message queue telemetry transmission (MQTT) is one of the common communication protocols for any platform in the IoTs. Whether from the perspective of overall security, equipment compatibility and resource consumption, MQTT protocol has certain advantages and is the most competitive communication protocol in the current IoT. However, the user password login form adopted by MQTT protocol has some security problems ^[16]. Diffie-Hellman (DH) key exchange algorithm is used to share public key and private key pairing for encryption and decryption in a secured manner. This algorithm is named after its inventor Diffie and Hellman ^[17], DH is not an encryption algorithm, but a secure key exchange algorithm, which is commonly used in cloud computing and blockchain systems ^[18]. Fibonacci sequence, also known as golden section sequence, is mathematically defined by recursive method: F(0) = 0, f(1) = 1, f(n) = f(n−1) + F(n−2) (n ≥ 2, n ∈ N) is used in many fields of physics and chemistry ^[19] and the third-order Fibonacci sequence is also used in the encryption and decryption applications ^[20].

Aiming at the problems of complex system and difficulty in implementation of the application of blockchain in intelligent transportation system, this paper proposes a lightweight fuzzy decision blockchain scheme through MQTT and DH Fibonacci technologies. Through this, the blockchain service scheme is scalable and easy to implement. DH and Fibonacci transformation are adopted to form lightweight fuzzy decision blockchain (LF-BC), which enhances the security and ensures the sustainable safety of the intelligent transportation system. The main contributions of this paper include three aspects:

● DH and Fibonacci transform are combined to form the fuzzy practical Byzantine fault tolerance (DH-FIB) algorithm which is used to generate LF-BC and to enhance the security.

● Realize scalable blockchain service scale and realize reliable communication of blockchain through MQTT protocol.

● In LF-BC blockchain system, using F-PBFT consensus algorithm, both fault tolerance rate and the transmission efficiency are significantly improved.

The paper is organized as follows. An extensive literature review on related technologies is undertaken in the second part. The third part proposes a lightweight fuzzy decision blockchain scheme. The fourth part compares and analyzes the experimental results. The fifth part summarizes the conclusion.

2.   Related research

In this paper, we implement a trusted lightweight blockchain scheme based on MQTT and Fibonacci, discuss the recent existing research on MQTT protocol, Fibonacci matrix, DH algorithm, blockchain technology and propose to apply DH-FIB algorithm to blockchain scheme.

2.1.   MQTT protocol

MQTT was originally developed by IBM as a communication protocol for telemedicine services. It is widely used in the IoTs because of its simplicity, specification, low overhead and easy implementation ^[21]. MQTT-publish based communication protocol, which creates and controls the hierarchy of topics, or subscribes to multiple topics. In March 2013, Oasis announced that MQTT was the preferred standard for the emerging IoTs messaging protocol. The model of MQTT protocol applied to the IoTs ^[22] is shown in Figure 1.

MQTT protocol frame format is shown in Table 1:

The type of MQTT protocol package ^[23], is shown in Table 2.

MQTT protocol only specifies the message format and does not limit the load content and format of users. Therefore, we can customize the load format. There are three options for load format: 1) Hexadecimal/Binary: In this, there is no readability, but the flow can be controlled to relatively small extent; 2) String: This is easy to read, but is still not the best choice; 3) JSON-key value pair: The hierarchy is concise and clear, which is easy to read and write. While implementing the blockchain scheme, considering the security of confidentiality, hexadecimal format is adopted along with Modbus to implement the monitoring and control of the terminal.

MQTT protocol is simple, standardized and has certain advantages. It is the most competitive communication protocol in the current IoTs ^[24].

2.2.   Fibonacci matrix

Fibonacci, an Italian mathematician in the 13th century, introduced an interesting sequence (called as Fibonacci sequence) from the problem of rabbit reproduction, record as {Fn}. It is a second-order recursive sequence, F₀ = 0, F₁ = 1, F_n+1 = F_n + F_n−1, n = 1, 2, 3…, and we call each term of this sequence as Fibonacci number. Researchers are interested in Fibonacci sequence over years because of its unique properties and are widely using in computational mathematics, optimization theory, operations research and other fields ^[25,26].

Reference ^[27] defines Fibonacci matrix T₂, which corresponds to the second-order Fibonacci sequence {Fn} and is expressed as:

Reference ^[28] defines the third-order Fibonacci matrix T₃, which corresponds to the third-order Fibonacci sequence {Fn}−a third-order recursive sequence F₀ = 1, F₁ = 1, F₂ = 2, F_n+1 = F_n + F_n−1 + F_n−2, n = 2, 3, 4…, and is expressed as:

Since the determinant |T₃| = 1 corresponding to the third-order Fibonacci matrix, T₃ is reversible.

Similarly, |T₃ⁿ| = 1, so T₃ⁿ is also reversible. The formulae for calculating T₃ⁿ and (T₃ⁿ)⁻¹ are as follows:

Since:

So:

For example, n = 5, T₃⁵ and (T₃⁵)⁻¹ are calculated by formula (6):

We make F_n = T₃ⁿ, F_n⁻¹ = (T₃ⁿ)⁻¹, use the characteristics of the third-order Fibonacci matrix T₃ⁿ reversible sum formula (6), take n as a parameter, and apply F_n and F_n⁻¹ to the encryption process of LF-BC blockchain in this paper.

2.3.   DH Encryption algorithm

Cryptography is the most important part of the blockchain system and the basic technology to realize the blockchain ^[29]. DH is an asymmetric encryption algorithm, which is commonly used in blockchain encryption schemes. It is also a public key algorithm ^[30]. Each communication party generates a private key and a public key, where the private key is not public. After the public key is publicly exchanged, the communication parties can calculate the shared key, and the shared key calculated by both parties is the same. Therefore, both parties can encrypt and decrypt the message ^[31,32] through the shared key, so as to realize the encrypted transmission of the message. DH negotiates a shared key through unreliable channels. In many industrial security protocols, such as SSL/TLS, SSH, Kerberos, ISO-9798-3, just fast key and PKI key distribution are widely used.

Alice sends the encrypted transmission process of plaintext M to Bob, as shown in Figure 2.

Encryption process (Alice)

Step 1: First agree two parameters g, N with Bob;

Step2: Randomly generates own private key x, and calculate X = g^x mod N, X as the public key;

Step3: Select the public key Y = g^y mod N, is sent by Bob and calculate the key: K = Y^x mod N = g^xy mod N, K as the shared key with Bob;

Step 4: Calculate the encrypted data Cm = E_k1(M);

Step5: Discloses sending Cm to Bob.

Decryption process (Bob)

Step1: First agree two parameters g, n with Alice;

Step2: Randomly generates own private key y, and calculates Y = g^y mod N, Y as the public key;

Step3: Select the public key X = g^x mod N sent by the sender and calculate the key, G = X^y mod N = g^{x y}mod N, G as the shared key with Alice;

Step4: Publicly receives cm and decrypts data, D_G(Cm) = D_G(E_K(M)) = M;

Step5: Finally obtains m from the slave.

DH is the basis of authentication key exchange (AKE) scheme in the post quantum computing era ^[33]. It combines DH and Fibonacci transformation to form LF-BC blockchain, which is a specific application of DH in vehicle intelligent transportation system.

2.4.   Blockchain technology

Blockchain technology was originally applied in the field of Internet finance to solve the trust problem of the third-party central institutions and provide a trust mechanism for decentralized transactions. The central idea of blockchain technology comes from the Bitcoin project released and implemented in 2009. The core technologies involved in the project mainly include cryptography, incentive mechanism, workload proof mechanism, P2P network, distributed database ^[34] and other technologies. It has four key characteristics.

● Decentralized network

The essence of blockchain is a decentralized distributed database, which is composed of a series of blocks generated by cryptography. The blocks contain data information that cannot be tampered within a certain period of time. Block contains data record, current block root hash, previous block root hash, time stamp and other information. Each user node in the network is both a client and a server. Each node has a complete backup of the whole database, and all nodes insert data through a specific consensus algorithm ^[35,36].

● Trusted blockchain structure

A blockchain consists of a block header and a block body as shown in Figure 3.

In Figure 3, block hash represents the hash value of the block header, pre-hash represents the hash value of the previous block, Merkel hash represents the Merkel hash value generated by the transaction number Tx_id, transaction number represents the number of transaction orders, time stamp represents the time stamp of the generated block, public key represents the public key of the generated block, and signature represents that the private key encrypts and signs of the user information. Policy header represents the permission control header of the block body ^[37], Transaction_i (i = 1...n) represents several transaction orders of the block body.

● Smart contract

Smart contracts are programmable protocols that allow the execution of the contract terms and agreements. The concept was first proposed by Szabo, who defined a smart contract as "a computerized transaction protocol that executes the terms of a contract". Thus, smart contracts can be deployed to a blockchain database and users can develop computer codes based on contractual clauses ^[38].

● Consensus algorithm

Practical byzantine fault tolerance (PBFT) algorithm is a consensus algorithm proposed by Miguel Castro and Arbara Liskov in 1999. PBFT is an algorithm to solve the consistency of state machine replicas in distributed scenarios ^[39]. The implementation of PBFT is divided into five steps: (1) Request, (2) Pre-prepare, (3) Prepare, (4) Commit, (5) Reply ^[40].

The process of PBFT algorithm is shown in Figure 4.

PBFT is a state machine replication algorithm. State machines replicate in different nodes of the distributed system. The copy of each state machine not only saves the state of the service, but also realizes the operation of the service. For convenience of description, assuming that n is the total number of cluster nodes, the security and consistency of the consensus cluster can be guaranteed when the failed nodes do not exceed (n−1)/3. Therefore, the fault-tolerance rate of PBFT is:

In other words, as long as the nodes exceeding (n−1)−F₁ = 2*(n−1)/3 are honest, the validity of blockchain data can be guaranteed.

3.   Lightweight fuzzy decision blockchain scheme

3.1.   Lightweight fuzzy decision blockchain scheme architecture

The lightweight fuzzy decision blockchain scheme mainly includes four parts: client, terminal, blockchain system and cloud plan work. 1) The client is the user's operating software, which can be a web client or APP; 2) The terminal mainly realizes GPS positioning, signal processing and control, and then realizes communication with the cloud platform; 3) Blockchain system is a service system responsible for data security, which refers to MQTT broker; 4) Cloud platform is a network platform responsible for remote communication and data management. The system architecture is shown in Figure 5, the communication between client, terminal, blockchain system and cloud platform is carried out through the publish and subscription (Pub/Sub) topic of MQTT. there is implementation process in Section 3.5.

Based on MQTT and Fibonacci fuzzy decision blockchain scheme, due to the use of LF-BC blockchain in the architecture, the security problem of the traditional centralized architecture has been effectively solved. When the system is implemented, it mainly includes two transactions: 1) User registration and 2) Data transmission, as shown in Figure 6.

In the user registration stage, the user inputs the user information to form a transaction order, and the registration information is encrypted and stored on the nodes of the blockchain through cryptographic technology and consensus algorithm F-PBFT; while in the data transmissionstage, the data message forms a transaction order. Through cryptography and consensus algorithm F-PBFT, the data message is stored in the blockchain and the information is transmitted to the terminal.

3.2.   DH-FIB fuzzy decision encryption algorithm

The basic principle of generating DH-FIB algorithm from Fibonacci matrix to DH encryption algorithm is as follows: 1) The sender and the receiver generate their own private key vectors, such as x = (x1, x2, x3), and generate their own public key vectors X and Y. 2) After X and y are exchanged, generate shared key vectors K and G, and calculate that the values of K and G are equal. 3) The sender's original m is encrypted into ciphertext Cm through K, and C is multiplied by Fibonacci matrix Fn to generate ciphertext vector Em = C*Fn, Em = {E1, E2, E3}, Em and sends it to the receiver. 4) The receiver multiplies the received em by the Fibonacci inverse matrix Fn−1, Em*Fn−1 = Cm*Fn*Fn−1 = Cm, finally decrypts Cm through the key vector G to obtain the original vector Em = (M1, M2, M3), and finally compares M1, M2, M3 through the voting algorithm to obtain the original M.

DH-FIB is called fuzzy decision encryption algorithm. Since the encryption key is random and Fibonacci transformed, the ciphertext generated each time is different. For example, the ciphertext obtained by the middleman is ambiguous. Secondly, due to the use of key vector, it is necessary to make decision on the result to achieve the purpose of fault tolerance, reliability and sustainability.

The encryption process of user sending plaintext m to Terminal is shown in Figure 7.

● Encryption process (user)

Step 1: First agree three parameters g, N, n of F_n with terminal;

Step 2: Randomly generate private key vector x = (x1, x2, x3) and calculate public key vector: X = (g^x1 mod N, g^x2mod N, g^x3mod N);

Step3: Select terminal's public key vector Y = (g^y1 mod N, g^y2 mod N, g^y3 mod N) and calculate: K = Y^x = (g^x1*y1mod N, g^x2*y2mod N, g^x3*y3mod N); K is defined as (K1, K2, K3), and is used as the shared key with terminal;

Step 4: Calculate the encrypted data C, for example, the original file m has 5 bytes;

M = (M1, M2, M3, M4, M5) (even for n bytes, the principle remains the same), calculate encryption matrix: Cm = E_k(M).

Step 5: Select the third-order Fibonacci matrix F_n, see formula (6);

Step 6: Calculate the encryption matrix Em by formulas (9) and (6);

Step 7: Convert Em to encrypted vector;

Step 8: Publicly send Em to terminal.

Decryption process (terminal)

Step 1: First agree three parameters g, N, n of F_n with user;

Step 2: Randomly generate their own private key vector y = (y1, y2, y3) and calculate public key vector: Y = (g^y1 mod N, g^y2 mod N, g^y3 mod N);

Step 3: Select user's public key vector X = (g^x1 mod N, g^x2mod N, g^x3mod N), and calculate: G = X^y = −(g^x1*y1mod N, g^x2*y2mod N, g^x3*y3mod N), G is defined as (G1, G2, G3), and is used as the shared key with user;

Step 4: Publicly accept T, T = {E1, E2, E3};

Step 5: Select the third-order Fibonacci inverse matrixF_n⁻¹, see formula (6);

Step6: The decryption transformation matrix Cm is calculated by formulae (10) and (6). Cm = E*F_n⁻¹ mod N;

Since:

So:

Step 7: The decryption matrix is calculated by G and formula (13).

Set:

From formula (14), M1, M2, M3 should be equal;

Step 8: The original text is obtained from the decryption Matrix Mn through the voting algorithm.

3.3.   LF-BC fuzzy decision blockchain and MQTT frame

The DH-FIB algorithm is applied to the blockchain system, and the generated blockchain is called lightweight fuzzy decision blockchain (LF-BC). Corresponding to a specific application, such as the remote monitoring system, the client in the system monitors the terminal through MQTT. We define the remote terminal as RTU, the control message adopts MQTT frame format, and the domain in MQTT frame format adopts DH-FIB blockchain structure, as shown in Figure 8. A blockchain includes a block header and a block body. The block body includes a policy header and several transaction orders. The transaction order is defined as a Modbus message.

The block header is used to ensure the security and integrity of blockchain. Police header is used for permission control and is the basis of blockchain data structure. The authorizer is a single entity user or multiple user groups ^[41].

LF-BC blockchain has three main functions:

● Authority management

Authority management completes permission control through police control header, which includes record number (No), authorizer, RTU_id, active and state. RTU authority management function is a very important part of LF-BC blockchain system, which is directly related to the security of application system.

● Storage management

Storage management is mainly used to manage the transactions. The transaction includes: transaction number (Tx_id) and Modbus message. Modbus protocol is the basic protocol commonly used in industrial automation system ^[42], which is also widely used in intelligent transportation system. The Modbus format is shown in Table 3.

● DH-FIB encryption and fault tolerance management

LF-BC blockchain adopts encryption fault-tolerant management for transactions. An example used in this paper is the remote monitoring system. Communication messages need to be encrypted to prevent man in the middle attack and eavesdropping.

As shown in Figure 9, Modbus messages generate encryption vectors Em = {E1, E2, E3} through DH-FIB encryption algorithm. See formula (11), E1, E2 and E3 is used as three transactions of the blockchain respectively. After receiving the blockchain, the receiver decrypts it through DH-FIB algorithm to form three new transactions Mn = {M1, M2, M3}, as shown in formula (14), and finally restores it to Modbus message through fault-tolerant voting algorithm.

3.4.   F-PBFT consensus algorithm

Ordinary blockchain schemes use PBFT consensus algorithm. A complete PBFT consensus needs to be completed twice communication, the complexity is O(n2), and its fault tolerance rate is F1 = (n−1)/3, see formula (9). This paper defines the consensus algorithm of the LF-BC blockchain scheme as F-PBFT. Through DH-FIB encryption algorithm, a complete message forms a consensus node. The consensus node contains three transaction orders Mn = {M1, M2, m3}. See formula (15). Take {M1, M2, m3} as a group with a fault tolerance of F2 = 1/3. Vote in the group to reach consensus. Therefore, A complete F-PBFT consensus needs to be completed twicecommunication, the complexity is O(n2/3), which greatly reduces the complexity of the communication.

Since one message generates three transaction orders and PBFT voting algorithm is adopted at the same time, the fault tolerance rate of F-PBFT is:

3.5.   Implementation of MQTT communication

The composition of the system is shown in Figure 5, and the subscription topic definition of its components is shown in Table 4:

MQTT communication process:

The process that the client sends data to the terminal through MQTT is as follows:

● The client sends information to the cloud platform by publish topic (Cloud_topic);

● The cloud platform receives the information and sends information to MQTT-1, MQTT-2, ..., MQTT-n by publish topic (MQTT_topic);

● After receiving the information, MQTT-1, MQTT-2, ..., MQTT-n performs the consensus algorithm and sends information to the cloud platform by publish topic (Cloud_topic);

● The cloud platform receives three groups of information. The cloud platform sends a group of information to the terminal through the voting algorithm by publish topic (Terminal_topic).

3.6.   Implementation Process of LF-BC blockchain scheme

The implementation process of LF-BC blockchain security scheme realizes the security of communication messages through the system without leakage. It mainly involves: encryption method, MQTT transmission, consensus algorithm, blockchain authentication, etc., mainly including: 1) User registration process and 2) data transmission process.

● User registration process

The flow chart of user registration (registered user name and password) in the system is shown in Figure 10.

Step 1: User sets three parameters g, N, n of F_n, randomly generates x = (x1, x2, x3), and calculates X and F_n. X = (g^x1 mod N, g^x2mod N, g^x3mod N);

Step 2: User sends g, N, n, X to cloud platform; U = > P:{g, N, n, X};

Step 3: Cloud platform generates y = (y1, y2, y3) and calculates Y and G; Y = (g^y1 mod N, g^y2mod N, g^y3mod N); G = X^y = (g^x1*y1mod N, g^x2*y2mod N, g^x3*y3mod N);

Step 4: Cloud platform sends Y to user; P = > U:{Y};

Step 5: User calculates K; K = Y^x = (g^x1*y1mod N, g^x2*y2mod N, g^x3*y3mod N);

Step 6: User inputs ID and PW, calculates: Em = E_k (ID, PW)* F_n; U = > P:{ID, Em};

Step 7: Cloud platform decrypts Em, calculates:

a) ID, PW = D_G(Em*F_n^-1);

b) Judge whether the ID and PW are equal to those in the database;

c) Calculate user id: Uid = H(ID, PW);

d) Calculate digital signature: S = sign(id, G).

Step 8: Cloud platform sends Uid to user; P = > U:{Uid};

Step 9: Cloud platform sends Uid, timestamp T, public key; P, S and blockB_hashto blockchain system; P = > B:{Uid, T, Y, P, B_hash};

Step 10: Blockchain system forms a blockchain and vote the transaction through the F-PBFT consensus algorithm and saves it to each blockchain node.

● Data transmission process

The security of data transmission is the most critical part of LF-BC blockchain scheme, which realizes the encryption and integrity of data. The data transmission flow chart is shown in Figure 11.

Step 1: User input Uid, RTU_addr, Modbus packet M_data; U = > P:{Uid, RTU_addr, M_data};

Step 2: Cloud platform checks whether the Uid is equal to the Uid of the database, and makes digital signature: S = sign(Uaddr, G);

Step 3: Cloud platform sends the address Uid, T, P, S and blockB_hash to blockchain system; P = > B:{Uid, T, P, S, B_hash};

Step 4: Blockchain system forms ablockclaim transaction and vote the transaction through the F-PBFT consensus algorithm, saves it to each block node;

Step 5: Blockchain system sends Police_head and transaction to cloud platform; B = > P:{Police_head, Transaction}

Step 6: Cloud platform sends Transaction to RTU; P = > RTU:{Transaction};

Step 7: RTU checks whether the RTU_addr is consistent with its own, parse packet M_data from the transaction;

Step 8: RTU checks whether the CRC is correct and executes Modbus command P_data;

Step 9: RTU sends Ack-data to Cloud platform; RTU = > P:{Ack-data};

Step 10: Cloud platform sends Ack-data to user. P = > U:{Ack-data}.

4.   Testing and comparison

4.1.   Case realization

This section takes the vehicle intelligent transportation system as an example to realize the specific application. First, establish a LF-BC blockchain through MQTT broker. Only authorized nodes can read blocks, execute smart contracts and verify new blocks in this blockchain. Secondly, the pre approved nodes agree and verify the blockchain through F-PBFT. The authorized nodes include data load terminal, cloud platform, MQTT broker and client.

The application block diagram of vehicle intelligent transportation system is shown in Figure 12. After the load terminal completes the monitoring, it encapsulates the monitoring data to be uploaded (such as equipment type, position, voltage, power, switch, monitoring time, etc.), then digitally signs these data in blockchain, and sends the signed data to cloud platform and blockchain system through MQTT. Finally, The client remotely monitors and controls the device through MQTT.

The following two sections emphasize the performance index analysis to illustrate the implementation effect of the system and verify the feasibility of this scheme.

4.2.   Safety performance analysis

The lightweight blockchain scheme suggested in this paper is significantly different from the existing centralized monitoring system and analyzes the security of the blockchain scheme from the following three aspects.

● Decentralization: The decentralized network architecture is adopted in which the transaction information is verified by all nodes, and finally a trusted blockchain is formed. Even if some nodes fail or are attacked by hackers, the failed nodes can still return to normal. The centralized system architecture however, is vulnerable to attacks (such as DDoS attacks, SQL injection attacks, etc.).

● Non tamperability: Digital signature can resist forgery attack under random key, so it can not be easily tampered. The fault tolerance performance is improved and the success rate of tampering and modification will be very low in the adoption of DH-FIB encryption algorithm and F-PBFT consensu.

● Traceability: The consensus node will verify the authenticity of the transaction. Each F-PBFT block has the hash value of the previous block, which can be traced back to the source Modbus message. When a malicious node deletes or modifies the content of a block, the system can easily restore and trace all transaction data.

4.3.   Fault-tolerance performance analysis

The collection was verified using three methods: the first was manual checking (MAC); the second one was common checking system (CMC)-referred as reading data through a single meter reading software and then checking data through a single image recognition software (such as Baidu cloud recognition) when the data could not be read; and the third one was the Petri parallel system, which was a parallel system of data acquisition and image recognition based on PN.

The higher the fault tolerance rate of the system, the higher is the transmission efficiency and the lower the fault tolerance rate, the lower is the transmission efficiency. The fault tolerance rates of the three schemes are compared below:

● Fault tolerance rate of the data redundancy: Centralized architecture often collects data. For example, a message is transmitted redundantly for three times, and the minority obeys the majority voting is adopted, so the fault tolerance rate is 1/3.

● PBFT fault tolerance rate: The common blockchain architecture adopts that if malicious nodes are evenly distributed on each blockchain, when the number of nodes does not exceed 1/3 of the total number of nodes, the consensus result is correct and has no impact on the system output result. The fault tolerance ability of the system is (n−1)/ 3, so the fault tolerance rate is 1/3.

● F-PBFT fault tolerance rate: The lightweight blockchain architecture in this paper adopts the F-PBFT consensus algorithm. One message generates three transaction orders, as shown in formula 16. The total fault tolerance is 5*(n−1)/9. Therefore, the fault tolerance is 5/9.

On comparing the fault tolerance rates of the three schemes in the histogram in Figure 13, it is observed that the fault tolerance rate of F-PBFT has increased by 22.3%.

4.4.   Data transmission time overhead comparison

Three architectures are compared by testing the data transmission time overhead on the load equipment monitoring system with wireless interference namely, 1) Centralized Architecture (CT-A), 2) Ordinary blockchain Architecture (BC-A); 3) Lightweight fuzzy decision blockchain Architecture (LF-BC-A). In the experiment, each Modbus message data contains 20 bytes, and the error code of one byte is randomly set in every three messages. The transmission time is calculated for the number of messages. B10 represents 10 messages, B20 represents 20 messages, and so on. B100 represents 100 messages. Communication parameters: 9600: 8: n: 1 (rate 9600 bps, 8-bit data bits, no parity check, 1-bit stop bit). Test under the same environment. The results are shown in Table 5.

The comparison curve based on Table 5 is shown in Figure 14, which intuitively reflects the time overhead of encrypted data transmission. X-axis represents the number of messages to be transmitted, and y-axis represents the time of message transmission.

Following observations are made from Figure 14. 1) In the centralized architecture, when the message is found to have error code (the error code can be judged by the check code in the message), the message needs to be retransmitted, so the transmission time of encrypted data is lower than that of the ordinary blockchain and lightweight blockchain in this paper; 2) On the other hand, in case of the PBFT fault tolerance algorithm, the ordinary blockchain architecture is more efficient than the centralized architecture; 3) whereas, in the F-PBFT fault tolerance algorithm, the LF-BC blockchain architecture has lower data transmission time overhead and the highest efficiency. Both theory and experiment prove that the LF-BC blockchain scheme in this paper has high transmission efficiency in the case of wireless interference.

4.5.   Performance index comparison

This sub-section compares the performance of the three architectures by testing on the vehicle intelligent transportation system, combined with six performance indexes: 1) Data flow, 2) Complexity, 3) Fault tolerance, 4) Security, 5) Reliability, 6) Maintainability. The analysis results are shown in Table 6. The inferences are as follows:

● Compared with the ordinary blockchain architecture, the LF-BC blockchain architecture in this paper has smaller scale, easier implementation and less complexity, but the data flow is obviously larger than the centralized architecture.

● Further due to the addition of Fibonacci transform on the basis of HD, its security and encryption performance are better.

● The above analysis infers that the fault tolerance and reliability of this scheme have significantly improved.

● Τhe scheme of this paper is lightweight blockchain, which has small scale and is easier to maintain.

Based on the above characteristics, the LF-BC blockchain architecture has certain scalability and can be applied to similar industries, such as agricultural food supply chain system, smart grid system, etc.

5.   Conclusions and future work

This paper proposes a lightweight fuzzy decision blockchain LF-BC scheme based on MQTT and Fibonacci. Through this scheme, the major problem of complex and difficult deployment of blockchain is solved. The reliable communication of the blockchain is realized through MQTT, the LF-BC blockchain is formed by HD algorithm and Fibonacci matrix, which enhances both the security and the fault-tolerance rate by F-PBFT consensus algorithm. Moreover, from the realization of the case under consideration and its comparative analysis of the performance demonstrate the feasibility of this scheme and ensures the sustainable safety of the intelligent transportation system.

This blockchain LF-BC scheme is a lightweight scheme, which has not been verified in a large-scale system. It has only been applied in an urban on-board intelligent transportation system, and has certain limitations. It is envisaged in future research to expand the application of blockchain based on the combination of HD algorithm and Fibonacci matrix, which not only can be applied to the blockchain scheme of intelligent transportation system, but also useful in other aspects.

Acknowledgments

This study was supported by the Natural Science Foundation Project of China (61976118), the Natural Science Foundation Project of Jiangsu Province (BK20180142), and the key topics of the "13th five-year plan" for Education Science in Jiangsu Province (B-b /2020/01/18).

Conflict of interest

All authors declare no conflicts of interest in this paper.