| Algorithm 1: The tree-like path establishment algorithm of LB-TBDAS. |
| Step 1: System initialization |
| (1) Sensor nodes are randomly deployed in the specific network area. |
| (2) The network area is partitioned into M × N cells of a grid. |
| (3) The sensor node with the highest residual energy is elected to be the cell head in each cell. |
| Step 2: Tree initialization |
| (1) The BS is responsible for serving as the root node. |
| (2) The network depth is Lm and the maximum number of child nodes (cell heads) is Cm. |
| Step 3: Tree construction |