Research On The Qos Routing Protocol For Mobile Ad Hoc Networks

Ad Hoc networks composed of mobile nodes with wireless communication device are typically characterized by their multi-hop, self-organization and un-center. With the nodes in Ad Hoc networks moving fast, the topologies of Ad Hoc networks are constantly changing. The traditional routing protocols used in Internet can not adapt to Ad Hoc networks. Adaptive routing algorithms must be designed to solve the routing problem in Ad Hoc networks. This has attracted more and more researchers'attentions and become one of hot fields.Traditional node-centered distributed Ad Hoc routing is quite complex with huge amount of the computing of each node in the network, which leads to performance degradation in quality of service in network such as the real-time in network transmission, throughput, end-to-end delay and so on. These routing protocols can not adapt to the Ad Hoc networks. Therefore, a new type of Ad Hoc routing protocol is of great significance in the research domain. DSR routing protocol is one of the classical routing protocols, many follow-up routing protocols are put forward based on DSR.By analyzing the shortage of the DSR routing protocol, a new routing protocol is set up based on probabilistic computing theory. This protocol includes two parts: node stable vector function model and propagation vector function model. Several network performance indices can be expressed though the node stable vector function. Propagation vector function describes how to transmit the message in the network. In the routing searching process, correlation operation is done with node stable vector function and wave vector function. These operations can calculate the probability of the link. By choosing the nodes and link with high probability, the amount of the computation will be reduced.Finally, network simulation model is built by MATLAB to analyze the performance of the network based on the nodes mobility, links connectivity, success rate of services and the networks lifespan. The relationship between the radius of the network and the success rate is carefully analyzed, and result shows success rate will increase with the radius of the network. Studies on the relationship between the selected probability and success rate show success rate will increase with the selected probability. The degree of the complexity of DSR routing protocol and Ad Hoc routing protocol based on probabilistic computing theory is also simulated, and result shows degree of the complexity of the Ad hoc routing protocol based on probabilistic computing theory is lower than DSR routing protocol, and the network lifespan of the Ad Hoc routing protocol is longer.