Research On Scalable Routing Strategies In Mobile Multi-Hop Wireless Networks

Mobile ad-hoc networks (MANETs) are expected to play an important role in future communication systems. Routing has a key role in MANETs. Scalability and QoS provisioning are desirable because of the numerous potential commercial applications. Unfortunately, most existing routing protocols have poor scalability.The dynamic nature of MANET's topologies results in a need for frequent broadcasts, thus placing a strain on the network's limited resources. The combination of these issues contributes to MANET's scalability problem. In this thesis a Priority-based Competitive Broadcasting Algorithm (PCBA) is proposed. PCBA is a distributed algorithm which boasts no extra communication overhead. The merits of PCBA are: significant reduction of rebroadcast redundancy, adaptivity, "selective rebroadcast" function and easy implementation.A Competing-based Route Discovery Strategy (CRDS), whereby different routing protocols can be constructed, is introduced. A routing protocol which constructs macrobian routes and provides good scalability is devised using CDRS. Additionally two scalable routing techniques which enhance the scalability of on-demand routing protocols for MANETs, namely, Active Link Repairing and Path-Constrained Route Discovery are presented.Finally an adaptive QoS framework for MANETs is designed. It is composed of various QoS components including QoS signaling, QoS routing, packet scheduling and so on.