A Cooperative Routing Algorithm to Increase QoS in Wireless E-Healthcare Systems - E-Healthcare Systems and Wireless Communications - page 386

composed of seven nodes where node 1 sends a
packet to node 7 and node 5 is mobile in time. In
this case, we have evaluated also the performance
of the routing algorithms for different values of
Hello sending intervals (between 0.3 and 1.3 sec).
As shown in Figure 5, the reliability improves with
the reducing of the HELLO intervals, as expected.
Moreover, QBAR has a better performance than
AODV due to the static behavior of AODV. Indeed,
AODV changes the path only when the moving
node becomes unconnected to the network.

Finally, Figure 6 shows the scalability perfor-
mance, drawing the reliability as a function of the
number of transmitting nodes. In this case too,
the QBAR scalability is better than that of AODV.

Presence of Mobile Patients

Finally, scenarios with random mobile patient
nodes sending packets to node 7 are considered.
In particular, in Figure 7, a sketch of the evolving
network topology in time is shown.

Figure 5. Reliability: QBAR algorithm (solid line); AODV algorithm (dotted line)

Figure 6. Reliability under a number of node variations: QBAR algorithm (solid line); AODV algorithm
(dotted line)