资 源 简 介
In this project we benchmark wireless algorithms for 2 mobility models.
The algorithms to be benchmarked are:
1.
2.
Each scenario is composed of the chosen algorithm, a mobility model file and a traffic file.
The files are the output of the Benchmark project (see downloads section)
The mobility models are:
Random Walk - A simple mobility model based on random directions and speeds. In this mobility model, an MN moves from its current location to a new location by randomly choosing a direction and speed in which to travel.
Nomadic - A group mobility model where a set of MNs move together from one location to another. An example scenario this model simulates would be a guided tour of a city or museum. The tour guide and tourists move from spot to spot and they would all roam around each particular location individually.
See - http://www.cise.ufl.edu/~helmy/papers/Survey-Mobility-Chapt
