Worst case mobility in ad hoc networks

摘要: We investigate distributed algorithms for mobile ad hoc networks moving radio stations with adjustable transmission power in a worst case scenario. consider two models to find reasonable restriction on the worst-case mobility. In pedestrian model we assume maximum speed vmax of stations, while vehicular acceleration amax points.Our goal is maintain persistent routes nice communication network properties like hop distance, energy-consumption, congestion and number interferences. A route persistent, if can guarantee that all edges this be uphold given time span Δ, which parameter denoting minimum needs adopt changes, i.e. update routing tables, change directory entries, etc. This Δ used as length an interval proactive scheme.We extend some known notions such range, interferences, spanner, spanner both mobility introduce new called crowdedness states lower bound Then prove hosts path system polylogarithmically approximates optimal congestion.We present based grid clustering technique high-dimensional representation dynamical start situation construct spanners low congestion, interference number, degree. measure optimality output our algorithm by comparing it choice under same circumstances respect or movements. Finally, solutions dynamic position information management models.