A Parallel Link State Routing Protocol for Mobile Ad-Hoc Networks

摘要

With the network size growing, routing protocols of mobile ad-hoc networks (MANET) face many challenges. The most critical issue is the lack of bandwidth and computation capability. This paper describes the Parallel Link State Routing protocol (PLSR) that is suitable for MANET. The key concept used in the protocol is that of graph decomposition. This technique substantially raises the rate of routing updating; meanwhile it reduces the message overload as compared with a classical flooding mechanism and some other link state routing protocols. In PLSR, the network is a two-levels topology, and many problems caused by "flat" multi-hoppings will disappear. Thus, the second optimization is achieved by sub-network that reduces the control messages. As a third optimization, the routing computation will be in several sub-networks simultaneity. Hence, comparing with current link state algorithms, the routing table of PLSR will be regenerated quickly as the network topology changes.