CN116032827B - AODV-based PCN optimal path routing method - Google Patents

Abstract

The invention discloses an AODV-based PCN optimal path routing method, which comprises the following steps: s1, defining a lightning network model, abstracting a lightning network into an undirected graph, and defining attributes of a payment channel; s2, improving an AODV protocol, and establishing a transaction request by an initiator to perform route discovery; s3, constructing a candidate model, and adding a payment channel meeting the requirements to the candidate model after the routing process is completed; s4, selecting an optimal path, and selecting a path with maximum benefit according to the commission, the route hops and the maximum transactable amount. The method improves the message formats of the route request RREQ and the route response RREP, selects the path with the maximum profit for each node based on the rights and interests of each node, and improves the enthusiasm of the nodes to participate in forwarding, thereby improving the payment success rate.

Description

AODV-based PCN optimal path routing method

Technical Field

The invention belongs to the technical field of AODV routing and expansion under a block chain, and particularly relates to an AODV-based PCN optimal path routing method.

Background

To address this difficulty faced by blockchains, blockchain researchers have proposed a number of solutions, one of which is the off-chain transaction payment channel. The core idea of the under-chain solution is to put cumbersome and less important transaction processes in the under-chain payment channel, avoiding frequent inefficient and high commission transactions on the blockchain. To further increase scalability, multiple channels may be connected to form a Payment Channel Network (PCN), a widely used example of which is a lightning network.

In the payment channel network, an active routing protocol is adopted, so that each node needs to search for the next-hop node (the neighbor node directly connected with the channel) in a broadcast mode in order to search for the destination node, thus the node is required to have complete knowledge of the network topology, and a great amount of information needs to be sent in the process of searching for the payment path, so that unnecessary overhead is generated. In addition, the blockchain network can continuously have new nodes added and old nodes withdrawn, channel fund distribution changes and the like, and the topology structure can be changed. In summary, the cost overhead required to establish and maintain routes using active routing protocols is significant, and therefore it becomes critical to use protocols that can accommodate network changes as needed.

In addition, the Payment Channel Network (PCN) is divided into two forms of in-channel payment and cross-channel payment, wherein in-channel payment refers to when two parties of a transaction have a direct channel, and cross-channel payment refers to a payment channel which is not directly connected between the two parties of the transaction, then route searching is needed at this time, a payment path formed by linking a plurality of payment channels is formed through one or more intermediary nodes, and the intermediary nodes assist in completing the transaction and obtain a commission. The main challenge in achieving cross-channel payment is how to find the optimal path to both parties to the transaction through routing. However, in the existing research of payment channel networks, there are few route-related and most of the factors concerned are relatively single, and some important limitations such as channel capacity, timeliness, success rate, etc. are not considered. In addition, the existing route research does not design an optimal route aiming at different node roles in the payment channel network, and does not comprehensively consider multiple factors to select an optimal path.

Disclosure of Invention

The invention aims to overcome the defects and shortcomings of the prior art and provides an AODV-based PCN optimal path routing method.

In order to achieve the above purpose, the present invention adopts the following technical scheme:

An AODV-based PCN optimal path routing method comprises the following steps:

S1, defining a lightning network model, abstracting a lightning network into an undirected graph, and defining attributes of a payment channel;

s2, improving an AODV protocol, and establishing a transaction request by an initiator to perform route discovery;

S3, constructing a candidate model, and adding a payment channel meeting the requirements to the candidate model after the routing process is completed;

S4, selecting an optimal path, and selecting a path with maximum benefit according to the commission, the route hops and the maximum transactable amount.

Compared with the prior art, the invention has the following advantages and beneficial effects:

1. in the method, the route discovery process adopts an AODV protocol, which is an on-demand route (reactive route) protocol, and only establishes a route when needed, thereby avoiding the overhead of sending redundant messages caused by the adoption of an active route protocol by the traditional lightning network; the improved AODV protocol can be well adapted to a dynamically changing blockchain network.

2. The method selects the path with the maximum profit for each node based on the rights and interests of each node, and improves the enthusiasm of the nodes to participate in forwarding, thereby improving the payment success rate.

3. The method considers the capacity problem of each channel, divides the transaction amount according to the node wish of each path, and selects different guarantees the mobility in the PCN.

Drawings

FIG. 1 is a flow chart of the method of the present invention;

Fig. 2 is a process for route discovery in a PCN using improved AODV.

Detailed Description

The present invention will be described in further detail with reference to examples and drawings, but embodiments of the present invention are not limited thereto.

Examples

As shown in fig. 1, the present invention provides an AODV-based PCN optimal path routing method, which includes the following steps:

S1, defining a lightning network model, abstracting a lightning network into an undirected graph, and defining attributes of a payment channel; the method comprises the following steps:

Abstracting the lightning network into an undirected graph g= (V, E), wherein V is a set of all nodes and E is a set of payment channels between nodes;

for each participating node V _/i e V, representing a user with a blockchain account and at least establishing an under-chain payment channel with one participant node;

For each edge e= (v _i,v_j) ∈e, representing the payment channel established between v _i and v _j, where v _i is the sender and v _j is the receiver;

each payment channel e= (v _i,v_j) has the following 4 attributes:

Transaction amount T _i(v_i,v_j), representing the amount that sender v _i wants to pay to receiver v _j, the transaction amount for the same payment path should be equal;

a commission f _i(T_i(v_i,v_j)) indicating that the sender v _i needs to pay the receiver v _j at the time of the transaction of T _i(v_i,v_j), v _j and intermediate transaction nodes following the path may obtain the commission by helping to forward the transaction;

Channel balance B _i(v_i,v_j), representing the balance of node v _i in channel e= (v _i,v_j), for guaranteeing the mobility of the channel, for node v _i its channel balance B _i(v_i,v_j), transaction amount T _i(v_i,v_j) and the fee f _i(T_i(v_i,v_j) to be paid to node v _j) need to satisfy:

B_i(v_i,v_j)≥T_i(v_i,v_j)+f_i(T_i(v_i,v_j)) (1)

Otherwise, the construction of the transaction path is not participated, namely the candidate model is not added;

Tolerance time T _i(Ti(v_i,v_j)), meaning that node v _i can wait for v _j to reveal the longest time of the key when the transaction of T _i(v_i,v_j) is performed, and when the waiting time exceeds the tolerance time, the funds roll back and the transaction fails; for nodes on the same path, the tolerance time is decremented in sequence by the transaction initiator.

S2, improving an AODV protocol, and establishing a transaction request by an initiator to perform route discovery; the improvements of the AODV protocol include improvements to the route request RREQ and route response RREP, specifically:

The improved RREQ message format is specifically as follows:

RREQ＝＜ID,S_ad,D_ad,P_sn,S_sn,D_sn,d_rreq,d_route,a＞

Wherein, the ID is a unique identification RREQ together with S _ad; s _ad,S_sn, the address of the transaction initiator node and the corresponding serial number; p _sn, forwarding the sequence number of the last hop node of the RREQ message, and setting P _sn as the current node after each node; d _ad,D_sn, the address and the latest sequence number of the target receiver node; d _rreq, the effective time of the RREQ message exceeds the effective time, no feedback signal is received, and the last hop node retransmits; d _route, the effective time of the reverse route, and the update of each node to d _route is gradually decreased; a is the transaction demand amount.

The improved RREP message format is specifically as follows:

RREP＝＜ID,S_ad,S_sn,P_sn,D_ad,D_sn,d_rrep,d_route,fee,T_max,hop＞

Wherein, the ID is a common unique identification RREP with S _ad; s _ad,S_sn, corresponding to the address and the serial number of the target receiving node; p _sn, forwarding the sequence number of the last hop node of the RREP message, and setting P _sn as the current node after each node; d _ad,D_sn, corresponding to the address and serial number of the transaction initiator node; d _rrep, the effective time of the RREP message exceeds the effective time, no feedback signal is received, and the last hop node retransmits; d _route, the effective time of forward route, the update of d _route by each node is gradually increased; fee is taken as an intermediate node, and the transaction initiating node is charged with the commission fee, so that a commission fee collection fee is formed; t _max is the maximum amount willing to be forwarded in the path, namely the willing amount, which is determined by the node according to the demand amount a and the balance of the node in the path, and T _max is set as the minimum value in the willing amount sequence of the passing node, namely the willing amount T _max needs to be updated to be T _max＝min(T_max_new,T_max _old when passing through one node; and for each node v _i its willingness amount T _max and the commission f _i(T_i(v_i,v_j to be paid to v _j) should not exceed the channel balance B _i(v_i,v_j), i.e. T _max+f_i(T_i(v_i,v_j))≤B_i(v_i,v_j); hop, starting from the target node, is increased by one every time a node passes.

As shown in fig. 2, in step S2, performing route discovery specifically includes:

S21, determining a transaction demand amount a and a transaction receiver v _d by a transaction initiator v _s, and creating a payment request R= (v _s,v_d, a, t), wherein t is the maximum route discovery tolerance time, namely the maximum time consumption of a routing process acceptable by the transaction initiator v _s;

S22, when the initiator determines v _s transaction demand amount a and a receiver v _d, and creates an immediate payment request R= (v _s,v_d, a, t), and then checks the routing table to find that no route entry to v _d exists, broadcasting a routing request RREQ, and searching a routing path capable of reaching a destination node;

the improved AODV protocol does not work if there is an active route between the initiator v _s and the recipient v _d to each other;

S23, judging whether the RREQ is received by the intermediate node or not according to the ID and S _ad, if yes, discarding the RREQ message, and if no, performing the following operations:

s24, judging whether the destination node is self, if so, directly sending a route response RREP, and if not, carrying out the following operations:

S25, checking whether a valid route to a destination node exists and whether a channel has a sufficient balance; if the route table records the effective route to the destination node and the funds are sufficient, the following steps are performed:

S26, comparing S _sn in the RREQ with the serial number of the table item of which the destination node address is S _ad in the routing table, and updating the routing table to the maximum value of the two;

s27, establishing a reverse route;

S28, sending a route response RREP;

s29, updating the RREQ, and forwarding the RREQ to continuously search for the destination node;

S210, judging whether the RREP is received by the intermediate node or not according to the ID and S _ad, if yes, discarding the RREP message, and if not, performing the following operations:

S211, judging whether the destination node is self, if so, selecting a demand path according to the T _max, the commission and the route hop count; if not, continuing the following operations:

S212, checking whether an effective route to a destination node exists and whether a channel has enough balance, if the effective route exists in a routing table and the channel funds are sufficient, directly sending an RREP to a transaction initiator node, and if the route is terminated, otherwise, continuing the following operations:

S213, establishing a forward route;

S214, updating the RREP, and forwarding the RREP to continuously search for the transaction initiator node.

In step S214, the node has the option to autonomously decide whether to continue forwarding the RREP and participate in route establishment.

S3, constructing a candidate model, and adding a payment channel meeting the requirements to the candidate model after the routing process is completed; the method comprises the following steps:

After the routing process in step S2 is completed, a payment channel network composed of N paths, p1, p2, and pN are formed, and it is verified whether the payment channel involved in each path satisfies formula (1), and if the path does not satisfy formula (1), the path does not participate in the construction of the candidate model, and the path satisfying formula (1) is added into the candidate model.

For example, for node v _i, if its balance B _i(v_i,v_j on the path (v _i,v_j) is less than the sum of the maximum willingness amount T _max and the commission f _i(T_i(v_i,v_j) of the path, i.e., B _i(v_i,v_j)＜T_max+f_i(T_i(v_i,v_j), then the path on which it is located (v _i,v_j) and all payment paths after the path to which it belongs are not added to the candidate model.

The step S3 specifically comprises the following steps:

S31, of the N paths routed from v _s to v _d, one path sequence p1 associated with the payment request R is expressed as:

v₀→v₁→v₂→...→v_n-1→v_n

Wherein v ₀ is the payment initiator v _s,v_n is the target receiver v _d, and the corresponding payment channel obtained by the path sequence is:

(v₀,v₁),(v₁,v₂),...,(v_n-1,v_n)

s32, regarding the paths selected into the candidate model, consider the network equalization problem:

assuming that the kth path transaction amount is T _pk(v_s,v_d), the channel needs to satisfy the transaction demand amount a in order to ensure balance of the payment channel network:

s33, the total amount P actually required to be paid by a payment initiator is required to satisfy the following conditions:

S34, in the path p1 in the candidate model, there is v ₁,v₂,...,v_n-1 at the node that needs to collect the commission, so the commission that the payment initiator v _s needs to pay additionally in the path p1 is:

S35, obtaining the total transaction fee F _P(v_s,v_d) required to be paid by the transaction initiator v _s corresponding to the transaction request R according to the transaction fee required to be paid by the path p 1:

S4, selecting an optimal path, and selecting a path with maximum benefit according to the commission, the route hops and the maximum transactable amount; the method comprises the following steps:

S41, the initiating node corresponding to each transaction receives N RREP from different candidate route paths, and performs optimal multipath selection according to fee, hop and T _max in the RREP;

S42, summing the handling fee sets fee required by each candidate path to obtain F _p1,F_p2,...,F_pN respectively, wherein the handling fee required by each path is represented; the corresponding route hop count and the maximum amount of tradable money of each candidate path are H _p1,H_p2,...,H_pN and T _p1,T_p2,...,T_pN respectively;

S43, on the basis of S42, defining an attribute tuple P1 to represent the maximum transactable amount corresponding to each path, the commission and the route hop count:

P1＝(T_p1,F_p1,H_p1),P2＝(T_p2,F_p2,H_p2),...,PN＝(T_pN,F_pN,H_pN)

S44, starting from the maximum tradable amount, selecting path combinations which accord with the following linear inequality from all candidate paths:

∑T_pi≥a (2)

The solution of the linear inequality is noted as:

S＝{i∈N⁺|C_i＝C_i1p1+C_i2p2+...+C_iNpN}

Wherein, C _ij = 0 or 1, j= {1,2,., N }, when C _ij = 1 indicates that the candidate path conforms to formula (2), jointly forming a solution of formula (2), and participating in the construction of the target model; when C _ij =0 indicates that the candidate path is not selected for the construction of the target model, there is a proper subset of the solution S of the linear inequality between the automatic filtering combinations, for example, if:

C_i＝P_a+P_b+P_c

C_j＝P_a+P_b+P_c+P_d＝C_i+P_d

At this point, C _j has the proper subset C _i, then C _j is automatically culled, and so on.

That is, if C _m,C_n ε S is present, the formula is satisfied:

C_m＝∑pi+C_n

Then, C _m is put into set S, as will be apparent Finally, the solution of equation (2) should be/>。

S45, assuming that n combinations of the n combinations satisfying the requirement of S44 are found, that is, after the final solution of the linear inequality (2) is calculated, these combinations are denoted as C1, C2, cn, that is:

P₁₁,P₁₂,...,P_1k；

P₂₁,P₂₂,...,P_2l；

......

P_n1,P_n2,...,P_nm

S46, calculating the total commission Ci.F and the maximum route hop count Ci.H of each combination, wherein the total commission Ci.F and the maximum route hop count Ci.H are respectively as follows:

C₁.F,C₂.F,...,C_n.F；

C₁.H,C₂.H,...,C_n.H

Two weight coefficients w ₁,w₂ are adopted to assist in evaluating the total commission and the maximum route hop count of each path combination, and then the corresponding cost of each path combination is:

cost＝w₁*C_i.F+w₂*C_i.H (3)

wherein the relationship between w ₁,w₂ satisfies w ₁+w₂ =1.

In this embodiment, assuming that the nodes participating in the candidate model construction are honest, do not easily regret about the participating transactions, and assuming that the transaction time intervals of the neighboring payment channels are fixed, then:

after collecting and calculating forwarding willingness and handling fees of each intermediate node of each path, the initiator selects a path combination with the minimum cost according to a path cost result formula (3) and own requirements:

The path combination with the least required procedure cost, namely the path combination with the least cost corresponding to w ₁＝1,w₂ = 0, can be selected; or the shortest path combination with the least route hops, namely the corresponding minimum cost path combination when w ₁＝0,w₂ =1;

Or both, selecting a path with a compromise between the commission and the routing length, namely, a corresponding minimum cost path combination when w ₁＝0.5,w₂ =0.5;

similarly, the weight distribution coefficient can be adjusted according to the self demand, and the path combination cost is calculated, so that the optimal payment path combination with the greatest benefit is selected.

It should also be noted that in this specification, terms such as "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (3)

1. An AODV-based PCN optimal path routing method is characterized by comprising the following steps:

S1, defining a lightning network model, abstracting a lightning network into an undirected graph, and defining attributes of a payment channel; the step S1 specifically comprises the following steps:

Abstracting the lightning network into an undirected graph g= (V, E), wherein V is a set of all nodes and E is a set of payment channels between nodes;

for each participating node V _/i e V, representing a user with a blockchain account and at least establishing an under-chain payment channel with one participant node;

For each edge e= (v _i,v_j) ∈e, representing the payment channel established between v _i and v _j, where v _i is the sender and v _j is the receiver;

each payment channel e= (v _i,v_j) has the following 4 attributes:

Transaction amount T _i(v_i,v_j), representing the amount that sender v _i wants to pay to receiver v _j, the transaction amount for the same payment path is equal;

a commission f _i(T_i(v_i,v_j)) indicating that the sender v _i needs to pay the receiver v _j at the time of the transaction of T _i(v_i,v_j), v _j and intermediate transaction nodes following the path may obtain the commission by helping to forward the transaction;

Channel balance B _i(v_i,v_j), representing the balance of node v _i in channel e= (v _i,v_j), for guaranteeing the mobility of the channel, for node v _i its channel balance B _i(v_i,v_j), transaction amount T _i(v_i,v_j) and the fee f _i(T_i(v_i,v_j) to be paid to node v _j) need to satisfy:

B_i(v_i,v_j)≥T_i(v_i,v_j)+f_i(T_i(v_i,v_j)) (1)

Otherwise, the construction of the transaction path is not participated, namely the candidate model is not added;

Tolerance time T _i(Ti(v_i,v_j)), meaning that node v _i can wait for v _j to reveal the longest time of the key when the transaction of T _i(v_i,v_j) is performed, and when the waiting time exceeds the tolerance time, the funds roll back and the transaction fails; for the nodes on the same path, the tolerance time is gradually decreased from the transaction initiator;

s2, improving an AODV protocol, and establishing a transaction request by an initiator to perform route discovery; the modified AODV protocol includes modifications to the route request RREQ and route response RREP, specifically:

The improved RREQ message format is specifically as follows:

RREQ＝＜ID,S_ad,D_ad,P_sn,S_sn,D_sn,d_rreq,d_route,a＞

Wherein, the ID is a unique identification RREQ together with S _ad; s _ad,S_sn, the address of the transaction initiator node and the corresponding serial number; p _sn, forwarding the sequence number of the last hop node of the RREQ message, and setting P _sn as the current node after each node; d _ad,D_sn, the address and the latest sequence number of the target receiver node; d _rreq, the effective time of the RREQ message exceeds the effective time, no feedback signal is received, and the last hop node retransmits; d _route, the effective time of the reverse route, and the update of each node to d _route is gradually decreased; a is transaction demand amount;

the improved RREP message format is specifically as follows:

RREP＝＜ID,S_ad,S_sn,P_sn,D_ad,D_sn,d_rrep,d_route,fee,T_max,hop＞

Wherein, the ID is a common unique identification RREP with S _ad; s _ad,S_sn, corresponding to the address and the serial number of the target receiving node; p _sn, forwarding the sequence number of the last hop node of the RREP message, and setting P _sn as the current node after each node; d _ad,D_sn, corresponding to the address and serial number of the transaction initiator node; d _rrep, the effective time of the RREP message exceeds the effective time, no feedback signal is received, and the last hop node retransmits; d _route, the effective time of forward route, the update of d _route by each node is gradually increased; fee is taken as an intermediate node, and the transaction initiating node is charged with the commission fee, so that a commission fee collection fee is formed; t _max is the maximum amount willing to be forwarded in the path, namely the willing amount, determined by the node according to the demand amount a and the balance of the node in the path, T _max is set as the minimum value in the willing amount sequence of the passing node, namely the willing amount T _max needs to be updated to be T _max＝min(T_max_new,T_max _old when passing through one node; and for each node v _i its willingness amount T _max and the commission f _i(T_i(v_i,v_j to be paid to v _j) does not exceed the channel balance B _i(v_i,v_j), i.e. T _max+f_i(T_i(v_i,v_j))≤B_i(v_i,v_j); hop, starting from a target node, adding 1 to hop count per node;

in step S2, the route discovery specifically includes:

S21, determining a transaction demand amount a and a transaction receiver v _d by a transaction initiator v _s, and creating a payment request R= (v _s,v_d, a, t), wherein t is the maximum route discovery tolerance time, namely the maximum time consumption of a routing process acceptable by the transaction initiator v _s;

S22, when the initiator determines v _s transaction demand amount a and a receiver v _d, and creates an immediate payment request R= (v _s,v_d, a, t), and then checks the routing table to find that no route entry to v _d exists, broadcasting a routing request RREQ, and searching a routing path capable of reaching a destination node;

the improved AODV protocol does not work if there is an active route between the initiator v _s and the recipient v _d to each other;

S23, judging whether the RREQ is received by the intermediate node or not according to the ID and S _ad, if yes, discarding the RREQ message, and if no, performing the following operations:

s24, judging whether the destination node is self, if so, directly sending a route response RREP, and if not, carrying out the following operations:

S25, checking whether a valid route to a destination node exists and whether a channel has a sufficient balance; if the route table records the effective route to the destination node and the funds are sufficient, the following steps are performed:

S26, comparing S _sn in the RREQ with the serial number of the table item of which the destination node address is S _ad in the routing table, and updating the routing table to the maximum value of the two;

s27, establishing a reverse route;

S28, sending a route response RREP;

s29, updating the RREQ, and forwarding the RREQ to continuously search for the destination node;

S210, judging whether the RREP is received by the intermediate node or not according to the ID and S _ad, if yes, discarding the RREP message, and if not, performing the following operations:

S211, judging whether the target node is self, if so, selecting a demand path according to the T _max, the commission and the route hop count; if not, continuing the following operations:

S212, checking whether an effective route to a destination node exists and whether a channel has enough balance, if the effective route exists in a routing table and the channel funds are sufficient, directly sending an RREP to a transaction initiator node, and if the route is terminated, otherwise, continuing the following operations:

S213, establishing a forward route;

S214, updating the RREP, and forwarding the RREP to continuously find a transaction initiator node;

S3, constructing a candidate model, and adding a payment channel meeting the requirements to the candidate model after the routing process is completed; after the routing process of step S2 is completed, a payment channel network composed of N paths, p1, p2, and pN are formed, and verifying whether the payment channel involved in each path satisfies the formula (1), and if the path does not satisfy the formula (1), the path does not participate in the construction of the candidate model, and the path satisfying the formula (1) is added into the candidate model;

Step S3 further includes:

S31, of the N paths routed from v _s to v _d, one path sequence p1 associated with the payment request R is expressed as:

v₀→v₁→v₂→...→v_n-1→v_n

Wherein v ₀ is the payment initiator v _s,v_n is the target receiver v _d, and the corresponding payment channel obtained by the path sequence is:

(v₀,v₁),(v₁,v₂),...,(v_n-1,v_n)

s32, regarding the paths selected into the candidate model, consider the network equalization problem:

assuming that the kth path transaction amount is T _pk(v_s,v_d), the channel needs to satisfy the transaction demand amount a in order to ensure balance of the payment channel network:

s33, the total amount P actually required to be paid by a payment initiator is required to satisfy the following conditions:

S34, in the path p1 in the candidate model, there is v ₁,v₂,...,v_n-1 at the node that needs to collect the commission, so the commission that the payment initiator v _s needs to pay additionally in the path p1 is:

S35, obtaining the total transaction fee F _P(v_s,v_d) required to be paid by the transaction initiator v _s corresponding to the transaction request R according to the transaction fee required to be paid by the path p 1:

S4, selecting an optimal path, and selecting a path with maximum benefit according to the commission, the route hops and the maximum transactable amount; the step S4 specifically comprises the following steps:

S41, the initiating node corresponding to each transaction receives N RREP from different candidate route paths, and performs optimal multipath selection according to fee, hop and T _max in the RREP;

S42, summing the handling fee sets fee required by each candidate path to obtain F _p1,F_p2,...,F_pN respectively, wherein the handling fee required by each path is represented; the corresponding route hop count and the maximum amount of tradable money of each candidate path are H _p1,H_p2,...,H_pN and T _p1,T_p2,...,T_pN respectively;

S43, on the basis of S42, defining an attribute tuple P1 to represent the maximum transactable amount corresponding to each path, the commission and the route hop count:

P1＝(T_p1,F_p1,H_p1),P2＝(T_p2,F_p2,H_p2),...,PN＝(T_pN,F_pN,H_pN)

s44, starting from the maximum transactable amount, selecting path combinations conforming to the formula (2) from all candidate paths:

∑T_pi≥a (2)

The solution of the linear inequality is noted as:

S＝{i∈N⁺|C_i＝C_i1p1+C_i2p2+...+C_iNpN}

Wherein, C _ij = 0 or 1, j= {1,2,., N }, when C _ij = 1 indicates that the candidate path conforms to formula (2), jointly forming a solution of formula (2), and participating in the construction of the target model; when C _ij = 0 indicates that the candidate path is not selected into the construction of the target model, the solution S of the linear inequality automatically filters the situation that there is a proper subset between the combinations; that is, if C _m,C_n ε S is present, the formula is satisfied:

C_m＝∑pi+C_n

then put C _m into the collection In (1)/>, get the collectionFinally, the solution of equation (2) should be/>

S45, assuming that n combinations of the n combinations satisfying the requirement of S44 are found, that is, after the final solution of the linear inequality (2) is calculated, since the number of each combination path is an indefinite term, these combinations are denoted as C ₁,C₂,...,C_n, that is:

S46, calculating the total commission Ci.F and the maximum route hop count Ci.H of each combination, wherein the total commission Ci.F and the maximum route hop count Ci.H are respectively as follows:

C₁.F,C₂.F,...,C_n.F；

C₁.H,C₂.H,...,C_n.H

Two weight coefficients w ₁,w₂ are adopted to assist in evaluating the total commission and the maximum route hop count of each path combination, and then the corresponding cost of each path combination is:

cost＝w₁*C_i.F+w₂*C_i.H (3)

Wherein w ₁,w₂ satisfies w ₁+w₂ =1.

2. The method of claim 1, wherein in step S214, the node has the option to autonomously decide whether to continue forwarding the RREP and participate in route establishment.

3. The method of claim 1, wherein assuming that nodes participating in candidate model construction are honest, do not readily agree to participating transactions, and assuming that transaction time intervals of neighboring payment channels are fixed, there are:

after collecting and calculating forwarding willingness and handling fees of each intermediate node of each path, the initiator selects a path combination with the minimum cost according to a path cost result formula (3) and own requirements:

selecting a path combination with the minimum required procedure cost, namely a corresponding path combination with the minimum cost when w ₁＝1,w₂ = 0; or the shortest path combination with the least route hops, namely the corresponding minimum cost path combination when w ₁＝0,w₂ =1;

Or both, selecting a path with a compromise between the commission and the routing length, namely, a corresponding minimum cost path combination when w ₁＝0.5,w₂ =0.5;

And similarly, adjusting the weight distribution coefficient according to the self demand, and calculating the path combination cost so as to select the optimal payment path combination with maximum benefit.