Worst Case Mobility in Ad Hoc Networks

We investigate distributed algorithms for mobile ad hoc networks for moving radio stations with adjustable transmission power in a worst case scenario. We consider two models to find a reasonable restriction on the worst-case mobility. In the pedestrian model we assume a maximum speed vmax of the radio stations, while in the vehicular model we assume a maximum acceleration amax of the points. Our goal is to maintain..