High Throughput Routing in Hybrid Cellular and Ad-Hoc Networks
I. Ioannidis, Bogdan Cărbunar, Cristina Nita-Rotaru · 2005
We present DST, a dynamic spanning tree based algorithm, as a routing protocol for hybrid networks. It is scalable with the network size and achieves high throughput by taking advantage of multiple channels. DST maintains a close to optimal spanning tree of the network by using distributed topology trees. DST is fully dynamic and generates only O(log n) messages per update operation. We show experimentally that DST scales well with network size, making it ideal for metropolitan environment hybrid networks.