Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Topological Synthesis of Mobile Backbone Networks for Managing Ad Hoc Wireless Networks
MMNS '01 Proceedings of the 4th IFIP/IEEE International Conference on Management of Multimedia Networks and Services: Management of Multimedia on the Internet
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
An Extended Localized Algorithm for Connected Dominating Set Formation in Ad Hoc Wireless Networks
IEEE Transactions on Parallel and Distributed Systems
A Distributed Mobile Backbone Formation Algorithm for Wireless Ad Hoc Networks
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Ad Hoc Networking
The capacity of wireless networks
IEEE Transactions on Information Theory
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
The mobile backbone network (MBN) architecture has been introduced to synthesize robust, scalable and efficient mobile ad hoc wireless networks that support multimedia flows. Backbone capable nodes are dynamically elected to construct a mobile backbone (Bnet). In this article, we present a hybrid routing mechanism for such networks, identified as MBN routing with flow control and distance awareness (MBNR-FC/DA) scheme. Flows that travel a distance longer than a threshold level are routed across the Bnet. This induces a significant reduction in the route discovery control overhead, yielding a highly scalable operation. In turn, a limited span global route discovery process is invoked for routing shorter distance flows. Discovered global routes use effectively the capacity of non-backbone wireless links. Such an operation serves to upgrade the network's throughput capacity level when the backbone network does not provide global topological covering. The hybrid routing protocol introduced and studied in this paper, also employs combined nodal congestion control and flow admission control schemes to guide admitted flows across areas that are less congested, and to avoid overloading the network. We present a centralized procedure as well as a distributed adaptive scheme for the calculation of the distance threshold level under varying traffic loading and backbone coverage conditions. We show our schemes to make efficient use of network-wide capacity resources by dynamically selecting proper distance threshold levels, yielding outstanding delay-throughput performance.