Optimum root placement in a multiple-hop wireless network

A multi-hop wireless network using a rooted spanning tree as routing backbone has to deal with reliability and congestion problem when the network size increases. In this paper, we consider the problem of adding a new root with its own rooted spanning tree to the network to alleviate such problems. Based on minimum-depth and minimum-load metrics, we present efficient algorithm that achieves optimum selection of root(s).