Structured Markovian models for discrete spatial mobile node distribution
- First Online:
The study and characterization of node mobility in wireless networks is extremely important to foresee the node distribution in the network, enabling the creation of suitable models, and thus a more accurate prediction of performance and dependability levels.
In this paper we adopt a structured Markovian formalism, namely SAN (Stochastic Automata Networks), to model and analyze two popular mobility models for wireless networks: the Random Waypoint and Random Direction.
Our modeling considers mobility over a discrete space, i.e., over a space divided in a given number of slots, allowing a suitable analytical representation of structured regions. We represent several important aspects of mobility models, such as varying speed and pause times, and several border behaviors that may take place. One, two, and three-dimensional models are presented. For the two-dimensional models, we show that any regular or irregular convex polygon can be modeled, and we describe several routing strategies in two dimensions.
In all cases, the spatial node distribution obtained from the steady state analysis is presented and whenever analogous results over continuous spaces were available in the literature, the comparison with the ones obtained in this paper is shown to be coherent.
Besides showing the suitability of SAN to model this kind of reality, the paper also contributes to new findings for the modeled mobility models over a noncontinuous space.
KeywordsStructured stochastic modeling formalisms Mobile nodes Markovian models
- 3.Bansal N, Liu Z (2003) Capacity, delay and mobility in wireless ad-hoc networks. In: IEEE InfocomGoogle Scholar
- 6.Bettstetter C (2001) Smooth is better than sharp: a random mobility model for simulation of wireless networks. In: Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems. ACM, New York, pp 19–27Google Scholar
- 9.Brenner L, Fernandes P, Sales A (2005) The need for and the advantages of generalized tensor algebra for Kronecker structured representations. Int J Simul Syst Sci Technol 6(3–4):52–60Google Scholar
- 16.Czekster RM, Fernandes P, Webber T (2009) GTAEXPRESS: a software package to handle Kronecker descriptors. In: QEST’09: quantitative evaluation of systemsGoogle Scholar
- 17.Czekster RM, Fernandes P, Sales A, Taschetto D, Webber T (2010) Simulation of Markovian models using Bootstrap method. In: Proceedings of the 2010 summer computer simulation conference (SCSC ’10). pp 564–569Google Scholar
- 18.Czekster RM, Fernandes P, Sales A, Webber T (2011) A memory aware heuristic for fast computation of structured Markovian models through tensor product restructuring. Numer Linear Algebra Appl (to appear)Google Scholar
- 19.Czekster RM, Fernandes P, Webber T (2011) Efficient vector-descriptor product exploiting time-memory trade-offs. ACM SIGMETRICS Perform Eval Rev (to appear)Google Scholar
- 20.Delamare F, Dotti FL, Fernandes P, Nunes CM, Ost LC (2006) Analytical modeling of random waypoint mobility patterns. In: PE-WASUN ’06: proceedings of the 3rd ACM international workshop on performance evaluation of wireless ad hoc, sensor and ubiquitous networks. ACM, New York, pp 106–113CrossRefGoogle Scholar
- 21.Di W, Xiaofeng Z, Xin W (2006) Analysis of 3-d random direction mobility model for ad hoc network. In: ITS telecommunications proceedings, 6th int conf on, pp 741–744Google Scholar
- 26.Haas ZJ, Pearlman MR (1998) The performance of query control schemes for the zone routing protocol. In: ACM SIGCOMM. pp 167–177Google Scholar
- 30.Jardosh A, Belding-Royer E, Almeroth K, Suri S (2003) Towards realistic mobility models for mobile ad hoc networks. In: Proceedings of the 9th annual international conference on mobile computing and networking. ACM, New York, pp 217–229Google Scholar
- 32.Jayakumar G, Ganapathi G (2008) Reference point group mobility and random waypoint models in performance evaluation of manet routing protocols. J Comput Syst Netw CommunGoogle Scholar
- 34.Kleinrock L, Silvester J (1978) Optimum transmission radio for packet radio networks or why six is a magic number. In: Proc of the IEEE national telecommunications confGoogle Scholar
- 35.Kumar M, Rajesh RS (2009) Performance analysis of manet routing protocols in different mobility models. Int J Comput Sci Netw Secur 9(2):22–29Google Scholar
- 36.Lassila P, Hyytiä E, Koskinen H (2005) Connectivity properties of random waypoint mobility model for ad hoc networks. In: Proceedings of the fourth annual Mediterranean workshop on ad hoc networks (Med-Hoc-Net)Google Scholar
- 37.Le Boudec J, Vojnovic M (2005) Perfect simulation and stationarity of a class of mobility models. In: INFOCOM 2005. 24th annual joint conf of the IEEE computer and communications societies. Proceedings IEEE, vol 4. IEEE Press, New York, pp 2743–2754Google Scholar
- 38.Lin G, Oubir G, Rajaraman R (2004) Mobility models for ad hoc network simulation. In: IEEE infocomGoogle Scholar
- 40.Milner R (1999) Communicating and mobile systems: the π-calculus. Cambridge University Press, CambridgeGoogle Scholar
- 41.Nain P, Towsley D, Liu B, Liu Z (2005) Properties of random direction models. In: IEEE Infocom, pages. IEEE Press, New York, pp 1897–1907Google Scholar
- 43.Nilsson A (2004) Performance analysis of traffic load and node density in ad hoc networks. In: Proceedings of the 5th European wireless 2004: mobile and wireless systems beyond 3GGoogle Scholar
- 47.Royer EM, Melliar-Smith PM, Moser LE (2001) An analysis of the optimum node density for ad hoc mobile networks. In: IEEE international conference on communications, vol 3. pp 857–861Google Scholar
- 50.Stewart WJ (2009) Probability, Markov chains, queues, and simulation. Princeton University Press, PrincetonGoogle Scholar