RWA-BFT: Reputation-Weighted Asynchronous BFT for Large-Scale IoT

. 2025 Jan 12;25(2):413. doi: 10.3390/s25020413

Algorithm 1. Layer-2: RWABA
Initialization: $When node P_{i}$ $receives the input b_{i n p u t}$ $, set {{e s t}_{0} : = b}_{i n p u t}, d e c i d e d : = f a l s e,$ $r : = 0$ $, {b i n_v a l u e s}_{r} : = \emptyset$ $and {R W e i g h t S u m}_{r}^{d} : = 0$ $, where r = {0, 1, 2, . . .}$ $and d = {0, 1}$ .
1:	${R W e i g h t S u m}_{r}^{{e s t}_{r}} : = {r w}_{i n p u t}$ ;
2:	$broadcast to other nodes {V a l}_{r} ({e s t}_{r}, r w_{i}) = {V a l, r, {e s t}_{r}, r w_{i n p u t}}$
3:	Upon $receiving {V a l}_{r} (v, r w)$ $from P_{j}$ do
4:	${R W e i g h t S u m}_{r}^{v} : = {R W e i g h t S u m}_{r}^{v} + r w$ ;
5:	Upon ${R W e i g h t S u m}_{r}^{v} \geq f + 1$ do
6:	If ${V a l}_{r} (v, r w_{i n p u t})$ has not been sent, then broadcast ${V a l}_{r} (v, r w_{i n p u t})$ .
7:	Upon ${R W e i g h t S u m}_{r}^{v} \geq 2 f + 1$ do
8:	${b i n_v a l u e s}_{r} : = {b i n_v a l u e s}_{r} \cup {v}$ ;
9:	Upon ${b i n_v a l u e s}_{r} \neq \emptyset$ do
10:	$b r o a d c a s t {A U X}_{r} (μ, {r w}_{i n p u t}) = {A U X, r, μ, r w_{i n p u t}}$ $, where μ \in {b i n_v a l u e s}_{r}$
11:	$Wait until the sum of the reputation weights in {A U X}_{r} (μ, *)$ $is greater than or equal to n - f$ $, then set {v a l}_{r}$ $as the set of x$ $in the {A U X}_{r}$ $, resulting in {v a l}_{r} \subseteq {b i n_v a l u e s}_{r}$ .
12:	$s : = H (H (m) \| r)$ ;
13:	if ${v a l}_{r} = {b}$ then
14:	if $b = s % 2$ then
15:	if $d e c i d e d = f a l s e$ then
16:	$reach consensus b$ ;
17:	$d e c i d e d ≔ t r u e$ ;
18:	else:
19:	terminate program;
20:	${e s t}_{r + 1} ≔ b$ ;
21:	else:
22:	${e s t}_{r + 1} ≔ s % 2$ ;
23:	$r ≔ r + 1$ ;
24:	goto line 1;