Analysis on optimizing model for proactive ad hoc routing protocol

Proactive routing protocols for mobile ad hoc networks are table driven, where each node tries to maintain routing information about every other node in the network at all the times. Mobility in ad hoc network causes new link or breaking of network, proactive routing protocol is required to broadcast these updates throughout the network. In this paper, the effects of different updating schemes on the performance of proactive routing protocol have been examined. We set up a mathematical model to optimize proactive routing in order to balance between routing protocol overhead and routing accuracy. According to the math model we build on proactive routing, we find that proactive routing protocol has limited optimum propagating zone, and nonlinear relationship exists between updating interval and network size. Beyond the conclusion we have made, we aim at some proactive routing protocol using the ACK mechanism to ensure the update message reliability, in order to eliminate unnecessary flooding over the network, and optimize the hello interval, we make a math model according to kummer-confluent function of mobility model. Considering traffic and mobility, we find that, ACK mechanism may take effect when link state changes are not very often and data traffic is heavy. By optimizing time interval of hello message, the proactive routing protocol will have less routing overhead and high delivery rate.