Abstract

Mobility, in its various forms, is one of the sources of several technical challenges being addressed in the last years to achieve a more flexible computing and communication infrastructure. In this context, the study and characterization of node mobility in wireless networks is extremely important to foresee the node distribution in the network, thus enabling the creation of suitable models and a more accurate prediction of performance and dependability levels.In this paper we adopt a Markovian formalism, namely SAN (Stochastic Automata Networks), to model and analyze various aspects of the Random Waypoint mobility pattern. We first show the compatibility of our results with existing continuous state studies and then we extend the analysis of the Random Waypoint by addressing different specific, but far from irrelevant, aspects of the mobility pattern. In this sense, this contribution shows both results for this mobility pattern as well as the suitability of the SAN formalism to detailed description of such pattern

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.