The objective function in Eq.
16 aims to minimize the EED each time a source node s attempt to send a data to the destination node d. Eq. 17 calculates the over all delay from s to d via p (parent node). is the nodal delay at s and is the delay from p to d. For high-emergency data, where the communication is direct therefore EEDsp = ,we have low EED. However, in the first part of Eq.
17, high delay is experienced and our aim is to minimize it. Eq. 18 describes the nodal delay as addition of queuing delay, processing delay ,channel capture delay and transmission delay . In Eq.19, is defined as the summation of parent node transmission delay ,aggregation delay, reception delay . Constraint 16.1 gives the upper and lower bounds designed for N (size of network in regard to the number of nodes).
If N is very large then more nodes will compete for channel use. This will lead to rise in and eventually rise in EED. To be able to handle this problem, our proposed protocol takes into account suitable amount of nodes which is 8. Constraint 16.2 declares that the amount of packets sent via the transmitter is and ought not surpass the handling capacity of the receiver . Violation of the constraints result to congestion at the side of the receive, making the queue Dqueue dimension to raise.
Also, constraint in Eq.16.3 and 16.4 defines that the packet arrival rate ?arr should not surpass the packet departure rate ?dep at node p and node i. Violation of the equations lead to increased Dqueue . In case the packets are dropped as a result of violation of equations 16.
1, 16.2, 16.3 or 16.
4 then the packets is required to be retransmitted because every single data is crutial in WBSNs. As a result, excess energy is depleted (i.e., network lifetime decreases) and EED rises. To solve this problem, constraint in equation 16.5 stresses on the decrease in packet retransmissions .
Lastly, constraint in Eq. 16.6 limits the bit level errors at any node ni to an satisfactory level nth, else additional erroneous packets result to rise in Dpr