Table 8 Comparison of rounds
From: Towards improved clustering and routing protocol for wireless sensor networks
Step | LEACH | JCR | ICR |
|---|---|---|---|
Advertisement | All nodes sharing residual battery information | Gradient field setup | Cluster-sorting |
CH selection | Random selection of CH among nodes | CH selection using back-off timer | CH selection based on cumulative weights of parameters |
Cluster setup | The CH sends an advertisement message to the CM. The CM joins the desired CH | Similar to LEACH | The CH only sends its info to the CMs in the sub-area |
Scheduling | The CH generates the TDMA schedule and broadcasts it to all nodes in the network. All the nodes receive this message and accept or discard based on relevance | The CH sends the TDMA-based schedule information to all nodes in its transmission range | The CH sends the TDMA-based schedule information of only nodes in the sub-area |
Route selection | No routing is performed in LEACH | The BS initiates the path discovery and moves from one gradient to the next and selects the optimal the next gradient CHs | The ICR protocol develops a multihop route of the CHs to the BS. This routing is initiated by the BS |
Data transmission | The data transmission of LEACH is started from the CM to the CH. Since all the nodes are in the transmission range of each other, the probability of packet loss is very high | Data transmissions from the CM to the CH have a lower probability of collision compared with LEACH but more than that of ICR because of variable clustering ranges | Each clustering area has its own transmission range, the probabilities of packet loss in ICR are much less than LEACH |