{"department":[{"_id":"63"}],"publication_identifier":{"isbn":["1581136617"]},"title":"Worst case mobility in ad hoc networks","_id":"18960","citation":{"mla":"Schindelhauer, Christian, et al. “Worst Case Mobility in Ad Hoc Networks.” <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003, doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>.","ama":"Schindelhauer C, Lukovszki T, Rührup S, Volbert K. Worst case mobility in ad hoc networks. In: <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>","bibtex":"@inproceedings{Schindelhauer_Lukovszki_Rührup_Volbert_2003, title={Worst case mobility in ad hoc networks}, DOI={<a href=\"https://doi.org/10.1145/777412.777448\">10.1145/777412.777448</a>}, booktitle={Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)}, author={Schindelhauer, Christian and Lukovszki, Tamás and Rührup, Stefan and Volbert, Klaus}, year={2003} }","ieee":"C. Schindelhauer, T. Lukovszki, S. Rührup, and K. Volbert, “Worst case mobility in ad hoc networks,” in <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003.","chicago":"Schindelhauer, Christian, Tamás Lukovszki, Stefan Rührup, and Klaus Volbert. “Worst Case Mobility in Ad Hoc Networks.” In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>, 2003. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>.","short":"C. Schindelhauer, T. Lukovszki, S. Rührup, K. Volbert, in: Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03), 2003.","apa":"Schindelhauer, C., Lukovszki, T., Rührup, S., &#38; Volbert, K. (2003). Worst case mobility in ad hoc networks. In <i>Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)</i>. <a href=\"https://doi.org/10.1145/777412.777448\">https://doi.org/10.1145/777412.777448</a>"},"user_id":"15415","date_created":"2020-09-03T13:10:50Z","status":"public","year":"2003","author":[{"last_name":"Schindelhauer","full_name":"Schindelhauer, Christian","first_name":"Christian"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"},{"last_name":"Rührup","full_name":"Rührup, Stefan","first_name":"Stefan"},{"first_name":"Klaus","last_name":"Volbert","full_name":"Volbert, Klaus"}],"abstract":[{"text":"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 $v_max$ of the radio stations, while in   the vehicular model we assume a maximum acceleration $a_max$ of   the points.      Our goal is to maintain persistent routes with nice communication   network properties like hop-distance, energy-consumption, congestion   and number of interferences. A route is persistent, if we can   guarantee that all edges of this route can be uphold for a given   time span $Delta$, which is a parameter denoting the minimum time   the mobile network needs to adopt changes, i.e. update routing   tables, change directory entries, etc. This $Delta$ can be used as   the length of an update interval for a proactive routing scheme.      We extend some known notions such as transmission range,   interferences, spanner, power spanner and congestion to both   mobility models and introduce a new parameter called crowdedness   that states a lower bound on the number of radio interferences. Then   we prove that a mobile spanner hosts a path system that   polylogarithmically approximates the optimal congestion.    We present distributed algorithms based on a grid clustering   technique and a high-dimensional representation of the dynamical   start situation which construct mobile spanners with low congestion,   low interference number, low energy-consumption, and low degree.  We   measure the optimality of the output of our algorithm by comparing   it with the optimal choice of persistent routes under the same   circumstances with respect to pedestrian or vehicular worst-case   movements. Finally, we present solutions for dynamic position   information management under our mobility models.","lang":"eng"}],"doi":"10.1145/777412.777448","publication":"Proc. of the 15th ACM Symposium on Parallel Algorithms and Architectures (SPAA03)","type":"conference","date_updated":"2022-01-06T06:53:55Z","language":[{"iso":"eng"}],"publication_status":"published"}