ACM Transactions on Computer Systems (TOCS)
Stochastic Automata Network of Modeling Parallel Systems
IEEE Transactions on Software Engineering
Efficient descriptor-vector multiplications in stochastic automata networks
Journal of the ACM (JACM)
IEEE Transactions on Software Engineering
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
Smooth is better than sharp: a random mobility model for simulation of wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Mobility modeling in wireless networks: categorization, smooth movement, and border effects
ACM SIGMOBILE Mobile Computing and Communications Review
Proceedings of the second ACM international workshop on Principles of mobile computing
Source-Tree Routing in Wireless Networks
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Wireless network multicasting
Towards realistic mobility models for mobile ad hoc networks
Proceedings of the 9th annual international conference on Mobile computing and networking
The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks
IEEE Transactions on Mobile Computing
Stochastic properties of the random waypoint mobility model
Wireless Networks
IEEE Communications Magazine
User mobility modeling and characterization of mobility patterns
IEEE Journal on Selected Areas in Communications
Evaluating the impact of an acknowledgment strategy for APRP
Proceedings of the 5th International Latin American Networking Conference
A novel data dissemination method for vehicular networks with rateless codes
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
Secure three-party key distribution protocol for fast network access in EAP-based wireless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance Evaluation of Software Development Teams: a Practical Case Study
Electronic Notes in Theoretical Computer Science (ENTCS)
Hi-index | 0.00 |
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