An obstacle avoidance mobility model

摘要

In real world obstacles are almost ubiquitous, especially in the emergency situations like battlefields and disaster area where the ad hoc network is usually deployed. But obstacles are not taken into account by most of the existing mobility models. This paper provides an obstacle mobility model that realistically represents the movements in obstacle environment. It suits the network deployment in emergency situations. In our model, the motion planning theory is incorporated and the node avoids obstacles by following the shortest path which is computed by the classical visibility graph algorithm. The obstacles are used to restrict the node movement as well as the wireless transmissions. We distinguish our model with others by deeply analyses, and then a thorough simulation study is made which highlights the differences. The experimental results show that our model has a significant impact on the network topology and the performance of ad hoc network protocols, especially compared with other models.