Detailed Design and Implementation Robust Networking Architecture(CHNetArch) Self-formation of chnetarch Cluster member Step3-Allyorithmforilag SINK Cluster head Regional head L-hode Rdgipadead RouRleggdbalrtdaiskboeieytrees farad eedipoadadstathieir lEsaeddres ICes eeeiueddttedeglsaneealegb b PLaster Yith strongest signal HE The active nodes find children then nasac tinedes erem casters bycshoesinw th ghboring node with the lowest id to be repeats unti regional backbone tree is complete B- Connect Regional backbone trees Sink and regional heads form a tree rooted t the sink in the same way as regional backbone tree formation HL-node H H SINK H H H H H H SINK Cluster head Cluster member Regional head Step 1 – Algorithm for region formation Round 1 H-nodes broadcast their IDs and L￾nodes receive H-nodes IDs and select H-node with strongest signal 18 Self-formation of CHNetArch Region head H-node Step 2 – Algorithm for cluster formation A – Neighbor discovery Round 1 L-nodes broadcast their IDs and receive IDs B – Clustering Rounds 1 - 4 L-nodes form clusters by choosing the neighboring node with the lowest ID to be its cluster head Step 3 – Algorithm for BT formation A – Regional backbone trees Start at region head: region head becomes active Rounds 1 – 3 (1) The active nodes find children, then turn to inactive (2) Then the children become active The above process repeats until the regional backbone tree is complete B – Connect Regional backbone trees Sink and regional heads form a tree rooted at the Sink in the same way as regional backbone tree formation Detailed Design and Implementation – Robust Networking Architecture (CHNetArch)