Detailed Design and Implementation Robust Networking architecture Construction of chnetarch CHNetArch Self-Formation Reconfiguration Data routing/relay a General Assumptions Communication range: H-node(D)and L-node(d Algorithms run in rounds .o Each round consists of I transmission, I reception, and data processing 口 Data structures H-node: list of L-nodes in its region, parent and children on the backbone tree L-node: cluster head, region head Cluster head: its cluster member list, the parent and children on the backbone treeDetailed Design and Implementation – Robust Networking Architecture ❑ General Assumptions ➢ Communication range: H-node (D) and L-node (d) ➢ Algorithms run in rounds. ❖ Each round consists of 1 transmission, 1 reception, and data processing ❑ Data Structures ➢ H-node: list of L-nodes in its region, parent and children on the backbone tree ➢ L-node: cluster head, region head ❖ Cluster head: its cluster member list, the parent and children on the backbone tree CHNetArch Data routing/relay Self-Formation Reconfiguration Construction of CHNetArch 16