Edge computing has become an increasingly popular paradigm as part of distributed computing architecture. It accomplishes this by facilitating data from end devices to be stored and processed at the edge of the network close to the data. Unfortunately, consensus scalability and throughput become a big issue in collaborative edge scenarios. Byzantine consensus is a promising consensus solution that is feasible in small-scale collaborative edge systems. However, most of the existing consensus algorithms cannot meet the increasing number of nodes in collaborative edges, which poses a big challenge to the throughput of consensus algorithms. In this paper, we propose a tree-based pipeline consensus, a variant BFT (Byzantine Fault Tolerant) that maintains high throughput as the system size grows, utilizing a novel pipelining technique that performs scalable splitting and recombination on the tree to increase the efficiency of BLS (Boneh-Lynn-Shacham). We conduct experiments through simulations. The experimental results show that the proposed consensus mechanism can effectively improve the performance of collaborative edges, including throughput and consensus latency.