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.

[1]  Ilsun You,et al.  Field architecture for traffic and mobility modelling in mobility management , 2012, Int. J. Ad Hoc Ubiquitous Comput..

[2]  Hamid Sarbazi-Azad,et al.  Analysis of Time-Based Random Waypoint Mobility Model for Wireless Mobile Networks , 2007, Fourth International Conference on Information Technology (ITNG'07).

[3]  Ahmed Helmy,et al.  IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[4]  Tasos Dagiuklas,et al.  An obstacle-aware human mobility model for ad hoc networks , 2009, 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems.

[5]  Xiaoyan Hong,et al.  Recent advances in mobility modeling for mobile ad hoc network research , 2004, ACM-SE 42.

[6]  Dirk Pesch,et al.  A mobility framework to improve heterogeneous wireless network services , 2011, Int. J. Ad Hoc Ubiquitous Comput..

[7]  Sami Tabbane,et al.  Mobility model used for QoS management for wireless multimedia networks , 2007, Int. J. Wirel. Mob. Comput..

[8]  Wenye Wang,et al.  A unified mobility model for analysis and simulation of mobile wireless networks , 2009, Wirel. Networks.

[9]  Juanjuan Li,et al.  A random obstacle‐based mobility model for delay‐tolerant networking , 2011, Int. J. Netw. Manag..

[10]  Kevin C. Almeroth,et al.  Towards realistic mobility models for mobile ad hoc networks , 2003, MobiCom '03.

[11]  Tasos Dagiuklas,et al.  Modeling human mobility in obstacle-constrained ad hoc networks , 2012, Ad Hoc Networks.

[12]  Zhang Dafang,et al.  An obstacle avoidance mobility model , 2010, 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems.

[13]  Mahmood Fathy,et al.  Obstacle Mobility Model Based on Activity Area in Ad Hoc Networks , 2007, ICCSA.

[14]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[15]  Alfredo Ferro,et al.  Obstacles constrained group mobility models in event-driven wireless networks with movable base stations , 2011, Ad Hoc Networks.

[16]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[17]  Joarder Kamruzzaman,et al.  An environment-aware mobility model for wireless ad hoc network , 2010, Comput. Networks.

[18]  Ahmed Helmy,et al.  A survey of mobility modeling and analysis in wireless adhoc networks , 2004 .

[19]  Yang Wang,et al.  A dynamic conditional random field model for foreground and shadow segmentation , 2006, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Tracy Camp,et al.  Trace-based mobility modeling for multi-hop wireless networks , 2011, Comput. Commun..

[21]  Ahmed Helmy,et al.  Modeling Spatial and Temporal Dependencies of User Mobility in Wireless Mobile Networks , 2008, IEEE/ACM Transactions on Networking.