# Energy Harvested and Cooperative Enabled Efficient Routing Protocol (EHCRP) for IoT-WBAN
## 1 Introduction
In this solution, the data packets are divided into two types (normal and emergency). The path cost estimation function is used to calculate the cost of normal packets based on signal-to-noise ratio (SNR), total energy (TE), hop-count (HC), distance (d) from the central node coordinator (CNC) and node congestion level (NCL). The PCE technique balances the use of SN resources which increases the overall network performance. The second type of data packets (emergency data or life life-threatening data) is labeled as priority label. Each node in the network schedules data transmissions based on the priority label. Highest priority label packets are selected first for transmission. This is clearly depicted in the flowchart of the proposed scheme and also in Algorithm 1, 2 and 3. The presented technique includes:  
1. Link efficiency network model is presented which calculates the capability of the forwarder node in terms of its ability to send the received/sensed data. Link efficiency is based on four link quality parameters which are link quality indicator (LQI), packet reception ratio (PRR), SNR and received signal strength indicator (RSSI). 2. The proposed protocol selects the forwarder node by calculating its PCE function derived from energy aware link efficiency of the selected node compared to non-selected ones. 3. Supportive efforts communication has been used in which duplicated data is being discarded in successive transmission and not sent to CNC. In the proposed protocol the SN checks the sensed data for possible redundancy. If the sensed data (not in the case of critical situations) is similar to the prior sensed data, it is discarded otherwise it forwards the data to the sink. This research work is organized as follows: related research and literature is briefly reviewed in Section 2. The IoT-based WBAN along with energy harvesting is elaborated in Section 3, Section 4, elaborates the system model. The proposed system architecture is explained in Section 5. Section 6 gives details of decision-based cooperative-efforts. Section 7 explains the operational phase of the proposed protocol. Section 8 portrays evaluation and simulation, results and analysis with required figures and Section 9, presents the conclusions and suggestions for future work of this study. ```
Notation: 1. \(\mathrm{HP}=\mathrm{Hello}\) Packet
2. T.E = Total Energy
3. L.E = Link Efficiency
4. H.C = Number of hop-count between sink node (CNC) and leaf node (BSN)
5. d = distance between SN to the sink CNC
6. D = distance between leaf nodes
7. (NT) = information included in Neighbor Table
8. (HP) = information included in Hello Packet
9. Hello Packets from neighboring nodes 'i' and 'j'
10. Start
11. For each HP do
11. If HP (TE\({}_{i}\), LE\({}_{ij}\), HC\({}_{i,\mathrm{CNC}}\), d\({}_{i,j}\)) = NT (TE\({}_{i}\), LE\({}_{i,\mathrm{j}}\), HC\({}_{i,\mathrm{CNC}}\), d\({}_{i,j}\)) Packet record in neighbor table for neighbor information
12. E\({}_{i}\) (NT) \(\longleftarrow\)  TE (HP)
13. LE\({}_{ij}\) (NT) \(\longleftarrow\)  LE\({}_{i,j}\) (HP)
14. d\({}_{i,j}\) (NT) \(\longleftarrow\)  d\({}_{i,j}\) (HP)
15. hc\({}_{i,\mathrm{CNC}}\) (NT) \(\longleftarrow\)  HC\({}_{i,\mathrm{CNC}}\) (HP)
16. Else
17. Discard HP
18. If HP (TE\({}_{i}\), LE\({}_{i,j}\), HC\({}_{i,\mathrm{CNC}}\), d\({}_{i,j}\)) = null then Addrecord in neighbor table //new neighbor entry
19. TE\({}_{j}\) (NT) \(\longleftarrow\)  TE\({}_{j}\) (HP)
20. LE\({}_{i,j}\) (NT) \(\longleftarrow\)  LE\({}_{j}\) (HP)
21. d\({}_{i,j}\) (NT) \(\longleftarrow\)  d\({}_{i,j}\) (HP)
22. HC\({}_{i,\mathrm{CNC}}\) (NT) \(\longleftarrow\)  HC\({}_{i,\mathrm{CNC}}\) (HP)
23. else go to line-10
24. end if
25. end if
26. end for
27. End
```  
**Algorithm 1**Data sensing and Topology discovery phase
```
**Notation:**

1. \(\text{N}_{\text{i}}\) = Source Node
2. \(\text{NH}_{\text{i}}\) = Next Hop for node \(\text{N}_{\text{i}}\)
3. \(\text{CCN}\) = Central Coordinator Node
4. \(\text{NT}\) = Neighbor Table
5. \(\text{SNR}\) = Single to Noise Ratio between nodes
6.