Partially Deterministic Mobility

The characteristics of the partially (or semi) deterministic mobility model are described along PDM with known direction of movement and PDM with known mobility patterns. Simulation results are used to verify the analytical model of the PDM. The purposeful partially (or semi) deterministic mobility model is also described. The motion-based distributed annealing method accounting the total transmission power and energy required for motion along with Gibbs function is used for analysis of the PPD mobility model. Both analytical model and simulation results are provided for the PPD.

[1]  Gerald Q. Maguire,et al.  A predictive mobility management algorithm for wireless mobile computing and communications , 1995, Proceedings of ICUPC '95 - 4th IEEE International Conference on Universal Personal Communications.

[2]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[3]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[4]  Thomas Haug,et al.  The GSM System for Mobile Communications , 1992 .

[5]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[6]  George Kesidis,et al.  Purposeful mobility for relaying and surveillance in mobile ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[7]  Sajal K. Das,et al.  Longevity of routes in mobile ad hoc networks , 2001, IEEE VTS 53rd Vehicular Technology Conference, Spring 2001. Proceedings (Cat. No.01CH37202).

[8]  Tong Liu,et al.  Mobility modeling, location tracking, and trajectory prediction in wireless ATM networks , 1998, IEEE J. Sel. Areas Commun..

[9]  Richard A. Brown,et al.  Introduction to random signals and applied kalman filtering (3rd ed , 2012 .

[10]  R. Moose,et al.  Modeling and Estimation for Tracking Maneuvering Targets , 1979, IEEE Transactions on Aerospace and Electronic Systems.

[11]  Stuart E. Dreyfus,et al.  Applied Dynamic Programming , 1965 .

[12]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  John H. Holland,et al.  Genetic Algorithms and the Optimal Allocation of Trials , 1973, SIAM J. Comput..

[14]  Theodore J. Lambert,et al.  Fictitious Play Approach to a Mobile Unit Situation Awareness Problem , 2002 .

[15]  H. H. Xia.  An analytical model for predicting path loss in urban and suburban environments , 1996, Proceedings of PIMRC '96 - 7th International Symposium on Personal, Indoor, and Mobile Communications.

[16]  Jonathan E. Fieldsend,et al.  Dominance measures for multi-objective simulated annealing , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[17]  George Kesidis,et al.  Optimal acceptance probability for simulated annealing , 1990 .

[18]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[19]  Shashi Phoha,et al.  Surveillance coverage of sensor networks under a random mobility strategy , 2003, Proceedings of IEEE Sensors 2003 (IEEE Cat. No.03CH37498).