Simulation of DTN nodes' mobility using least action principle for locations selection
A. Privalov, Alexandr A. Tsarev · 2015
Three modifications of mobility model of DTN’s nodes are presented. These modifications are based on the Levy mobility model. Flight length of DTN nodes inside some locations (hot spots) is a random value with the Levy probability distribution function. Between locations the nodes can move differently. In the first modification nodes walk between different locations randomly; in the second modification nodes walk between locations using the least action principle; and in the third modification each node chooses the next location according to a limiting number of possible visits. These modifications are implemented in the Omnet++ simulation environment. This paper presents an experimental results of DTN nodes’ movements modeling, and comparison of these results with real nodes movements data.