Page 40 - 2024-Vol20-Issue2

36 |
dispensed among ? classes. Now, suppose ni are the nodes in
class i where i = 1 to N. The value of N is assumed to be 4 for
easier simulation; so, the simulation nodes are (n1, n2, n3, n4). different circumstance.
All nodes have an energy constraint (Ei), and a lifetime ex-
pectation (Li). Each node has a constraint of average power
which is ?i = Ei/Li. It’s assumed that ?1 > ?2 > ?3 > ?4.
Since the system is operated in discrete time so, in every slot,
any node of the N nodes (except n1) could be picked as a
source with the same probability where n1 is considered as a
relay node for testing and analyze its behaviour in different
networking circumstances using Taguchi DoE. Each source
needs several relays to reach the destination and the relays
max number is (M). For the sake of simplicity, at least one re-
lay in each session has been assumed. The source demands the
relay node to deliver its traffic toward the destination and the
relay node could accept or deny the request. The relay node
transmits its ruling to the source by sending either a negative
or a positive acknowledgment. The traffic session blocked on
negative acknowledgment. Positive and negative acknowledg-
ments may be sent depending on power constraints. Because
the node tested using Taguchi DoE under different conditions
of power constrains. 0.0005 assumed as a constant value of
energy needed for sending a packet.
For a relay node n1(n), denote by Bn the number of relayed
requested packets made by node n, and by An the number of
relays requested packets accepted by node n. Dn the relay
requests number that has been made toward node n, and by
Cn the relay requests number that has been accepted to node
n. It’s defined in (7) [1]:
Fn = An and ?n = Cn (7)
Bn Dn
Watch that ?n is the ratio of the relay requests number by n
which had been accepted, to the requests number that had
been made by n; thus, Fn is one of the throughput indications
which experienced by n.
In the proposed GTFT algorithm, each node preserves an expe-
rience record for its behaviour depending on the two variables
Fn and ?n. Therefore, each node only keeps information
for each session kind and does not keep individual logs of
its experience with each node inside the network. The relay
node always makes decisions based on its values of Fn and
?n. Assume that the n relay node receives a request to be
relayed. Suppose that e is a small number representing the
degree of generosity and that tn is the probable probability of
accepting a request as far as a node in class i fetch a request.
GTFT algorithm is as below:
If ?n > tn or Fn < ?n - e Reject
Else Accept
The simulation details are summarized in algorithm 1. It
should be mentioned that the algorithm is repeated 9 times
Jumaa, Mohamad, Allawy & Mohammed
(once for a Taguchi experiments) i.e., each Taguchi experi-
ment is an ad-hoc session for testing the relay node with a
Algorithm (1)
Step1: let nodei ? Classi where i=1, 2, 3. . . k
Step2: Let k=4
Step3: Let Energy and Lifetime of all nodes are Ei and Li
respectively.
Step4: Average power of nodei is ?i = Ei/Li.
Step5: Let ?1 >?2 > ?3 > ?4
Step6: Let n1 is the relay node.
Step7: Let Bn is number of relayed requested packets made by
node n.
Step8: Let An the relay requested packets number that ac-
cepted by node n.
Step9: Let Dn the relay requests number that made to node n.
Step10: Let Cn the relay requests number that accepted to
node n.
Step11: Fn = An/Bn , and ?n = Cn/Dn
Step12: Suppose e is a tiny +ve number which presents the
grade of generosity and tn
Step13: If ?n >tn or Fn < ?n - e Reject , Else Accept
VI. TAGUCHI METHOD BASED GTFT NODE
BEHAVIOUR OPTIMIZATION
The proposed system demonstrates the Taguchi method for
studying the effect on GTFT node behaviour; there are four
factors (parameters). Then use the Taguchi method to infer
which factor will influence the node’s cooperative behaviour
depending on throughput, ?, and ?; these are the measure-
ments calculated from the Taguchi method. Where:
• Throughput is the number of forwarded packets per
time slot.
• ? is the (amount of the requested packets that relayed
and created by the node) per (requested packets number
that had been accepted by a node from the relays).
• ? is the (amount of relay request that has been accepted
to the node) per (number of relay request that has been
made to the node).
The analysis is based on dependent factors. These factors are:
• Power constraints of the node.
• Several received packets by a specific node that need to
be forwarded to the next node.
• Power consumption per a packet
• Grade of generosity.