what-when-how
In Depth Tutorials and Information
node B—“banana.” Similarly, when node B does the same process to try to send
an RDM to node A, the RDM from node B must include the keyword of node
A—“apple.” Otherwise, the RDM will be discarded by the receipts. For security
purposes, all the contents in the message except the keywords will be encrypted.
12.2.9 Route Discovery
When a node A wants to establish a link to node B, node A needs to send an
RDM in which it includes two kind of keywords: KInt and KDes. KRDM(A) =
KInt
∪
KDes represents all the keywords in A's RDM. In the RDM, it also has
some special space Af for recording the forwarding link of the RDM in order to
make node B send an ACK message to node A.
For the node who receives the RDM, the major process for the route discovery
is as follows:
◾
Acceptance:
A node u accepts an RDM from its
i-
th neighbor node only if
KAnn(u,i) is the subset of KRDM(A). If the RDM does not correspond to u's
i-th neighbor, this node will simply discard the RDM.
◾
Loop Detection:
In DSL, if a sender sends its message (RDM) to another
node, in this message (RDM), the sender side must design a message ID.
When a node receives the RDM, the message ID will be checked; if it is a
duplicated one, the receiver will drop it.
If an RDM can survive in the loop detection, the receiver node v will do the fol-
lowing three optional processes:
◾
Try to forward the RDM to the next node
◾
Make an acknowledgment to the RDM
◾
Discard the RDM
he receiver node v will first try to forward and acknowledge the RDM. If both of
them do not happen, node v will discard the RDM.
12.3 DestabilizationofTerroristNetworksthrough
Argument-DrivenHypothesisModel[2]
he basic idea for network destabilization is to remove the key path in the network
in order to destabilize the communication between nodes. It utilizes
the following
characteristics of the nodes:
◾
How fast a node propagates the information
◾
he followers of a given node
