## 3 Proposed Techniques
### Initial Phase
#### 3.1.2 Independent Nodes (INs)
```  NHN next hop node (N) to the CH  RT routing table \(N_{D\text{-}CH}\) indicates the N distance to the CH \(N_{D\text{-}N1}\) indicates the minimum distance in the RT for NHN within the level 1  
Figure 6: The Time- Division Multiple Access (TDMA) schedule of (**a**) N; (**b**) CH; and (**c**) IN. * Inter-clusters Routing  
This group includes all the CHs and INs of the network, which are distributed along the levels around the BS. Thus, the CHs and INs of the first level do not need to create RTs. Additionally, they can forward their data to the BS directly. On the other hand, the CHs and INs that are on the second level or more have to establish their RTs. Based on their RTs, the CHs and INs can determine the next hops to the BS. Clearly, the CH's and the IN's data will be transmitted to the minimum distance destination, which could be to the BS or one member of RT. The details of the inter-cluster routing processes for the CH and the IN are giving by the pseudo-code in Algorithm 3 and Algorithm 4 respectively. ```
1:begin
2:if (\(N_{D\_CH}>=d_{o}/2\)) then
3: Create its RT;
4:if (\(N_{D\_CH}<=N_{D\_N1}\)) then
5: Transmit the data directly to the CH using \(N_{D\_CH}\);
6:else
7: Transmit the data to the NHN in the level 1 having the minimum distance (\(N_{D\_N1}\));
8:endif
9:else
10: Transmit the data directly to the CH using \(N_{D\_CH}\);
11:endif
```  
**Algorithm 3** The inter-cluster routing for CH  
```
1:NFI
2:next hop node to the BS, which might be a CH or IN
3:\(CH_{D\_BS}\) indicates the CH distance to the BS
4:\(CH_{D\_L1}\) indicates the minimum distance in the RT for NHI within the level 1
5:\(CH_{D\_Ln}\) indicates the minimum distance in the RT for NHI within the level n
6:begin
7:if (\(CH_{D\_BS}>=d_{o}/2\)) then
8: Create its RT;
9:if (\(CH_{D\_BS}>=d_{o}\))
10:if (\(CH_{D\_BS}>CH_{D\_Ln}\))
11:if (\(CH_{D\_Ln}>=d_{o}\)) then
12: Transmit the data to the NHI in the level n having the minimum distance (\(CH_{D\_Ln}\));
13:endif
14:else
15:if (\(CH_{D\_BS}>CH_{D\_L1}\)) then
16: Transmit the data to the NHI in the level 1 having the minimum distance (\(CH_{D\_L1}\));
17:else
18: Transmit the data directly to the BS using \(CH_{D\_BS}\);
19:endif
20:endif
21:else
22: Transmit the data directly to the BS using \(CH_{D\_BS}\);



+++ ==WARNING: Truncated because of repetitions==



++

In summary, the SMR technique provides an approach that is focused on minimizing the data transmission distances, either inside or outside the clusters, through distributing all the different types of sensor nodes into levels. The SMR also controls the number of sensor nodes within each cluster for minimizing the energy consumption in the CHs. In addition, it allows the CHs and the INs to transmit their data to the BS through other CHs or INs, which are in the lower levels. Consequently, the opportunities for transmitting the data over short distances between the levels have increased. Moreover, the SMR technique makes the data routing process more organized by introducing the idea of creating RT for each node. Accordingly, the node has sufficient information about the next hops and it can forward its data using the shortest route. #### 3.4.2 Dynamic Multi-Hop Routing Technique (DMR)

As recently debated, the static technique introduces a new static approach for conveying the data of nodes to the CHs, and then to the BS, which completely depends on choosing the routes that have the lowest distances. In this section, a dynamic technique is proposed to be applied to the topology of this network. As its name implies, this technique supposes that all nodes of the network, which own a number of routes in their RTs, can use different routes during the same round. For this reason, all nodes of the network arrange the available routes based on a cost function, which has been developed for this purpose. Like the static technique, this technique is also applied on the intra-cluster and inter-cluster transmissions.