Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Recent advances in mobility modeling for mobile ad hoc network research
ACM-SE 42 Proceedings of the 42nd annual Southeast regional conference
A Dynamic Conditional Random Field Model for Foreground and Shadow Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Analysis of Time-Based Random Waypoint Mobility Model for Wireless Mobile Networks
ITNG '07 Proceedings of the International Conference on Information Technology
Mobility model used for QoS management for wireless multimedia networks
International Journal of Wireless and Mobile Computing
Modeling spatial and temporal dependencies of user mobility in wireless mobile networks
IEEE/ACM Transactions on Networking (TON)
Obstacle mobility model based on activity area in ad hoc networks
ICCSA'07 Proceedings of the 2007 international conference on Computational science and Its applications - Volume Part II
An environment-aware mobility model for wireless ad hoc network
Computer Networks: The International Journal of Computer and Telecommunications Networking
A mobility framework to improve heterogeneous wireless network services
International Journal of Ad Hoc and Ubiquitous Computing
Trace-based mobility modeling for multi-hop wireless networks
Computer Communications
A random obstacle-based mobility model for delay-tolerant networking
International Journal of Network Management
Modeling human mobility in obstacle-constrained ad hoc networks
Ad Hoc Networks
Field architecture for traffic and mobility modelling in mobility management
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
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.