[{"type":"conference","department":[{"_id":"63"},{"_id":"58"}],"date_created":"2020-09-30T12:51:22Z","abstract":[{"lang":"eng","text":"We try to close the gap between theoretical investigations of wireless network topologies and realistic wireless environments. For point-to-point communication, we examine theoretically well-analyzed sparse graphs, i.e. the Yao-graph, the SparsY-graph, and the SymmY-graph.  We present distributed algorithms that can be used to build up these graphs in time $O(log n)$ per node without the use of any geo-graphical positioning system. Our algorithms are based only on local knowledge and local decisions and make use of power control to establish communication links with low energy-cost.  We compare these algorithms with respect to congestion, dilation, and energy. For congestion we introduce different measures that allow us to investigate the difference between real-world wireless networks and models for wireless communication at a high level of abstraction. For more realistic simulations we extend our simulation  environment SAHNE. We use a realistic transmission model for directed communication that uses sector subdivision.  Finally, our experimental results show that our topologies and algorithms work well in a distributed environment and we give some recommendations for the topology control based on our simulations."}],"publication":"Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)","citation":{"bibtex":"@inproceedings{Rührup_Schindelhauer_Volbert_Grünewald_2003, title={Performance of distributed algorithms for topology control in wireless networks}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>}, booktitle={Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)}, author={Rührup, Stefan and Schindelhauer, Christian  and Volbert, Klaus and Grünewald, M.}, year={2003} }","ama":"Rührup S, Schindelhauer C, Volbert K, Grünewald M. Performance of distributed algorithms for topology control in wireless networks. In: <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>. ; 2003. doi:<a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>","mla":"Rührup, Stefan, et al. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.” <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2003, doi:<a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>.","short":"S. Rührup, C. Schindelhauer, K. Volbert, M. Grünewald, in: Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS), 2003.","chicago":"Rührup, Stefan, Christian  Schindelhauer, Klaus Volbert, and M. Grünewald. “Performance of Distributed Algorithms for Topology Control in Wireless Networks.” In <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2003. <a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">https://doi.org/10.1109/ipdps.2003.1213107</a>.","ieee":"S. Rührup, C. Schindelhauer, K. Volbert, and M. Grünewald, “Performance of distributed algorithms for topology control in wireless networks,” 2003, doi: <a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">10.1109/ipdps.2003.1213107</a>.","apa":"Rührup, S., Schindelhauer, C., Volbert, K., &#38; Grünewald, M. (2003). Performance of distributed algorithms for topology control in wireless networks. <i>Proceedings of the International Parallel and Distributed Processing Symposium (IPDPS)</i>. <a href=\"https://doi.org/10.1109/ipdps.2003.1213107\">https://doi.org/10.1109/ipdps.2003.1213107</a>"},"doi":"10.1109/ipdps.2003.1213107","user_id":"15415","_id":"19806","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:54:13Z","publication_status":"published","title":"Performance of distributed algorithms for topology control in wireless networks","status":"public","year":"2003","author":[{"full_name":"Rührup, Stefan","first_name":"Stefan","last_name":"Rührup"},{"full_name":"Schindelhauer, Christian ","first_name":"Christian ","last_name":"Schindelhauer"},{"full_name":"Volbert, Klaus","last_name":"Volbert","first_name":"Klaus"},{"full_name":"Grünewald, M.","first_name":"M.","last_name":"Grünewald"}],"publication_identifier":{"isbn":["0769519261"]}},{"language":[{"iso":"eng"}],"_id":"13613","publisher":"IEEE CS Press","user_id":"398","doi":"10.1109/ipdps.2003.1213329","title":"Fast online task placement on FPGAs: free space partitioning and 2D-hashing","year":"2003","status":"public","publication_identifier":{"isbn":["0769519261"]},"author":[{"full_name":"Walder, Herbert","last_name":"Walder","first_name":"Herbert"},{"full_name":"Steiger, Christoph","first_name":"Christoph","last_name":"Steiger"},{"full_name":"Platzner, Marco","first_name":"Marco","last_name":"Platzner","id":"398"}],"publication_status":"published","date_updated":"2022-01-06T06:51:40Z","date_created":"2019-10-04T21:17:07Z","type":"conference","department":[{"_id":"78"}],"publication":"Proceedings International Parallel and Distributed Processing Symposium","citation":{"mla":"Walder, Herbert, et al. “Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing.” <i>Proceedings International Parallel and Distributed Processing Symposium</i>, IEEE CS Press, 2003, doi:<a href=\"https://doi.org/10.1109/ipdps.2003.1213329\">10.1109/ipdps.2003.1213329</a>.","bibtex":"@inproceedings{Walder_Steiger_Platzner_2003, title={Fast online task placement on FPGAs: free space partitioning and 2D-hashing}, DOI={<a href=\"https://doi.org/10.1109/ipdps.2003.1213329\">10.1109/ipdps.2003.1213329</a>}, booktitle={Proceedings International Parallel and Distributed Processing Symposium}, publisher={IEEE CS Press}, author={Walder, Herbert and Steiger, Christoph and Platzner, Marco}, year={2003} }","ama":"Walder H, Steiger C, Platzner M. Fast online task placement on FPGAs: free space partitioning and 2D-hashing. In: <i>Proceedings International Parallel and Distributed Processing Symposium</i>. IEEE CS Press; 2003. doi:<a href=\"https://doi.org/10.1109/ipdps.2003.1213329\">10.1109/ipdps.2003.1213329</a>","ieee":"H. Walder, C. Steiger, and M. Platzner, “Fast online task placement on FPGAs: free space partitioning and 2D-hashing,” in <i>Proceedings International Parallel and Distributed Processing Symposium</i>, 2003.","apa":"Walder, H., Steiger, C., &#38; Platzner, M. (2003). Fast online task placement on FPGAs: free space partitioning and 2D-hashing. In <i>Proceedings International Parallel and Distributed Processing Symposium</i>. IEEE CS Press. <a href=\"https://doi.org/10.1109/ipdps.2003.1213329\">https://doi.org/10.1109/ipdps.2003.1213329</a>","chicago":"Walder, Herbert, Christoph Steiger, and Marco Platzner. “Fast Online Task Placement on FPGAs: Free Space Partitioning and 2D-Hashing.” In <i>Proceedings International Parallel and Distributed Processing Symposium</i>. IEEE CS Press, 2003. <a href=\"https://doi.org/10.1109/ipdps.2003.1213329\">https://doi.org/10.1109/ipdps.2003.1213329</a>.","short":"H. Walder, C. Steiger, M. Platzner, in: Proceedings International Parallel and Distributed Processing Symposium, IEEE CS Press, 2003."},"extern":"1"}]