A sighting-aware obstacle mobility model for ad hoc network

摘要

In this work we present a sighting-aware obstacle mobility model for ad hoc network. In natural or man-made disasters, military activities or healthcare services scenarios, people's line of sight is obstructed by the obstacles. In the proposed mobility model, the nodes of the network move around the obstacles in a natural and realistic way. A recursive procedure is followed by each node according to which every time an obstacle is encountered between the node's current position and the final destination point, the node moves to the obstacle's vertex which makes the path the current shortest path from the source point to the destination point. This process is repeated until the destination is reached. Simulation results show that the proposed model has significant difference with other obstacle mobility models on the network pathway selection. And also the proposed model has different impacts on network topology and routing performance.