The specific algorithm is as follows: When node a and node b
meet, node a is the request node, and bid M is sent to node b
to purchase the forwarding service.
For example, in Figure 8, as one candidate of node B
's next-hops, node A lies about its location and associates with disguisers ([H.sub.4]-[H.sub.7]) as its colluders.
where local-area is the set of node b
's potential neighbor nodes in its transmission range, and [k.sub.max] is a predefined default upper bound of node's degree, q is the number of nodes which already have the degree of [k.sub.max], and f(E) is the function mentioned in the EAEM model.
As node B's available buffer space is much smaller than that of node A, it is assigned a larger virtual rate [R.sub.VQ](B) = [C.sub.A]/[C.sub.B] consequently based on the virtual rate assigning method described earlier.
Assume node D is also an intermediate node on the way to a packet's destination and has a much larger cache space than node B. As a result, [R.sub.VQ](B) will be larger than [R.sub.VQ](D).
As each chunk is sent and verified, Node A receives onFileChunkSent() and Node B receives onFileChunkReceived().
This signals that it would like to send a file to Node B.
Node b is the bottleneck node of tree T if it satisfies:
Node b is the bottleneck node of tree T by Definition 1, Node s is the sub-bottleneck node of tree T if it satisfies:
In ODAM algorithm, node B
and node C are two relay nodes in different directions of node A, but the forward of node B
inhibits the forwarding of node C, and result in sending interruption from node A to node D.
4, to isolate node C on the path from the network, the malicious node B
reports to the source node S falsely as node C did not deliver data sent to the destination node D by node S, although node C normally delivers the data.
In this topology, repair node B
has a shortest TTL distance (in this example, it is equal to 0).