Data dissemination and routing in a gossip based mobile environment

In this paper we study the information spreading behavior of selected, mobility models combined with epidemic algorithms and the dynamic routing efficiency of gossip based routing algorithms on ad-hoc networks. Epidemic algorithms follow a paradigm of nature where simple rules dictate the spread of information by having a local view of the environment. In our work, three models of mobility, Random Waypoint, Gauss Markov and Clustering Motion have been combined with the SIR epidemic model. Behavior of the SIR model in a mobile environment is based on susceptible, infectious and recovered population of the mobile network. It can be seen that there is a significant drop in message overhead in the route protocol when combined with the gossip protocol and such reduction in message overhead is independent of the mobility model. However, there is an accompanied convergence time in create, which is dependent on the mobility model.