From this figure, we observe that among the selected routing protocols, DEEC has the highest rate of CH selection, since the CH selection in DEEC, DDEEC, and EDEEC is totally based on random number and threshold value and this criteria does not guarantee optimum number of CHs.
With a short transmission range, the selected routing neighbor is closer to the sender's transmission range limit and any routing node movement will break the wireless link with the sender.
PATH is the selected routing path.
Section 4 introduces the four selected routing protocols which are implemented with NS-2.
Consequently, the selected routing paths do not lead to optimal end-to-end throughput.
We show that request–request type of deadlocks can be avoided by proper inclusion of virtual channels (VCs) for the links along the selected routing path.
Figure 5a shows the selected routing neighbor at low network density, where a small number of neighboring nodes are within the sender's transmission range, and Figure 5b shows the selected routing neighbor at high network density, where a large number of neighboring nodes are within the sender's transmission range.
The reliability and efficiency of WBAN depend on how the system responds quickly and accurately, to send and receive the data between the nodes, which eventually depends on the selected routing protocols or algorithms.
Particularly, we initially present a dynamic programming approach for the computation of the minimum transportation cost paths when the caching capabilities of the network are independent of the selected routing scheme, as well as an iterative algorithm for those cases where the caching capabilities of the network are strongly coupled to the routing scheme.
