An MAHAP Execution Example Sample Clauses

An MAHAP Execution Example. The worst BA problem case occurs when the source node is a malicious faulty node. If the BA problem can be solved in the worst case (the source node is a malicious faulty node), the BA problem can be solved in all other cases if n>3fm+fa. Therefore, in this section, an example of executing MAHAP in the worst case is given. The MANET example is shown in Figure 1. There are nine nodes in the network. The malicious faulty nodes are Nodes s and e. The source node is a malicious faulty node which means that Node s can transmit different values to different nodes. To reach a common agreement value from a fault-free node in our example, the MAHAP needs 3 ((9-1)/3+1) message exchange rounds. In the first round of message-exchange phase, the source node Node s transmits different messages to different nodes in the MANET. Therefore, the fault-free Node a receives the value “0” from the source node in the first message exchange round and stores the received message in the root s of its mg-tree, as shown in Figure 3(a). In the second round of message-exchange phase, Xxxxx b and f move away from the MANET. Fault-free Node a therefore cannot receive the message from Nodes b and f. An mg-tree example by Node a in the second message exchange round is shown in Figure 3(b). In addition, an mg-tree example of Node a in the third round is shown in Figure 3(c). In the decision-making phase, each fault-free node turns its mg-tree into the corresponding ic-tree by deleting the vertices with repeated names to avoid repeated influence from faulty nodes in an ic-tree. An example of an ic-tree by Node a is shown in Figure 3(d). Using the VOTE function in its ic-tree from the t+1 level of the ic-tree to the root s, an agreement value “1” can be obtained. An example using the VOTE function in Node a’s ic-tree from the t+1 level of the ic-tree to root s is shown in Figure 3(e). If there are any return nodes in the MANET, each fault-free node transmits its agreement value to the return nodes. In the extension-agreement phase, each return node receives the other nodes’ agreement values VOTE(s) using the VOTE function on the received messages to obtain the agreement value. Node b returns to the MANET before the decision-making phase. Node b will get the other nodes’ agreement values and using the VOTE function to obtain the final agreement value “1”. Level 1 root s val(s)=0 (a) Node a stores the value received from Node s in the root of its mg-tree at the first round (b) Node a can dete...