This paper addresses the scatternet formation for large scale multi-hop Bluetooth networks. We first describe a novel communication efficient method to build a connected dominating set (CDS) as the backbone of multi-hop Bluetooth network, then propose new algorithms to form the dBBlue scatternets [1] in each cluster. Notice that our methods is not a simple combination of existing CDS methods and dBBlue algorithm. We propose a new algorithm for finding the connectors in CDS that are more suitable for multihop Bluetooth networks and several new algorithms to enable formation of dBBlue scatternets inside each cluster. The final scatternet, M-dBBlue, guarantees the connectivity. Our experiment shows the majority of nodes have degree smaller or equal to 7 which means our scatternet seldom parks any node. Our scatternet also enjoys efficient updating, since both the backbone and the dBBlue structure of each cluster can be maintained efficiently in a dynamic environment. We then propose a complete set of hierarchical routing methods for M-dBBlue which enables the self-routing inside each cluster. Moreover, our scatternet formation and routing algorithm do not require any position information at all.